Submission #1092495

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define gcd __gcd
#define x first
#define y second
#define st first
#define nd second
#define pb push_back

using namespace std;

template<typename T> ostream& operator<<(ostream &out, const vector<T> &v){ out << "{"; for(const T &a : v) out << a << ", "; out << "}"; return out; }
template<typename S, typename T> ostream& operator<<(ostream &out, const pair<S,T> &p){ out << "(" << p.st << ", " << p.nd << ")"; return out; }

typedef long long LL;
typedef pair<int, int> PII;
typedef long double K;
typedef vector<int> VI;

const int dx[] = {0,0,-1,1}; //1,1,-1,1};
const int dy[] = {-1,1,0,0}; //1,-1,1,-1};

long long n;
long long sum, ps, vv;
long long A[100010];
long long P[100010];

bool solve(){
	FWD(i,0,n) sum += A[i];
	if(sum % (n*(n+1)/2)) return 0;
	sum /= (n*(n+1)/2);
	FWD(i,0,n){
		P[i] = sum - (A[(i+1)%n] - A[i]);
		if(P[i] % n) return 0;
		P[i] /= n;
		ps += P[i];
		vv += (n-i)*P[i];
	}
	FWD(i,0,n){
		if(vv != A[i]) return 0;
		vv += ps - n*P[i];
	}
	return 1;
}

int main(){
	scanf("%lld", &n);
	FWD(i,0,n) scanf("%lld", &A[i]);
	printf(solve()?"YES\n":"NO\n");;
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:55:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
                   ^
./Main.cpp:56:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  FWD(i,0,n) scanf("%lld", &A[i]);
                                 ^

Judge Result