Commit 9648abdd by Andrew Dahl

Solved Problem 67

parent 84aa7cab
Showing with 67 additions and 0 deletions
Question:
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 in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.
NOTE: This is a much more difficult version of Problem 18. It is not possible to try every route to solve this problem, as there are 299 altogether! If you could check one trillion (1012) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o)
Answer: 7273
This diff is collapsed. Click to expand it.
#include <iostream>
#include <map>
#include <fstream>
using namespace std;
map<int,map<int,long int> > route_grid;
map<int,map<int,long int> > grid;
long int find_route(int x, int y)
{
long int largest = 0;
long int temp = 0;
if(route_grid[x][y] == 0 && grid.size() != x+1)
{
largest = find_route(x+1,y);
temp = find_route(x+1,y+1);
temp = ((largest > temp) ? largest : temp) + grid[x][y];
}
else if(grid.size() == x+1 && route_grid[x][y] == 0)
temp = grid[x][y];
else
temp = route_grid[x][y];
return temp;
}
int main() {
int num = 0;
ifstream file;
file.open("input.txt");
file >> num;
for(int i = 0; !file.eof(); i++)
for(int j = 0; j < i+1; j++)
{
grid[i][j] = num;
route_grid[i][j] = 0;
file >> num;
}
for(int i = grid.size() - 1; i >= 0; i--)
for(int j = grid[i].size() - 1; j>= 0; j--)
route_grid[i][j] = find_route(i,j);
cout << route_grid[0][0] << endl;
return 0;
}
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment