#include <string>

#include <iostream>

#include <fstream>

#include <math.h>

#include <vector>

using namespace std;

const int MAX = 100005;

long maxPath = 0;

long triangle[MAX];

​

vector<pair<long, long> > table; // derinlik maliyet

​

void loadNumbers (){

    triangle[0] = -1;

    std::ifstream inFile ("input.txt");

    if (!inFile){

        cout << "Unable to open the file" << endl;

    }

    else {

        long number;

        int index = 1;

        table.push_back(make_pair(-1, -1));

        while(!inFile.eof()){

            inFile >> number;

            triangle[index++] = number;

            table.push_back(make_pair(0, -1));

        }

        for (; index< MAX; index++){

        triangle[index] = -1;

            table.push_back(make_pair(0, -1));

        }

    }

}

bool isPrime(long x){

    for (long i = 2; i <= sqrt(x); i++){

        if (x % i == 0)

            return false;

    }

    return true;

}

​

void checkPath(long index, long levelNumber, long sum){

    if (sum + triangle[index] > table[index].second){

        table[index] = make_pair(levelNumber, sum+triangle[index]);

    }

    else {

        return;

    }

    if(triangle[index + levelNumber] != -1 && !isPrime(triangle[index + levelNumber])){ // Left Child

        checkPath(index + levelNumber, levelNumber + 1, sum + triangle[index]);

    }

    if (triangle[index + levelNumber + 1] != -1 && !isPrime(triangle[index + levelNumber + 1])){ // Right Child

        checkPath(index + levelNumber + 1, levelNumber + 1, sum + triangle[index]);

    }

}

​

void getLongestPath(){

    sort(table.begin(), table.end(), greater<pair<long, long> >());

    cout << "Derinlik: " << table[0].first << " Toplam: " << table[0].second << endl;

}

int main(){

    loadNumbers();

    checkPath(1, 1, 0); // Root Node

    getLongestPath();

​

    return 0;

}