Submission #1092466

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <map>
#include <queue>
#define rep(i,n) for(int i = 0; i < n; i++)
#define INF 1000000000
#define MOD 1000000007
#define ll long long
using namespace std;
int n;
ll sum,ans;
ll a[100000];
ll sa[100000];
int main(){
    cin>>n;
    rep(i,n){cin>>a[i]; sum+=a[i];}
    ll set=n*(n+1)/2;
    ll kai=sum/set;
    rep(i,n){
        sa[i]=kai-a[(i+1)%n]+a[i];
        ans+=(sa[i]/n)*(n-i);
    }
    if (ans==a[0]){
        cout<<"YES"<<endl;
    }else{
        cout<<"NO"<<endl;
    }
    return 0;
}

Submission Info

Judge Result