Quyidagi kod yordamida 1 dan 1000 gacha bo'lgan sonlarning eng katta boshi topilishi mumkin: ``` python def is_prime(n): if n < 2: return False for i in range(2, int(n**0.5)+1): if n % i == 0: return False return True max_prime = 0 for num in range(1, 1001): if is_(primenum): max_prime = num print(max_prime) ``` Birinchidan, bir sonni boshi deb hisoblash uchun `is_prime` funksiyasini aniqlang. Keyin `for` yordamida 1 dan 1000 gacha bo'lgan sonlarni aylanib chiqing va har bir sonni boshi deb hisoblang.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence