华为机考-简单（3）

 

 

 

 

while True:
    try:
        num = int(input())
        stack = []
        for i in range(num):
            stack.append(input())
        print("\n".join(sorted(stack)))
    except:
        break


##############################################################3
n = int(input().strip())  # 先处理输入
strlist = []
while n > 0:
    istr = input()
    strlist.append(istr)
    n -= 1 #输入的次数

# 定义排序函数,返回是否交换顺序
def strOrder(a, b):
    la = len(a)
    lb = len(b)
    for i in range(min(la, lb)):
        if ord(a[i]) < ord(b[i]):
            return 0  #
        elif ord(a[i]) > ord(b[i]):
            return 1
        else:
            continue
    if la <= lb:
        return 0
    else:
        return 1


# 冒泡排序
for i in range(len(strlist) - 1):
    for j in range(i + 1, len(strlist)):
        if strOrder(strlist[i], strlist[j]):  # 满足条件，则交换二者顺序
            tmp = strlist[i]
            strlist[i] = strlist[j]
            strlist[j] = tmp
for i in range(len(strlist)):
    print(strlist[i])

 

n = int(input())
while True:
    try:
        lis = []
        for i in range(n):
            sr = input()
            lis.append(sr)
        lis.sort()
        print('\n'.join(lis))
    except (EOFError, KeyboardInterrupt):
        break

 

2\

 

 

 

count+1，然后n除2取整后继续，由于除了0以外的n的二进制都至少有一个1 故count从1开始
n = int(input())
count = 1
while n != 1:
    k = n % 2
    if k == 1:
        count +=1
    n = n // 2
print(count)


import sys
line=int (sys.stdin.readline().strip())
res=0
while line>0 :
    if line%2 ==1 :
        res+=1
    line=line//2
print res

num = int(input())
counts = 0
while num !=0:
    if num % 2 == 1:
        counts = counts+1
    num = num >> 1
print(counts)

n = int(input())
count = 1
while n != 1:
    k = n % 2
    if k == 1:
        count +=1
    n = n // 2
print(count)



#先转换为二进制，再转换为字符串，计算字符串中的‘1’的数量
intNum = int(input())
byteNum = bin(intNum)
byteStr = str(byteNum)
count = 0
for i in byteStr:
    if i == '1':
        count += 1
print(count)


num = int(input())
bin_num_ss = bin(num)
ct =0
for i in range(len(bin_num_ss)-1,1,-1):
    if bin_num_ss[i] == '1':
        ct +=1
print(ct)  


print(bin(int(input())).count("1"))
#bin()返回一个整数 int 或者长整数 long int 的二进制表示。返回类型为字符串
#count()方法用于统计字符串里某个字符出现的次数

 

 

 

 

 

 

 

 

3\

 

 

 

 

 

 

4\

 

 

 

 

 

 

 

 

5\

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

1