# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092019 | haianhnguyen08102007 | Prosjek (COCI14_prosjek) | C++11 | 1 ms | 468 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;
const int N = 1e5+1;
const int inf = 1e9;
const long long INFZ = 1e18;
int a[N], n;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>n;
for (int i=1; i<=n; i++) cin>>a[i];
long long sumpre=0;
for (int i=1; i<=n; i++)
{
long long z=a[i]*i;
long long pt=z-sumpre;
cout<<pt<<" ";
sumpre+=pt;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |