# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
19696 | | joojis | 괄호 (kriii4_R) | C++98 | | 5 ms | 3944 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>
#include <vector>
int main ()
{
int N, K;
int M = 1000000007;
scanf("%d %d", &N, &K);
std::vector<long long unsigned> A(N+1, 0);
A[0] = 1;
A[1] = K;
for (int i=2; i<=N; i++) {
A[i] = ((A[i-1]*K)%M + (A[i-2]*K)%M) % M;
}
printf("%llu\n", A[N]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |