백준 9625 BABBA

다이나믹 프로그래밍 문제

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int K;
int dpA[46];
int dpB[46];

void input(){
  cin >> K;

}

void solve(){
  dpA[0] = 1;
  dpB[0] = 0;
  for(int i = 1; i <= K; i++){
    dpA[i] = dpB[i-1];
    dpB[i] = dpA[i-1] + dpB[i-1];
  }
  cout << dpA[K] << " " << dpB[K];
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  input();
  solve();
  
  return 0;
}