# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
513762 | couplefire | Asceticism (JOI18_asceticism) | C++17 | 10 ms | 1872 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5+100;
const int MOD = 1e9+7;
ll powmod(ll a, ll b, ll r = 1) {
while(b) {
if(b & 1) r = r * a % MOD;
a = a * a % MOD;
b >>= 1;
} return r;
}
ll fac[N], inv[N];
void prep() {
fac[0] = 1;
for(ll i = 1; i < N; i++)
fac[i] = i * fac[i - 1] % MOD;
inv[N - 1] = powmod(fac[N - 1], MOD - 2);
for(ll i = N - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
ll C(int n, int r) {
return fac[n] * (inv[r] * inv[n - r] % MOD) % MOD;
}
int main() {
Compilation message (stderr)
# | 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... |