# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
328694 | 2020-11-17T17:30:12 Z | aris12345678 | 평균 (COCI14_prosjek) | C++14 | 1 ms | 384 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define pi pair<int, int> #define fi first #define se second const int mxN = 1e6+5; const int mod = 1e9+7; const ll inf = 1e18; int n, b[mxN]; vector<ll> ans; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i = 0; i < n; i++) cin >> b[i]; for(int i = 0; i < n; i++) { ll sum = b[i]*(i+1); for(int j = 0; j < i; j++) sum -= ans[j]; ans.push_back(sum); } for(ll i : ans) cout << i << " "; cout << "\n"; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 364 KB | Output is correct |
8 | Correct | 1 ms | 364 KB | Output is correct |
9 | Incorrect | 1 ms | 364 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |