Submission #1592736
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int n; int a[maxn]; int main() { long long sum = 0; scanf("%d", &n); for(int i = 0; i < n; i++) { scanf("%d", &a[i]); sum += a[i]; } a[n] = a[0]; if(sum % (n * (n + 1) / 2) != 0) { printf("NO\n"); return 0; } long long cnt = sum / (n * (n + 1) / 2); for(int i = 0; i < n; i++) { long long tmp = cnt + a[i] - a[i + 1]; if(tmp < 0 || tmp % n != 0) { printf("NO\n"); return 0; } } printf("YES\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | vjudge3 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 517 Byte |
Status | WA |
Exec Time | 12 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:11:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:13:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &a[i]); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 11 ms | 640 KB |
in10.txt | AC | 2 ms | 256 KB |
in11.txt | AC | 12 ms | 640 KB |
in12.txt | AC | 12 ms | 640 KB |
in13.txt | AC | 10 ms | 512 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 | WA | 12 ms | 640 KB |
in20.txt | AC | 1 ms | 256 KB |
in21.txt | AC | 12 ms | 640 KB |
in22.txt | AC | 12 ms | 640 KB |
in23.txt | AC | 12 ms | 640 KB |
in24.txt | AC | 2 ms | 256 KB |
in25.txt | AC | 2 ms | 256 KB |
in26.txt | AC | 12 ms | 640 KB |
in27.txt | AC | 12 ms | 640 KB |
in3.txt | WA | 12 ms | 640 KB |
in4.txt | WA | 12 ms | 640 KB |
in5.txt | WA | 12 ms | 640 KB |
in6.txt | AC | 12 ms | 640 KB |
in7.txt | AC | 12 ms | 640 KB |
in8.txt | AC | 2 ms | 256 KB |
in9.txt | AC | 2 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |