Submission #1689958
Source Code Expand
#include <bits/stdc++.h> #include <stdio.h> using namespace std; #define fi first #define se second #define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define rep(i,n) repl(i,0,n) #define each(itr,v) for(auto itr:v) #define pb(s) push_back(s) #define mmax(x,y) (x>y?x:y) #define mmin(x,y) (x<y?x:y) #define maxch(x,y) x=mmax(x,y) #define minch(x,y) x=mmin(x,y) #define mp(a,b) make_pair(a,b) #define all(x) (x).begin(),(x).end() #define dbg(x) cout<<#x"="<<x<<endl #define uni(x) x.erase(unique(all(x)),x.end()) template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;} template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;} #define MAX(a, b) ((a) > (b) ? (a) : (b)) #define MIN(a, b) ((a) > (b) ? (b) : (a)) typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> P; typedef pair<P, int> PPI; #define INF INT_MAX/3 #define MAX_N 1000 #define M_INF 1000000000 const ll MOD = 1e9+7; ll w,h; ll kaijou(ll k){ ll ans = 1; while(k > 0){ (ans*=k)%=MOD; k--; } return ans%MOD; } ll calc(ll x,ll m){ if(m==0) return 1; else if(m%2==0) return calc((x*x)%MOD,m>>1) % MOD; else return calc((x*x)%MOD,m>>1) * x % MOD; } int main(){ cin.tie(0); ios::sync_with_stdio(false); cin>>w>>h; ll a=kaijou(w+h-2); ll b=kaijou(h-1)*kaijou(w-1)%MOD; cout<<(a*calc(b,MOD-2)%MOD)<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 経路 |
User | koki1018 |
Language | C++14 (GCC 5.4.1) |
Score | 101 |
Code Size | 1419 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 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 | 1 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | AC | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 1 ms | 256 KB |
005.txt | AC | 1 ms | 256 KB |
006.txt | AC | 1 ms | 256 KB |
007.txt | AC | 1 ms | 256 KB |
008.txt | AC | 1 ms | 256 KB |
009.txt | AC | 1 ms | 256 KB |
010.txt | AC | 1 ms | 256 KB |
011.txt | AC | 1 ms | 256 KB |
012.txt | AC | 1 ms | 256 KB |
013.txt | AC | 1 ms | 256 KB |
014.txt | AC | 1 ms | 256 KB |
015.txt | AC | 1 ms | 256 KB |
016.txt | AC | 1 ms | 256 KB |
017.txt | AC | 1 ms | 256 KB |
018.txt | AC | 1 ms | 256 KB |
019.txt | AC | 1 ms | 256 KB |
020.txt | AC | 1 ms | 256 KB |
021.txt | AC | 1 ms | 256 KB |
022.txt | AC | 3 ms | 256 KB |
023.txt | AC | 3 ms | 256 KB |
024.txt | AC | 2 ms | 256 KB |
025.txt | AC | 1 ms | 256 KB |
026.txt | AC | 1 ms | 256 KB |
027.txt | AC | 2 ms | 256 KB |
028.txt | AC | 2 ms | 256 KB |
029.txt | AC | 2 ms | 256 KB |
030.txt | AC | 3 ms | 256 KB |
031.txt | AC | 2 ms | 256 KB |
032.txt | AC | 3 ms | 256 KB |
s0.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |