# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1008746 | Rolo678 | Labels (NOI20_labels) | C++14 | 0 ms | 0 KiB |
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 <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >>n;
vector<int>d(n);
for(int i = 1;i<n;i++)
{
cin >>d[i];
}
int num = 0;
int ans = 0;
for(int i = 1;i<=n;i++)
{
flag = true;
int k = i;
for(int j = 1;j<n;j++)
{
if(d[i]+k > n)
{
flag = false;
break;
}
else
{
k+= d[i];
}
num += flag;
if(flag)ans = i;
}
}
if(num != 1)
{
cout << -1 << '\n';
}
else
{
int k = i;
cout << i << ' ';
for(int j:d)
{
k+= j;
cout << k << ' ';
}
}
}