Submission #1653868
Source Code Expand
/*=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= Coder:LCJ Prob:Boxes :AtCoder - 2303 Type:math =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/ #include <iostream> #include <cstdlib> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #include <stack> #include <list> #include <queue> #include <vector> #include <map> #include <set> #include <sstream> #define MEM(a,b) memset(a,b,sizeof(a)) #define sint(x) scanf("%d",&(x)) #define sint2(x,y) scanf("%d%d",&(x),&(y)) #define rep(x,y,z) for(int (x)=(y);(x)<(z);++(x)) using namespace std; typedef long long ll; const int maxn=10000000+10; const int mod=1000000007; bool flag; ll n,sum,s; ll a[100005]; int main() { flag=true; scanf("%lld",&n); for(ll i=0;i<n;i++) { scanf("%lld",&a[i]); sum+=a[i]; } if(sum%(((n+1)*n)/2)) { flag=false; printf("NO\n"); } else { s=sum/(((n+1)*n)/2); for(ll i=0;i<n;i++) { ll j=(i+1)>=n?0:i+1; if( (s-(a[j]-a[i]))<0 || (s-(a[j]-a[i]))%n ) { flag=false; printf("NO\n"); break; } } } if(flag) printf("YES\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1054 Byte |
Status | AC |
Exec Time | 14 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:33:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld",&n); ^ ./Main.cpp:36:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld",&a[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 12 ms | 1024 KB |
in10.txt | AC | 2 ms | 384 KB |
in11.txt | AC | 13 ms | 1024 KB |
in12.txt | AC | 12 ms | 1024 KB |
in13.txt | AC | 11 ms | 896 KB |
in14.txt | AC | 1 ms | 256 KB |
in15.txt | AC | 1 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in17.txt | AC | 1 ms | 256 KB |
in18.txt | AC | 1 ms | 256 KB |
in19.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 14 ms | 1024 KB |
in20.txt | AC | 1 ms | 256 KB |
in21.txt | AC | 13 ms | 1024 KB |
in22.txt | AC | 13 ms | 1024 KB |
in23.txt | AC | 13 ms | 1024 KB |
in24.txt | AC | 2 ms | 256 KB |
in25.txt | AC | 2 ms | 384 KB |
in26.txt | AC | 12 ms | 1024 KB |
in27.txt | AC | 12 ms | 1024 KB |
in3.txt | AC | 14 ms | 1024 KB |
in4.txt | AC | 14 ms | 1024 KB |
in5.txt | AC | 14 ms | 1024 KB |
in6.txt | AC | 13 ms | 1024 KB |
in7.txt | AC | 13 ms | 1024 KB |
in8.txt | AC | 2 ms | 384 KB |
in9.txt | AC | 2 ms | 384 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |