# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
31176 | 2017-08-12T15:10:19 Z | foul3r | 평균 (COCI14_prosjek) | C++14 | 0 ms | 2020 KB |
#include <bits/stdc++.h> using namespace std; long long A[110], B[110]; int main(){ long long n, i; scanf("%lld", &n); for(i=1;i<=n;i++){ scanf("%lld", &B[i]); A[i] = B[i]*i-(B[i-1])*(i-1); printf("%lld ", A[i]); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2020 KB | Output is correct |
2 | Correct | 0 ms | 2020 KB | Output is correct |
3 | Correct | 0 ms | 2020 KB | Output is correct |
4 | Correct | 0 ms | 2020 KB | Output is correct |
5 | Correct | 0 ms | 2020 KB | Output is correct |
6 | Correct | 0 ms | 2020 KB | Output is correct |
7 | Correct | 0 ms | 2020 KB | Output is correct |
8 | Correct | 0 ms | 2020 KB | Output is correct |
9 | Correct | 0 ms | 2020 KB | Output is correct |
10 | Correct | 0 ms | 2020 KB | Output is correct |