얄루의 개발일기🥑

from collections import deque import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n, m = map(int,input().split()) q = deque(list(map(int,input().split()))) cnt = 0 while q: maxQ = max(q) front = q.popleft() m -= 1 if maxQ == front: cnt += 1 if m < 0 : print(cnt) break else: q.append(front) if m < 0 : m = len(q) - 1 # m이 0보다 작아지는 경우는 그 위치만큼 q를 돌려서 확인했다는 것이기 때문에 m < 0 일때 cnt ..

n = int(input()) p = [0] + list(map(int,input().split())) dp = [0 for _ in range(n+1)] for i in range(1,n+1): for j in range(1,i+1): dp[i] = max(dp[i],dp[i-j]+p[j]) print(dp[i])

import sys input = sys.stdin.readline def solution(n): if n == 1: return 1 elif n == 2: return 2 elif n == 3: return 4 else: return solution(n-1)+solution(n-2)+solution(n-3) t = int(input()) for _ in range(t): print(solution(int(input())))

import sys input = sys.stdin.readline def dfs(x,y): if x >= n or x = n or y n: graph[x][y] = 0 dfs(x,y-1) dfs(x,y+1) dfs(x-1,y) dfs(x+1,y) return True return False n = int(input()) graph = [] cnt = 0 for i in range(n): graph.append(list(map(int,input().split()))) for i in range(n): for j in range(n): if dfs(i,j) == True: cnt += 1 print(cnt) #틀렸다고 나온다...

import sys sys.setrecursionlimit(10**6) #재귀함수 호출범위를 늘린다. def DFS(x,y): #범위를 벗어나면 False if x >= m or x = n or y < 0: return False if graph[x][y] == 1: graph[x][y] = 0 DFS(x,y-1) DFS(x,y+1) DFS(x-1,y) DFS(x+1,y) return True return False result = [] TestCase = int(input()) for _ in range(TestCase): m,n,k = map(int,input().split()) graph = [[0]*m for _ in range(n)] cnt = 0 for _ in range(k..

def DFS(x,y): global cnt #단지 범위를 넘어가면 종료 if x >= n or x = n or y < 0: return False if graph[x][y] == 1: cnt += 1 #다시 방문하지 않기 위해서 0으로 만들어준다. graph[x][y] = 0 #대각선의 범위는 담색허용 하지 않기 때문에 상하좌우로 살펴보도록 한다. DFS(x-1,y) DFS(x+1,y) DFS(x,y-1) DFS(x,y+1) return True return False n = int(input()) graph = [] cnt = 0 for i in range(n): graph.append(list(map(int,input()))) res = 0 resultLIST= [] for i i..

from collections import deque n,k = map(int,input().split()) queue = [] for i in range(n): queue.append(i+1) print("")

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