# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931870 | 2024-02-22T13:32:40 Z | hugsfromadicto | Prosjek (COCI14_prosjek) | C++14 | 1 ms | 464 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 464 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 344 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 456 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |