[BAEKJOON] 1904 01타일

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <vector> using namespace std;   vector<long long>DP(1000001,-1);   long long fibo(int n) {     long long &ret = DP[n];     if (ret != -1) return ret;       return ret = (fibo(n - 1) + fibo(n - 2))%15746; }   int main() {     int n;     scanf("%d", &n);       DP[1] = 1;     DP[2] = 2;       printf("%lld", fibo(n)% 15746);     return 0; }

문제를 제대로 읽자!