Decrease (Judge ver.)（AtCoder-2662）

Problem Description

We have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N−1 or smaller. (The operation is the same as the one in Problem D.)

Determine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.
It can be proved that the largest element in the sequence becomes N−1 or smaller after a finite number of operations.

You are given the sequence ai. Find the number of times we will perform the above operation.

Constraints

• 2≤N≤50
• 0≤ai≤1016+1000

Input

Input is given from Standard Input in the following format:

N
a1 a2 ... aN

Output

Print the number of times the operation will be performed.

Example

Sample Input 1

4
3 3 3 3

Sample Output 1

0

Sample Input 2

3
1 0 3

Sample Output 2

1

Sample Input 3

2
2 2

Sample Output 3

2

Sample Input 4

7
27 0 0 0 0 0 0

Sample Output 4

3

Sample Input 5

10
1000 193 256 777 0 1 1192 1234567891011 48 425

Sample Output 5

1234567894848

题意： 给出 n 个数，对这 n 个数每次取最大的减 n，其余数 +1，直到所有数都小于等于 n，问操作次数

思路：模拟即可，取最大的直接减到 n 以下，然后其余数相应加上减 n 的次数

Source Program

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
const int MOD = 1E9+7;
const int N = 200000+5;
const int dx[] = {-1,1,0,0,-1,-1,1,1};
const int dy[] = {0,0,-1,1,-1,1,-1,1};
using namespace std;
LL a[N];
int main() {
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%lld",&a[i]);
    LL res=0;
    while(true){
        LL maxx=a[1];
        int pos=1;
        for(int i=2;i<=n;i++){
            if(a[i]>maxx){
                maxx=a[i];
                pos=i;
            }
        }

        if(maxx<=n-1)
            break;

        for(int i=1;i<=n;i++){
            if(i==pos)
                a[i]=maxx%n;
            else
                a[i]+=maxx/n;
        }
        res+=(maxx/n);
    }
    printf("%lld\n",res);
    return 0;
}