제출 #19863

#제출 시각아이디문제언어결과실행 시간메모리
19863joojis괄호 (kriii4_R)C++14
0 / 100
4 ms4084 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...