# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931870 | hugsfromadicto | Prosjek (COCI14_prosjek) | C++14 | 1 ms | 464 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.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mxN = 101;
int a[mxN], b[mxN];
void _()
{
int n;
cin >> n;
for(int i = 0; i < n; ++i)
cin >> a[i];
b[0] = a[0];
b[1] = (a[1] * 2) - b[0];
for(int i = 2; i < n; ++i)
{
int sm1 = a[i] * (i + 1);
int sm2 = a[i-1] * i;
b[i] = abs(sm2 - sm1);
}
for(int i = 0; i < n; ++i)
cout << b[i] << ' ';
}
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
while(tc--)
{
_();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |