[Offer收割]编程练习赛93 register

Ended

Participants:99

Verdict:Accepted
Score:100 / 100
Submitted:2019-02-17 14:11:43

Lang:Python2

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
n=int(input())
a=map(int,raw_input().split())
l=[0]*200005
for i in a:
    l[i]+=1
c=0
a.sort()
for i in a:
    if l[i] and l[2*i]:
        m=min(l[i],l[2*i])
        l[i]-=m
        l[2 * i]-=m
        c+=m
print c
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX