简体   繁体   English

Project Euler #8 与溢出无关

[英]Project Euler #8 NOT related to overflow

I too am attempting Project Euler #8.我也在尝试 Project Euler #8。 I know what the right answer is, but I'm getting something different.我知道正确的答案是什么,但我得到了不同的答案。 I'm using all ulong in a checked block, so this isn't related to overflow.我在一个选中的块中使用了所有 ulong,所以这与溢出无关。

Here's the problem:这是问题所在:

The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832. 1000 位数字中乘积最大的相邻四个数字是 9 × 9 × 8 × 9 = 5832。

73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135336276614282806444486645238749 30358907296290491560440772390713810515859307960866 70172427121883998797908792274921901699720888093776 65727333001053367881220235421809751254540594752243 52584907711670556013604839586446706324415722155397 53697817977846174064955149290862569321978468622482 83972241375657056057490261407972968652414535100474 82166370484403199890008895243450658541227588666881 16427171479924442928230863465674813919123162824586 17866458359124566529476545682848912883142607690042 24219022671055626321111109370544217506941658960408 07198403850962455444362981230987879927244284909188 84580156166097919133875499200524063689912560717606 05886116467109405077541002256983155200055935729725 7163626956188267042825248360082 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135336276614282806444486645238749 30358907296290491560440772390713810515859307960866 70172427121883998797908792274921901699720888093776 65727333001053367881220235421809751254540594752243 52584907711670556013604839586446706324415722155397 53697817977846174064955149290862569321978468622482 83972241375657056057490261407972968652414535100474 82166370484403199890008895243450658541227588666881 16427171479924442928230863465674813919123162824586 17866458359124566529476545682848912883142607690042 24219022671055626321111109370544217506941658960408 07198403850962455444362981230987879927244284909188 84580156166097919133875499200524063689912560717606 05886116467109405077541002256983155200055935729725 7163626956188267042825248360082 3257530420752963450 3257530420752963450

Find the thirteen adjacent digits in the 1000-digit number that have the greatest product.找出 1000 位数字中乘积最大的 13 个相邻数字。 What is the value of this product?这个产品的价值是什么?

And here's my implementation (using LinqPad).这是我的实现(使用 LinqPad)。 I keep getting an answer of 10077696000 but I know the answer is actually 23514624000 ;我不断得到10077696000的答案,但我知道答案实际上是23514624000

string digit = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355668966489504452445231617318564030987111217223831136222989342338030813533627661428280644448664523874930358907296290491560440772390713810515859307960866701724271218839987979087922749219016997208880937766572733300105336788122023542180975125454059475224352584907711670556013604839586446706324415722155397536978179778461740649551492908625693219784686224828397224137565705605749026140797296865241453510047482166370484403199890008895243450658541227588666881164271714799244429282308634656748139191231628245861786645835912456652947654568284891288314260769004224219022671055626321111109370544217506941658960408071984038509624554443629812309878799272442849091888458015616609791913387549920052406368991256071760605886116467109405077541002256983155200055935729725716362695618826704282524836008232575304207529634500";


int numDigits = 13;



ulong answer = 0;
int answerIndex = 0;
int currentIndex = 0;
checked
{
    while (currentIndex <= digit.Length - numDigits)
    {
        var substr = digit.Substring(currentIndex, numDigits);
        if (!substr.Contains('0'))
        {
            ulong product = substr.ToCharArray().Select(x => ulong.Parse(x.ToString())).Aggregate((x, y) => x * y);

            if (product > answer)
            {
                answerIndex = currentIndex;
                answer = product;
                var disp = string.Join(" x ", substr.ToCharArray());
                $"Start Index:\t{currentIndex.ToString().PadLeft(4)}\t\tDigits:\t{disp} = {product}".Dump();
            }
        }
        currentIndex++;
    }
}

$"Answer is: {answer}".Dump();

Your argument is incorrect , something went wrong when you copy pasted and you lost 7 :您的论点不正确,复制粘贴时出了点问题,您丢失了7

// current code
string digit = "...227443043556689664895044524452316173185640..." 
// should be
string digit = "...2274430435576689664895044524452316173185640..."
                              ^
                              |
                            missed 

Edit: To spot this I've solved the problem myself:..编辑:为了发现这一点,我自己解决了这个问题:..

      string digit = ...;

      int numDigits = 13;

      var result = Enumerable
        .Range(0, digit.Length - numDigits + 1)
        .Select(start => digit
           .Skip(start)
           .Take(numDigits)
           .Aggregate(1L, (s, a) => s * (a - '0')))
        .Max();

...And I got the incorrect result ( 10077696000 ), then I copy pasted data from the original site and got the right outcome ( 23514624000 ). ...我得到了错误的结果( 10077696000 ),然后我从原始站点复制粘贴的数据并得到了正确的结果( 23514624000 )。 All I had to do is to compare inputs.我所要做的就是比较输入。

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM