# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22224 | a (#42) | 다항식 계산 (KRIII5P_2) | C++98 | 0 ms | 2020 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 <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int P;
int fMOD_P(const vector<int> &a, const int x) {
int xPow = 1;
int fx = 0;
for (int i = 0; i < a.size(); i++) {
fx = (fx + a[i] * xPow) % P;
xPow = (xPow*x) % P;
}
return fx;
}
int main()
{
//freopen("input.txt", "r", stdin);
//setbuf(stdout, NULL);
int testCase; cin >> testCase;
for (int t = 1; t <= testCase; t++)
{
int N; cin >> N >> P;
vector<int> a(N+1);
for (int i = N; i >= 0; i--) {
cin >> a[i];
a[i] = a[i] % P;
}
for (int i = 0; i < P; i++)
cout << fMOD_P(a, i) << endl;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |