Submission #1093048

---

Source Code Expand

#include <iostream>
using namespace std;

int main() {
	int flag = 0;
	long long sum = 0;
	int n;
	long m;
	long a[114514];
	long b[114514];
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		sum += a[i];
	}
	m = sum / (n*(n + 1) / 2);
	a[n] = a[0];
	for (int i = 0; i < n; i++) b[i] = a[i + 1] - a[i];
	for (int i = 0; i < n; i++) {
		while (b[i] < 0) b[i] += n;
	}
	for (int i = 0; i < n; i++) {
		if ((b[i]% n) == m);
		else flag = 1;
	}
	if (flag == 0) cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}

Submission Info

Judge Result