# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
953255 |
2024-03-25T18:21:50 Z |
ind1v |
Prosjek (COCI14_prosjek) |
C++11 |
|
1 ms |
348 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
int n;
int b[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
for (int i = 1; i <= n; i++) {
cout << 1LL * b[i] * i - (1LL * b[i - 1] * (i - 1)) << ' ';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |