975B - Mancala - CodeForces Solution

#include <iostream>

using namespace std;

int main()
{
    // cout<<10001/14<<" "<<10001%14<<endl;
    long long arr[14];
    long long dup[14];
    for(long long i=0;i<14;i++){
        cin>>arr[i];
        dup[i] = arr[i];
    }
    long long max = 0;
    for(long long i=0;i<14;i++){
        for(long long j=0;j<14;j++){
            dup[j] = arr[j];
        }
        long long sum = 0;
        long long rem = dup[i]%14;
        for(long long j=0;j<14;j++){
            if(j!=i){
                dup[j]+=dup[i]/14;
            }
        }
        dup[i] = dup[i]/14;
        long long inc = 1;
        while(rem>0){
            dup[(i+inc)%14]++;
            rem--;
            inc++;
        }
        // for(int j=0;j<14;j++){
        //     cout<<dup[j]<<" ";
        // }
        // cout<<endl;
        for(long long j=0;j<14;j++){
            if(dup[j]%2==0){
                sum+=dup[j];
            }
        }
        if(sum>max){
            max = sum;
        }
    }
    cout<<max<<endl;
    return 0;
}