얄루의 개발일기🥑

lst = list(input()) for i in range(len(lst)): if i % 10 == 0: print() print(lst[i],end='') 출력 형식이 잘못 되었다고 나온다. s = input() for i in range(0,len(s),10): print(s[i:i+10])

a = [1,2,3,4,5,6,7,8] d = [8,7,6,5,4,3,2,1] lst = list(map(int,input().split())) if lst == a: print('ascending') elif lst == d: print('descending') else: print("mixed")

while True: try: print(input()) except EOFError: #데이터가 없어서 더이상 값을 읽을 수 없을 때 발생하는 break

day = 0 m = [31,28,31,30,31,30,31,31,30,31,30,31] w = ['SUN','MON','TUE','WED','THU','FRI','SAT'] x,y = map(int,input().split()) for i in range(x-1): day += m[i] day = (day+y) % 7 print(w[day])

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

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

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(..