/* Challenge: 'The Golden Mountain' At one international Olympiad in Informatics, the following task was given. Let's solve it! 7 7 x 3 8 10 15 0 1 8 1 0 18 16 15 00 10 11 2 7 4 4 20 25 20 19 000 001 101 111 4 5 2 6 5 24 30 27 26 24 0000 0010 0011 1011 The figure shows an example of a triangle of numbers. Write a program that calculates the largest sum of numbers through which the path starts, starting at the top and ending somewhere on the bottom. Each step can go diagonally down to the right or diagonally to the left. In the example - this is the path 7➡3➡8➡7➡5, given a max amount of 30. */ #include #include #include using namespace std; class Triangle { public : Triangle(int _height=5):height(_height) { cout<<"\n_generating a random triangle..\n\n"; floors=new int*[height]; for(int i=0;ibests[j]) { bests_temp[j]=bests[j-1]+obj.floors[i][j]; paths_temp[j]=paths[j-1]*2+1; } else { bests_temp[j]=bests[j]+obj.floors[i][j]; paths_temp[j]=paths[j]*2; } } for(int j=0;j<=i;j++) { bests[j]=bests_temp[j]; paths[j]=paths_temp[j]; cout<bests[best]) { best=i; } } cout<<"Solved.\nBest: "<0;i--) { path-=paths[best]%2; paths_temp[i]=path; paths[best]/=2; } cout<"<>x; cout<<"Enter the height: "<