백준 1904번 C++

#include <iostream>

using namespace std;

const int MAX = 1000001;

const int MOD = 15746;

int n;

int waycount[MAX];

int calway() {

waycount[1] = 1;

waycount[2] = 2;

for (int i = 3; i <= n; i++) {

waycount[i] = (waycount[i - 2] + waycount[i - 1]) % MOD;

}

return waycount[n];

}

int main(void) {

cin >> n;

cout << calway();

return 0;

}