Submission #1093372

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
using namespace std;

#define fi first
#define se second
typedef long long LL;
typedef long double LD;

LL N,a[100010];

int main(){
    cin >> N;

    if (N==1){
        cout << "YES\n";
        return 0;
    }

    LL i,sum=0;
    for (i=1; i<=N; i++) cin >> a[i],sum+=a[i];

    if (sum%(N*(N+1)/2)!=0){
        cout << "NO\n";
        return 0;
    }

    LL op=sum/(N*(N+1)/2); a[N+1]=a[1];
    LL tot=0;
    for (i=1; i<=N; i++){
        LL aux=op+a[i]-a[i+1];
        if (aux<0 || aux%N!=0){
            cout << "NO\n";
            return 0;
        }

        tot+=aux/N;
    }

    if (tot!=op) cout << "NO\n";
    else cout << "YES\n";

    return 0;
}

Submission Info

Judge Result