Submission #1686532
Source Code Expand
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef ll Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
//#define mt make_tuple
//typedef tuple<double,int,double> tp;
//typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
const double PI=acos(-1);
const double EPS=1e-7;
Def inf=sizeof(Def)==sizeof(long long)?9e18:1e9;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
/*
//Lucasの定理の拡張
//m=p^q m<1e7 n,r:任意
vi fact,ifact;
ll nCr(ll n,ll r,ll p,ll q){
if(h=
}
*/
//nCr mod m
#define MOD 1000000007
#define M 1000000
vector<ll> fact;
bool h=false;
void init(){
h=true;
fact=vector<ll>(M);
fact[0]=fact[1]=1;
loop(i,2,M)fact[i]=fact[i-1]*i%MOD;
}
// a^b mod MOD
ll powmod(ll a,ll b,ll m){
ll out=1;
ll p=a%m;
while(b){
if(b&1)out=out*p%m;
p=p*p%m;
b>>=1;
}
return out;
}
//nCr
ll nCr(ll n,ll r,ll m){
if(!h)init();
if(n<r)return 1;
ll out=fact[n]*powmod(fact[r]*fact[n-r]%m,m-2,m)%m;
return out;
}
int main(){
ll n,m;
cin>>n>>m;
cout<<nCr(n-1+m-1,m-1,MOD)<<endl;
}
Submission Info
Submission Time |
|
Task |
C - 経路 |
User |
ixmel_rd |
Language |
C++14 (GCC 5.4.1) |
Score |
101 |
Code Size |
1890 Byte |
Status |
AC |
Exec Time |
10 ms |
Memory |
8064 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 |
10 ms |
8064 KB |
001.txt |
AC |
10 ms |
8064 KB |
002.txt |
AC |
10 ms |
8064 KB |
003.txt |
AC |
10 ms |
8064 KB |
004.txt |
AC |
10 ms |
8064 KB |
005.txt |
AC |
10 ms |
8064 KB |
006.txt |
AC |
10 ms |
8064 KB |
007.txt |
AC |
10 ms |
8064 KB |
008.txt |
AC |
10 ms |
8064 KB |
009.txt |
AC |
9 ms |
8064 KB |
010.txt |
AC |
10 ms |
8064 KB |
011.txt |
AC |
9 ms |
8064 KB |
012.txt |
AC |
10 ms |
8064 KB |
013.txt |
AC |
10 ms |
8064 KB |
014.txt |
AC |
9 ms |
8064 KB |
015.txt |
AC |
9 ms |
8064 KB |
016.txt |
AC |
10 ms |
8064 KB |
017.txt |
AC |
9 ms |
8064 KB |
018.txt |
AC |
10 ms |
8064 KB |
019.txt |
AC |
9 ms |
8064 KB |
020.txt |
AC |
9 ms |
8064 KB |
021.txt |
AC |
10 ms |
8064 KB |
022.txt |
AC |
10 ms |
8064 KB |
023.txt |
AC |
10 ms |
8064 KB |
024.txt |
AC |
10 ms |
8064 KB |
025.txt |
AC |
10 ms |
8064 KB |
026.txt |
AC |
10 ms |
8064 KB |
027.txt |
AC |
10 ms |
8064 KB |
028.txt |
AC |
10 ms |
8064 KB |
029.txt |
AC |
10 ms |
8064 KB |
030.txt |
AC |
10 ms |
8064 KB |
031.txt |
AC |
10 ms |
8064 KB |
032.txt |
AC |
10 ms |
8064 KB |
s0.txt |
AC |
10 ms |
8064 KB |
s1.txt |
AC |
10 ms |
8064 KB |