Submission #1057351

#TimeUsernameProblemLanguageResultExecution timeMemory
1057351LilPlutonProsjek (COCI14_prosjek)C++14
50 / 50
0 ms460 KiB
#include <bits/stdc++.h> /// author: LilPluton auuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuu using namespace std; #define ll long long #define ld long double #define ar array #define int ll #define vt vector #define pb push_back #define all(c) (c).begin(), (c).end() #define sz(x) (int)(x).size() #define endll '\n' #define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s)) #define F_OR1(e) F_OR(i, 0, e, 1) #define F_OR2(i, e) F_OR(i, 0, e, 1) #define F_OR3(i, b, e) F_OR(i, b, e, 1) #define F_OR4(i, b, e, s) F_OR(i, b, e, s) #define GET5(a, b, c, d, e, ...) e #define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1) #define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__) #define EACH(x, a) for (auto& x: a) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1}; const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1}; struct BIT { long long n; vector<long long> ft; BIT(long long N) { n = N; ft.assign(n + 5, 0); } void upd(long long pos, long long val) { while(pos <= n) { ft[pos] += val; pos += (pos & (-pos)); } } long long sum(long long l, long long r) { if(l != 1) return sum(1, r) - sum(1, l - 1); long long res = 0; while(r >= 1) { res += ft[r]; r += (r | (-r)); } return res; } }; struct DSU { vector<int>par, size; int n; DSU(int N) { n = N + 5; par.resize(n + 1, 0); size.assign(n + 1, 1); for(int i = 0; i <= n; ++i) par[i] = i; } int _find(int v) { if(par[v] == v) return v; return par[v] = _find(par[v]); } bool unite(int a, int b) { a = _find(a); b = _find(b); if(a != b) { if(size[a] < size[b]) swap(a, b); size[a] += size[b]; par[b] = a; return 1; } return 0; } }; const long long INF = 1e18; const int N = 1e5 + 1; const int MAXM = 1e5 + 5; const int L = 22; const int modulo = 1000000007; void solve(int test_case) { int n; cin >> n; int prev = 0; for(int i = 1; i <= n; ++i) { int x; cin >> x; cout << (x * i) - prev << ' '; prev += (x * i) - prev; } } main() { ios::sync_with_stdio(0); cin.tie(0); int t = 1; for(int i = 1; i <= t; ++i) solve(i); return 0; }

Compilation message (stderr)

prosjek.cpp:113:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  113 | main() {
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...