algorithm'''problem solve
[백준] 11726 - 2xn타일링(설명X)
JunHwa Park
2020. 4. 9. 11:43
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | #include <iostream> using namespace std; int main() { int n; cin >> n; int** arr = new int*[n + 1]; for (int i = 1; i <= n; i++) arr[i] = new int[2]{ 0, }; arr[1][0] = 1; for (int i = 1; i < n; i++) { arr[i + 1][0] = (arr[i][0] + arr[i][1]) % 10007; arr[i + 1][1] = arr[i][0] % 10007; } cout << (arr[n][0] + arr[n][1]) % 10007 << endl; } | cs |