# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370922 | 79brue | Tents (JOI18_tents) | C++14 | 247 ms | 71020 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 ll MOD = 1000000007;
ll mpow(ll x, ll y){
if(!y) return 1;
if(y&1) return mpow(x, y-1) * x % MOD;
ll tmp = mpow(x, y/2);
return tmp*tmp%MOD;
}
int n, m;
ll fact[10002];
ll factInv[10002];
ll arr[10002];
ll DP[3002][3002];
ll ans;
ll comb(ll x, ll y){
if(x<y) return 0;
return fact[x] * factInv[y] % MOD * factInv[x-y] % MOD;
}
int main(){
scanf("%d %d", &n, &m);
fact[0] = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |