takrorlanuvchioperatorlar

DOCX 21 pages 130.2 KB Free download

21 pages

FaylHub.uz

Download via Telegram

Size 130.2 KB

File type DOCX

Pages 21

Updated Dec 2025

Page preview (5 pages)

Scroll down 👇

1 / 21

4-amaliy ish mavzu: takrorlanuvchi operatorlar. parametrli sikl operatori(for), old shart(while) va so’ng shart (do while) operatorlari. ishdan maqsad: c++ dasturlash tilining sikl operatorlari bilan tanishish. sharti oldindan, shart oxiridan beriladigan takrorlanish va parametrik sikl operatorlarini o’rganish. nazariy qism. dastur kodining biror qismining ko’p marta bajarishi sikl hisoblanadi. dastur kodining qandaydir qismini qandaydir shart asosida bir necha marta bajartirish uchun dasturlashda sikldan foydalaniladi. agar shart rost bo’lsa sikl davom qiladi. aks holda to’xtatiladi. agar shart hamisha rost bo’lsa bunday sikl cheksiz sikl deb ataladi. c++ da siklni tashkil qilish uchun while, do while va for operatorlari mavjud. siklni o’rganish uchun eng oson misol bu 1 dan n gacha natural sonlarning yig’indisini(1+2+3+…+n) topish dasturini tuzish. bu yig’indini takrorlanish jarayoni orqali hisoblash uchun 1 dan n gacha sonlarni birma-bir qo’shib chiqish lozim. yig’indining dastlabki qiymatini 0 ga tenglaymiz. siklning har bir qadamida quyidagi amallar bajariladi: s=0; 1-qadam. s=s+1=0+1=1; 2-qadam. s=s+2=1+2=3; 3-qadam. s=s+3=3+3=6; 4-qadam. …

2 / 21

${ int s = 0, n; cout >n; for (int i = 1; i 100.000001) break; cout using namespace std; int main() { int n; cin>>n; bool is_prime = true; for (int i = 2; i*i >n – n sonini kiritish. is_prime o’zgaruvchisi - berilgan sonning tub ekanligining rost yoki yolg’onligini saqlovchi qiymat. dastlab sonni tub deb tasavvur qilamiz(is_prime = true). 2 dan gacha sonlarni ko’rib chiqish uchun for (int i=2; i using namespace std; int main() { int a, b, n; cin>>a>>b>>n; int sum = 0, cnt = 0; for (int i = a; i #include using namespace std; int main(){ int a,b,c; cout >a; cout >b; cout >c; double s=0; for(int m=1;m #include using namespace std; int main(){ int a,b,c,d,k; cout >a; cout >b; cout >c; cout >d; double p=1; for(k=1;k #include using namespace std; int main() { for (int i = 1; i #include using namespace std; …$

3 / 21

tma-ketlikda o’suvchi ketma-ketliklar kamayuvchiga va kamayuvchi ketma-ketliklar o’suvchiga o’zgarishlar soni chop qilinsin. (masalan, 1 ,2, 4, -3, -5, 8 ,4,-5 ketma-ketlikda 3 marta o‘zgaradi) 9. nol bilan tugaydigan, noldan farqli butun sonlar ketma-ketligida ishora o‘zgarishlar soni aniqlansin. (masalan, 1 ,-34, 8 ,4,-5,0 ketma-ketlikda ishora 3 marta o‘zgaradi) 10. butun n (n>1) soni va n ta haqiqiy sonlardan iborat ketma-ketlik berilgan. ketma-ketlikning musbat elementlari orasidan eng kichigi topilsin. 11. raqamlari yig‘indisi n soniga teng (1 2) oraliqdagi barcha tub sonlar chop etilsin 15. berilgan natural sonning barcha tub bo'luvchilari chop etilsin 16. to’rt xonali sonlar ichida raqamlarining 4-darajalari yig’indisiga teng bo’lgan sonlarni chop qilish 17. berilgan, 7 so‘mdan katta bo`lgan har qanday tiyinsiz pul miqdorini 3 va 5 so‘mliklar yig‘indisi bilan qaytimsiz to‘lash mumkinligi isbotlansin, ya’ni berilgan n>7 uchun 3a+5b = n shartni qanoatlantiruvchi musbat butun a va b sonlar juftliklari topilsin 18. hadlar soni ikkitadan kam bo‘lmagan nol bilan tugaydigan …

4 / 21

eobject10.bin image11.wmf oleobject11.bin image12.wmf oleobject12.bin image13.wmf oleobject13.bin image14.wmf oleobject14.bin image15.wmf oleobject15.bin image16.wmf oleobject16.bin image17.wmf oleobject17.bin image18.wmf oleobject18.bin image19.wmf oleobject19.bin image20.wmf oleobject20.bin image21.wmf oleobject21.bin image22.wmf oleobject22.bin image23.wmf oleobject23.bin image24.wmf oleobject24.bin image25.wmf oleobject25.bin image26.wmf oleobject26.bin image27.wmf oleobject27.bin image28.wmf oleobject28.bin image29.wmf oleobject29.bin image30.wmf oleobject30.bin image31.wmf oleobject31.bin image32.wmf image1.wmf oleobject32.bin image33.wmf oleobject33.bin image34.wmf oleobject34.bin image35.wmf oleobject35.bin image36.wmf oleobject36.bin image37.wmf oleobject1.bin oleobject37.bin image38.wmf oleobject38.bin image39.wmf oleobject39.bin image40.wmf oleobject40.bin image41.wmf oleobject41.bin image42.wmf image2.wmf oleobject42.bin image43.wmf oleobject43.bin image44.wmf oleobject44.bin image45.wmf oleobject45.bin image46.wmf oleobject46.bin image47.wmf 10 , = £ £ - n x p p c x a x b a x c b a y + + + + = 3 2 2 2 . 0 , 5 3 = £ £ h x 2 2 2 2 4 x b a bx ax y + + + + = 100 , 20 1 = £ £ n x å õ = = + + = 32 …

5 / 21

1 × - + + - + - = ( ) n x x x x ss n n 1 2 1 3 2 1 ... 3 2 - - - + - + - = n x x x x s n 1 2 3 2 ... 3 2 - + + + + = ( ) 1 2 1 ... 5 3 1 2 1 5 3 - - + - + - = - + n x x x x p n n ) 1 2 ( ... 5 3 1 2 5 3 - + + + + = - n x x x x s n n pp 1 ... 3 1 2 1 1 1 1 + + + + + = n k k k k s n + + + + = ... 3 2 3 2 ! ... ! 3 ! …

Want to read more?

Download all 21 pages for free via Telegram.

Download full file

About "takrorlanuvchioperatorlar"

4-amaliy ish mavzu: takrorlanuvchi operatorlar. parametrli sikl operatori(for), old shart(while) va so’ng shart (do while) operatorlari. ishdan maqsad: c++ dasturlash tilining sikl operatorlari bilan tanishish. sharti oldindan, shart oxiridan beriladigan takrorlanish va parametrik sikl operatorlarini o’rganish. nazariy qism. dastur kodining biror qismining ko’p marta bajarishi sikl hisoblanadi. dastur kodining qandaydir qismini qandaydir shart asosida bir necha marta bajartirish uchun dasturlashda sikldan foydalaniladi. agar shart rost bo’lsa sikl davom qiladi. aks holda to’xtatiladi. agar shart hamisha rost bo’lsa bunday sikl cheksiz sikl deb ataladi. c++ da siklni tashkil qilish uchun while, do while va for operatorlari mavjud. siklni o’rganish uchun eng oson misol bu 1 dan n gacha natur...

This file contains 21 pages in DOCX format (130.2 KB). To download "takrorlanuvchioperatorlar", click the Telegram button on the left.

Tags: takrorlanuvchioperatorlar DOCX 21 pages Free download Telegram