| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 461327 | JasperL | Prosjek (COCI14_prosjek) | C++14 | 1 ms | 300 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 <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;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
