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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[1005];
int n, p, a0;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin >> n >> p;
for(int i = n, x; i >= 0; i--){
cin >> x;
a[i % (p-1)] += x;
if(!i) a0 = x;
}
for(int i = p; i--;) a[i] %= p;
for(int j = 0; j < p; j++){
if(!j){
printf("%d\n",a0%p);
continue;
}
int k = 1;
int ans = 0;
for(int i = 0; i < p; i++){
ans = (ans + k * a[i]) % p;
k = k * j % p;
}
printf("%d\n",ans);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |