Hari Python - Contoh Gelung dan Tugas

Tugas: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



<p>Output:<br>
</p>

<pre class="brush:php;toolbar:false">1 2 3 4 5 6 7 8 9 10 

Tugas: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 



<p>Output:<br>
</p>

<pre class="brush:php;toolbar:false">Enter the no: 10
Sum of 10 natural numbers are 55

Tugas:3

#Find even numbers between 1 to 50

def even_number(num):
    no=2
    while no



<p>Output:<br>
</p>

<pre class="brush:php;toolbar:false">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

Tugas:4

#Find odd numbers between 1 and NN

def odd_number(num):
    no=1
    while no



<p>Output:<br>
</p>

<pre class="brush:php;toolbar:false">Enter the number:15
1 3 5 7 9 11 13 15

Tugas:5

#Multiplication table of number NN
#NN-2

no=1
while no



<p>Output:<br>
</p>

<pre class="brush:php;toolbar:false">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

Faktorial:

Tulis atur cara untuk mengira pemfaktoran nombor tertentu menggunakan gelung sementara.

Kes-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)

Kes-2

def find_factorial(num):
    no=1
    factorial=1
    while no



<p>Untuk senario output akan sama<br>
Keluaran:<br>
</p>

<pre class="brush:php;toolbar:false">Enter the number:5
120

Jumlah digit:
Cari hasil tambah digit bagi nombor yang diberi (cth., 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))

Output:

Enter the number:123
6

Kira Digit

Untuk mengira bilangan digit dalam nombor tertentu (cth., 12345 → 5 digit).

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))

Output:

Enter the number:12345
5

Nombor songsang
Untuk menterbalikkan nombor

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


print(reverse_no(1234)) 

Output:

Enter the number:12345
54321

Semak Palindrom

semak sama ada nombor yang diberikan ialah palindrom (cth., 121 → palindrom, 123 → bukan palindrom).

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")

Output:

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

Cari kuasa

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)

Output:

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

Nombor Armstrong

Contoh:

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")

Output:

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

Atas ialah kandungan terperinci Hari Python - Contoh Gelung dan Tugas. Untuk maklumat lanjut, sila ikut artikel berkaitan lain di laman web China PHP!