Description
问长度为
n
,元素介于
Input
一个正整数
Output
输出满足条件的序列数,结果模 109+7
Sample Input
2
Sample Output
4
Solution
考虑只用
k
个数构造不减的序列,
Code
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f,maxn=100005;
#define mod 1000000007
int fact[maxn],inv[maxn];
void init(int n=100000)
{
fact[0]=1;
for(int i=1;i<=n;i++)fact[i]=(ll)i*fact[i-1]%mod;
inv[1]=1;
for(int i=2;i<=n;i++)inv[i]=mod-(ll)(mod/i)*inv[mod%i]%mod;
inv[0]=1;
for(int i=1;i<=n;i++)inv[i]=(ll)inv[i-1]*inv[i]%mod;
}
int C(int n,int m)
{
return (ll)fact[n]*inv[m]%mod*inv[n-m]%mod;
}
int main()
{
init();
int n;
while(~scanf("%d",&n))
{
int ans=0;
for(int k=1;k<=n;k++)ans=(ans+(ll)C(n,k)*C(n-1,k-1)%mod)%mod;
ans=((ans+ans)%mod-n+mod)%mod;
printf("%d\n",ans);
}
return 0;
}