1주차 - 숫자 정사각형(1051)

Hyunwoo/1051_숫자 정사각형.py

@@ -0,0 +1,31 @@
+def find_Max(s):
+
+    for x in range(N):
+        for y in range(M):
+
+            if x + i >= N:
+                continue
+
+            elif y + i >= M:
+                continue
+
+            if arr[x][y] == arr[x+i][y] and arr[x][y] == arr[x][y+i] and arr[x][y] == arr[x+i][y+i]:
+                return (i+1) ** 2
+
+    return -1
+
+
+N,M = map(int, input().split())
+arr = []
+
+for i in range(N):
+    arr.append(list(map(int, input())))
+
+s = min(N,M)
+
+for i in range(s-1,-1,-1):
+    t = find_Max(i)
+
+    if t != -1:
+        print(t)
+        break

Hyunwoo/4796_캠핑.py

@@ -0,0 +1,21 @@
+ct = 1
+
+while True:
+
+    L,P,V = map(int, input().split())
+
+    if L == 0 and P == 0 and V == 0:
+        break
+
+    ans = L * (V // P)
+
+    if V % P <= L:
+        ans += V % P
+
+    else:
+        ans += L
+
+    a = f'Case {ct}: {ans}'
+    print(a)
+
+    ct += 1