# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19702 | kk1401 | 괄호 (kriii4_R) | C++14 | 0 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>
#define M 1000000007
int n;
long long d[1000001],k;
int main()
{
int i;
scanf("%d%lld",&n,&k);
d[1] = k;
for(i=2; i<=n; i++){
if(i%2 == 0) d[i] = (d[i-1] * (k + 1)) % M;
else d[i] = ((d[i-1] * k) % M + (d[i-1] - d[(i-1)/2] + M) % M) % M;
}
printf("%lld\n",d[n]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |