✏️ 준비운동 PART1. 튼튼한 기본기
1292 쉽게 푸는 문제
a,b = map(int,input().split())
d=[]
idx = 0
while(len(d)<1000):
idx +=1
for i in range(idx):
d.append(idx)
print(sum(d[a-1:b]))
1978 소수 찾기
n = int(input())
nl = list(map(int,input().split()))
che = [True] * 1001
che[1] = False
for i in range(2,501):
for j in range(2*i,1001,i):
che[j] = False
cnt = 0
for i in nl:
if che[i] == True:
cnt+=1
print(cnt)
2309 일곱 난쟁이
h = []
for i in range(9):
h.append(int(input()))
save=[0]*2
sum_h = sum(h)
for a in range(len(h)):
for b in range(a+1,len(h)):
if sum_h-(h[a]+h[b])==100:
save[0]=h[a]
save[1]=h[b]
h.remove(save[0])
h.remove(save[1])
h.sort()
for i in h:
print(i)
2460 지능형 기차
answer= 0
temp=0
for i in range(10):
comeout, comein = map(int,input().split())
temp+= comein-comeout
answer = max(temp,answer)
print(answer)
2501 약수 구하기
n,k = map(int,input().split())
d=[]
for i in range(1,n//2+1):
if n%i==0:
d.append(i)
d.append(n)
if len(d)<k:
print("0")
else:
print(d[k-1])
2581 소수
n = int(input())
m = int(input())
che = [True] * (m+1)
che[1] = False
for i in range(2,(m//2)+1):
for j in range(2*i,m+1,i):
che[j] = False
ans =[]
for j in range(n,m+1):
if che[j] == True:
ans.append(j)
if ans:
print(sum(ans))
print(min(ans))
else:
print(-1)
2609 최대공약수와 최소공배수
n,m = map(int,input().split())
def gcd(a,b):
if a==0:
return b
else:
return gcd(b%a,a)
gcd_n = gcd(n,m)
lcm_n = int(n/gcd_n * m/gcd_n * gcd_n)
print(gcd_n)
print(lcm_n)
2693 N번째 큰수
tc = int(input())
for _ in range(tc):
d = list(map(int,input().split()))
d.sort(reverse=True)
print(d[2])
3460 이진수
tc = int(input())
for i in range(tc):
n = int(input())
op_nbin = bin(n)[::-1]
for i in range(len(op_nbin)):
if op_nbin[i]=="1":
print(i,end=" ")
10818 최소, 최대
n = int(input())
d = list(map(int,input().split()))
d.sort()
print(d[0],d[-1])
10870 피보나치수 5
n = int(input())
d=[0]*(n+1)
d[0]=0
if n==0:
print(d[n])
elif n==1:
d[1] = 1
print(d[n])
else:
d[1] = 1
for i in range(2,n+1):
d[i] = d[i-1]+d[i-2]
print(d[n])