Submission #2861001

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define int long long
const int N = 1e5 + 5;
const int M = 1e6 + 5;
const int mod = 1e9 + 7;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef set<int> si;
typedef map<string, int> msi;

int a[N];
signed main(){
	//ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n; cin >> n;
	int sum = 0;
	for(int i = 0 ; i < n ; ++i) cin >> a[i], sum += a[i];
	int s = n * (n + 1) / 2;
	if(sum % s != 0) return printf("NO");
	s = sum / s;
	for(int i = 0 ; i < n ; ++i)
	{
		int d = s - a[(i + 1) % n] + a[i];
		if(d < 0 || d % n) return printf("NO");
	}
	cout << "YES";
}
				

Submission Info

Judge Result