| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 224229 | illequiprogrammat | Prosjek (COCI14_prosjek) | C++14 | 5 ms | 384 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 <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    vector<int> v(n);
    int buf;
    for (int i = 0; i < n; i++) {
        cin >> buf;
        v[i] = buf * (i+1);
        // cout << "v[i] " << v[i] << endl;
    }
    vector<int> v2(n);
    for (int i = n - 1; i >= 1; i--) {
        v2[i] = v[i] - v[i-1];
        // cout << "v[i] " << v2[i] << endl;
    }
    v2[0] = v[0];
    for (int i = 0; i < n-1; i++) cout << v2[i] << " ";
    cout << v2[n-1] << endl;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
