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