Merge branch 'main' into 31-yuna83

Munbin-Lee/README.md

@@ -35,4 +35,6 @@
 | 32차시 | 2024.01.30 |  백트래킹  | <a href="https://www.acmicpc.net/problem/17114">하이퍼 토마토</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/124 |
 | 33차시 | 2024.02.04 |  정수론  | <a href="https://www.acmicpc.net/problem/14905">소수 4개의 합</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/128 |
 | 34차시 | 2024.02.06 |  구현  | <a href="https://www.acmicpc.net/problem/1756">피자 굽기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/133 |
+| 35차시 | 2024.02.18 |  백트래킹  | <a href="https://www.acmicpc.net/problem/24891">단어 마방진</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/140 |
+| 36차시 | 2024.02.21 |  문자열  | <a href="https://www.acmicpc.net/problem/15927">회문은 회문아니야!!</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/143 |
 ---

Munbin-Lee/문자열/36-회문은 회문아니야!!.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <unordered_set>
+
+using namespace std;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    string s;
+    cin >> s;
+
+    if (unordered_set<char>(s.begin(), s.end()).size() == 1) {
+        cout << "-1";
+        return 0;
+    }
+
+    auto isPalindrome = [](string &s) {
+        int lo = 0;
+        int hi = s.size() - 1; // NOLINT
+
+        while (lo < hi) {
+            if (s[lo] != s[hi]) return false;
+            lo++;
+            hi--;
+        }
+
+        return true;
+    };
+
+    if (!isPalindrome(s)) {
+        cout << s.size();
+        return 0;
+    }
+
+    cout << s.size() - 1;
+
+    return 0;
+}

Munbin-Lee/백트래킹/35-단어 마방진.py

@@ -0,0 +1,22 @@
+from itertools import permutations
+
+stdin = open(0)
+
+L, N = map(int, stdin.readline().split())
+words = sorted(stdin.read().splitlines())
+
+# 단어 순열 x가 단어 마방진인지 확인하는 함수
+def isValid(x):
+    for i in range(L):
+        for j in range(L):
+            if x[i][j] != x[j][i]: return False
+
+    return True
+
+for perm in permutations(words, L):
+    if not isValid(perm): continue
+
+    print(*perm, sep='\n')
+    exit()
+
+print('NONE')

tgyuuAn/DP/앱.py

@@ -0,0 +1,16 @@
+total_app_count, need_memory = map(int,input().split())
+
+use_memory = list(map(int,input().split()))
+re_use_cost = list(map(int,input().split()))
+
+dp_table = [0 for _ in range(sum(re_use_cost)+1)]
+cost_sum = sum(re_use_cost)
+
+for memory, cost in zip(use_memory, re_use_cost):
+    for idx in range(cost_sum,cost-1,-1):
+        dp_table[idx] = max(dp_table[idx], dp_table[idx-cost] + memory)
+
+for idx, memory in enumerate(dp_table):
+    if memory >= need_memory: 
+        print(idx)
+        break

tgyuuAn/DP/입대.py

@@ -0,0 +1,30 @@
+import sys
+
+remain_days, need_score = map(int,sys.stdin.readline().split())
+volunteer_scores = [0]
+volunteer_scores.extend(list(map(int,sys.stdin.readline().split())))
+
+blood_donation_score, blood_donation_break_time = map(int,sys.stdin.readline().split())
+
+volunteer_scores.extend([0 for _ in range(blood_donation_break_time-1)])
+maximum_blood_donation_count = (len(volunteer_scores)+blood_donation_break_time-1)//blood_donation_break_time+1
+
+dp_table = [[0 for _ in range(maximum_blood_donation_count)] for _ in range(len(volunteer_scores))]
+
+for date in range(len(volunteer_scores)):
+    if date >= blood_donation_break_time:
+        for blood_donation_count in range(1,maximum_blood_donation_count):
+            dp_table[date][blood_donation_count] = max(dp_table[date][blood_donation_count],
+                                                       dp_table[date-1][blood_donation_count] + volunteer_scores[date],
+                                                       dp_table[date-blood_donation_break_time][blood_donation_count-1] + blood_donation_score)
+
+    dp_table[date][0] = dp_table[date-1][0] + volunteer_scores[date]
+
+print(dp_table)
+
+for count in range(len(dp_table[-1])):
+    if dp_table[-1][count] >= need_score:
+        print(count)
+        break
+
+else: print(-1)

tgyuuAn/DP/피보나치 수 3.py

@@ -0,0 +1,16 @@
+target = int(input())
+
+M = 1_000_000
+period = 1_500_000
+
+target %= period
+
+dp_table = [0 for _ in range(3)]
+dp_table[0] = 0
+dp_table[1] = 1
+
+for idx in range(2,target+1):
+    idx %= 3
+    dp_table[idx] = dp_table[idx-1] % M + dp_table[idx-2] % M
+
+print(dp_table[target%3]%M)

tgyuuAn/README.md

@@ -39,4 +39,7 @@
 | 35차시 | 2023.01.25 |  이분 탐색  | <a href="https://www.acmicpc.net/problem/2110">공유기 설치</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/120
 | 36차시 | 2023.02.04 |  BFS  | <a href="https://www.acmicpc.net/problem/4991">로봇 청소기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/126
 | 37차시 | 2023.02.04 |  BFS  | <a href="https://www.acmicpc.net/problem/1039">교환</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/131
+| 38차시 | 2023.02.15 |  DP  | <a href="https://www.acmicpc.net/problem/2749">피보나치 수 3</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/137
+| 39차시 | 2023.02.18 |  DP  | <a href="https://www.acmicpc.net/problem/7579">앱</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/139
+| 40차시 | 2023.02.21 |  DP  | <a href="https://www.acmicpc.net/problem/31413">입대</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/142
 ---

yuna83/슬라이딩윈도우/블로그.py

@@ -0,0 +1,26 @@
+import sys
+input=sys.stdin.readline
+
+n,x=map(int,input().split())
+data=list(map(int,input().split()))
+
+if max(data) == 0:
+    print("SAD")
+else:
+    value = sum(data[:x])  # x개씩 윈도우 생성
+    max_value=value
+    max_cnt=1
+
+    for i in range(x,n):
+        value+=data[i]
+        value-=data[i-x]
+
+        if value > max_value:
+            max_value=value
+            max_cnt =1
+
+        elif value == max_value:
+            max_cnt+=1
+
+    print(max_value)
+    print(max_cnt)