2011-12-14 39 views
2

我正在处理Project Euler并遇到问题。C中的1000位数字#

我无法使用1000位数字,并想知道我是否做错了什么,或者只是以错误的方式解决此问题,如果是的话,那么最佳方法是什么?

C#

namespace ToThePowerOf 
{ 
    class Program 
    { 
     static void Main(string[] args) 
     { 
      BigInteger n = 1; 
      int x = 0; 
      BigInteger [] number; 
      number = new BigInteger[149194]; 
      number[x] = 1; 
      number[x + 1] = 1; 
      x = 3; ; 
      BigInteger check = 10000000000000000000000000000 
           0000000000000000000000000000000 
           0000000000000000000000000000000 
           0000000000000000000000000000000 
           0000000000000000000000000000000 
           0000000000000000000000000000000 
           0000000000000000000000000000000 
           0000000000000000000000000000000 
           0000000000000000000000000000000 
           00000000000000000000000; 

      for (int i = 99; i > 0; i--) 
      { 
       n = (n - 1) + (n - 2); 
       number[x] = n; 
       x++; 
       if (n > check) 
       { 
        Console.WriteLine(x); 
       } 
      } 
     } 
    } 
} 
+3

这是从源代码粘贴?如果是这样,比你在号码内有一个换行符,这是不允许的。顺便说一下,Fibbonaci数字生成有更好更快的公式。 – SWeko 2011-12-14 13:02:01

+1

顺便说一句,要得到一个1000位数的数字,你需要`BigInteger(10).Pow(999)`,而不是`BigInteger(10).Pow(1000)`。不止一个海报弄错了! – TonyK 2011-12-14 13:25:58

回答

13

我猜“问题”你遇到了(将是有益的,包括错误消息)是编译器不喜欢的文字与数字1000整数这样你就可以”用一个非常大的整数文字初始化它。正如其他人所指出的,将整数文字分成多行也是无效的。

number[x] = 1;线工作,因为编译器可以处理整数文字1因为我们将其分配给BigInteger它使用BigIntegerimplicit operator将其转换为一个BigInteger


一个简单的方法来解决你的问题与大整数文字是用BigInteger.Parse方法来创建你的1000位数字。

BigInteger check = BigInteger.Parse("10000....", CultureInfo.InvariantCulture); 

另一种方法可能是用小INT初始化它,然后用数学来获得你想要的号码,如Jon Skeet's answer

13

C#中BigInteger没有文字支持。因此,在使用BigInteger时没有错误,您需要制定一种实例化方法 - 例如new BigInteger(10).Pow(1000)

4

这样的大字面是不可能的。整数文字最多可以是64位。

为了得到一个大的整数,你可以从字符串转换,或者计算数字而不是硬编码它。在你的情况下,用BigInteger.Pow(10, digits)来计算它是最干净的解决方案。

0

我可能真的很迟到,但我所做的是把每一个数字,并使其成为一个单独的对象内的数组。然后,我将数组的前5个数字相乘,并将它们设置为一个变量。如果它们大于最大值,我将它设置为最大值。然后我继续下一组数字1-6,并做了同样的事情。我确实得到了一个超出范围的例外。在这种情况下,您将使用try和get格式,直到收到此异常。如果你想看代码,我会编辑我的回复,但为了节省你在数组上的时间,如果你仍然想尝试这个,我会给你数组。

long[] a; 
a = new long[] { 
      7,3,1,6,7,1,7,6,5,3,1,3,3,0,6,2,4,9,1,9,2,2,5,1,1,9,6,7,4,4,2,6,5,7,4,7,4,2,3,5,5,3,4,9,1,9,4,9,3,4, 
      9,6,9,8,3,5,2,0,3,1,2,7,7,4,5,0,6,3,2,6,2,3,9,5,7,8,3,1,8,0,1,6,9,8,4,8,0,1,8,6,9,4,7,8,8,5,1,8,4,3, 
      8,5,8,6,1,5,6,0,7,8,9,1,1,2,9,4,9,4,9,5,4,5,9,5,0,1,7,3,7,9,5,8,3,3,1,9,5,2,8,5,3,2,0,8,8,0,5,5,1,1, 
      1,2,5,4,0,6,9,8,7,4,7,1,5,8,5,2,3,8,6,3,0,5,0,7,1,5,6,9,3,2,9,0,9,6,3,2,9,5,2,2,7,4,4,3,0,4,3,5,5,7, 
      6,6,8,9,6,6,4,8,9,5,0,4,4,5,2,4,4,5,2,3,1,6,1,7,3,1,8,5,6,4,0,3,0,9,8,7,1,1,1,2,1,7,2,2,3,8,3,1,1,3, 
      6,2,2,2,9,8,9,3,4,2,3,3,8,0,3,0,8,1,3,5,3,3,6,2,7,6,6,1,4,2,8,2,8,0,6,4,4,4,4,8,6,6,4,5,2,3,8,7,4,9, 
      3,0,3,5,8,9,0,7,2,9,6,2,9,0,4,9,1,5,6,0,4,4,0,7,7,2,3,9,0,7,1,3,8,1,0,5,1,5,8,5,9,3,0,7,9,6,0,8,6,6, 
      7,0,1,7,2,4,2,7,1,2,1,8,8,3,9,9,8,7,9,7,9,0,8,7,9,2,2,7,4,9,2,1,9,0,1,6,9,9,7,2,0,8,8,8,0,9,3,7,7,6, 
      6,5,7,2,7,3,3,3,0,0,1,0,5,3,3,6,7,8,8,1,2,2,0,2,3,5,4,2,1,8,0,9,7,5,1,2,5,4,5,4,0,5,9,4,7,5,2,2,4,3, 
      5,2,5,8,4,9,0,7,7,1,1,6,7,0,5,5,6,0,1,3,6,0,4,8,3,9,5,8,6,4,4,6,7,0,6,3,2,4,4,1,5,7,2,2,1,5,5,3,9,7, 
      5,3,6,9,7,8,1,7,9,7,7,8,4,6,1,7,4,0,6,4,9,5,5,1,4,9,2,9,0,8,6,2,5,6,9,3,2,1,9,7,8,4,6,8,6,2,2,4,8,2, 
      8,3,9,7,2,2,4,1,3,7,5,6,5,7,0,5,6,0,5,7,4,9,0,2,6,1,4,0,7,9,7,2,9,6,8,6,5,2,4,1,4,5,3,5,1,0,0,4,7,4, 
      8,2,1,6,6,3,7,0,4,8,4,4,0,3,1,9,9,8,9,0,0,0,8,8,9,5,2,4,3,4,5,0,6,5,8,5,4,1,2,2,7,5,8,8,6,6,6,8,8,1, 
      1,6,4,2,7,1,7,1,4,7,9,9,2,4,4,4,2,9,2,8,2,3,0,8,6,3,4,6,5,6,7,4,8,1,3,9,1,9,1,2,3,1,6,2,8,2,4,5,8,6, 
      1,7,8,6,6,4,5,8,3,5,9,1,2,4,5,6,6,5,2,9,4,7,6,5,4,5,6,8,2,8,4,8,9,1,2,8,8,3,1,4,2,6,0,7,6,9,0,0,4,2, 
      2,4,2,1,9,0,2,2,6,7,1,0,5,5,6,2,6,3,2,1,1,1,1,1,0,9,3,7,0,5,4,4,2,1,7,5,0,6,9,4,1,6,5,8,9,6,0,4,0,8, 
      0,7,1,9,8,4,0,3,8,5,0,9,6,2,4,5,5,4,4,4,3,6,2,9,8,1,2,3,0,9,8,7,8,7,9,9,2,7,2,4,4,2,8,4,9,0,9,1,8,8, 
      8,4,5,8,0,1,5,6,1,6,6,0,9,7,9,1,9,1,3,3,8,7,5,4,9,9,2,0,0,5,2,4,0,6,3,6,8,9,9,1,2,5,6,0,7,1,7,6,0,6, 
      0,5,8,8,6,1,1,6,4,6,7,1,0,9,4,0,5,0,7,7,5,4,1,0,0,2,2,5,6,9,8,3,1,5,5,2,0,0,0,5,5,9,3,5,7,2,9,7,2,5, 
      7,1,6,3,6,2,6,9,5,6,1,8,8,2,6,7,0,4,2,8,2,5,2,4,8,3,6,0,0,8,2,3,2,5,7,5,3,0,4,2,0,7,5,2,9,6,3,4,5,0 
     }; 
相关问题