Merge pull request #83 from learntosurf/main

Learntosurf / 11월 1주차 / 7문제

Author: Mingguriguri

.DS_Store

@@ -0,0 +1 @@
+{"name":"Local: 2024-11-07-[BOJ]-#14717-앉았다","url":"/Users/learntosurf/Desktop/codingtest_algorithm_study/learntosurf/BruteForce/2024-11-07-[BOJ]-#14717-앉았다.py","tests":[],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/learntosurf/Desktop/codingtest_algorithm_study/learntosurf/BruteForce/2024-11-07-[BOJ]-#14717-앉았다.py","group":"local","local":true}

learntosurf/.DS_Store

@@ -0,0 +1,9 @@
+N = int(input())
+
+for i in range(1, N+1):
+    answer = i + sum((map(int, str(i))))
+    if answer == N: 
+        print(i)
+        break 
+    if i == N: # 생성자가 없는 경우 
+        print(0)

learntosurf/BruteForce/.cph/.2024-11-07-[BOJ]-#14717-앉았다.py_0bd4b78fdcfce942f4b0309901ad2256.prob

@@ -0,0 +1,12 @@
+import sys 
+input = sys.stdin.readline 
+
+heights = [int(input()) for _ in range(9)]
+
+for i in range(9):
+    for j in range(i + 1, 9):
+        if sum(heights) - heights[i] - heights[j] == 100:
+            result = [heights[k] for k in range(9) if k != i and k != j]
+            result.sort()  
+            print(*result, sep='\n')
+            exit()

learntosurf/BruteForce/2024-11-04-[BOJ]-#2231-분해합.py

@@ -0,0 +1,12 @@
+Tn = [i * (i+1) // 2 for i in range(1, 46)] 
+eureka = [0] * 10001
+
+for i in range(Tn):
+    for j in range(Tn):
+        for k in range(Tn):
+            if i+j+k <= 1000:
+                eureka[i+j+k] = 1
+
+T = int(input())
+for _ in range(T):
+    print(eureka[int(input())])

learntosurf/BruteForce/2024-11-05-[BOJ]-#2309-일곱난쟁이.py

@@ -0,0 +1,52 @@
+## 틀린 풀이 ## 
+
+from itertools import combinations
+from math import comb
+
+cards = [i for i in range(1, 11)] * 2 # 20장의 카드 리스트 구성 (1~10 2장씩)
+
+def judge(card1, card2):
+    # 땡: 두 카드가 같을 경우 
+    if card1 == card2:
+        return f"{card1}땡"
+    
+    # 끗: 땡이 아닐 경우 두 카드의 합을 10으로 나눈 나머지 
+    else: 
+        sum_value = (card1 + card2) % 10 
+        return f"{sum_value}끗"
+
+# 족보 우선순위 설정 (높은 족보일수록 더 높은 값)
+rank_order = {f"{i}땡": 10-i for i in range(1, 11)}
+rank_order.update({f"{i}끗": -i for i in range(10)})  # 끗 족보는 숫자가 클수록 강하지만 땡보다는 약함
+                                                     # 끗 족보에는 음수를 사용해 낮은 값을 할당하여, 땡 족보보다 낮은 순위로 설정
+
+def win_probability(y_card1, y_card2):
+    win_count = 0 
+    total_count = 0
+    
+    y_rank = rank_order[judge(y_card1, y_card2)] # 영학이의 족보
+    
+    # 상대방이 2장을 뽑는 모든 경우의 수 
+    for opp_card1, opp_card2 in combinations(cards, 2):
+        
+        remaining_cards = cards.copy()
+        remaining_cards.remove(opp_card1)
+        remaining_cards.remove(opp_card2)
+        
+        opp_rank = rank_order[judge(opp_card1, opp_card2)] # 상대방의 족보
+        
+        total_count += 1
+        
+        if y_rank > opp_rank: # 영학이가 이기는 경우의 수 
+            win_count += 1
+        
+    probability = win_count / total_count
+    return f"{probability:.3f}" # 소수점 셋째 자리까지 출력
+
+y_card1, y_card2 = map(int, input().split())
+print(win_probability(y_card1, y_card2))
+
+# print(win_probability(1, 1)) # 0.941
+# print(win_probability(1, 2)) # 0.275
+# print(win_probability(1, 9)) # 0.000
+# print(win_probability(10, 10)) # 1.000

learntosurf/BruteForce/2024-11-06-[BOJ]-#10448-유레카이론.py

@@ -0,0 +1,26 @@
+m, n = map(int, input().split())
+plate = []
+count = []
+
+for _ in range(m):
+    plate.append(input())
+
+for a in range(m-7):
+    for b in range(n-7):
+        W = 0
+        B = 0
+        for i in range(a, a+8):
+            for j in range(b, b+8):
+                if (i+j) % 2 == 0:
+                    if plate[i][j] != 'W':
+                        W += 1
+                    if plate[i][j] != 'B':
+                        B += 1
+                else:
+                    if plate[i][j] != 'B':
+                        W += 1
+                    if plate[i][j] != 'W':
+                        B += 1
+        count.append(min(W, B))
+
+print(min(count))

learntosurf/BruteForce/2024-11-07-[BOJ]-#14717-앉았다.py

@@ -0,0 +1,12 @@
+N, M = map(int, input().split())
+
+rect = [[input() for _ in range(M)] for _ in range(N)]
+square = []
+for k in range(1, min(N, M)):
+    for i in range(N):
+        for j in range(M):
+            if rect[i][j] == rect[i][j+k] == rect[i+k][j] == rect[i+k][j+k]:
+                square.append((k+1)**2)
+                exit()
+
+print(max(square))