SSENI's

# String 클래스 메서드 # HashMap 메서드 1) 문자열 압축 - java import java.io.*; import java.util.*; public class Main { public String solution(String s){ String ans = ""; s += " "; int cnt = 1; for(int i=0; i 1) ans += String.valueOf(cnt); cnt = 1; } } return ans; } public static void main(String[] args) throw..

L = int(input()) L_list = [0] + sorted(list(map(int,input().split()))) N = int(input()) start = 0 if N in L_list: print(0) else: for i in L_list: if N > i: start = i + 1 else: end = i - 1 break print(end - start + (end - N) * (N - start))

n, m = map(int, input().split()) m_list = [] for _ in range(n): m_list.append(input()) n_min = 64 for i in range(n - 7): for j in range(m - 7): cnt1 = 0 cnt2 = 0 for k in range(i, i + 8): for s in range(j, j + 8): if k % 2 == 0 and s % 2 == 0: if m_list[k][s] == 'B': cnt1 += 1 elif k % 2 == 1 and s % 2 == 1: if m_list[k][s] == 'B': cnt1 += 1 elif k % 2 == 0 and s % 2 == 1: if m_list[k][s] == 'W'..

import sys from collections import deque limit = 100001 def solve(arr, n, k): q = deque() q.append(n) while q: i = q.popleft() if i == k: return arr[i] for j in (i+1, i-1, 2*i): if (0

import sys t = int(sys.stdin.readline()) dr = [1, -1, 0, 0] dc = [0, 0, -1, 1] for i in range(t): m, n, k = map(int, sys.stdin.readline().split()) cabbage = [[0] * m for cb in range(n)] cnt = 0 for j in range(k): c, r = map(int, sys.stdin.readline().split()) cabbage[r][c] = 1 for q in range(n): for w in range(m): if cabbage[q][w] == 1: queue = [[q, w]] while queue: fr, fc = queue[0][0], queue[0]..

""" #원소 추가 n = 3 print(bin(0b0010 | (1

import sys from collections import defaultdict n, m, b = map(int, sys.stdin.readline().split()) dic = defaultdict(int) # default값이 int인 딕셔너리 for i in range(n): for j in list(map(int, input().split())): dic[j] += 1 print(dic) key = list(dic.keys()) bot = min(key) top = max(key) cnt = int(1e9) h = 0 for x in range(bot, top+1): count, have = 0, b for y in dic.keys(): if x > y: count += (x - y) * di..

import sys n = int(sys.stdin.readline()) arr = [int(sys.stdin.readline()) for _ in range(n)] negative = [] positive = [] ans = 0 for a in arr: if a 1: positive.append(a) negative.sort() positive.sort(reverse=True) for i in range(0,len(negative), 2): if i+1 < len(negative): ans += negative[i] * negative[i+1] else: ans += negative[i] for i in range(0,len(positive), 2): if i+1 < len(positive): ans ..

N = int(input()) f = 1 for i in range(1, N+1): f *= i f %= 1000000000000 while f % 10 == 0: f /= 10 print(int(f % 10))

def f(floor, num): flr = [i for i in range(1, num+1)] for i in range(floor): for j in range(1, num): flr[j] += flr[j-1] return flr[-1] t = int(input()) for _ in range(t): floor = int(input()) num = int(input()) print(f(floor, num))

import sys from collections import Counter n = int(sys.stdin.readline()) arr = [int(sys.stdin.readline()) for _ in range(n)] def mean(num): return round(sum(num)/len(num)) def median(num): num.sort() return num[len(num)//2] def mode(num): mode_dict = Counter(num) # 딕셔너리로 데이터 등장 횟수 저장 m = mode_dict.most_common() # 등장한 횟수를 내림차순으로 정리 if len(num) > 1: if m[0][1] == m[1][1]: mod = m[1][0] else: mod =..

import sys def prime(num): if num == 1: return False elif num == 2: return True for i in range(2, int(num**0.5)+1): if num % i == 0: return False return True m, n = map(int, sys.stdin.readline().split()) s = '' for i in range(m, n+1): if prime(i): s += (str(i) + '\n') print(s)

import sys k, n = map(int, sys.stdin.readline().split()) lan = [int(sys.stdin.readline()) for _ in range(k)] start, end = 1, max(lan) while start = n: start = mid + 1 else: end = mid - 1 print(end)

n, k = map(int, input().split()) p = list(range(1, n+1)) ans = [] i = k-1 while len(ans) < n-1: ans.append(p.pop(i)) i = (i + k-1) % len(p) ans.append(p[0]) print('')

import sys from collections import deque n = int(sys.stdin.readline()) q = deque() for i in range(n): q.append(i + 1) while len(q) > 1: q.popleft() q.append(q.popleft()) print(q.pop())

import sys from collections import deque n = int(sys.stdin.readline()) dq = deque() for i in range(n): cmd = list(sys.stdin.readline().split()) if cmd[0] == 'push_front': dq.appendleft(cmd[1]) elif cmd[0] == 'push_back': dq.append(cmd[1]) elif cmd[0] == "pop_front": if len(dq) == 0: print('-1') else: print(dq.popleft()) elif cmd[0] == "pop_back": if len(dq) == 0: print('-1') else: print(dq.pop()..

n = int(input()) arr = list(map(int, input().split())) def prime(num): if num == 1: return False elif num == 2: return True for i in range(2, num): if num % i == 0: return False return True cnt = 0 for a in arr: if prime(a): cnt += 1 print(cnt)

from sys import stdin, stdout n = int(stdin.readline()) arr1 = list(map(int, input().split())) arr1.sort() m = int(sys.stdin.readline()) arr2 = list(map(int, input().split())) for i in arr2: start = 0 end = n-1 target = i ans = 0 while start

import sys n = int(sys.stdin.readline()) stack = list() for i in range(n): cmd = sys.stdin.readline().split() if cmd[0] == 'push': stack.append(cmd[1]) elif cmd[0] == 'pop': if not stack: print('-1') else: print(stack.pop()) elif cmd[0] == 'size': print(len(stack)) elif cmd[0] == 'empty': if not stack: print('1') else: print('0') elif cmd[0] == 'top': if not stack: print('-1') else: print(stack[..

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')