# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22066 | 연습 세션과 본 대회의 등록은 왜 따로일까 (#42) | 다항식 계산 (KRIII5P_2) | C++98 | 0 ms | 8928 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 <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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |