# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22138 | 연습대회 팀 네임은 수정할 수 있을까? (#42) | 다항식 계산 (KRIII5P_2) | C++14 | 209 ms | 5024 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <string.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long ll;
const int MAX_N = 1e6 + 100, MAX_P = 1e3 + 100;
int N, P, Nr[MAX_N], Ans[MAX_P];
int main() {
scanf("%d%d", &N, &P); for(int i=N; i>=0; i--) scanf("%d", &Nr[i]), Nr[i] %= P;
Ans[0] = Nr[0];
for(int i=N; i>=P-1; i--) Nr[i-(P-1)] = (Nr[i-(P-1)] + Nr[i]) % P;
for(int x=1; x<P; x++) {
int pw = 1, &ans = Ans[x];
for(int i=0; i<P-1; i++) {
ans = (ans + pw * Nr[i]) % P;
pw = pw * x % P;
}
}
for(int i=0; i<P; i++) printf("%d\n", Ans[i]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |