This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int A[N], B[N];
for(int i = 0; i < N; i++)
{
cin >> A[i] >> B[i];
}
for(int r = 1; r <= 5; r++)
{
for(int i = 0; i < N; i++)
{
if(A[i] - B[i] < 2) continue;
int t = (A[i] - B[i])/2;
A[i] -= 2*t;
A[(i+1)%N] += t;
}
}
for(int i = 0; i < N; i++) if(A[i] != B[i])
{
cout << "No\n";
return 0;
}
cout << "Yes\n";
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |