第1关十进制数转换为二进制数

第2关数字排序

第3关杨辉三角

1

-- coding:utf-8 --

def dec_to_bin( number ):
#********** Begin /
# 在此处补全代码
b = []
i = 0
result = ‘’
while(number > 0):
i = number % 2
number = number // 2
b.append(i)
while b:
result += str(b.pop())
return result
#* End **********/
num = int(input())
print( dec_to_bin(num) ,end="")

2

-- coding:utf-8 --

def sort( l ):
#********** Begin /
#在此处补全代码
for i in range(len(l)):
for j in range(i):
if l[i] < l[j]:
l[i] = l[i] + l[j]
l[j] = l[i] - l[j]
l[i] = l[i] - l[j]
return l
#* End **********/
line = input()
l = []
line = line.split()
for i in line:
l.append(int(i))
l = sort( l )

for index, number in enumerate(l):
if index != len( l ) -1:
print(number, end=’,’)
else:
print( number, end=’’ )
3

-- coding:utf-8 --

def yanghui(n):
#********** Begin *********/

result=[] 
for i in range(n):
    if i==0:
        result.append([1])  
    elif i==1:
        result.append([1,1])
    else:
        y = []  
        for j  in range(i+1):
            if j==0 or j==i:
                y.append(1)
            else:
                y.append(result[i-1][j]+result[i-1][j-1])
        result.append(y)
return result

#********** End **********/

def output(result):
for row,item in enumerate(result):
for index, number in enumerate(item):
if index != len( item) - 1:
print( “%d,” % ( number ), end="" )
else:
if row != len( result ) -1:
print( number )
else:
print( number, end="" )

n = int(input(’’))
output(yanghui(n))