Submission #52555359

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
def count_teeth(n, q, t):
    holes = [1] * n
    for i in range(q):
        Ti = t[i]
        if holes[Ti - 1] == 1:
            holes[Ti - 1] = 0
        else:
            holes[Ti - 1] = 1
    return sum(holes)
n, q  = map(int, input().split())
t = list(map(int, input().split()))
print(count_teeth(n, q, t))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

def count_teeth(n, q, t):
    holes = [1] * n

    for i in range(q):
        Ti = t[i]
        if holes[Ti - 1] == 1:
            holes[Ti - 1] = 0
        else:
            holes[Ti - 1] = 1

    return sum(holes)

n, q  = map(int, input().split())

t = list(map(int, input().split()))
print(count_teeth(n, q, t))

Submission Info

Judge Result