n = int(input()) direct = list(map(str,input().split())) x = 1 y = 1 #방 direction = ['U','D','L','R'] #상 하 좌 우 dx = [0,0,-1,1] dy = [-1,1,0,0] for d in direct: v = direction.index(d) if (x + dx[v]) < 1 or (y + dy[v]) < 1: continue else: x += dx[v] y += dy[v] print('x={}, y={}'.format(y,x))
data = input() num = ['1','2','3','4','5','6','7','8','9'] num_list = list() alpha_list = list() for d in data: if d in num: num_list.append(int(d)) else: alpha_list.append(d) alpha_list.sort() alpha_list.append(str(sum(num_list))) for a in alpha_list: print(a,end='')
import sys input=sys.stdin.readline n = int(input()) data = list(map(int,input().split())) data.sort() result = 0 # 총 그룹의 수 count = 0 #현재 그룹에 포함된 모험가의 수 for i in data: count += 1 if count >= i: result += 1 count = 0 print(result)
