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