题解 | #密码强度等级#
记负均正
http://www.nowcoder.com/practice/6abde6ffcc354ea1a8333836bd6876b8
while True:
try:
k = input()
count_f = 0
input_list = [i for i in map(int,input().split())]
pos_list = []
for i in input_list:
if i < 0 :
count_f += 1
elif i > 0:
pos_list.append(i)
print('{} {:.1f}'.format(count_f,(sum(pos_list)/len(pos_list))))
except:
break
