Submission #405872
Source Code Expand
#include<iostream> #include<fstream> #include<sstream> #include<string> #include<cstdio> #include<cstdlib> #include<cstring> #include<ctime> #include<stack> #include<queue> #include<set> #include<map> #include<vector> #include<list> #include<algorithm> #include<utility> #include<complex> #include<functional> using namespace std; #define LL long long const LL MOD = (1e9) + 7; typedef long long Int; Int extgcd(Int a, Int b, Int &x, Int &y) { Int g = a; x = 1; y = 0; if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x; return g; } Int invMod(Int a, Int m) { Int x, y; if (extgcd(a, m, x, y) == 1) return (x + m) % m; else return 0; // unsolvable } LL mod_fuct(LL n){ LL res = 1; for (LL i = 1; i <= n; i++){ res = (res*i) % MOD; } //cout << res << endl; return res; } int main(void){ LL N, K; cin >> N >> K; if (N > K){ cout << (mod_fuct(N + K - 1)*invMod((mod_fuct(N - 1)*mod_fuct(K)) % MOD, MOD)) % MOD << endl; } else{ K = K%N; cout << (mod_fuct(N)*invMod((mod_fuct(N - K)*mod_fuct(K)) % MOD, MOD)) % MOD << endl; } return(0); }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | btk15049 |
Language | C++11 (GCC 4.9.2) |
Score | 100 |
Code Size | 1152 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 924 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | 20 / 20 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt |
Subtask2 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 25 ms | 808 KB |
subtask0_sample_02.txt | AC | 24 ms | 672 KB |
subtask0_sample_03.txt | AC | 23 ms | 912 KB |
subtask1_01.txt | AC | 27 ms | 788 KB |
subtask1_02.txt | AC | 24 ms | 792 KB |
subtask1_03.txt | AC | 24 ms | 924 KB |
subtask1_04.txt | AC | 24 ms | 916 KB |
subtask1_05.txt | AC | 25 ms | 924 KB |
subtask1_06.txt | AC | 27 ms | 920 KB |
subtask1_07.txt | AC | 25 ms | 728 KB |
subtask1_08.txt | AC | 25 ms | 920 KB |
subtask1_09.txt | AC | 25 ms | 916 KB |
subtask1_10.txt | AC | 25 ms | 916 KB |
subtask1_11.txt | AC | 24 ms | 924 KB |
subtask1_12.txt | AC | 24 ms | 668 KB |
subtask1_13.txt | AC | 25 ms | 728 KB |
subtask1_14.txt | AC | 25 ms | 916 KB |
subtask1_15.txt | AC | 23 ms | 920 KB |
subtask1_16.txt | AC | 25 ms | 732 KB |
subtask1_17.txt | AC | 25 ms | 920 KB |
subtask1_18.txt | AC | 25 ms | 920 KB |
subtask1_19.txt | AC | 26 ms | 796 KB |
subtask2_01.txt | AC | 25 ms | 792 KB |
subtask2_02.txt | AC | 24 ms | 796 KB |
subtask2_03.txt | AC | 24 ms | 924 KB |
subtask2_04.txt | AC | 25 ms | 728 KB |
subtask2_05.txt | AC | 24 ms | 924 KB |
subtask2_06.txt | AC | 25 ms | 732 KB |
subtask2_07.txt | AC | 24 ms | 920 KB |
subtask2_08.txt | AC | 24 ms | 924 KB |
subtask2_09.txt | AC | 24 ms | 920 KB |
subtask2_10.txt | AC | 25 ms | 920 KB |
subtask2_11.txt | AC | 24 ms | 920 KB |