Merge pull request #11 from AlgoLeadMe/3-rivkms

3-rivkms

rivkms/DP/10844.cpp

@@ -0,0 +1,37 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+vector<vector<int>> vec(101,vector<int> (10,0));
+
+int func(const int & n, const int & a){
+    if(vec[n][a]){
+        return vec[n][a];
+    }
+    else if(a==0){
+        return vec[n][a] = func(n-1, 1)%1000000000;
+    }
+    else if(a==9){
+        return vec[n][a] = func(n-1, 8)%1000000000;
+    }
+    return vec[n][a] = ((func(n-1, a-1)) + (func(n-1, a+1)))%1000000000;
+}
+
+int main(){
+    int n, sum = 0;
+    cin >> n;
+
+
+    for(int i = 0 ;i<=9; i++){
+        vec[1][i] = 1;
+    }
+
+    for(int i = 1; i<=9; i++){
+        sum+=func(n ,i);
+        sum%=1000000000;
+    }
+    cout << sum;
+    return 0;
+}

rivkms/README.md

@@ -4,4 +4,5 @@
 |:----:|:---------:|:----:|:-----:|:----:|
 | 1차시 | 2024.02.12 |  DP  | [평범한 배낭](https://www.acmicpc.net/problem/12865)  | [#1](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/5) |
 | 2차시 | 2024.02.15 |  Recursion  | [하노이 탑 이동 순서](https://www.acmicpc.net/problem/11729)  | [#2](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/8) |
+| 3차시 | 2024.02.18 |  DP  | [하노이 탑 이동 순서](https://www.acmicpc.net/problem/10844)  | [#2](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/11) |
 ---