https://ac.nowcoder.com/acm/contest/553/D
题意:
思路:(1)正整数就相当于有n个1然后在中间查板即C(n-1,m-1);
(2) 非负整数就即有的可以为0;公式设yi=xi+1;那么y1+y2+y3....=n+m;就成了(1)了即C(m+n-1,n-1);
总结:(1)逆元的线性递推:
(2) 阶乘的逆元:
(3) 组合数公式:
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x) memset(x,0,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e6+9;
const int mod=1e9+7;
template <class T>
inline void sc(T &ret)
{
char c;
ret = 0;
while ((c = getchar()) < '0' || c > '9');
while (c >= '0' && c <= '9')
{
ret = ret * 10 + (c - '0'), c = getchar();
}
}
ll f[maxn+100];
ll inv[maxn+100];
ll power(ll x,ll n)
{
ll ans=1;
while(n)
{
if(n&1)ans=ans*x%mod;
n>>=1;
x=x*x%mod;
}
return ans;
}
void F()//求阶乘
{
f[0]=1;
for(int i=1;i<=maxn;i++)
{
f[i]=(f[i-1]*i)%mod;
}
}
/*void Inv()//线性递推求1~maxn在mod下的逆元
{
inv[1]=1;
for(int i=2;i<maxn;i++)
{
inv[i]=inv[mod%i]*(mod-mod/i)%mod;
}
}*/
void Inv_fac()//阶乘的逆元
{
inv[maxn]=power(f[maxn],mod-2)%mod;
for(int i=maxn-1;i>=0;i--)
{
inv[i]=(inv[i+1]*(i+1))%mod;
}
}
ll C(ll n,ll m)
{
return ((f[n]*inv[m])%mod*inv[n-m])%mod;
}
int main()
{
F();
Inv_fac();
ll n,m;
cin>>m>>n;
cout<<C(n-1,m-1)<<" "<<C(n+m-1,m-1)<<endl;
return 0;
}