# 108 - bet
# Nazorat ishi
# 1 - masala
# n sonini kiritamiz:
n = int(input("n = "))
# yig'indini hisoblash uchun:
sum = 0
# n ta qadam uchun sikl:
# ushbu siklda elementlar => [1:n]
for i in range(1, n+1):
# oraliqda har bir sonni kubini hisoblab
# sumga qo'shamiz:
sum += i*i*i
# oynaga ifodani chiqarish uchun:;
if i != n:
print(f"{i}*{i}*{i}", end=" + ")
else:
print(f"{i}*{i}*{i}", end=" = ")
# natijani chiqarish:
print(sum)
👍7
# 108 - bet
# Nazorat ishi
# 2 - masala
# ko'paytmani hisoblash uchun:
k = 1
# ushbu siklda elementlar => (2, 4, 6, ... ,40)
for i in range(2, 41, 2):
# har bir qadamdagi sonni k ga ko'paytiramiz:
k *= i
# oynaga ifodani ko'rsatish uchun:
if i < 40:
print(f"{i}", end=" * ")
else:
print(f"{i}", end=" = ")
# natijani chiqarish:
print(k)
👍6
# 108 - bet
# Nazorat ishi
# 4 - masala
# protsedura prototipini yozamiz:
def almashtir(suz):
# yangi so'zni terish uchun hozircha bo'sh:
s = ''
# barcha harflarni kichik harga o'tqizish:
suz = suz.lower()
# har bir harfni tekshirish uchun sikl:
for i in range(len(suz)):
# kerakli harflar uchun shartlar:
if suz[i] == 'k':
s += 'q'
elif suz[i] == 't':
s += 'd'
elif suz[i] == 'n':
s += 'm'
else:
s += suz[i]
# natijani chop e'tish:
print(s)
# so'z kiritamiz:
s = input("so'z => ")
# uni funksiyaga argument qilib beramiz:
almashtir(s)
👍6
# 108 - bet
# Nazorat ishi
# 5 - masala
# EKUK ni topish funksiyasi
""" uni algoritmi oddiy yani:
Ikki sondan kattasi topiladi va o'sha katta songa to ikkala son bo'linguncha 1 qo'shilaveradi"""
def ekuk(a, b):
# kattasini topamiz:
if a > b:
kattasi = a
else:
kattasi = b
# cheksiz sikl:
while True:
if kattasi % a == 0 and kattasi % b == 0: # shart: katta son a ga ham b ga ham qoldiqsiz bo'linsin.
ekuk = kattasi # agar shart bajarilsa u ekuk bo'lsin va sikl tugasin
break
else:
kattasi += 1 # shakl bajarilmasa kattasi bittaga ortirilib sikl davom etsin
return ekuk # ekuk ni qaytaramiz:
# sonlarni kiritamiz:
a = int(input("a = "))
b = int(input("b = "))
print(ekuk(a, b)) # natija
👍16❤2