[6084]
h, b, c, s = map(int, input().split())
bit = h * b * c * s #bit
mbyte = float(bit / 8 / 1024 / 1024) #MB
print(format(mbyte,".1f"),"MB")
[6085]
w, h, b = map(int, input().split())
bit = w * h * b
mbyte = float(bit/8/1024/1024)
print(format(mbyte, ".2f"),"MB")
[6086]
n = int(input())
cnt = 0
sum = 0
while True:
cnt += 1
sum += cnt
if sum >= n:
break
print(sum)
[6087]
n = int(input())
for i in range(1,n+1):
if i % 3 == 0:
continue
else: print(i,end=" ")
[6088]
a, d, n = map(int, input().split())
for i in range(1,n):
a += d
print(a)
[6089]
a, r, n = map(int, input().split())
for i in range(1,n):
a *= r
print(a)
[6090]
a, m, d, n = map(int, input().split())
for i in range(1,n):
a = a * m + d
print(a)
[6091]
n1, n2, n3 = map(int, input().split())
d = 2
while d%n1!=0 or d%n2!=0 or d%n3!=0:
d += 1
print(d)
[6092]
n = int(input())
m = input().split()
d = []
for i in range(24):
d.append(0)
for i in range(n):
m[i] = int(m[i])
d[m[i]] += 1
for j in range(1,24):
print(d[j],end=' ')
이거 푸는데 좀 걸렸다.. 엄청 간단한건데 참 많이 부족하다
[6093]
n = int(input())
m = input().split()
for i in range(n):
m[i] = int(m[i])
for i in range(n-1,-1,-1):
print(m[i],end=' ')
[6094]
n = int(input())
m = list(map(int, input().split()))
min = m[n-1]
for i in range(n):
if m[i] < min:
min = m[i]
print(min)
#-------------------
n = int(input())
print(min(map(int, input().split())))
2021.05.24 - [Dev/Algorithm] - [Codeup] Python 기초 100제(3)
'Algorithm' 카테고리의 다른 글
[Codeup] Python 기초 100제(6) (0) | 2021.05.27 |
---|---|
[Codeup] Python 기초 100제(5) (0) | 2021.05.26 |
[Codeup] Python 기초 100제(3) (0) | 2021.05.24 |
[Codeup] Python 기초 100제(2) (0) | 2021.05.22 |
[Codeup] Python 기초 100제(1) (0) | 2021.05.22 |
댓글