# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
206142 | 2020-03-02T12:15:11 Z | aloo123 | 평균 (COCI14_prosjek) | C++14 | 5 ms | 376 KB |
#include <bits/stdc++.h> #define ll long long #define ld long double #define f first #define s second #define mp make_pair #define pb push_back #define vll vector<ll> #define pll pair<ll,ll> using namespace std; const ll N = 2e5+5; const ll MOD = 1e9+7; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); ll n; cin >> n; ll a[n+1]; for(int i =1;i<=n;i++) cin >> a[i]; ll b[n+1]; b[1] = a[1]; ll sum = b[1]; for(int i =2;i<=n;i++){ // (sum + x)/i = a[i] // sum + x = a[i] * i // x = a[i] * i -sum b[i] = (a[i] * i) - sum; sum += b[i]; } for(int i=1;i<=n;i++) cout<<b[i]<<" ";cout<<endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 4 ms | 376 KB | Output is correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Correct | 5 ms | 376 KB | Output is correct |
5 | Correct | 5 ms | 376 KB | Output is correct |
6 | Correct | 5 ms | 376 KB | Output is correct |
7 | Correct | 5 ms | 376 KB | Output is correct |
8 | Correct | 5 ms | 376 KB | Output is correct |
9 | Correct | 5 ms | 376 KB | Output is correct |
10 | Correct | 5 ms | 376 KB | Output is correct |