#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define INF 1e9
using namespace std;
typedef long long ll;
void solve()
{
	int n; cin >> n;
	ll sum = 0;
	for (int i = 1; i <= n; i++) {
		ll num; cin >> num;
		num = num * i;
		num -= sum;
		cout << num << " ";
		sum += num;
	}
}
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1; //cin>>t;
	while (t--) solve();
	return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |