# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
354270 | Edbert2397 | Prosjek (COCI14_prosjek) | C++14 | 1 ms | 384 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;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
#define pii pair<int,int>
const int N = 2e5 + 5;
const int INF = 1e9;
const ll mod = 1e9+7;
ll ans[N],arr[N];
int n;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//freopen(,r,stdin);
//freopen(,w,stdout);
cin>>n;
for(int i = 1;i<=n;i++){
cin>>arr[i];
}
ll tot = 0;
for(int i = 1;i<=n;i++){
ans[i] = arr[i] * i - tot;
tot+=ans[i];
}
for(int i = 1;i<=n;i++){
cout<<ans[i];
if(i < n) cout<<" ";
}
cout<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |