출처 | https://www.acmicpc.net/step/6
n = int(input())
n_list = list(map(int, input().split()))
v = int(input())
print(n_list.count(v))
a ,b = (map(int, input().split()))
c = list(map(int, input().split()))
for i in range(a):
if c[i] < b:
print(c[i], end = ' ')
import math
a = int(input())
b = list(map(int,input().split()))
c = max(b)
d = min(b)
print(d,c)
print(end = '')
numbers = []
for _ in range(9):
i = int(input())
numbers.append(i)
print(max(numbers))
print(numbers.index(max(numbers))+1)
N, M = map(int, input().split())
basket = [0 for _ in range(N)]
for _ in range(M):
i,j,k = map(int, input().split())
for n in range(i,j+1):
basket[n-1] = k
for n in range(N):
print(basket[n], end = ' ')
basket = [0 for _ in range(N)]: 바구니의 상태를 나타내는 배열 basket을 생성 + 배열의 크기는 N이며, 모든 요소를 0으로 초기화
for _ in range(M) M번 반복하면서 공을 넣는 방법을 입력받고 처리
N,M = map(int, input().split())
basket = [i for i in range(1,N+1)]
temp = 0
for i in range(M):
i,j = map(int, input().split())
temp = basket[i-1]
basket[i-1] = basket[j-1]
basket[j-1] = temp
for i in range(N):
print(basket[i], end = ' ')
students = [i for i in range(1,31)]
for _ in range(28):
applied = int(input())
students.remove(applied) #소거
print(min(students))
print(max(students))
x = []
y = []
z = []
for i in range (0,10):
x.append(int(input()))
y.append(x[i]%42)
if y[i] not in z:
z.append(int(y[i]))
print(len(z))
N, M = map(int, input().split())
basket = [i for i in range(1,N+1)]
for i in range(M):
i,j = map(int, input().split())
temp = basket[i-1:j]
temp.reverse()
basket[i-1:j] = temp
for i in range(N):
print(basket[i], end = ' ')
130문제남음