# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19424 | Qwaz | Ω (kriii4_P3) | C++14 | 0 ms | 1084 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>
typedef long long ll;
const int MOD = 1000000007, MAX = 110;;
ll modpow(ll a, ll x) {
ll ret = 1;
a = a % MOD;
while (x) {
if (x & 1) ret = ret * a % MOD;
a = a * a % MOD;
x >>= 1;
}
return ret;
}
int p, q, n, k;
ll coeff[MAX], constant[MAX], val[MAX];
int main() {
scanf("%d%d%d%d", &p, &q, &n, &k);
if (k == 0) puts("0");
else if (k == n) puts("1");
else {
ll x = q * modpow(p, MOD-2) % MOD;
ll y = 1 - x;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |