Bu yerda siz tomonidan berilgan isPrime funksiyasidan foydalanib, birinchi 20 ta bos sonni bosib chiqarish uchun asosiy funksiya mavjud. ``` #include <iostream> nomlar bo'shlig'i std; bool isPrime(int n) { if(n == 1 ∈ n == 0) false qaytaradi; forint i = 2; i < n; i++) { if(n % i == 0) false qaytaradi; } true qaytaradi; } int main ((() { int count = 0; int num = 2; whilecount (((count < 20) { if(isPrime (((num)) { cout << << numl end; count++; } num++; } 0 qaytaradi; } ```
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence