oj.uz

Submission #154341

# Submission time Handle Problem Language Result Execution time Memory
154341 2019-09-20T20:59:55 Z jvalsortav Prosjek (COCI14_prosjek) C++14
50 / 50
 3 ms 504 KB 
#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;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct