#include <iostream>
#include <fstream>
using namespace std;

int main()
{
   int num, rows;
   int maxsum[200][200] = {0};
   int best = 0;
    //cout << "it works here: definitions ";
   ifstream infile("INPUT.TXT");
   ofstream outfile("OUTPUT.TXT");
    //cout << "it works here: filestreams ";
   infile >> rows;
   //cout << "it works here: infilestream rows ";
   for(int b = 0; b < 200; b++)
   {
		maxsum[0][b] = 0;
		//cout << "it works here: first for loop: iter:" << b<<" \n";
		for(int r = 1; r < rows; r++)
		{
			//cout << "it works here: second for loop: iter:"<<r<<" ";
			//maxsum[r][0] = 0;
			for(int c = 1; c < r; c++)
			{
				//cout << "it works here: third for loop: iter:"<<c<<" ";
				infile >> num;
				// cout << num << " ";
				maxsum[r][c] = (maxsum[r-1][c-1] > maxsum[r-1][c]) ?
                        (maxsum[r-1][c-1] + num) :
                        (maxsum[r-1][c]   + num);
				// cout << maxsum[r][c] << " " << maxsum[r-1][c-1] << " " << maxsum[r-1][c] << " ";
			}
			maxsum[r][r+1] = 0;
		}

		for(int k = 1; k < rows; k++)
		{
			if(best < maxsum[rows][k]) 
				best = maxsum[rows][k];
			//cout << "it works here: fourth for loop: iter:"<<b<<" ";
		}
	}
	outfile << best;
    cout << best<<endl;
	cout << "it works here: last thing\n";
	return 0;
}

int sum = 0;
int table[5][5] = {.....};

void solve(int i, int j, int &sum_temp)
{
     if (i =< j and i <= 5)
     {
            sum_temp += table[i][j];
            solve(i++ ,j , sum_temp);
            solve(i++, j++, sum_temp);
     }
     else if(i == 6)
     {
              if (sum < sum_temp) sum = sum_temp;
     }
}

solve(i++ ,j , sum_temp);
solve(i++, j++, sum_temp);

#include <iostream>
#include <conio.h>

using namespace std;

int table[5][5] = 
/*{{1, 0, 0, 0, 0}, 
{2, 3, 0, 0, 0}, 
{4, 5, 6, 0, 0},
{7, 8, 9, 10, 0},
{11, 12, 13, 14, 15}};*/

{{7, 0, 0, 0, 0}, 
{3, 8, 0, 0, 0}, 
{8, 1, 0, 0, 0},
{2, 7, 4, 4, 0},
{4, 5, 2, 6, 5}};//*/
int sum = 0;

void solve(int i, int j, int sum_temp)
{
     if (i >= j && i < 5 && j < 5)
     {
            sum_temp += table[i][j];
            solve(++i ,j , sum_temp);
            solve(i, ++j, sum_temp);
     }
     else if(i == 5)
     {
              if (sum < sum_temp) sum = sum_temp;
     }
}


int main()
{
	int temp = 0, i = 0, j = 0;

	solve(i, j, temp);
	cout << "Sum is : " << sum << endl;
	getchar();
}

#include <iostream>
#include <conio.h>
#include <fstream>
#include <string>

using namespace std;
/*
7 
3 8 
8 1 0 
2 7 4 4 
4 5 2 6 5
*/
const int NMAX = 200;
/*int table[5][5] = 
{{1, 0, 0, 0, 0}, 
{2, 3, 0, 0, 0}, 
{4, 5, 6, 0, 0},
{7, 8, 9, 10, 0},
{11, 12, 13, 14, 15}};

{{7, 0, 0, 0, 0}, 
{3, 8, 0, 0, 0}, 
{8, 1, 0, 0, 0},
{2, 7, 4, 4, 0},
{4, 5, 2, 6, 5}};//*/
int table[NMAX][NMAX] = {0};
int sum = 0;

int find_max();

bool open_file(string fileName)
{
	ifstream inStream(fileName.c_str(), ios::in);
	int size = 0, read = 0, count = 0;

	while (inStream)
	{
		inStream >> read;
		table[size][count] = read;

		if (count == size)
		{
			size++;
			count = 0;
		}
		else
			count++;
	}
	inStream.close();
	return true;
}

void solve_recursive(int i, int j, int sum_temp)
{
     if (i >= j && i < NMAX && j < NMAX)
     {
            sum_temp += table[i][j];
			
            solve_recursive(++i ,j , sum_temp);
            solve_recursive(i, ++j, sum_temp);
     }
     else if(i == NMAX)
     {
		 if (sum < sum_temp) sum = sum_temp;
     }
}

void solve_iterative()
{
	for (int i = 1; i < NMAX; i++)
		for (int j = 0; j <= i; j++)
		{
			if (j == i)
				table[i][j] += table[i-1][j-1];
			else if (j == 0)
				table[i][j] += table[i-1][j];
			else
				table[i][j] += (table[i-1][j-1] > table[i-1][j]) ? table[i-1][j-1] : table[i-1][j];
		}

	sum = find_max();
}

int find_max()
{
	const int I = NMAX - 1;
	int temp = table[i][0];

	for (int j = 1; j < NMAX; j++)
		if (table[i][j] > temp) temp = table[i][j];

	return temp;
}

int main()
{
	int temp = 0, i = 0, j = 0;
	string file("INPUT.TXT");

	open_file(file);
	solve_recursive(i, j, temp);
	cout << "Recursive sum : " << sum << endl;
	solve_iterative();
	cout << "Iterative sum : " << sum << endl;
	getchar();
}