https://www.acmicpc.net/problem/25756
1
2
3
4
5
6
7
8
9
10
11
12
13
|
def sol(nums):
n = len(nums)
current_defend = 0
for i in range(n):
defend = 100 - (100-current_defend)*(100-nums[i])/100
print(defend)
current_defend = defend
if __name__ == '__main__':
len_nums = int(input())
nums = list(map(int, input().split()))
sol(nums)
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
백준 26350 Good Coin Denomination (0) | 2022.12.22 |
---|---|
백준 5300 Fill the Rowboats! (0) | 2022.12.22 |
백준 24072 帰省 (Homecoming) (0) | 2022.12.22 |
백준 26711 A+B (0) | 2022.12.22 |
백준 20833 Kuber (0) | 2022.12.21 |
댓글