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