Submission #3454218
Source Code Expand
#include <bits/stdc++.h> #define rep(i, m, n) for(int i = m; i < (n); i++) #define print(x) cout << (x) << endl; #define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]) << " ";} cout << endl; #define printa2(x,m,n) for(int i = 0; i < m; i++){ for(int j = 0; j < n; j++){ cout << x[i][j] << " ";} cout << endl;} #define printp(x,n) for(int i = 0; i < n; i++){ cout << "(" << x[i].first << ", " << x[i].second << ") "; } cout << endl; #define INF (1e18) using namespace std; typedef long long ll; const ll MOD = 1e9 + 7; typedef struct{ int x; int y; } P; typedef struct{ ll to; ll cost; } edge; typedef pair<ll, ll> lpair; const ll max_N = 210000; ll fac[max_N + 1000], facinv[max_N + 1000]; ll power(ll x, ll n){ // xのn乗 % MOD if(n == 0) return 1LL; ll res = power(x * x % MOD, n/2); if(n % 2 == 1){ res = res * x % MOD; } return res; } ll nck(ll n, ll k){ if(k == 0 || n == k){ return 1; } return fac[n] * facinv[k] % MOD * facinv[n-k] % MOD; } void comb_setup(){ fac[0] = 0; fac[1] = 1; rep(i,2,max_N){ fac[i] = (fac[i-1] * i) % MOD; } rep(i,0,max_N){ facinv[i] = power(fac[i], MOD - 2); } } int main(){ cin.tie(0); ios::sync_with_stdio(false); ll W,H; cin >> W >> H; comb_setup(); ll ans = nck(W+H-2,W-1) % MOD; print(ans); }
Submission Info
Submission Time | |
---|---|
Task | C - 経路 |
User | yuji9511 |
Language | C++14 (GCC 5.4.1) |
Score | 101 |
Code Size | 1434 Byte |
Status | AC |
Exec Time | 45 ms |
Memory | 3584 KB |
Judge Result
Set Name | Sample | Dataset1 | Dataset2 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 50 / 50 | 1 / 1 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | s0.txt, s1.txt |
Dataset1 | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, s0.txt |
Dataset2 | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, s0.txt, s1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, s0.txt, s1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 44 ms | 3584 KB |
001.txt | AC | 44 ms | 3584 KB |
002.txt | AC | 44 ms | 3584 KB |
003.txt | AC | 44 ms | 3584 KB |
004.txt | AC | 45 ms | 3584 KB |
005.txt | AC | 44 ms | 3584 KB |
006.txt | AC | 44 ms | 3584 KB |
007.txt | AC | 44 ms | 3584 KB |
008.txt | AC | 44 ms | 3584 KB |
009.txt | AC | 44 ms | 3584 KB |
010.txt | AC | 44 ms | 3584 KB |
011.txt | AC | 44 ms | 3584 KB |
012.txt | AC | 44 ms | 3584 KB |
013.txt | AC | 44 ms | 3584 KB |
014.txt | AC | 44 ms | 3584 KB |
015.txt | AC | 44 ms | 3584 KB |
016.txt | AC | 44 ms | 3584 KB |
017.txt | AC | 44 ms | 3584 KB |
018.txt | AC | 44 ms | 3584 KB |
019.txt | AC | 44 ms | 3584 KB |
020.txt | AC | 44 ms | 3584 KB |
021.txt | AC | 44 ms | 3584 KB |
022.txt | AC | 44 ms | 3584 KB |
023.txt | AC | 44 ms | 3584 KB |
024.txt | AC | 44 ms | 3584 KB |
025.txt | AC | 44 ms | 3584 KB |
026.txt | AC | 44 ms | 3584 KB |
027.txt | AC | 44 ms | 3584 KB |
028.txt | AC | 44 ms | 3584 KB |
029.txt | AC | 44 ms | 3584 KB |
030.txt | AC | 44 ms | 3584 KB |
031.txt | AC | 44 ms | 3584 KB |
032.txt | AC | 44 ms | 3584 KB |
s0.txt | AC | 44 ms | 3584 KB |
s1.txt | AC | 44 ms | 3584 KB |