# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925968 | Karoot | Prosjek (COCI14_prosjek) | C++17 | 1 ms | 500 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 <iostream>
#include <cmath>
#include <unordered_map>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <iomanip>
#include <algorithm>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
typedef long long ll;
ll linf = 1e15+1;
inline void scoobydoobydoo(){
ios::sync_with_stdio(false);
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
int main(){
scoobydoobydoo();
int n; cin >> n;
vector<ll> ans(n), vals(n);
for (int i = 0; i < n; i++){
cin >> vals[i];
vals[i] *= (i+1);
}
ans[0] = vals[0];
ll sum = ans[0];
for (int i = 1; i < n; i++){
ans[i] = vals[i]-sum;
sum += ans[i];
}
for (int i = 0; i < n; i++)cout << ans[i] << " ";
cout << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |