| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 154341 | jvalsortav | Prosjek (COCI14_prosjek) | C++14 | 3 ms | 504 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cctype>
#include <ctime>
#include <set>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <utility>
#include <string>
#include <map>
#define ll long long
using namespace std;
const int M = 1000000007;
ll n, a, b, s, x, y;
vector <ll> v;
int main() {
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	
	cin >> n;
	cin >> s;
	v.push_back(s);
	for (int i = 1; i < n; i++){
		cin >> x;
		y = x*(i+1) - s;
		v.push_back(y);
		s += y;
	}
	
	for (int i = 0; i < n; i++) cout << v[i] << " ";
	
return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
