# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22443 | 카시코이 (#40) | Polynomial Quine (KRIII5_PQ) | C++11 | 239 ms | 1640 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>
int p[210][210];
int inv[210];
int a[210][210], b[210][210];
int x[210], y[210];
bool DEBUG = false;
int main(){
int N; scanf("%d", &N);
// for 2 point: N = prime
inv[1] = 1;
for(int i = 2; i < N; i++){
inv[i] = N - N / i * inv[N % i] % N;
}
for(int i = 0; i < N; i++){
int w = 1, v = N - 1 - i;
for(int j = N - 1; j >= 0; j--){
p[i][j] = w; w *= v; w %= N;
}
}
for(int i = 0; i < N; i++){
if(p[i][i] == 0) p[i][i] = N - 1;
else p[i][i]--;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |