Submission #1093052

---

Source Code Expand

#include <bits/stdc++.h>

#define N (1<<17)
#define ll long long
#define ld long double
#define M 1000000007
#define INF 1000000007
#define LINF 1000000000000000007LL
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define F first
#define S second
#define L length() - 1

using namespace std;

int main () {
    ll n;
    cin>>n;
    ll s = 0;
    ll v[n];
    for (int i = 0; i < n; i++) {
        cin>>v[i];
        s += v[i];
    }
    if (s % (n * (n + 1) / 2)) {
        cout<<"NO"<<endl;
        return 0;
    }
    ll t = s / (n * (n + 1) / 2);
    for (ll i = 0; i < n; i++) {
        v[i] -= t * (i + 1);
        v[i] %= n;
        v[i] += n;
        v[i] %= n;
    }
    bool b = true;
    for (int i = 1; i < n; i++) {
        b = b & (v[i] == v[i - 1]);
    }
    if (b) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
}

Submission Info

Judge Result