oj.uz

Submission #1092019

# Submission time Handle Problem Language Result Execution time Memory
1092019 2024-09-23T00:37:22 Z haianhnguyen08102007 Prosjek (COCI14_prosjek) C++11
0 / 50
 1 ms 468 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5+1;
const int inf = 1e9;
const long long INFZ = 1e18;

int a[N], n;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    cin>>n;
    for (int i=1; i<=n; i++) cin>>a[i];

    long long sumpre=0;
    for (int i=1; i<=n; i++)
    {
        long long z=a[i]*i;
        long long pt=z-sumpre;
        cout<<pt<<" ";
        sumpre+=pt;
    }

    return 0;
}

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -