Submission #1690539
Source Code Expand
#include <cstdio> #include <iostream> #include <cmath> #include <algorithm> #include <vector> #include <queue> #include <map> using namespace std; long long int INF = 1000000007; long long int pow10_9_5(long long int num){ long long int pow_num = 1000000005; long long int mod_num = 1000000007; long long int pow_cur = num; long long int ret = 1; while(pow_num > 0){ if(pow_num % 2 == 1){ ret *= pow_cur; ret %= mod_num; } pow_cur *= pow_cur; pow_cur %= mod_num; pow_num /= 2; } return ret; } int main(){ long long int W, H; cin >> W >> H; W--; H--; long long int ans = 1; for(int i = 1; i <= H + W; i++){ ans *= i; ans %= INF; } for(int i = 1; i <= H; i++){ ans *= pow10_9_5(i); ans %= INF; } for(int i = 1; i <= W; i++){ ans *= pow10_9_5(i); ans %= INF; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 経路 |
User | monolith |
Language | C++14 (GCC 5.4.1) |
Score | 101 |
Code Size | 914 Byte |
Status | AC |
Exec Time | 38 ms |
Memory | 384 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 | 33 ms | 256 KB |
023.txt | AC | 29 ms | 256 KB |
024.txt | AC | 26 ms | 384 KB |
025.txt | AC | 9 ms | 256 KB |
026.txt | AC | 8 ms | 256 KB |
027.txt | AC | 25 ms | 256 KB |
028.txt | AC | 30 ms | 256 KB |
029.txt | AC | 16 ms | 256 KB |
030.txt | AC | 29 ms | 256 KB |
031.txt | AC | 22 ms | 256 KB |
032.txt | AC | 38 ms | 256 KB |
s0.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |