// #include<bits/stdc++.h>
// using namespace std;
// using ll=long long;
// using ull=unsigned long long;
// void solve(){
// ll n;
// cin>>n;
// ll m;
// int ans=0;
// vector<ll>a;
// for(ll i=1;i<=n;i++)
// {
// cin>>m;
// a.push_back(i*m-ans);
// ans+=a[a.size()-1];
// }
// int p=a.size();
// cout<<a[0];
// for(int i=1;i<p;i++)cout<<' '<<a[i];
// return;
// }
// int main()
// {
// solve();
// return 0;
// }
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6;
int ans[N], n;
int main() {
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) {
int a; cin >> a;
ans[i] = a*i-sum;
sum += ans[i];
}
cout << ans[1];
for (int i = 2; i <= n; i++) cout << ' ' << ans[i];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 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 |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
440 KB |
Output is correct |