# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22066 | 2017-04-29T06:58:50 Z | 연습 세션과 본 대회의 등록은 왜 따로일까(#1013, gs13105) | None (KRIII5P_2) | C++ | 0 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]); 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 8928 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 8928 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |