# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
22067 | 2017-04-29T06:59:29 Z | 연습 세션과 본 대회의 등록은 왜 따로일까(#1013, gs13105) | 다항식 계산 (KRIII5P_2) | C++14 | 206 ms | 8928 KB |
#include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> using namespace std; long long arr[1000010]; int main() { int n, p, i, j; long long c, r; scanf("%d%d", &n, &p); for(i = n; i>=0; i--) scanf("%lld", &arr[i]); if(p == 2) { printf("%lld\n", arr[0] % p); r = 0; for(i = 0; i<=n; i++) { r += arr[i]; r %= p; } printf("%lld", r); return 0; } for(i = p; i<=n; i++) { arr[i%p] += arr[i]; arr[i%p] %= p; } for(i = 0; i<p; i++) { c = 1; r = 0; for(j = 0; j<p; j++) { r += arr[j] * c; c *= i; r %= p; c %= p; } printf("%lld\n", r); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 8928 KB | Output is correct |
2 | Correct | 0 ms | 8928 KB | Output is correct |
3 | Correct | 0 ms | 8928 KB | Output is correct |
4 | Correct | 0 ms | 8928 KB | Output is correct |
5 | Correct | 0 ms | 8928 KB | Output is correct |
6 | Correct | 26 ms | 8928 KB | Output is correct |
7 | Correct | 26 ms | 8928 KB | Output is correct |
8 | Correct | 23 ms | 8928 KB | Output is correct |
9 | Correct | 23 ms | 8928 KB | Output is correct |
10 | Correct | 23 ms | 8928 KB | Output is correct |
11 | Correct | 13 ms | 8928 KB | Output is correct |
12 | Correct | 16 ms | 8928 KB | Output is correct |
13 | Correct | 3 ms | 8928 KB | Output is correct |
14 | Correct | 0 ms | 8928 KB | Output is correct |
15 | Correct | 3 ms | 8928 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 8928 KB | Output is correct |
2 | Correct | 0 ms | 8928 KB | Output is correct |
3 | Correct | 0 ms | 8928 KB | Output is correct |
4 | Correct | 0 ms | 8928 KB | Output is correct |
5 | Correct | 0 ms | 8928 KB | Output is correct |
6 | Correct | 26 ms | 8928 KB | Output is correct |
7 | Correct | 26 ms | 8928 KB | Output is correct |
8 | Correct | 23 ms | 8928 KB | Output is correct |
9 | Correct | 23 ms | 8928 KB | Output is correct |
10 | Correct | 23 ms | 8928 KB | Output is correct |
11 | Correct | 13 ms | 8928 KB | Output is correct |
12 | Correct | 16 ms | 8928 KB | Output is correct |
13 | Correct | 3 ms | 8928 KB | Output is correct |
14 | Correct | 0 ms | 8928 KB | Output is correct |
15 | Correct | 3 ms | 8928 KB | Output is correct |
16 | Correct | 196 ms | 8928 KB | Output is correct |
17 | Incorrect | 206 ms | 8928 KB | Output isn't correct |
18 | Halted | 0 ms | 0 KB | - |