day5

水仙花
def narcissistic_number_1(num):

length = len(str(num))
 
count = length    

num_sum = 0    
 
while count:        
    
    num_sum += ((num // 10 ** (count - 1)) % 10) ** length     
     
    count -= 1    
 
else:       
    
    if num_sum == num:            
         
        print("%d is %d bit narcissistic_number" % (num, length))
    else:                        
        print("%d is not a narcissistic_number" % num)

def narcissistic_number_2(num):

original_num = num 
 
s = str(original_num)    
 
length = len(s)    
 
count = length    
 
sum_num = 0    
 
while count:        
     
    sum_num += int(s[count - 1]) ** length        
     
    count -= 1    
 
else:       
     
    if sum_num == num:           
        
        print("%d is a %d bit narcissistic_number" % (num, length))
     
    else:            
         
        print("%d is not a narcissistic_number" % num)

max_num = int(input(‘请输入最大范围’))

获取小于指定数的阿姆斯特朗数

for num in range(0, max_num):

narcissistic_number_1(num)        #调用方法一,方法二均可

代码如下：

for cock in range(1,101): # 公鸡
for hen in range(1,101): #母鸡
for chick in range(1,101): #小鸡
if cock * 5 + hen * 3 + chick = 100:
if cock + hen + chick * 3= 100:
print(“公鸡有%d只\t母鸡有%d只\t小鸡有%d只”%(cock,hen,chick * 3))

def fib(n):
a, b = 1, 1
while a < n:
print(a, end=’ ')
a, b = b, a+b
fib(100) #输出的是100以内的斐波那契数列