Algorithm/케로베로스
[🐉 백준 5단계] 1차원 배열
대인보우
2020. 12. 5. 16:26
반응형
백준 5단계
1차원 배열
Q. 10818
n = int(input())
a = list(map(int, input().split()))
print(min(a), max(a))
Q. 2562
l = []
for _ in range(9):
l.append(int(input()))
m = max(l)
idx = l.index(m)
print(m)
print(idx+1)
Q. 2577
l = [0] * 10
s = 1
for _ in range(3):
s = s * int(input())
s = str(s)
for i in s:
i = int(i)
l[i] = l[i] + 1
for i in l:
print(i)
Q. 3052
l = []
answer = []
for _ in range(10):
l.append(int(input())%42)
for i in l:
if i in answer:
pass
else:
answer.append(i)
print(len(answer))
Q. 1546
n = int(input())
l = list(map(int, input().split()))
m = max(l)
for i in range(len(l)):
l[i] = l[i]/m*100
print(sum(l)/n)
Q. 8958
n = int(input())
for _ in range(n):
a = list(input())
answer = []
for i in range(0, len(a)):
if i == 0:
if a[i] == 'X':
answer.append(0)
else:
answer.append(1)
else:
if a[i] == 'X':
answer.append(0)
else:
answer.append(answer[i-1]+1)
print(sum(answer))
Q. 4344
n = int(input())
for _ in range(n):
a = list(map(int, input().split()))
answer = []
count = 0
average = sum(a[1:])/a[0]
for i in range(1, len(a)):
if a[i] > average:
count += 1
p = '%0.3f' % ((count/a[0])*100)
print('{}%'.format(p))
반응형