# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
328695 | 2020-11-17T17:31:28 Z | aris12345678 | Prosjek (COCI14_prosjek) | C++14 | 1 ms | 384 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define pi pair<int, int> #define fi first #define se second const int mxN = 1e6+5; const int mod = 1e9+7; const ll inf = 1e18; ll n, b[mxN]; vector<ll> ans; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i = 0; i < n; i++) cin >> b[i]; for(int i = 0; i < n; i++) { ll sum = b[i]*(i+1); for(int j = 0; j < i; j++) sum -= ans[j]; ans.push_back(sum); } for(ll i : ans) cout << i << " "; cout << "\n"; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 0 ms | 364 KB | Output is correct |
6 | Correct | 1 ms | 364 KB | Output is correct |
7 | Correct | 1 ms | 364 KB | Output is correct |
8 | Correct | 1 ms | 364 KB | Output is correct |
9 | Correct | 1 ms | 384 KB | Output is correct |
10 | Correct | 1 ms | 364 KB | Output is correct |