# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22509 | 카시코이 (#40) | Polynomial Quine (KRIII5_PQ) | C++11 | 376 ms | 1812 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 <algorithm>
using namespace std;
int p[210][210];
int inv[210];
int a[210][210], b[210][210];
int x[210], y[210];
bool DEBUG = false;
int ans[210][210];
int main(){
int N; scanf("%d", &N);
for(int T = 0; ; T++){
// 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 = 2; i < N; i++){
for(int v = 1; v < N; v++) if(i * v % N == 1){ inv[i] = v; break; }
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |