5-topshiriq.py
1.6 KB
#coment Kiritiligan 4 ta kordinata nuqtasidan kvadrat hosil bo'lishi yoki bo'lmasligini aniqlovhchi dastur.
Pythonda yurak grafigi
👇👇👇
import math
from turtle import *
def hearta(k):
return 15*math.sin(k)**3
def heartb(k):
return 12*math.cos(k)-5*\
math.cos(2*k)-2*\
math.cos(3*k)-\
math.cos(4*k)
speed(0)
bgcolor("black")
for i in range(6000):
goto(hearta(i)*20,heartb(i)*20)
for j in range(5):
color("red")
goto(0,0)
done()
👇👇👇
Pycharm_activate.rar
149.6 KB
Jetbrains program full aktivate.
parol:2024-bayroq
parol:2024-bayroq
8-topshiriq.py
1.6 KB
Ixtiyoriy songacha bo'lgan o'zaro tub, bo'luvchilari va tub sonlar grafigini chizuvchi dastur.
10-topshiriq.py
1.2 KB
Komplesk sonlardan tashkil topgan kvadrat tenglama yechuvchi dastur
Python:
import math
while True:
def fi(n):
count = 0
for i in range(1, n + 1):
if math.gcd(i, n) == 1:
count += 1
return count
def tau(n):
count = 0
for i in range(1, n + 1):
if n % i == 0:
count += 1
return count
def pi(n):
count = 0
for i in range(2, n + 1):
is_prime = True
for j in range(2, int(math.sqrt(i)) + 1):
if i % j == 0:
is_prime = False
break
if is_prime:
count += 1
return count
def print_graph(func, k, name):
print(f"\n{name} funktsiyasining grafigi:\n")
for x in range(1, k + 1):
y = func(x)
print(" " * (y-1) + "*")
print("1. O'zaro tub sonlar grafigini chizish."
"\n2. Bo'luvchilar soni grafigini chizish."
"\n3. Tub sonlar grafigini chizish."
"\n4. Dasturdan chiqish.")
son = int(input("Kerakli bo'lim raqamini kiriting:"))
if son == 1:
k = int(input("Birorta son kiriting:"))
print_graph(fi, k, "phi(n) - o‘zaro tub sonlar miqdori")
elif son == 2:
k = int(input("Birorta son kiriting:"))
print_graph(tau, k, "tau(n) - bo‘luvchilar soni")
elif son == 3:
k = int(input("Birorta son kiriting:"))
print_graph(pi, k, "pi(n) - tub sonlar soni")
elif son == 4:
break
#Tuzatish
import math
while True:
def fi(n):
count = 0
for i in range(1, n + 1):
if math.gcd(i, n) == 1:
count += 1
return count
def tau(n):
count = 0
for i in range(1, n + 1):
if n % i == 0:
count += 1
return count
def pi(n):
count = 0
for i in range(2, n + 1):
is_prime = True
for j in range(2, int(math.sqrt(i)) + 1):
if i % j == 0:
is_prime = False
break
if is_prime:
count += 1
return count
def print_graph(func, k, name):
print(f"\n{name} funktsiyasining grafigi:\n")
for x in range(1, k + 1):
y = func(x)
print(" " * (y-1) + "*")
print("1. O'zaro tub sonlar grafigini chizish."
"\n2. Bo'luvchilar soni grafigini chizish."
"\n3. Tub sonlar grafigini chizish."
"\n4. Dasturdan chiqish.")
son = int(input("Kerakli bo'lim raqamini kiriting:"))
if son == 1:
k = int(input("Birorta son kiriting:"))
print_graph(fi, k, "phi(n) - o‘zaro tub sonlar miqdori")
elif son == 2:
k = int(input("Birorta son kiriting:"))
print_graph(tau, k, "tau(n) - bo‘luvchilar soni")
elif son == 3:
k = int(input("Birorta son kiriting:"))
print_graph(pi, k, "pi(n) - tub sonlar soni")
elif son == 4:
break
#Tuzatish