얄루의 개발일기🥑

def solution(n): answer = 0 while n >1: if n % 2 == 0: n = n//2 answer += 1 else: n = (n*3)+1 answer += 1 if answer > 500: return -1 else: return answer

def solution(arr): answer = 0 answer = sum(arr)/len(arr) return answer

import sys from collections import deque input = sys.stdin.readline n =int(input()) queue = deque() for i in range(n): queue.append(i+1) while len(queue)>1: queue.popleft() queue.append(queue.popleft()) print(queue.pop()) #2개 남았을 때 마지막(맨 오른쪽 요소)을 출력해주면 된다.

import sys n = int(input()) a = list(map(int, sys.stdin.readline().split())) answer = [-1] * n stack = [] stack.append(0) for i in range(1, n): while stack and a[stack[-1]] < a[i]: answer[stack.pop()] = a[i] stack.append(i) print(*answer)

n = int(input()) stack = [] result = [] check = True cur = 1 for i in range(n): num = int(input()) while cur

c1 = c2 = 0 while True: s = input() if s == ".": break for i in s: if i == '(': c1 += 1 elif i == ')': c1 -= 1 elif i == '[': c2 += 1 elif i == ']': c2 -= 1 if c1 0: print("no") while True: s = input() #종료조건 if s == '.': break stack = [] check = True for i in s: if i == '(' or i == '[': stack.append(i) elif i == ')': if not stack or stack[-1] == '[': check = False break elif..

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 sys.setrecursionlimit(10**6) import heapq n, m = map(int, input().split()) start = int(input()) INF = int(1e9) graph = [[] * (n+1) for _ in range(n+1)] distance = [INF] * (n+1) for _ in range(m): u, v, w = map(int, input().split()) # u에서 v로 가는 거리가 w라는 의미 graph[u].append((v, w)) def dijkstra(start): q = [] heapq.heappush(q, (0, start)) distance[start] = 0 whi..

from collections import deque m,n = map(int,input().split()) graph = [] queue = deque([]) for i in range(n): graph.append(list(map(int,input().split()))) for j in range(m): if graph[i][j]==1: queue.append([i,j]) dx = [0,0,-1,1] dy = [-1,1,0,0] def bfs(): while queue: x,y = queue.popleft() for i in range(4): nx = x+dx[i] ny = y+dy[i] if 0

import sys input = sys.stdin.readline def push(x): return queue.append(x) def pop(): if len(queue) > 0: return queue.pop(0) return -1 def size(): return len(queue) def empty(): if len(queue) > 0: return 0 return 1 def front(): if len(queue) > 0: return queue[0] return -1 def back(): if len(queue) > 0: return queue[-1] return -1 n = int(input()) queue = [] for _ in range(n): command = input().spl..