Submission #384233
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>
using namespace std;
#define reE(i,a,b) for(auto (i)=(a);(i)<=(b);(i)++)
#define rE(i,b) reE(i,0,b)
#define reT(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rT(i,b) reT(i,0,b)
#define rep(i,a,b) reE(i,a,b);
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define fe(i,b) for (auto &(x):b);
#define itr(i,b) for(auto (i)=(b).begin();(i)!=(b).end();++(i))
#define rti(i,b) for(auto (i)=(b).rbegin();(i)!=(b).rend();++(i))
#define LL long long
#define all(b) (b).begin(),(b).end()
#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num
#define dir(xx,yy,x,y,i) (xx)=(x)+dir[(i)],(yy)=(y)+dir[(i)+1]
typedef complex<double> P;
typedef vector<P> Poly;
const LL INF = 1 << 30;
const double eps = 1e-8;
const int dir[] = { 0, 1, 0, -1, 0 };
#define MOD 1000000007
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;
reE(i, 1ll, n){
res = (res*i) % MOD;
}
//cout << res << endl;
return res;
}
int main(void){
LL N, K;
cin >> N >> K;
cout << (mod_fuct(N + K - 1)*invMod((mod_fuct(N-1)*mod_fuct(K)) % MOD, MOD)) % MOD << endl;
return(0);
}
Submission Info
Submission Time |
|
Task |
D - 多重ループ |
User |
btk15049 |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
1946 Byte |
Status |
AC |
Exec Time |
30 ms |
Memory |
928 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
99 / 99 |
1 / 1 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
Subtask1 |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.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 |
All |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.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_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 |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
24 ms |
800 KB |
subtask0_sample_02.txt |
AC |
23 ms |
924 KB |
subtask0_sample_03.txt |
AC |
23 ms |
796 KB |
subtask0_sample_04.txt |
AC |
25 ms |
924 KB |
subtask0_sample_05.txt |
AC |
30 ms |
912 KB |
subtask1_01.txt |
AC |
25 ms |
800 KB |
subtask1_02.txt |
AC |
24 ms |
796 KB |
subtask1_03.txt |
AC |
25 ms |
924 KB |
subtask1_04.txt |
AC |
22 ms |
672 KB |
subtask1_05.txt |
AC |
24 ms |
796 KB |
subtask1_06.txt |
AC |
24 ms |
924 KB |
subtask1_07.txt |
AC |
24 ms |
800 KB |
subtask1_08.txt |
AC |
24 ms |
672 KB |
subtask1_09.txt |
AC |
24 ms |
924 KB |
subtask1_10.txt |
AC |
24 ms |
840 KB |
subtask1_11.txt |
AC |
24 ms |
672 KB |
subtask1_12.txt |
AC |
24 ms |
796 KB |
subtask1_13.txt |
AC |
24 ms |
804 KB |
subtask1_14.txt |
AC |
24 ms |
736 KB |
subtask1_15.txt |
AC |
23 ms |
796 KB |
subtask1_16.txt |
AC |
25 ms |
804 KB |
subtask1_17.txt |
AC |
22 ms |
928 KB |
subtask1_18.txt |
AC |
23 ms |
800 KB |
subtask1_19.txt |
AC |
24 ms |
920 KB |
subtask2_02.txt |
AC |
25 ms |
800 KB |
subtask2_03.txt |
AC |
26 ms |
928 KB |
subtask2_04.txt |
AC |
25 ms |
800 KB |
subtask2_05.txt |
AC |
27 ms |
800 KB |
subtask2_06.txt |
AC |
24 ms |
924 KB |
subtask2_07.txt |
AC |
25 ms |
924 KB |
subtask2_08.txt |
AC |
27 ms |
800 KB |
subtask2_09.txt |
AC |
26 ms |
676 KB |
subtask2_10.txt |
AC |
27 ms |
920 KB |