-
[B9012][괄호][python]
2021.03.16
n = int(input()) for i in range(n): sentence = list(input()) cnt = 0 for s in sentence: if s == '(': cnt += 1 elif s == ')': cnt -= 1 if cnt 0: print('NO') elif cnt == 0: print('YES')
-
[B10816][숫자 카드 2][python]
2021.03.15
n = int(input()) card = list(map(int, input().split())) m = int(input()) have = list(map(int, input().split())) dic = dict() for c in card: if c not in dic: dic[c] = 1 else: dic[c] += 1 for h in have: if h in dic: print(str(dic[h]), end = " ") else: print("0", end = " ")
-
[B11650][좌표 정렬하기][python]
2021.03.14
n = int(input()) arr = [] for i in range(n): x, y = map(int, input().split()) arr.append([x, y]) arr.sort() for i in range(n): print(arr[i][0], arr[i][1])
-
[B15489][파스칼 삼각형][python]
2021.03.14
r,c,w = map(int, input().split()) dp = [[0 for col in range(50)] for row in range(50)] dp[1][1] = 1 for i in range(0,31): for j in range(0,i+1): if j==1 | j==i: dp[i][j] = 1 else: dp[i][j] = dp[i-1][j-1]+dp[i-1][j] ans = 0 for i in range(w): for j in range(i+1): ans += dp[r+i][c+j] print(ans)
-
[B2609][최대공약수와 최소공배수][python]
2021.03.12
from math import gcd def lcm(x, y): return x * y // gcd(x, y) n, m = map(int, input().split()) print(gcd(n, m)) print(lcm(n, m))
-
[B11050][이항 계수 1][python]
2021.03.12
from math import factorial n, m = map(int, input().split()) print(factorial(n) // (factorial(n-m) * factorial(m)))
-
[B1259][팰린드롬수][python]
2021.03.12
while True: n = input() if n == '0': break word = n[::-1] if n == word: print("yes") else: print("no")
-
[B1700][멀티탭 스케줄링][python]
2021.03.12
n, k = map(int, input().split()) s = list(map(int, input().split())) multi = [0 for i in range(n)] cnt = 0 for i in range(k): noEmpty = False for j in range(n): if multi[j] == s[i] or multi[j] == 0: noEmpty = True multi[j] = s[i] break if noEmpty: continue else: a = 0 for j in range(n): if try: if a < s[i + 1:].index(multi[j]): a = s[i + 1:].index(multi[j]) b = j except: a = -1 b = j break multi..
-
[B1181][단어 정렬][python]
2021.03.10
n = int(input()) arr = [input() for _ in range(n)] arr_idx = [len(arr[i]) for i in range(n)] max_idx = max(arr_idx) + 1 ans = [] cnt = 1 while cnt != max_idx: L = [] for i in arr: if len(i) == cnt: L.append(i) if len(L) == 1: ans.append(L[0]) else: L.sort() for l in L: ans.append(l) cnt += 1 ans1 = [] for v in ans: if v not in ans1: ans1.append(v) for a in ans1: print(a)
-
[B3052][나머지][python]
2021.03.10
arr = [int(input()) % 42 for _ in range(10)] n = [] for i in range(len(arr)): if arr[i] not in n: n.append(arr[i]) print(len(n))
-
[B2908][상수][python]
2021.03.10
n, m = map(str, input().split()) n, m = int(n[::-1]), int(m[::-1]) # 문자열 reverse print(max(m, n))
-
-
[B2475][검증수][python]
2021.03.10
arr = list(map(int, input().split())) add = [pow(i,2) for i in arr] print(sum(add) % 10)
-
[B1037][약수][python]
2021.03.09
n = int(input()) L = [1] L += list(map(int, input().split())) L.sort() if (len(L)+1)%2 == 0: idx = (len(L)+1)//2 print(L[idx - 1] * L[idx]) else: idx = (len(L)+1)//2 + 1 print(L[idx - 1] * L[idx - 1])
-
[B1010][다리 놓기][python]
2021.03.09
import math t=int(input()) arr=[] for i in range(t): n,m=input().split() n,m=int(n),int(m) answer=math.factorial(m)//math.factorial(n)//math.factorial(m-n) print(answer)
-
[B1009][분산처리][python]
2021.03.05
import sys data_cnt = int(sys.stdin.readline()) for _ in range(data_cnt): a, b = map(int, sys.stdin.readline().split()) result = [(a ** i) % 10 for i in range(1,5)][(b % 4) -1] print(result if result != 0 else 10)
-
[B11943][파일 옮기기][python]
2021.03.05
n1, m1 = map(int, input().split()) n2, m2 = map(int, input().split()) print(min(n1 + m2, n2 + m1))
-
[B2588][곱셈][python]
2021.03.05
n = int(input()) m = int(input()) m1 = m // 100 m2 = (m // 10) % 10 m3 = m % 10 print(n * m3, n * m2, n * m1, (n * m3) + (n * m2 * 10) + (n * m1 * 100))
-
[B2530][인공지능 시계][python]
2021.03.05
a,b,c = map(int, input().split()) x = int(input()) a += (x // 60) // 60 b += (x // 60) % 60 c += x % 60 if c >= 60: c %= 60 b += 1 if b >= 60: b %= 60 a += 1 if a >= 24: a %= 24 print(a,b,c)
-
[B2525][오븐 시계][python]
2021.03.05
h, m = map(int, input().split()) x = int(input()) h += x // 60 m += x % 60 if m >= 60: m %= 60 h += 1 if h >= 24: h %= 24 print(h, m)
