项目Euler#11 in C/C++

Question

我有这个代码,它是为了解决Project Euler的第11个问题,并且它没有进一步工作printout(),之后它崩溃了"堆栈溢出".我猜我的索引有些问题(可能在next_elem函数中),但我看不出是什么.请给一个提示.

#include "stdafx.h"
#include <iostream>


const int matrix[20][20]  = {
                             {8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8},
                             {49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0},
                             {81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65},
                             {52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91},
                             {22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80},
                             {24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50},
                             {32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70},
                             {67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21},
                             {24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72},
                             {21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95},
                             {78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92},
                             {16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57},
                             {86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58},
                             {19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40},
                             {4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66},
                             {88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69},
                             {4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36},
                             {20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16},
                             {20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54},
                             {1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48},
                            };

unsigned long int rows[20][20], columns [20][20], diagslash[20][20], diagbackslash[20][20]; //create all necessary arrays of maximum possible dimensions

//a debugging function  -- to check that everything is right and that I'm working with indices correctly
void printout()
    {
    for(int i=0;i<20;++i)
    {
            {
                    for(int j=0;j<20;++j) 
                        std::cout << "a["<<i<<"],["<<j<<"] = " << matrix[i][j] << " " << "\n";
            }
        std::cout << "\n"; 
        }    
    }


// a function that calculates the next element from the previous one and some matrix elements
unsigned long int next_elem(int i,int j, unsigned long int array[][20])
    {
        if (matrix[i][j] == 0) // a zero in a sequence means we need to move 4 elements to the right
        {
            j+=4;
            next_elem(i,j,rows);
        }
        else if(matrix[i][j] > matrix[i][j-4])  // this condition is meant to put an increasing sequence of results into the 'rows' array
        {
            rows[i][j-4]=rows[i][j-5]*matrix[i][j-1]/matrix[i][j-1];
            next_elem(i,j,rows);
        }
        return 0;
    }



void check(int i, int j, unsigned long int array[][20]) 
    {
        if ((matrix[i][j] == 0) || (matrix[i][j+1] == 0) || (matrix[i][j+2] == 0) || (matrix[i][j+3] == 0)) //look for a zero
        {
            j+=4;
            check(i,j,rows);    
        }
        else  //no zero found, calculate the next element
        {
            rows[i][j] = matrix[i][j]*matrix[i][j+1]*matrix[i][j+2]*matrix[i][j+3]; 
            next_elem(i,j+4,rows); 
        }


    }

void sort()  //this function is meant to find maximums in 'rows', 'columns' and so on
{
    for (int i = 0; i<20;++i)
    {
        for (int j = 0;j < 17;++j)
        {
            check(i,j,rows);
            std::cout << "rows["<<i<<"]["<<j << "] = " << rows[i][j] << std::endl; //a debugging line -- to see what's going on
        }
    }
}

int main()
{
    printout();
    sort();
    return 0;
}

PS对于那些有疑问的人来说,这个版本主要是在C中.一旦我掌握了算法,我就会用C++重写它.

Answer 1

在这种情况下,i或j或矩阵没有做任何事情:

else if(matrix[i][j] > matrix[i][j-4])  // this condition is meant to put an increasing sequence of results into the 'rows' array
{
    rows[i][j-4]=rows[i][j-5]*matrix[i][j-1]/matrix[i][j-1];
    next_elem(i,j,rows);
}

所以它会永远递归,总是使用相同的参数,总是通过相同的分支,最终给你一个堆栈溢出; 这将是我的猜测发生了什么.

您需要步进i或j沿着,或更改一个matrix[i][j]或matrix[i][j-4]多个条件最终将为false,终止递归.

没有进一步分析代码或问题,所以我不知道你需要改变什么:)