s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s833304051 | p03607 | u243075416 | 1576796918 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 162 | num = gets.to_i
hash = {}
num.times do |i|
a = gets.to_i
if hash.has_key?("#{a}")
hash.delete("#{a}")
else
hash["#{a}"] = 0
end
end
print hash.size
|
s318919543 | p03607 | u071416928 | 1576692321 | Python | Python (3.4.3) | py | Runtime Error | 1714 | 7508 | 444 | n = int(input())
a = [int(input()) for _ in range(n)]
a.sort()
def fanc(n, a):
if n == 1:
print(1)
return 0
cnt = 0
while len(a) > 0:
same_cnt = 1
j = 1
while a[0] == a[j]:
same_cnt += 1
if j == len(a) - 1:
break
j... |
s434164059 | p03607 | u071416928 | 1576692128 | Python | Python (3.4.3) | py | Runtime Error | 1728 | 7512 | 331 | n = int(input())
a = [int(input()) for _ in range(n)]
a.sort()
if len(a) == 1: cnt = 1
else: cnt = 0
while len(a) > 0:
same_cnt = 1
j = 1
while a[0] == a[j]:
same_cnt += 1
if j == len(a) - 1:
break
j += 1
if same_cnt % 2 == 1:
cnt += 1
del a[0:same_cnt]
... |
s511738402 | p03607 | u071416928 | 1576691840 | Python | Python (3.4.3) | py | Runtime Error | 1725 | 7512 | 300 | n = int(input())
a = [int(input()) for _ in range(n)]
a.sort()
cnt = 0
while len(a) > 0:
same_cnt = 1
j = 1
while a[0] == a[j]:
same_cnt += 1
if j == len(a) - 1:
break
j += 1
if same_cnt % 2 == 1:
cnt += 1
del a[0:same_cnt]
print(cnt) |
s313070908 | p03607 | u940342887 | 1576657454 | Python | PyPy3 (2.4.0) | py | Runtime Error | 513 | 50392 | 282 | N = int(input())
a = []
for i in range(N):
a.append(int(input()))
a.sort()
flag=False
ans = 0
i = 0
while i <= len(a) - 1:
if a[i] != a[i+1]:
ans += 1
i += 1
flag=True
else:
i += 2
flag=False
if flag:
ans += 1
print(ans) |
s841433947 | p03607 | u607075479 | 1576595662 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 285 | N = int(input())
A = [int(input()) for i in range(N)]
A = sorted(A)
ans = 0
prev = A[0]
cnt = 0
for a in A:
if prev == a:
cnt += 1
prev = a
else:
if cnt % 2 == 1:
ans += 1
cnt = 1
prev = a
if cnt %= 1:
ans += 1
print(ans) |
s912594851 | p03607 | u774160580 | 1576080192 | Python | Python (3.4.3) | py | Runtime Error | 218 | 15072 | 183 | N = int(input())
A = {}
for i in range(N):
a = int(input())
if a in A:
A[a] += 1
else:
A[a] = 1
ans = 0
for val in A.values:
ans += val % 2
print(ans)
|
s220971183 | p03607 | u780475861 | 1576025346 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 171 | n = int(input())
dic = {}
for _ in range(n):
tmp = int(input())
if tmp in dic and dic[tmp] == 1:
dic[tmp] == 0
else:
dic[tmp] = 1
print(sum([*dic.values()])) |
s659250459 | p03607 | u088552457 | 1575348394 | Python | Python (3.4.3) | py | Runtime Error | 1135 | 15628 | 192 | n = int(input())
a = {}
r = []
for i in range(n):
s = int(input())
if s in a:
a[s] += 1
if a[s] % 2 == 0:
r.remove(s)
else:
a[s] = 1
r.append(s)
print(len(r)) |
s963697891 | p03607 | u325282913 | 1574052156 | Python | Python (3.4.3) | py | Runtime Error | 2117 | 7320 | 183 | N = int(input())
arr = [int(input()) for _ in range(N)]
ans = [0] * (max(arr)+1)
for i in range(N):
ans[arr[i]] += 1
a = 0
for i in ans:
if i % 2 == 1:
a += 1
print(a) |
s905782640 | p03607 | u153902122 | 1573340353 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 179 | N = int(input())
content = [0]*(10**9+2)
for i in range(N):
ai = int(input())
if content[ai]==1:
content[ai]=0
else:
content[ai]=1
print(sum(content))
|
s957828364 | p03607 | u153902122 | 1573340227 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 220 | import sys
sys.setrecursionlimit(10**6)
N = int(input())
content = [0]*(10**9+2)
for i in range(N):
ai = int(input())
if content[ai]==1:
content[ai]=0
else:
content[ai]=1
print(sum(content))
|
s397316466 | p03607 | u153902122 | 1573340170 | Python | Python (3.4.3) | py | Runtime Error | 207 | 10868 | 219 | import sys
sys.setrecursionlimit(10**6)
N = int(input())
content = [0]*(10**6+2)
for i in range(N):
ai = int(input())
if content[ai]==1:
content[ai]=0
else:
content[ai]=1
print(sum(content)) |
s825761948 | p03607 | u768896740 | 1573002176 | Python | Python (3.4.3) | py | Runtime Error | 267 | 8012 | 283 | n = int(input())
num_list = []
for i in range(n):
a = int(input())
num_list.append(a)
num_list.sort()
num_list2 = []
i = 0
while i < n:
if num_list[i] == num_list[i+1]:
i += 2
else:
num_list2.append(num_list[i])
i += 1
print(len(num_list2)) |
s052960162 | p03607 | u215315599 | 1572886971 | Python | PyPy3 (2.4.0) | py | Runtime Error | 502 | 49240 | 201 | import sys
sys.stdin.readline()
#sys.stdin = f
N = int(input())
A = [ int(input()) for _ in range(N)]
cntA = [0 for _ in range(max(A)+1)]
for a in A:
cntA[a] += 1
cntA[a] %= 2
print(sum(cntA)) |
s765433272 | p03607 | u225388820 | 1572792852 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38256 | 184 | n=int(input())
a=sorted[int(input()) for _ in range(n)]
ans=0
k=1
for i in range(1,n):
if a[i]==a[i-1]:
k+=1
else:
ans+=k%2
k=1
if a[n-2]==a[n-1]:
ans+=k%2
print(ans) |
s749045408 | p03607 | u225388820 | 1572792812 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 38512 | 182 | n=int(input())
a=sorted[int(input()) for _ in range(n)]
ans=0
k=1
for i in range(n):
if a[i]==a[i-1]:
k+=1
else:
ans+=k%2
k=1
if a[n-2]==a[n-1]:
ans+=k%2
print(ans) |
s553505060 | p03607 | u225388820 | 1572789889 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38384 | 49 | print(len({int(input()) for i in int(input())}))
|
s280503274 | p03607 | u225388820 | 1572789852 | Python | PyPy3 (2.4.0) | py | Runtime Error | 163 | 38512 | 43 | print({int(input()) for i in int(input())}) |
s800769556 | p03607 | u638282348 | 1572575165 | Python | Python (3.4.3) | py | Runtime Error | 177 | 13204 | 182 | n = int(input())
list_ = [int(input()) for _ in range(n)]
dict_ = dict()
for key in set(list_):
dict_[key] += dict_.get(key, 0) + 1
print(sum(num % 2 for num in dict_.values())) |
s264845021 | p03607 | u327310087 | 1572399168 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 173 | n = int(input())
a = [int(input()) for _ in range(n))]
paper = []
for i in a:
if i in paper:
paper.remove(i)
else:
paper.append(i)
print(len(paper)) |
s378457711 | p03607 | u084357428 | 1572391810 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 185 | import collections
n=int(input())
a=[]
for _ in range(n)
a.append(int(input()))
c = collections.Counter(a)
ans=0
for k,v in c.items():
if v % 2 != 0:
ans += 1
print(ans) |
s097713249 | p03607 | u311636831 | 1572035190 | Python | Python (3.4.3) | py | Runtime Error | 229 | 18908 | 268 | import collections
N = int(input())
List = {}
for i in range(N):
A = int(input())
if List.get(A,None)==None:
List[A]=1
else:
del List[A]
c = collections.Counter(List)
if(c.most_common(1)[0][1]==0):
print(0)
exit()
print(len(c))
|
s712627016 | p03607 | u933341648 | 1571334670 | Python | Python (3.4.3) | py | Runtime Error | 178 | 7072 | 104 | n = int(input())
a = [int(input()) for _ in range(n)]
s = set()
for a_ in a:
s ^= a
print(len(s))
|
s821682055 | p03607 | u077291787 | 1570873021 | Python | Python (3.4.3) | py | Runtime Error | 41 | 14052 | 291 | # ABC073C - Write and Erase
def main():
N, *A = map(int, open(0).read().split())
store = set()
for a in range(n):
if a in store:
store.remove(a)
else:
store.add(a)
ans = len(store)
print(ans)
if __name__ == "__main__":
main() |
s581187331 | p03607 | u527261492 | 1570581926 | Python | Python (3.4.3) | py | Runtime Error | 186 | 7072 | 192 | n=int(input())
a=[]
for i in range(n):
a.append(int(input()))
from collentions import Counter
b=list(Counter(a).values())
cnt=0
for i in range(len(b)):
if b[i]%2==0:
cnt+=1
print(cnt)
|
s441148404 | p03607 | u941438707 | 1570040921 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 139 | n=int(input())
a=set()
for i in range(n):
b=int(input())
if b in a:
a.remove(b)
else:
a.append(b)
print(len(a)) |
s450736733 | p03607 | u109617108 | 1569552740 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 197 | N=int(input())
x=[]
for i in range(N):
if i==0:
x+=list(int(input()))
else:
y=int(input())
if y in x:
x.remove(y)
else:
x.append(y)
print(len(x))
|
s431538586 | p03607 | u109617108 | 1569552652 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 192 | N=int(input())
for i in range(N):
if i==0:
x+=list(int(input()))
else:
y=int(input())
if y in x:
x.remove(y)
else:
x.append(y)
print(len(x))
|
s058557337 | p03607 | u027929618 | 1569550412 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 146 | n=int(input())
ans=[0]*1000000002
for i in range(n):
num=int(input())
if ans[num] == 0:
ans[num]+=1
else:
ans[num]=0
print(sum(ans)) |
s586632572 | p03607 | u027929618 | 1569550313 | Python | Python (3.4.3) | py | Runtime Error | 193 | 3828 | 142 | n=int(input())
ans=[0]*100002
for i in range(n):
num=int(input())
if ans[num] == 0:
ans[num]+=1
else:
ans[num]=0
print(sum(ans)) |
s539830234 | p03607 | u223904637 | 1568681917 | Python | Python (3.4.3) | py | Runtime Error | 1719 | 7388 | 248 | n=int(input())
l=[]
for i in range(n):
l.append(int(input()))
l.sort()
ans=0
c=0
for i in range(n-1):
if len(l)>0 and l[c]==l[c+1]:
l.pop(c)
l.pop(c)
else:
c+=1
if len(l)==n:
print(n)
else:
print(len(l)) |
s885700323 | p03607 | u223904637 | 1568681814 | Python | Python (3.4.3) | py | Runtime Error | 220 | 7388 | 211 | n=int(input())
l=[]
for i in range(n):
l.append(int(input()))
l.sort()
ans=0
c=0
for i in range(n-1):
if len(a)>0 and a[c]==a[c+1]:
a.pop(0)
a.pop(0)
else:
c+=1
print(len(a)) |
s031919629 | p03607 | u263226212 | 1568643417 | Python | Python (3.4.3) | py | Runtime Error | 2129 | 7188 | 266 | # -*- coding: utf-8 -*-
# input
N = int(input())
A = list()
for _ in range(N):
A.append(int(input()))
# solve
ans = 0
l = [0] * max(A)
for i in range(N):
l[A[i] - 1] += 1
for i in range(len(l)):
if l[i] % 2 == 1:
ans += 1
# output
print(ans)
|
s423803244 | p03607 | u480138356 | 1567883054 | Python | Python (3.4.3) | py | Runtime Error | 2117 | 7072 | 325 | import sys
input = sys.stdin.readline
def main():
N = int(input())
a = [int(input()) for i in range(N)]
check = [False] * (max(a) + 1)
for i in a:
check[i] = not(check[i])
ans = 0
for c in check:
if c:
ans += 1
print(ans)
if __name__ == "__main__":
m... |
s452407768 | p03607 | u480138356 | 1567883004 | Python | Python (3.4.3) | py | Runtime Error | 60 | 7840 | 327 | import sys
input = sys.stdin.readline
def main():
N = int(input())
a = [int(input()) for i in range(N)]
check = [False] * (int(1e5) + 1)
for i in a:
check[i] = not(check[i])
ans = 0
for c in check:
if c:
ans += 1
print(ans)
if __name__ == "__main__":
... |
s933884959 | p03607 | u881816188 | 1567703254 | Python | Python (3.4.3) | py | Runtime Error | 136 | 10272 | 166 | n=int(input())
a=[input() for _ in range(n)]
l={}
for i in range(n):
if a[i] in l:
l.remove(a[i])
else:
l.append(a[i])
#print(l)
print(len(l)) |
s282805296 | p03607 | u332657092 | 1567646289 | Python | PyPy3 (2.4.0) | py | Runtime Error | 519 | 51176 | 173 | n = int(input())
list = [0] * 1000001
for i in range(n):
num = int(input())
if list[num - 1] == 0:
list[num - 1] = 1
else:
list[num - 1] = 0
print(sum(list)) |
s522118205 | p03607 | u332657092 | 1567645961 | Python | PyPy3 (2.4.0) | py | Runtime Error | 500 | 44888 | 172 | n = int(input())
list = [0] * 100000
for i in range(n):
num = int(input())
if list[num - 1] == 0:
list[num - 1] = 1
else:
list[num - 1] = 0
print(sum(list)) |
s759491796 | p03607 | u369338402 | 1566065565 | Python | Python (3.4.3) | py | Runtime Error | 263 | 7472 | 189 | n=int(input())
l=[0]*n
for i in range(n):
l[i]=int(input())
l.sort()
ans=0
c=0
j=0
while len(l)>0:
while l[j+1]==l[j]:
c+=1
j+=1
c+=1
j+=1
if c%2==1:
ans+=1
print(ans) |
s544908813 | p03607 | u369338402 | 1566064394 | Python | Python (3.4.3) | py | Runtime Error | 179 | 3828 | 145 | n=int(input())
l=[0]*n
for i in range(n):
l=int(input())
#l.sort()
ans=0
for j in range(1,10**9+1):
if l.count(j)%2==1:
ans+=1
print(ans) |
s866007663 | p03607 | u248670337 | 1565983369 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 68 | n=int(input())
s=set()
for i in range(n):
s^=input()
print(len(s)) |
s838441645 | p03607 | u830054172 | 1565316299 | Python | Python (3.4.3) | py | Runtime Error | 145 | 10600 | 185 | import collections
n = int(input())
a = [input() for i in range(n)]
count = 0
dic = collections.Counter(l)
for i in dic.values():
if i%2 == 1:
count += 1
print(count) |
s849131118 | p03607 | u537782349 | 1563652850 | Python | Python (3.4.3) | py | Runtime Error | 204 | 3828 | 154 | a = int(input())
b = [False] *(10**5)
for i in range(a):
c = int(input())
b[c-1] = not b[c-1]
d = 0
for i in b:
if i:
d += 1
print(d)
|
s658039438 | p03607 | u223646582 | 1561558989 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 180 | N=int(input())
from collections import defaultdict
d = defaultdict(int)
for _ in range(N):
d[int(input())] += 1
ams=0
for i in d.values():
i%2==1:
ans+=1
print(ans) |
s430200706 | p03607 | u641460756 | 1561041081 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 152 | n=int(input())
ans=set([])
for i in range(n):
a=int(input())
if a in ans:
ans.remove(a)
else:
ans.append(a)
print(len(ans))
|
s773141317 | p03607 | u329058683 | 1560181376 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3700 | 142 | N=int(input())
L=[]
n=0
while n <N+1 :
A=int(input())
if A in L:
L.remove(A)
n=n+1
else:
L.append(A)
n=n+1
print(len(L)) |
s938395626 | p03607 | u778814286 | 1559961223 | Python | PyPy3 (2.4.0) | py | Runtime Error | 197 | 38384 | 263 | ###template###
import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())
###template###
N = int(input())
nlist = [0] * (10**9+1)
for _ in range(N):
i = int(input())
nlist[i] = ~nlist[i]
print(nlist.count(~0))
|
s278560405 | p03607 | u172111219 | 1559575878 | Python | PyPy3 (2.4.0) | py | Runtime Error | 522 | 59736 | 181 | from collections import Counter
n = int(input())
a = [int(input()) for _ in range(n)]
cnt = Counter(a).value()
flg = 0
for i in cnt:
if i%2 == 1:
flg += 1
print(flg) |
s920005333 | p03607 | u055941944 | 1559531565 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 143 | n=int(input())
s=set()
for i in range(n):
a=int(input())
if a in s:
s.remove(a)
else:
s.append(a)
print(len(s))
|
s685945396 | p03607 | u220345792 | 1559434938 | Python | Python (3.4.3) | py | Runtime Error | 366 | 3316 | 146 | N = int(input())
A = []
for i in range(N):
tmp = int(input())
if tmp not in A:
A.append(tmp)
else:
A.romove(tmp)
print(len(A)) |
s973440652 | p03607 | u077291787 | 1559306844 | Python | PyPy3 (2.4.0) | py | Runtime Error | 175 | 38384 | 282 | # ABC073C - Write and Erase
import sys
input = sys.stdin.readline
n = int(input())
arr = [0] * (10 ** 9 + 1)
cnt = 0
for _ in range(n):
m = int(input())
if arr[m] == 0:
arr[m] = m
else:
arr[m] = 0
for i in arr:
if i != 0:
cnt += 1
print(cnt) |
s229263987 | p03607 | u329232967 | 1559144591 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3320 | 5270 | #!/usr/bin/env python3
import sys
from bisect import bisect_left, bisect_right
from typing import Any, Callable, Iterable, Iterator, List, Sequence
ItemGetter = Callable[[Sequence], Any]
class SortedCollection:
def __init__(self, items: Iterable, key: ItemGetter) -> None:
self._key = key
self._it... |
s176957087 | p03607 | u329232967 | 1559143660 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3572 | 5321 | #!/usr/bin/env python3
import sys
from bisect import bisect_left, bisect_right
from collections.abc import Collection
from typing import Any, Callable, Iterable, Iterator, List, Sequence
ItemGetter = Callable[[Sequence], Any]
class SortedCollection(Collection):
def __init__(self, items: Iterable, key: ItemGetter... |
s377614607 | p03607 | u059436995 | 1558543805 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 153 | a =set()
n = int(input())
for _ in range(n):
tmp = int(input())
if tmp in a:
a.remove(tmp)
else:
a.append(tmp)
print(len(a)) |
s163882047 | p03607 | u063052907 | 1558487802 | Python | Python (3.4.3) | py | Runtime Error | 204 | 8284 | 193 | N = int(input())
lst_a = [int(input()) for _ in range(N)]
lst_ans = [0] * (10**5 + 2)
lst_a.sort()
for a in lst_a:
lst_ans[a] += 1
ans = sum(1 for i in lst_ans if i % 2 != 0)
print(ans) |
s131916028 | p03607 | u063052907 | 1558487716 | Python | Python (3.4.3) | py | Runtime Error | 201 | 8284 | 193 | N = int(input())
lst_a = [int(input()) for _ in range(N)]
lst_ans = [0] * (10**5 + 2)
lst_a.sort()
for a in lst_a:
lst_ans[a] += 1
ans = sum(1 for i in lst_ans if i % 2 == 1)
print(ans) |
s543176758 | p03607 | u063052907 | 1558487664 | Python | Python (3.4.3) | py | Runtime Error | 202 | 8280 | 189 | N = int(input())
lst_a = [int(input()) for _ in range(N)]
lst_ans = [0] * (10**5)
lst_a.sort()
for a in lst_a:
lst_ans[a] += 1
ans = sum(1 for i in lst_ans if i % 2 == 1)
print(ans) |
s167352861 | p03607 | u734548018 | 1558130771 | Python | PyPy3 (2.4.0) | py | Runtime Error | 501 | 46256 | 175 | # /usr/bin/python
# -*- coding: utf-8 -*-
import math
An = [0 for _ in range(100001)]
for _ in range(int(input())):
i = int(input())
An[i] = (An[i]+1)%2
print(sum(An)) |
s771959748 | p03607 | u501163846 | 1557539092 | Python | Python (3.4.3) | py | Runtime Error | 2110 | 7072 | 176 | n=int(input())
a=[]
for i in range(n):
a.append(int(input()))
maxa=max(a)
test=[1]*(maxa+1)
for i in range(n):
test[a[i]]=test[a[i]]*(-1)
print((maxa-sum(test)+1)//2)
|
s737954996 | p03607 | u501163846 | 1557538677 | Python | Python (3.4.3) | py | Runtime Error | 2121 | 7192 | 161 | n=int(input())
a=[]
for i in range(n):
a.append(int(input()))
test=[1]*(max(a)+1)
for i in range(n):
test[a[i]]=test[a[i]]*(-1)
print(test.count(-1))
|
s621556140 | p03607 | u549497563 | 1556742893 | Python | Python (3.4.3) | py | Runtime Error | 212 | 3888 | 149 | n = int(input())
x = [0 for i in range(10**5+1)]
for i in range(n):
t = int(input())
x[t]+=1
if x[t]==2:
x[t]=0
print(x.count(1)) |
s658699462 | p03607 | u844005364 | 1555546349 | Python | Python (3.4.3) | py | Runtime Error | 83 | 3060 | 314 | import sys
input = sys.stdin.readline
import bisect
def main():
n = int(input())
s = []
for i in range(n):
a = int(input())
i = bisect.bisect_left(s, a)
if len(s) > 0 and s[i] == a:
s.remove(a)
else:
s.insert(i, a)
print(len(s))
main() |
s963019951 | p03607 | u689128894 | 1555378528 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 154 | N=int(input())
NUM_list = [0]*1000000000
X=0
for i in range(N):
NUM_list[int(input())]+=1
for i in range(1000000000):
X += NUM_list[i]%2
print(X) |
s079181044 | p03607 | u013629972 | 1555164142 | Python | Python (3.4.3) | py | Runtime Error | 111 | 18704 | 828 | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI()... |
s275105216 | p03607 | u974214237 | 1554772199 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 377 | #include<bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int>a(n);
for(int i = 0;i<n;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
int j = 0;int sum = 0;
while(j <n){
if(a[j] == a[j+1]){
j+=2;
}else{
sum += 1;
... |
s318313928 | p03607 | u278260569 | 1554398480 | Python | Python (3.4.3) | py | Runtime Error | 2134 | 7196 | 222 | N = int(input())
A = []
for i in range(N):
A.append(int(input()))
max_A = max(A)
num = [0] * (max_A + 1)
for i in range(N):
num[A[i]] += 1
sum = 0
for i in range(len(num)):
if num[i] % 2 == 1:
sum += 1
print(sum) |
s486798301 | p03607 | u013408661 | 1554242253 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 246 | import sys
n=int(input())
a=[[int(i) for i in l] for l in sys.stdin]
a.sort()
stack=a[0]
num=1
ans=0
for i in range(1,n):
if a[i]==stack:
num+=1
else:
if num%2==1:
ans+=1
stack=a[i]
num=1
if num%2==1:
ans+=1
print(ans) |
s250753764 | p03607 | u285443936 | 1553964109 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 138140 | 209 | N = int(input())
A = [int(input()) for i in range(N)]
array = []
ans = 0
for i in range(N):
if A[i] not in array:
array.append(A[i])
if A.count(A[i]) % 2 == 1:
ans += 1
print(i, array, ans)
|
s277640973 | p03607 | u027253287 | 1553874921 | Python | Python (3.4.3) | py | Runtime Error | 199 | 7836 | 160 | n = int(input())
a = [int(input()) for _ in range(n)]
cnt = [0]*int(1e5+10)
for i in range(n) :
cnt[a[i]] += 1
print(sum([cnt[i]%2 for i in range(len(cnt))])) |
s675309464 | p03607 | u674885198 | 1553821658 | Python | Python (3.4.3) | py | Runtime Error | 1727 | 7384 | 212 | n = int(input())
lis=[]
for i in range(n):
lis.append(int(input()))
lis.sort()
count=0
while len(lis)>0:
if lis[0]==lis[1]:
del lis[:2]
else:
del lis[0]
count+=1
print(count) |
s586295022 | p03607 | u580362735 | 1553367460 | Python | Python (3.4.3) | py | Runtime Error | 185 | 16632 | 195 | import collections
N = int(input())
a = [int(input()) for i in range(N)]
c = collections.Counter(a)
tmp = c.values()
count=0
for i in range(len(tmp)):
if tmp[i]%2!=0:
count+=1
print(count)
|
s487359191 | p03607 | u652081898 | 1553142033 | Python | Python (3.4.3) | py | Runtime Error | 199 | 8156 | 283 | n = int(input())
a = sorted([int(input()) for _ in range(n)])
ans = 0
count = 0
pre = a[0]
for i in range(n):
if a[i] == memo:
count+=1
else:
pre = a[i]
if count%2 == 1:
ans += 1
count = 1
if count%2 == 1:
ans += 1
print(ans)
|
s353251197 | p03607 | u652081898 | 1553141660 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 141 | s = int(input())
num = [int(input()) for _ in range(n)]
ans = 0
for i in set(num):
if num.count(i)%2 == 1:
ans += 1
print(ans)
|
s432373835 | p03607 | u555947166 | 1552509911 | Python | Python (3.4.3) | py | Runtime Error | 202 | 7388 | 289 | N = int(input())
Alist = [int(input()) for i in range(N)]
Alist.sort()
Alist.append('END')
counter = 1
ans = 0
for i in range(1, len(alist)):
if Alist[i - 1] == Alist[i]:
counter += 1
else:
if counter % 2 == 1:
ans += 1
counter = 1
print(ans)
|
s250149535 | p03607 | u807772568 | 1552423043 | Python | PyPy3 (2.4.0) | py | Runtime Error | 182 | 38640 | 168 | import collections
n = int(input())
co = collectiosn.Counter([int(input()) for i in range(n)])
c =0
for i in co.values():
if i % 2 != 0:
c +=1
print(c) |
s699631556 | p03607 | u353919145 | 1552171520 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 208 | num = int(input().strip().split())
nums = []
while num > 0:
tmp = int(input().strip().split())
if tmp in nums:
nums.remove(tmp)
else:
nums.append(tmp)
num -= 1
print(len(nums)) |
s941152754 | p03607 | u353919145 | 1552167031 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 380 | #include <cstdio>
#include <cstring>
int number[400000005] ={0};
int main()
{
int n,i,j,ans=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&j);
if(number[j]==0)
{
ans++;
number[j]++;
}
else
{
ans--;
number[... |
s859231997 | p03607 | u941753895 | 1551677238 | Python | Python (3.4.3) | py | Runtime Error | 199 | 3828 | 100 | l=[0]*100001
n=int(input())
for i in range(n):
a=int(input())
l[a]=abs(l[a]-1)
print(l.count(1)) |
s859327140 | p03607 | u934740772 | 1551634421 | Python | PyPy3 (2.4.0) | py | Runtime Error | 193 | 39792 | 140 | N=int(input())
A={}
for _ in range(N):
a=int(input())
if a not in A:
A.append(a)
else:
A.remove(a)
print(len(A)) |
s277263265 | p03607 | u865413330 | 1551597370 | Python | Python (3.4.3) | py | Runtime Error | 664 | 3316 | 219 | n = int(input())
l = []
#l = [l.remove(int(input())) if int(input()) in l else int(input()) for i in range(n)]
for i in range(n):
l.remove(int(input())) if int(input()) in l else l.append(int(input()))
print(len(l)) |
s062191585 | p03607 | u126823513 | 1551202988 | Python | Python (3.4.3) | py | Runtime Error | 194 | 13204 | 285 | int_n = int(input())
ar_int_a = []
for i in range(int_n):
ar_int_a.append(int(input()))
numbers = set(ar_int_a)
# written = [i for i in numbers if ar_int_a.count(i) % 2 == 1]
written = len((i for i in numbers if ar_int_a.count(i) % 2 == 1))
# print(len(written))
print(written) |
s298415863 | p03607 | u677440371 | 1550991303 | Python | Python (3.4.3) | py | Runtime Error | 191 | 7848 | 219 | n = int(input())
a = []
for i in range(n):
a.append(int(input()))
check = [0 for i in range(10**5 + 1)]
for i in a:
check[i] += 1
count = 0
for i in check:
if i % 2 != 0:
count += 1
print(count) |
s355234034 | p03607 | u099566485 | 1550945738 | Python | Python (3.4.3) | py | Runtime Error | 212 | 13204 | 326 | #073-C
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return input()
n=I()
a=[]
for i in range(n):
t=I()
a.append(t)
b=list[set(a)]
c={}
for i in b:
c[i]=0
for i in a:
c[a]+=1
for i in c.keys():
if c[i]%2==1:
cnt+=1
prin... |
s446192692 | p03607 | u543954314 | 1550722820 | Python | Python (3.4.3) | py | Runtime Error | 598 | 10272 | 147 | n = int(input())
a = [input() for i in range(n)]
b = []
for i in range(n):
if a[i] in b:
b.pop(a[i])
else:
b.append(a[i])
print(len(b)) |
s781905647 | p03607 | u578953945 | 1550633146 | Python | PyPy3 (2.4.0) | py | Runtime Error | 487 | 49240 | 137 | n = int(input())
a = [int(input()) for i in range(n)]
l=[]
for w in a:
if w in l:
l.append(w)
else:
l.remove(w)
print(len(l)) |
s031801228 | p03607 | u223133214 | 1550256056 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3316 | 192 | import collections
start = time.time()
n=int(input())
a=[input() for i in range(n)]
a_coll=dict(collections.Counter(a))
ans=0
for b in a_coll:
if a_coll[b]%2==1:
ans+=1
print(ans)
|
s622845364 | p03607 | u363407238 | 1546649066 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 150 | n=int(input())
paper=[]
for _ in range(n):
a = input()
if a in paper:
paper.remove(a)
else:
paper.add(a)
print(len(paper)) |
s876617494 | p03607 | u589087860 | 1545608684 | Python | Python (3.4.3) | py | Runtime Error | 195 | 7840 | 197 | n = int(input())
ko = [0 for _ in range(100000)]
a = [int(input()) for _ in range(n)]
for i in range(n):
ko[a[i]] += 1
ko = list(filter(lambda x: x%2 == 1, ko))
#print(ko)
print(len(ko))
|
s233428460 | p03607 | u017810624 | 1544319066 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 119 | n=int(input())
a=[]
for i in range(n):
x=int(input())
if x not in a:a.append(x)
else:a.remove(x)
print(len(a)) |
s999778900 | p03607 | u652150585 | 1541652362 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 212 | mport sys
import collections
input=sys.stdin.readline
n=int(input())
l=[int(input()) for i in range(n)]
ls=collections.Counter(l)
#print(ls)
a=0
for value in ls.values():
if value%2==1:
a+=1
print(a) |
s051620292 | p03607 | u652150585 | 1541652331 | Python | Python (3.4.3) | py | Runtime Error | 175 | 7072 | 157 | n=int(input())
l=[int(input()) for i in range(n)]
ls=collections.Counter(l)
#print(ls)
a=0
for value in ls.values():
if value%2==1:
a+=1
print(a) |
s098552489 | p03607 | u200030766 | 1541374536 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 137 | a=[0]*1000000001
N = int(input())
for i in range(N):
a[int(input().strip())]+=1
for i in range(len(a)):
a[i]=a[i]%2
print(sum(a)) |
s482634623 | p03607 | u785989355 | 1540957386 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 130 | N=int(raw_input())
A = [0 for i in range(10**9)]
for i in range(N):
a=int(raw_input())
A[a-1]=(A[a-1]+1)%2
print(sum(A)) |
s046372687 | p03607 | u785989355 | 1540957250 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 136 | N=int(raw_input())
A = [0 for i in range(10000000000)]
for i in range(N):
a=int(raw_input())
A[a-1]=(A[a-1]+1)%2
print(sum(A)) |
s959623143 | p03607 | u785989355 | 1540957084 | Python | Python (2.7.6) | py | Runtime Error | 141 | 6668 | 126 | N=int(raw_input())
A = [0 for i in range(N)]
for i in range(N):
a=int(raw_input())
A[a-1]=(A[a-1]+1)%2
print sum(A) |
s144240687 | p03607 | u785989355 | 1540957050 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 124 | N=int(raw_input())
A = [0 for i in range(N)]
for i in range(N):
a=int(raw_input())
A[a-1]=(a-1]+1)%2
print sum(A) |
s494159242 | p03607 | u785989355 | 1540956990 | Python | Python (2.7.6) | py | Runtime Error | 122 | 6668 | 133 | N=int(raw_input())
A = [0 for i in range(N)]
for i in range(N):
A[int(raw_input())-1]=(A[int(raw_input())-1]+1)%2
print sum(A) |
s361303822 | p03607 | u658993896 | 1540673488 | Python | Python (3.4.3) | py | Runtime Error | 148 | 12448 | 921 | import numpy as np
def search(now,r,dist,ans):
if len(r)==0:
return ans
min_=float('inf')
for i,x in enumerate(r):
if i < len(r)-1:
min_=min(min_,search(x,r[:i]+r[i+1:],dist,ans+dist[now][x]))
else:
min_=min(min_, search(x,r[:i],dist,ans+dist[now][x]))
re... |
s780404803 | p03607 | u940102677 | 1539755846 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 102 | n = int(input())
a = [0]*(1000000001)
for _ in [0]*n:
k = int(input())
a[k] = 1-a[k]
print(sum(a)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.