# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19668 | xdoju | 비트 (kriii4_Q) | C++14 | 0 ms | 1088 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>
using namespace std;
const long long MOD = 1000000007ll;
long long modpow(long long r, long long n) {
long long ret = 1;
while (n > 0) {
if (n % 2 > 0) {
ret = (ret * r) % MOD;
}
r = (r * r) % MOD;
n /= 2;
}
return ret;
}
long long modinv(long long n) {
return modpow(n, MOD - 2);
}
long long coff[300], add[300];
long long ans[300];
void proc() {
int n, k;
scanf("%d %d", &n, &k);
coff[1] = ((n - 1) * modinv(n)) % MOD;
add[1] = 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |