Submission #1686509

---

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};
//
// extgcd(a=12707,b=12319,x,y) -> x=32,y=-33,return 97=gcd
ll extgcd(ll a,ll b,ll &x,ll &y){//ax+by=gcd(a,b)=d
	ll d=a;
	if(b!=0){
		d=extgcd(b,a%b,y,x);
		y-=(a/b)*x;
	}else{
		x=1;y=0;
	}
	return d;
}
// x= mod1 mod div1
// x= mod2 mod div2
// であるxを返す
ll crt(ll div1,ll mod1,ll div2,ll mod2){
	ll x,y;
	ll d=extgcd(div1,div2,x,y);
	if(d-1)assert(0);
	ll ndiv=div1*div2;
//	ll nmod=(x*(mod2-mod1)*div1+mod1)%ndiv;
	ll nmod=(mod1*div2%ndiv*(ndiv+y)%ndiv+mod2*div1%ndiv*(ndiv+x)%ndiv)%ndiv;
	return nmod;
}

#define MOD 1000000007
#define MAX 1000010
int sosu[MAX]={1,1,0};
vi sos;
bool h=false;
void init(){
	h=true;
	for(int i=2;i*i<=MAX;i++)if(!sosu[i])
	for(int j=i*2;j<MAX;j+=i)sosu[j]=true;
	rep(i,MAX)if(sosu[i]==0)sos.pb(i);
}
//nCr mod m
//n<1e7 r,m：任意
//前計算O(nloglogn) 本計算O(n/logn)
ll nCr_m(ll n,ll r,ll m){
	if(!h)init();
	if(n<0||r<0||r>n)return 0;
	if(r>n/2)r=n-r;
	vi A(n);
	rep(i,r)A[i]=n-i;
	rep(p,sos.size()){
		if(sos[p]>r)break;
		for(ll q=sos[p];q<=r;q*=sos[p]){
			int m=n%q;
			for(int i=m,j=0;j<r/q;i+=q,j++)A[i]/=sos[p];
		}
	}
	ll out=1;
	rep(i,r)(out*=A[i])%=m;
	return out;
}
ll nCr(ll n,ll r,ll m){
	ll out=1;
	while(n>0){
		(out*=nCr_m(n%m,r%m,m))%=m;
		n/=m;r/=m;
	}
	return out;
}
int main(){
	ll n,m;
	cin>>n>>m;
	cout<<nCr(n-1+m-1,m-1,MOD)<<endl;
}

Submission Info

Judge Result