Merge pull request #529 from kingjinyong/main

[김진용] 65차 라이브 코테 제출

Author: github-actions[bot]

live6/test65/문제1/김진용.py

@@ -0,0 +1,41 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+ary = []
+for _ in range(n):
+    ary.append(list(input()))
+# print(ary)
+def check(a):
+    mcnt = 1
+    for i in range(n):
+        cnt = 1
+        for j in range(1, n):
+            if a[i][j-1] == a[i][j]:
+                cnt += 1
+            else:
+                cnt = 1
+            mcnt = max(mcnt, cnt)
+
+        cnt = 1
+        for j in range(1, n):
+            if a[j-1][i] == a[j][i]:
+                cnt += 1
+            else:
+                cnt = 1
+            mcnt = max(mcnt, cnt)
+
+    return mcnt
+m = 0
+for i in range(n):
+    for j in range(n):
+        if i + 1 < n:
+            ary[i][j], ary[i+1][j] = ary[i+1][j], ary[i][j]
+            m = max(m, check(ary))
+            ary[i][j], ary[i+1][j] = ary[i+1][j], ary[i][j]
+        if j + 1 < n:
+            ary[i][j], ary[i][j+1] = ary[i][j+1], ary[i][j]
+            m = max(m, check(ary))
+            ary[i][j], ary[i][j+1] = ary[i][j+1], ary[i][j]
+
+print(m)

live6/test65/문제2/김진용.py

@@ -0,0 +1,15 @@
+n = int(input())
+
+ary = []
+
+for _ in range(n):
+    a, b = map(int, input().split())
+    ary.append([a, b])
+
+dp = [0]*(n+1)
+
+for i in range(n):
+    for j in range(i+ary[i][0], n+1):
+        if dp[j] < dp[i] + ary[i][1]:
+            dp[j] = dp[i] + ary[i][1]
+print(dp[-1])

live6/test65/문제3/김진용.py

@@ -0,0 +1,16 @@
+def solution(s):
+    answer = 0
+    s = list(s)
+    stack = []
+    for i in s:
+        if len(stack) == 0:
+            stack.append(i)
+        elif i == stack[-1]:
+            stack.pop()
+        else:
+            stack.append(i)
+
+    if len(stack) == 0:
+        answer = 1
+
+    return answer