# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
19865 | | ilbbke | 괄호 (kriii4_R) | C++98 | | 5 ms | 8896 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>
long long D[1000003];
int main()
{
int n,k;
scanf("%d%d",&n,&k);
D[0]=1, D[1]=k;
for(int i=2; i<=n; i++){
D[i]=((D[i-1]+D[i-2])*k)%1000000007;
if(i&1) D[i]=((D[i]+D[i/2])*k)%1000000007;
}
printf("%lld\n",D[n]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |