B. Mancala (Codeforces Round #478 (Div. 2))

 #include <bits/stdc++.h>
 using namespace std;
 const int maxn = ;
 typedef long long ll;
 ll a[maxn];
 ll b[maxn];

 int main(){
     for(int i = ;i < maxn;i++){
         cin >> a[i];
     }
     ll ans = -;
     for(int i = ;i < maxn;i++){
         for(int j = ;j < maxn;j++) b[j] = a[j];
         b[i] = ;
         int x = a[i] / maxn;
         int y = a[i] % maxn;
         for(int j = ;j < maxn;j++)
             b[j] += x;
         for(int j = ;j <= y;j++)
             b[(j+i)%maxn]++;
         ll sum = ;
         for(int j = ;j < maxn;j++)
             if(b[j]% == )
             sum += b[j];
         if(ans < sum)
             ans = sum;
     }
     cout << ans << endl;
     return ;
 }

B. Mancala