# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162726 | Pwo | Real Mountains (CCO23_day1problem2) | C++20 | 4 ms | 8772 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int md = 1e6 + 3;
int modexp(int base, int exp, int mod) {
int res = 1;
base %= mod;
while(exp) {
if(exp & 1)
res = (res * base) % mod;
base = (base * base) % mod;
exp /= 2;
}
return res;
}
int modinv(int a, int mod) {
return modexp(a, mod - 2, mod);
}
int modMul(int a, int b) {
return ((a % md) * (b % md)) % md;
}
int modAdd(int a, int b) {
return ((a % md) + (b % md)) % md;
}
int n, a[5005], b[5005];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |