1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
|
def sol(nums1,nums2):
not_inview=0
entire=sum(nums1)
for i in range(len(nums2)):
if nums2[i]==0 :
not_inview+=nums1[i]
print(entire)
print(not_inview)
n=int(input())
nums1=list(map(int,input().split()))
nums2=list(map(int,input().split()))
sol(nums1,nums2)
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
codeforces 617A - Elephant (0) | 2022.05.31 |
---|---|
codeforces 1686A - Everything Everywhere All But One (0) | 2022.05.30 |
백준 23813 회전 (0) | 2022.05.26 |
백준 24923 Canadians, eh? (0) | 2022.05.26 |
백준 24927 Is It Even? (0) | 2022.05.26 |
댓글