/*
god taekyu
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int n;
int A[100005];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++) cin>>A[i];
for(int i=1;i<=n;i++) {
cout<<(ll)A[i]*(ll)(i) - (ll)A[i-1]*(ll)(i-1)<<' ';
}
return 0;
}
/*
god taekyu
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2564 KB |
Output is correct |
2 |
Correct |
0 ms |
2564 KB |
Output is correct |
3 |
Correct |
0 ms |
2564 KB |
Output is correct |
4 |
Correct |
0 ms |
2564 KB |
Output is correct |
5 |
Correct |
0 ms |
2564 KB |
Output is correct |
6 |
Correct |
0 ms |
2564 KB |
Output is correct |
7 |
Correct |
0 ms |
2564 KB |
Output is correct |
8 |
Correct |
0 ms |
2564 KB |
Output is correct |
9 |
Correct |
0 ms |
2564 KB |
Output is correct |
10 |
Correct |
0 ms |
2564 KB |
Output is correct |