Submission #1420655
Source Code Expand
// この小定理...「深い」!!! #include <iostream> using namespace std; using ll = long long; #define MOD 1000000007 ll powmod(ll a, int b, ll p) { // 繰り返し2乗法 if (b == 0) return 1; if (b % 2 == 0) { ll d = powmod(a, b/2, p); return (d * d) % p; } else { return (a * powmod(a, b-1, p)) % p; } } int main() { int W, H; ll ans = 1; cin >> W >> H; // ans == (H+W-2)! / (H-1)!(W-1)! として計算する場合 see: http://oto-suu.seesaa.net/article/310359155.html // for(int i = 1; i <= H + W - 2; i++) { // ans = ans * i % MOD; // } // for(int i = 1; i <= H - 1; i++) { // ここで小定理を使う(割り算を掛け算に変換) // ans = ans * powmod(i, MOD - 2, MOD) % MOD; // } // for(int i = 1; i <= W - 1; i++) { // ans = ans * powmod(i, MOD - 2, MOD) % MOD; // } // ans == (H+W-2)P(H-1) / (H-1)! として計算する場合 for(int i = W; i <= H + W - 2; i++) { // ans == (H + W - 2)!になる ans = ans * i % MOD; } for(int i = 1; i <= H - 1; i++) { // ここで小定理を使う(割り算を掛け算に変換) ans = ans * powmod(i, MOD - 2, MOD) % MOD; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 経路 |
User | sei0o |
Language | C++14 (GCC 5.4.1) |
Score | 101 |
Code Size | 1313 Byte |
Status | AC |
Exec Time | 74 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 | 2 ms | 256 KB |
012.txt | AC | 1 ms | 256 KB |
013.txt | AC | 2 ms | 256 KB |
014.txt | AC | 2 ms | 256 KB |
015.txt | AC | 2 ms | 256 KB |
016.txt | AC | 2 ms | 256 KB |
017.txt | AC | 2 ms | 256 KB |
018.txt | AC | 2 ms | 256 KB |
019.txt | AC | 1 ms | 256 KB |
020.txt | AC | 2 ms | 256 KB |
021.txt | AC | 2 ms | 256 KB |
022.txt | AC | 68 ms | 256 KB |
023.txt | AC | 44 ms | 256 KB |
024.txt | AC | 36 ms | 256 KB |
025.txt | AC | 29 ms | 256 KB |
026.txt | AC | 22 ms | 256 KB |
027.txt | AC | 36 ms | 256 KB |
028.txt | AC | 66 ms | 256 KB |
029.txt | AC | 20 ms | 256 KB |
030.txt | AC | 71 ms | 256 KB |
031.txt | AC | 27 ms | 256 KB |
032.txt | AC | 74 ms | 256 KB |
s0.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |