# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234538 | shayan_p | Ljetopica (COI19_ljetopica) | C++14 | 37 ms | 8440 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.
// Never let them see you bleed...
#include<bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1010 , mod = 1e9 + 7, inf = 1e9 + 10;
int fac[maxn], ifac[maxn];
int Pow(int a, int b){
int ans = 1;
for(; b; b>>=1, a = 1ll * a * a % mod)
if(b & 1)
ans = 1ll * ans * a % mod;
return ans;
}
int C(int n, int k){
if(n < 0 || k < 0 || n < k)
return 0;
return 1ll * fac[n] * ifac[k] %mod * ifac[n-k] % 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... |