4. Dinamik ma‟lumotlar tuzilmasi haqida ma’lumot bering

158. Butun son berilgan. Quyidagilarni tekshiring:
1) uning juftligini;
2) oxirgi raqami 7 bilan tugashini;
3) juft raqam bilan tugashini;Ushbu shartlarini tekshirish dasturini tuzing.
159. Aylana radiusi va kvadrat tomoni berilgan. Qaysi shaklning yuzasi kata
ekanligini aniqlang va necha marta katta ekanligini chop eting.
160. Ikki xonali son berilgan. Aniqlang: 1) Uning birinchi yoki ikkinchi raqami katta ekanligini Uning raqamlari tengligini

#include
using namespace std;
int main(){
int n,a,b;
cout<<"n="; cin>>n;
a=n/10;
b=n%10;
if(a>b)
cout<<"a="<else if(acout<<"b="<else if(a==b)
cout<<"a=b";
return 0;
}

161. Uch xonali son berilgan. Quyidagilarni aniqlang:a) Qaysi raqami katta?b) Son 2 ga ham 3 ga ham 4 ga ham bir vaqtda bo‟linadimi? Uning raqamlari yig’indisi 5 ga karralimi?

#include
using namespace std;
int main(){
int n,a,b,c,max;
cout<<" Uch xonali son kiriting n="; cin>>n;
c=n%10;
b=(n%100)/10;
a=n/100;
if(a>b) max=a;
else max=b;
if(c>max)max=c;
cout<if(n%12==0)
cout<<"Bu son 2 ga ham 3 ga ham 4 ga ham bir vaqtda bolinadi "<else cout<<"Bu son 2 ga ham 3 ga ham 4 ga ham bir vaqtda bo'linmaydi"<if((a+b+c)%5==0)
cout<<"yig'indisi 5ga karrali"<else
cout<<"yig'indisi 5ga karrali emas"<return 0;
}

162. To‟rt xonali son berilgan. Quyidagilarni aniqlang:a) Uning birinchi ikkita raqamlari yig‟indisi, uning oxirgi ikkita raqamlarining yig‟indisiga tengmi
Uning raqamlari yig‟indisi uchga karralimi?

#include
using namespace std;
int main(){
int n,a,b,c,d,max;
cout<<" To'rt xonali son kiriting n="; cin>>n;
d=n%10;
c=(n%100)/10;
b=(n%1000)/100;
a=n/1000;
if((a+b)==(c+d))
cout<<"(a+b)==(c+d)"<else
if ((a+b)!=(c+d))
cout<<"(a+b) teng emas (c+d)"<if((a+b+c+d)%3==0)
cout<<"Uning raqamlari yig'indisi uchga karrali"<else
cout<<"3 ga karrali emas";
return 0;}

163. Uchta haqiqiy son berilgan. Ulardan manfiymaslarini kvadratga,
mafiylarini to‟rtincha darajaga ko‟tarish dasturini tuzing.

#include
using namespace std;
int main(){
float a,b,c;
cout<<"a="; cin>>a;
cout<<"b="; cin>>b;
cout<<"c="; cin>>c;
if(a>0)
cout<<"a ning kvadrati="<else
cout<<"a ning to'rtincha darajasi"<if(b>0)
cout<<"b ning kvadrati="<else
cout<<"b ning to'rtincha darajasi="<if(c>0)
cout<<"c ning kvadrati="<else
cout<<"c ning to'rtincha darajasi="<return 0;}

164.Uchburchakning ikkita burchagi (gradusda) berilgan. Bunday uchburchak mavjudligini, agar mavjud bo‟lsa uning to‟g‟ri burchakli ekanligin aniqlang

#include
using namespace std;
int main(){
float a,b,c;
cout<<"a="; cin>>a;
cout<<"b="; cin>>b;
if(a+b==90)
cout<<"To'g'ri burchakli uchburchak";
else
cout<<"To'g'ri burchakli uchburchak emas";
return 0;
}

165.Bir biriga teng bo‟lmagan x va y haqiqiy sonlar berilgan. Bu ikkita
sondan kichigini ularning yig‟indisining yarmi bilan, kattasini esa –
ularning ko‟paytmasini ikkilanganligi bilan almashtiring.

#include
using namespace std;
int main(){
float x,y;
cout<<"x="; cin>>x;
cout<<"y="; cin>>y;
if(x>y)
x=(x+y)/2;
cout<<"x="<
if (x>y)
y=(x*y)*2;
cout<<"y="<
return 0;
}

166. a, b, c sonlar orasidan manfiylarini sonini hisoblang.

#include
using namespace std;
int main(){
int a,b,c;
cout<<"a="; cin>>a;
cout<<"b="; cin>>b;
cout<<"c="; cin>>c;
if(a>0&&b>0&&c<0||a>0&&b<0&&c>0||a<0&&b>0&&c>0)
cout<<2;
else
if(a>0&&b<0&&c<0||a<0&&b<0&&c>0||a<0&&b>0&&c<0)
cout<<1;
else
if(a<0&&b<0&&c<0||a<0&&b<0&&c<0||a<0&&b<0&&c<0)
cout<<3;
else
if(a>0&&b>0&&c>0)
cout<<"Barchasi musbat son";
return 0;
}

167.Guruh ikkita paketga solingan. Birinchi paket og‟irligi – m kg,
ikkinchisiniki – n kg. Quyidagilarni aniqlovchi dastur tuzing:
a) Qaysi paket og‟irroq – birinchisimi yoki ikkinchisi; b) Eng og‟ir paket massasini.

#include
using namespace std;
int main(){
int m,n;
cout<<"m="; cin>>m;
cout<<"n="; cin>>n;
if(m>n)
cout<<"Birinchisi og'irroq massasi=>"<else
cout<<"Ikkkinchisi og'irroq massasi=>"<return 0;
}

168. Berilgan (m,n) koordinatali nuqtadan y=ax2+bx+c funksiyaning grafigini
O’tishini aniqlaydigan dastur tuzing..

#include
using namespace std;
int main(){
float a,b,c,x,n,y;
cin>>a>>b>>c>>x>>n;
y=a*x*x+b*x+c;
if(y==n){
cout<<"Grafikdan o'tadi";
}
else cout<<"Grafikdan o'tmaydi";
return 0;
}

169. 1 A 3 Ikkita natural son berilgan. Ularning o‟rta arifmetigi butun sonligini aniqlang

#include
#include
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
c=(a+b)%2;
if(c==0)
cout<<"butun son";
else cout<<"butun son emas";
return 0;
}

170. Uchburchakning uchta a, b va c tomonlari berilgan. Bu uchburchak
To’g’ri burchakli uchburchak va qaysi tomoni gipotenuza ekanligini aniqlang.

#include
#include
using namespace std;
int main()
{
float a,b,c;
cin>>a>>b>>c;
if(c==sqrt(a*a+b*b) or b==sqrt(a*a+c*c) or a==sqrt(b*b+c*c)){
cout<<"To'g'ri burchakli uchburchak va ";
if(a==sqrt(b*b+c*c))
cout<<"a tomoni gipotenuza";
if(b==sqrt(a*a+c*c))
cout<<"b tomoni gipotenuza";
if(c==sqrt(b*b+a*a))
cout<<"c tomoni gipotenuza";
}
else cout<<"To'g'ri burchakli uchburchak emas";
return 0;
}

171.Uchta musbat a, b va c sonlar berilgan. Ular arifmetik yoki geometrik
progressiya ketma-ketligini tashkil etishini aniqlang. Agar tashkil etsa, u
holda progressiyaning ayirmasi yoki bo‟linmasini toping.

#include
#include
using namespace std;
int main(){
float a,b,c,d,q;
x:
cin>>a>>b>>c;
d=b-a;
q=b/a;
if(b-a==c-b or b/a==c/b){
if(b-a==c-b){
cout<}
else cout<}
else goto x;
}

172.Ikkita butun son berilgan. Ularning ikkalasi ham juftligini yoki ikkalasi
ham toqligini yoki ulardan biri juftligi, qaysinisi toqligini aniqlang.

#include
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a%2==0 && b%2==1 || a%2==1 &&b%2==0){
cout<<"Biri toq "<<"Biri juft";
}
else
if(a%2==1 &&b%2==1){
cout<<"Ikkalasi ham toq";
}
else{
cout<<"Ikkalasi ham juft";
}
return 0;

173.Uchta sonlardan eng kattasining va eng kichigining yig‟indisini topadigan
dastur tuzing.

#include
using namespace std;
int main(){
float a,b,c;
cout << "a="; cin >> a;
cout << "b="; cin >> b;
cout << "c="; cin >> c;
cout<return 0;
}

174.To’rtta A1(x1,y1), A2(x2,y2), A3(x3,y3), A4(x4,y4) nuqtalar berilgan. Ular
parallelogrammning uchlari bo‟lishini aniqlang.

#include
using namespace std;
int main() {
int x1,x2,x3,x4,y1,y2,y3,y4;
cout<<"x1="; cin>>x1;
cout<<"x2="; cin>>x2;
cout<<"x3="; cin>>x3;
cout<<"x4="; cin>>x4;
cout<<"y1="; cin>>y1;
cout<<"y2="; cin>>y2;
cout<<"y3="; cin>>y3;
cout<<"y4="; cin>>y4;
x2=x2-x1;
y1=y1-y2;
x4=x4-x3;
y3=y3-y4;
if(x2==x4 && y1==y3) cout<<"Parallelogramm uchlari";
else cout<<"Parallelogramm uchlari emas";
return 0;
}

175.a, b, c sonlar berilgan. Agar a≤b≤c bajarilsa, bu sonlarni ikkilantiring,
agar bajarilmasa ularning absolyut qiymatlari bilan almashtiring.
176. Ixtiyoriy a, b lar uchun ax3+bx=0 tenglamani yechadigan dasturni yozing.
Barcha haqiqiy yechimlar topilsin
177.Berilgan uchta son asosida, ulardan ixtiyoriy ikkitasining yig‟indisi
musbat ekanligini aniqlovchi dastur tuzing.
178. Union-Find ma‟lumotlar strukturasi. 179.Dasturiy ta'minot komponentasi boshqa dasturiy ta'minot qismlariga taqdim etadigan funksionallikni nima aniqlaydi.
180.Matn berilgan. Matnda eng qisqa so‟z va eng uzun so‟z uzunliklarini
toping.
181.Knut Morris-Pratt algoritmi dasturini tuzish.
182.Butun sonli B(n) bir o‟lchamli massivning n-elementini o‟chirib o‟rniga 0kiritish algoritmini tuzing.
183. 10 dan 301 gacha barcha toq sonlar yig‟indisini hisoblash dasturini
tuzing.

#include
using namespace std;
int main() {
int s=0;
for(int i=10; i<=301; i++) {
if(i%2==1) {
s+=i;
//cout< }
}
cout< return 0;
}

184. 1 A 8 1 dan 150 gacha bo‟lgan oraliqda 2 ga va 5 ga bo‟linadigan sonlarni
yig‟indisini hisoblash dasturini tuzing.

#include
using namespace std;
int main() {
int s=0;
for(int i=10; i<=301; i++) {
if(i%2==1) {
s+=i;
cout< }
}
cout< return 0;
}

1

2