# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
838454 | Charizard2021 | Magneti (COCI21_magneti) | C++17 | 106 ms | 14924 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;
const long long MOD = 1e9 + 7;
long long fact[100002], inv[100002];
long long pw(long long b, long long e)
{
long long ans = 1;
while(e)
{
if(e & 1)
ans = (ans * b) % MOD;
b = (b * b) % MOD;
e >>= 1;
}
return ans;
}
long long C(long long n, long long k)
{
if(n < k){
return 0;
}
long long ans = fact[n];
ans *= inv[k];
ans %= MOD;
ans *= inv[n-k];
ans %= MOD;
# | 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... |