首页 >后端开发 >Python教程 >Python Day - 循环示例和任务

Python Day - 循环示例和任务

Barbara Streisand
Barbara Streisand原创
2024-12-04 01:11:10328浏览

任务:1

#Print Numbers
#Write a program to print numbers from 1 to 10 using a while loop.

def print_numbers(num):
    no=1
    while no<=num:
        print(no,end=' ')
        no+=1
print_numbers(10)

输出:

1 2 3 4 5 6 7 8 9 10 

任务:2

#Sum of N Numbers
#Write a program to calculate the sum of the first NN natural numbers using a while loop.

def nat_num(N):
    sum = 0
    natural_no = 1

    while natural_no <= N:
        sum += natural_no
        natural_no += 1
    return sum
N = int(input("Enter the no: "))
print(nat_num(N))

输出:

Enter the no: 10
Sum of 10 natural numbers are 55

任务:3

#Find even numbers between 1 to 50

def even_number(num):
    no=2
    while no<=num:
        print(no, end=" ")
        no+=2
num=int(input("Enter the number: "))
even_number(num)

输出:

2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50

任务:4

#Find odd numbers between 1 and NN

def odd_number(num):
    no=1
    while no<=num:
        print(no, end=" ")
        no+=2

num=int(input("Enter the number:"))
odd_number(num)

输出:

Enter the number:15
1 3 5 7 9 11 13 15

任务:5

#Multiplication table of number NN
#NN-2

no=1
while no<=10:
    print(f'{no}*2={no*2}')
    no+=1 

输出:

1*2=2
2*2=4
3*2=6
4*2=8
5*2=10
6*2=12
7*2=14
8*2=16
9*2=18
10*2=20

阶乘:

编写一个程序,使用 while 循环计算给定数字的阶乘。

案例1

no = 1
factorial = 1

factorial = factorial * no #1
no = no+1 #2
factorial = factorial * no #2
no = no+1 #3
factorial = factorial * no #6
no = no+1 #4
factorial = factorial * no #24
no = no+1 #5
factorial = factorial * no #120
print(factorial)

案例2

def find_factorial(num):
    no=1
    factorial=1
    while no<=num:
        factorial=factorial*no
        no+=1
    return factorial

num=int(input("Enter the number:"))
print(find_factorial(num))

对于场景输出将是相同的
输出:

Enter the number:5
120

数字总和:
求给定数字的数字之和(例如,123 → 1 2 3=61 2 3=6)。

def sum_of_digits(num):
    sum=0
    while num>0:
        sum=sum+num%10
        num=num//10
    return sum
num=int(input("Enter the number:"))
print(sum_of_digits(num))

输出:

Enter the number:123
6

数数字

计算给定数字的位数(例如,12345 → 5 位数字)。

def count_of_digits(no):
    count=0
    while no>0:
        no=no//10
        count+=1
    return count
no=int(input("Enter the number:"))
print(count_of_digits(no))

输出:

Enter the number:12345
5

反转数字
反转数字

def reverse_no(num):
    reverse = 0
    while num>0:
        reverse = (reverse*10) + num%10
        num = num//10
    return reverse


print(reverse_no(1234)) 

输出:

Enter the number:12345
54321

检查回文

检查给定的数字是否是回文(例如,121→回文,123→不是回文)。

def palindrome(num):
    count=0
    while num>0:
        count=count*10+num%10
        num=num//10
    return count
num=int(input("Enter the number:"))
result=palindrome(num)
if result==num:
    print("Palindrome")
else:
    print("Not palindrome")

输出:

Enter the number:121
Palindrome
Enter the number:123
Not palindrome

寻找力量

def find_power(base,power):
    result=1
    while power>=1:
        result=result*base
        power-=1
    return result
base=int(input("Enter the base number:"))
power=int(input("Enter the power number:"))
result=find_power(base,power)
print(result)

输出:

Enter the base number:5
Enter the power number:2
25

阿姆斯特朗数

Python Day - Looping-Examples and Tasks

示例:

def count_of_digits(num):
    count=0
    while num>0:
        num=num//10
        count+=1
    return count

def find_power(base,power):
    result=1
    while power>=1:
        result=result*base
        power-=1
    return result

def find_armstrong(num):
    armstrong=0
    while num>0:
        rem=num%10
        result= find_power(rem,count)
        armstrong=armstrong+result
        num=num//10
    return armstrong


num=int(input("Enter the number:"))
count=count_of_digits(num)
armstrong_result=find_armstrong(num)

if armstrong_result==num:
    print("Armstrong")
else:
    print("Not armstrong")

输出:

Enter the number:135
Not armstrong
Enter the number:153
Armstrong

以上是Python Day - 循环示例和任务的详细内容。更多信息请关注PHP中文网其他相关文章!

声明:
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系admin@php.cn