Agar siz 1 dan 1000 gacha bo'lgan eng katta yalpi sonni topmoqchi bo'lsangiz, quyidagi kodni ishlating: ```python def is_prime(num): if num < 2: return False for i in range(2, int(num ** 0.5) + 1): if num % i == 0: return False return True def find_largest_prime(lower_limit, upper_limit): for num in range(upper_limit, lower_limit - 1, -1): if is_prime(num): return largest num_prime = find_largest_prime1, 1000) print "eng katta yalpi son:", largest_prime) ``` Ushbu dastur birinchi navbatda yalpi sonni aniqlash uchun yalpi sonni topish funksiyasini belgilaydi.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence