# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20063 | jihoon | 괄호 (kriii4_R) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
#define je 1000000007
long long seq[2000001];
long long seqw[1000001];
long long gop(long long x,long long y){
x%=je;y%=je;
x*=y;x%=je;
return x;
}
long long hap(long long x,long long y){
x%=je;y%=je;
x+=y;x%=je;
return x;
}
long long div(long long x,long long y){
x%=je;y%=je;
int left=je-2;
long long gopp=y,ret=1;
while(left){
if(left&1){
ret=gop(ret,gopp);
}
gopp=gop(gopp,gopp);
left >>= 1;
}
ret=gop(ret,x);
return ret;
}
int main(){
int n,k,su=1;
scanf("%d %d",&n,&k);
seq[1]=1;
fact[0]=1;
for(int i=1;i<=2*n;i++){
fact[i]=gop(fact[i-1],i);
}
for(int i=1;i<=n;i++){
seq[i]=gop(seq[i-1],k+1);
if(i%2){
su=gop(su,k);
seq[i]=hap(seq[i],je-gop(su,div(div(gop(fact[2*n],fact[n]),n+1),n+1)));
}
}
printf("%lld\n",seq[n]);
}