# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305542 | quocnguyen1012 | Asceticism (JOI18_asceticism) | C++14 | 21 ms | 1152 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>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int mod = 1e9 + 7, maxn = 1e5 + 5;
int fact[maxn], ifact[maxn];
int N, K;
int power(int a, int b) {
if (b == 0) return 1;
int res = power(a, b / 2);
if (b & 1) return (ll)res * res % mod * a % mod;
return (ll)res * res % mod;
}
int inv(int a) {
return power(a, mod - 2);
}
int binom(int k, int n) {
# | 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... |