2024-02-15

miniron-v/DP/1793-타일링.cpp

@@ -0,0 +1,55 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+// 문자열 덧셈
+std::string string_add(std::string a, std::string b) {
+	std::reverse(a.begin(), a.end());
+	std::reverse(b.begin(), b.end());
+
+	// a > b, always.
+	if (a.size() < b.size()) {
+		std::swap(a, b);
+	}
+
+	else if (a.size() == b.size()) {
+		a += '0';
+	}
+
+	int i = 0, carry = 0;
+	std::string sum = "";
+	for (; i < b.size(); ++i) {
+		int num = (a[i] - '0') + (b[i] - '0') + carry;
+		sum.push_back(num % 10 + '0');
+		carry = num / 10;
+	}
+
+	a[i] += carry;
+
+	// a가 남은 경우
+	while (i < a.size()) {
+		sum += a[i++];
+	}
+
+	if (sum[--i] == '0') {
+		sum.pop_back();
+	}
+
+	std::reverse(sum.begin(), sum.end());
+
+	return sum;
+}
+
+int main() {
+	int n;
+	while (std::cin >> n) {
+		std::vector<std::string> dp(n + 1, "1");
+
+		for (int i = 2; i <= n; ++i) {
+			dp[i] = string_add(dp[i - 1], dp[i - 2]);
+			dp[i] = string_add(dp[i], dp[i - 2]);
+		}
+
+		std::cout << dp[n] << " ";
+	}
+}

miniron-v/README.md

@@ -17,4 +17,5 @@
 | 12차시 | 2024.02.03 |  DP  | [점프 점프](https://www.acmicpc.net/problem/11060)  | [#48](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/48) |
 | 13차시 | 2024.02.06 |  DP  | [퇴사 2](https://www.acmicpc.net/problem/15486)  | [#50](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/50) |
 | 14차시 | 2024.02.11 |  그래프, DP  | [ACM Craft](https://www.acmicpc.net/problem/1005)  | [#53](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/53) |
+| 15차시 | 2024.02.15 |  DP, 큰 수 연산  | [타일링](https://www.acmicpc.net/problem/1793)  | [#56](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/56) |
 ---