# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
392817 | 2021-04-21T20:51:18 Z | rainboy | 평균 (COCI14_prosjek) | C | 1 ms | 280 KB |
#include <stdio.h> #define N 100 int main() { static long long aa[N]; int n, i; scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%lld", &aa[i]); aa[i] *= i + 1; } for (i = n - 1; i > 0; i--) aa[i] -= aa[i - 1]; for (i = 0; i < n; i++) printf("%lld ", aa[i]); printf("\n"); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 280 KB | Output is correct |
3 | Correct | 0 ms | 208 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 1 ms | 276 KB | Output is correct |
9 | Correct | 1 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 208 KB | Output is correct |