# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21289 | suzy | 괄호 (kriii4_R) | C++11 | 483 ms | 16740 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 <stdio.h>
#define MOD 1000000007LL
typedef long long lli;
lli d[1000001], c[1000001];
lli pw(lli n, lli x) {
if(x==0) return 1;
if(x%2) return n*pw(n,x-1)%MOD;
else { lli ret=pw(n,x/2); return ret*ret%MOD; }
}
int main() {
c[1]=1;
for(lli i=2;i<=1000000;i++) {
lli aa=(2*i-1)*(2*i)%MOD;
lli bb=pw(i*(i+1)%MOD,MOD-2);
c[i]=c[i-1]*aa%MOD*bb%MOD;
}
lli n, k;
scanf("%lld %lld",&n,&k);
d[1]=k;
for(lli i=2;i<=n;i++) {
if(i%2) d[i]=(d[i-1]*(k+1)%MOD-c[(i-1)/2]*pw(k,(i-1)/2)%MOD+MOD)%MOD;
else d[i]=d[i-1]*(k+1)%MOD;
}
printf("%lld\n",d[n]);
return 0;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |