# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027541 | _8_8_ | Boat (APIO16_boat) | C++17 | 985 ms | 9556 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;
typedef long long ll;
const int N = 1e3 + 20, MOD = (int)1e9+7;
ll binpow(ll a,ll b) {
ll ans = 1,k = a;
while(b) {
if(b % 2)ans *= k;
ans %= MOD;
k *= k;
k %= MOD;
b /= 2ll;
}
return ans;
}
ll bp[N];
ll ceis(ll n,ll k){
if(k > n) return 0;
ll d = 1;
for(ll i = n - k + 1;i <= n;i++){
d = i % MOD * d % MOD;
}
for(ll i = 2;i <= k;i++){
d = d * bp[i]%MOD;
}
return d;
}
# | 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... |