oj.uz

Submission #858189

# Submission time Handle Problem Language Result Execution time Memory
858189 2023-10-07T14:52:16 Z bibocat Prosjek (COCI14_prosjek) C++14
0 / 50
 0 ms 464 KB 
#include<iostream>
#include<fstream>
#include<stdio.h>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<deque>
#include<ctime>

using namespace std;

#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define long long long
#define mp(a,b) make_pair(a,b)
#define FI first
#define SE second


#define N 300000

const long mod = 998244353;
    
int n;
int b[N];

long sum = 0;

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

 //   freopen("e:/test.inp","r",stdin);

    cin >> n;
    for(int i = 1;i <= n;i++) {
    	cin >> b[i];
    }

    for(int i = 1;i <= n;i++) {
    	long x = b[i]*i - sum;
    	cout << x << " ";
    	sum += x;
    }

    cerr<<"Times:  "<<TIME<<endl;
}

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 0 ms 464 KB Output isn't correct
10 Halted 0 ms 0 KB -