oj.uz

Submission #461327

# Submission time Handle Problem Language Result Execution time Memory
461327 2021-08-09T20:03:33 Z JasperL Prosjek (COCI14_prosjek) C++14
50 / 50
 1 ms 300 KB 
#include <iostream>
#include <vector>
using namespace std;

typedef long long ll;
#define maxn 105

int n;
ll a[maxn], b[maxn];

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    a[0] = b[0];
    for (ll i = 1; i < n; i++) {
        a[i] = b[i] * (i+1) - b[i-1] * i;
    }
    for (int i = 0; i < n; i++) {
        cout << a[i] << " ";
    }
    cout << endl;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct