# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
19863 | | joojis | 괄호 (kriii4_R) | C++14 | | 4 ms | 4084 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 <iostream>
#include <vector>
using namespace std;
const long long unsigned MOD = 1000000007;
void solveCase ()
{
long long unsigned N, K;
cin >> N >> K;
vector<long long unsigned> A(N+1);
A[0] = 1;
A[1] = K;
for (unsigned i=2; i<=N; i++) {
A[i] = (A[i-1]*K + A[i-2]*K) % MOD;
}
cout << A[N] << endl;
}
int main ()
{
#ifdef _TC
int T = _TC;
#else
int T = 1;
#endif
while (T--) {
solveCase();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |