Project Euler Problem 18 (C++和Python)

Problem 18 : Maximum path sum I

By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.

3
7 4
2 4 6
8 5 9 3

That is, 3 + 7 + 4 + 9 = 23.

Find the maximum total from top to bottom of the triangle below:

75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23

NOTE: As there are only 16384 routes, it is possible to solve this problem by trying every route. However, Problem 67, is the same challenge with a triangle containing one-hundred rows; it cannot be solved by brute force, and requires a clever method! ;o)

C++ 代码

#include <iostream>
#include <cassert>     // assert()
#include <cstdarg>     // va_start() and va_end()
#include <algorithm>   // max()

using namespace std;

int triangle4x4[4][4] = {
  {3},
  {7,4},
  {2,4,6},
  {8,5,9,3}
};

int triangle15x15[15+1][15+1] = {
{75},
{95,64},
{17,47,82},
{18,35,87,10},
{20,04,82,47,65},
{19,01,23,75,03,34},
{88,02,77,73,07,63,67},
{99,65,04,28,06,16,70,92},
{41,41,26,56,83,40,80,70,33},
{41,48,72,33,47,32,37,16,94,29},
{53,71,44,65,25,43,91,52,97,51,14},
{70,11,33,28,77,73,17,78,39,68,17,57},
{91,71,52,38,17,14,91,43,58,50,27,29,48},
{63,66,04,68,89,53,67,30,73,16,69,87,40,31},
{04,62,98,27,23, 9,70,98,73,93,38,53,60,04,23}
};


class PE0018
{
private:
    static const int max_size = 15;
    int m_triangle[max_size+1][max_size];

    int m_maxTotal;
    int m_routesSum;
    
    int m_routesStack[max_size]; 
    int m_routesRow[max_size]; 
    int m_routesCol[max_size]; 

    void debugPrintf(const char *format, ...);

public:
    int getMaximumTotal(int dimension);
    void tryNext(int row, int col, int step, int n);
};

//#define DEBUG

int main()
{
    PE0018 pe0018;

    assert(23 == pe0018.getMaximumTotal(4));

    cout << "The maximum total from top to bottom of the triangle is " ;
    cout << pe0018.getMaximumTotal(15) << endl;

    return 0;
}

int PE0018::getMaximumTotal(int dimension)
{
    m_maxTotal  = 0;
    m_routesSum = 0;

    for(int row=0; row<dimension; row++)
    {
        for(int col=0; col<=row; col++)
        {
            if (4 == dimension)
            {
                m_triangle[row][col] = triangle4x4[row][col];
            }
            else
            {
                m_triangle[row][col] = triangle15x15[row][col];
            }
        }
    }

    tryNext(0, 0, 0, dimension); // parameters row, col and step starts from 0

    return m_maxTotal;
}

void PE0018::tryNext(int row, int col, int step, int n)
{
    m_routesStack[step] = m_triangle[row][col];
    m_routesRow[step]   = row;
    m_routesCol[step]   = col;

    if (row >= col && row < n)
    {
        if (row+1 < n)
        {
            tryNext(row+1, col, step+1, n);
        }
        if (row+1<n && col+1<n)
        {
            tryNext(row+1, col+1, step+1, n);
        }
    }
    
    if (n-1 == row && n-1 == step)
    {
        m_routesSum++;

        int total = 0;
        for (int i=0; i<=step; i++)
        {
            total += m_routesStack[i];
            debugPrintf("Step %2d : %2d (%2d, %2d)\n", i+1, 
                        m_routesStack[i], m_routesRow[i], m_routesCol[i]);
        }
        
        m_maxTotal = max(total, m_maxTotal);

        debugPrintf("==> m_routesSum = %d, m_maxTotal = %d\n\n", 
                    m_routesSum, m_maxTotal);
    } 
}

void PE0018::debugPrintf(const char *format, ...)
{
#ifdef DEBUG
    va_list args;
    char buffer[512];   // it can change with the allowed max size

    va_start (args, format);
    (void)vsprintf (buffer, format, args);
    va_end(args);

    printf (buffer);
#endif
}

Python 代码 (I)

import numpy as np
    
# global veriable(s)
gRoutesStack = np.zeros(15)

def tryNext(row, col, step, n):
    global gMaxTotal, gTriangle

    gRoutesStack[step] = gTriangle[row][col]

    if row >= col and row < n:
        if row+1 < n:
            tryNext(row+1, col, step+1, n)
        if row+1<n and col+1<n:
            tryNext(row+1, col+1, step+1, n)
    
    if n-1 == row and n-1 == step:
        total = sum(gRoutesStack)        
        gMaxTotal = max(total, gMaxTotal)


def getMaximumTotal(size):
    global gMaxTotal, gTriangle 

    tri4x4 = [[3],
              [7,4],
              [2,4,6],
              [8,5,9,3]]

    tri15x15 = [[75],
                [95,64],
                [17,47,82],
                [18,35,87,10],
                [20, 4,82,47,65],
                [19, 1,23,75, 3,34],
                [88, 2,77,73, 7,63,67],
                [99,65, 4,28, 6,16,70,92],
                [41,41,26,56,83,40,80,70,33],
                [41,48,72,33,47,32,37,16,94,29],
                [53,71,44,65,25,43,91,52,97,51,14],
                [70,11,33,28,77,73,17,78,39,68,17,57],
                [91,71,52,38,17,14,91,43,58,50,27,29,48],
                [63,66,4,68,89,53,67,30,73,16,69,87,40,31],
                [ 4,62,98,27,23, 9,70,98,73,93,38,53,60,4,23]]

    gMaxTotal  = 0

    if 4 == size:
       gTriangle = tri4x4
    else:
       gTriangle = tri15x15

    tryNext(0, 0, 0, size)       # parameters row, col and step starts from 0

    return int(gMaxTotal) 

def main():
    assert 23 == getMaximumTotal(4)
    print("The maximum total from top to bottom of the triangle is",getMaximumTotal(15))

if  __name__ == '__main__':
    main()

Python 代码 (II)

def getMaximumTotal():
    tri_matrix = [[int(n) for n in line.split()] for line in open('PE0018.txt').readlines()]

    for row in range(len(tri_matrix)-1, 0, -1):
        for col in range(0, row):
            tri_matrix[row-1][col] += max(tri_matrix[row][col], tri_matrix[row][col+1])

    return tri_matrix[0][0]
    
def main():
    print("The maximum total from top to bottom of the triangle is",getMaximumTotal())

if  __name__ == '__main__':
    main()

Python data file PE0018.txt
75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23