#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<<' '<<fixed<<a[i];
return;
}
int main()
{
solve();
return 0;
}
# |
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 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |