얄루의 개발일기🥑

n = int(input()) for i in range(n): num = n-i print("*"*num)

a = int(input()) b = int(input()) print(a+b)

abc = list(map(int,input().split())) abc.sort() print(abc[1])

def solution(n, computers): def dfs(x,y): if 0

import sys sys.setrecursionlimit(5000000) def dfs(x, y): if 0

import sys input = sys.stdin.readline n = int(input().rstrip()) m = int(input().rstrip()) graph = [[] for _ in range(n + 1)] for i in range(m): node1, node2 = map(int, input().split()) graph[node1].append(node2) graph[node2].append(node1) def dfs(): visited = [] stack = [graph[1]] cnt = 0 while stack: num = stack.pop() print(num) for i in num: if not i in visited: visited.append(i) stack.append(..

a = int(input()) for i in range(a): b = input() s = list(b) sum = 0 for i in s: if i == '(': sum += 1 elif i == ')': sum -= 1 if sum 0: print('NO') elif sum == 0: print('YES')

import sys input = sys.stdin.readline n = int(input()) stack = [] for _ in range(n): num = int(input()) if num == 0: stack.pop() else: stack.append(num) print(sum(stack))

#스택 import sys input = sys.stdin.readline def pushx(x): return stack.append(x) def popx(): if len(stack) == 0: return -1 else: return stack.pop() def sizex(): return len(stack) def emptyx(): if len(stack) == 0: return 1 else: return 0 def topx(): if len(stack) == 0: return -1 else: return stack[-1] n = int(input()) stack = [] for i in range(n): s = input().split() operator = s[0] if operator == ..

def solution(progresses, speeds): answer = [] time = 0 cnt = 0 while len(progresses)>0: if progresses[0] + (speeds[0]*time) >= 100: progresses.pop(0) speeds.pop(0) cnt += 1 else: if cnt > 0: answer.append(cnt) cnt = 0 time += 1 answer.append(cnt) return answer