Submission #1092450

---

Source Code Expand

/*zhen hao*/
#include <bits/stdc++.h>
using namespace std;

#define lson l, m, rt*2
#define rson m + 1, r, rt*2+1
#define xx first
#define yy second

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> pii;

int main() {
#ifdef JUDGE
  freopen("case.in", "r", stdin);
#endif
  int n, mi = 1e9, ma = 0;
  cin >> n;
  LL tot = 0, sum = 1LL * (1 + n) * n / 2;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    tot += x;
    mi = min(mi, x);
    ma = max(ma, x);
  }
  if (tot % sum == 0 && tot / sum >= mi && tot / sum * n <= ma) puts("YES"); else puts("NO");
  return 0;
}

Submission Info

Judge Result