파이톨치

n, l, d = map(int, input().split()) # 5초 동안 쉰다. # 1초 동안 울린다. t = 0 b = 0 for i in range(n): t += l while b < t: b += d if t

a, b = map(int, input().split()) if a < b: print("") else: print("==")

import math a_x, a_y, b_x, b_y, c_x, c_y = map(int, input().split()) if a_x-b_x != 0: a1 = (a_y-b_y) / (a_x-b_x) else: a1 = 9999 if b_x-c_x != 0: a2 = (b_y-c_y) / (b_x-c_x) else: a2 = 9999 if a1 == a2: print(-1.0) else: x1 = (a_x-b_x) ** 2 y1 = (a_y-b_y) ** 2 l1 = math.sqrt(x1+y1) x2 = (b_x-c_x) ** 2 y2 = (b_y-c_y) ** 2 l2 = math.sqrt(x2+y2) x3 = (a_x-c_x) ** 2 y3 = (a_y-c_y) ** 2 l3 = math.sqrt..

s1, s2 = input().split() l1 = len(s1) l2 = len(s2) def same(s1, s2): cnt = 0 for i in range(len(s1)): if s1[i] == s2[i]: cnt += 1 return cnt if len(s1) == len(s2): print(len(s1) - same(s1, s2)) else: if l1 < l2: idx = 0 max = 0 for i in range(l2-l1+1): if max

n = int(input()) d = [0, 1, 2, 3, 4, -1, -2, -3, -4] cnt = 0 for i in range(1, n+1): s = str(i) if i

n = int(input()) l = [] for i in range(n): l.append(input()) s = "" for i in range(len(l[0])): a = l[0][i] # print(a) t = 0 for j in range(n): if a != l[j][i]: t = 1 if t == 0: s += a else: s += "?" print(s)

n, m = map(int, input().split()) s = [] k = [] for i in range(m): a, b = map(int, input().split()) s.append(a) k.append(b) best1 = min(s) best2 = min(k) best = min([best1, best2*6]) cost = 0 while n >= 6: cost += best n -= 6 if best < n*best2: cost += best else: cost += n*best2 print(cost)

# 라운드는 2의 배수 import math n, a, b = map(int, input().split()) k = math.ceil(math.log(n, 2)) n = 0 a-=1; b-=1 while a != b: a //= 2 b //= 2 n += 1 print(n)