dasturlash || fanidan oraliq nazorat ishi

DOCX 4 sahifa 11,2 KB Bepul yuklash

Sahifa ko'rinishi (4 sahifa)

Pastga aylantiring 👇
1 / 4
dasturlash || fanidan oraliq nazorat ishi its 23-08 auyelbekov nurman bilet 7 1.bitta chiziqli algoritm uchun: kiritilgan ikki sonning yig'indisini hisoblaydigan dastur tuzing. #include using namespace std; int main() { int a, b; cout > a; cout > b; int sum = a + b; cout #include #include #include using namespace std; int main() { string text; cout words; stringstream ss(text); string word; while (ss >> word) { words.push_back(word); } sort(words.begin(), words.end()); cout using namespace std; int factorial(int n) { if (n == 0 || n == 1) return 1; else return n * factorial(n - 1); } int main() { int num; cout > num; ial(num) << endl; return 0; }
2 / 4
dasturlash || fanidan oraliq nazorat ishi - Page 2
3 / 4
dasturlash || fanidan oraliq nazorat ishi - Page 3
4 / 4
dasturlash || fanidan oraliq nazorat ishi - Page 4

Ko'proq o'qimoqchimisiz?

Barcha 4 sahifani Telegram orqali bepul yuklab oling.

To'liq faylni yuklab olish

"dasturlash || fanidan oraliq nazorat ishi" haqida

dasturlash || fanidan oraliq nazorat ishi its 23-08 auyelbekov nurman bilet 7 1.bitta chiziqli algoritm uchun: kiritilgan ikki sonning yig'indisini hisoblaydigan dastur tuzing. #include using namespace std; int main() { int a, b; cout > a; cout > b; int sum = a + b; cout #include #include #include using namespace std; int main() { string text; cout words; stringstream ss(text); string word; while (ss >> word) { words.push_back(word); } sort(words.begin(), words.end()); cout using namespace std; int factorial(int n) { if (n == 0 || n == 1) return 1; else return n * factorial(n - 1); } int main() { int num; cout > num; ial(num) << endl; return 0; }

Bu fayl DOCX formatida 4 sahifadan iborat (11,2 KB). "dasturlash || fanidan oraliq nazorat ishi"ni yuklab olish uchun chap tomondagi Telegram tugmasini bosing.

Teglar: dasturlash || fanidan oraliq na… DOCX 4 sahifa Bepul yuklash Telegram