Muhammad al‑xorazmiy nomidagi toshkent axborot texnologiyalari universiteti nurafshon filiali kurs: 2 Guruh: 210-22 Bajardi: Qudratov Og’abek Tekshirdi: Karimov Sodiqjon

using namespace std;

int main() {
float a, b, c;
cout << "\n\n\t\tUchburchakning tomonlarini kiriting:"<cout << "1-tomoni a= "<cin >> a;
cout << "2-tomoni b= ";
cin >> b;
cout << "3-tomoni c= ";
cin >> c;
float kvIldiz;
kvIldiz=sqrt(a);
cout<<"Kvadrat tenglama ildizini hisoblash:"<cout<<"kvIldiz= "<float p, S;
p = (a + b + c) / 2;
cout << "Biz dastlab yarim premetrini p=(a+b+c)/2 shu formulaga asosan topib olamiz: " << endl;
S = sqrt(p * (p - a) * (p - b) * (p - c));
cout << "Geron formulasiga asosan yuzasini C++ tilida S=sqrt(p*(p-a)*(p-b)*(p-c)) funksiyasi orqali topamiz:"
<< endl;
cout<<"S= "<return 0;
}
2. Massiv elementlarini tartiblashtirish. Matrisa maksimal, minimal elementini aniqlash algoritmi. Matrisalarni ko’paytirish dasturi. Amallar tartibini baholash.
#include
#include

using namespace std;

int main() {
int m,n;
cout<<"1-massiv o'lchami m=";
cin>>m;
cout<<"2-massiv o'lchami n=";
cin>>n;
int massiv[m][n];
for (int i = 0; i for (int j = 0; j < n; ++j) {
massiv[i][j]=rand()%10;
cout<}
cout<}
int maxx=massiv[0][0];
int minn=massiv[0][0];
for (int i = 0; i for (int j = 0; j if (maxxmaxx=massiv[i][j];
}
if (minn>massiv[i][j]){
minn=massiv[i][j];
}
}
}
cout<<"massivning min elementi: min="<cout<<"massivning max elementi: max="<return 0;
}


3.Taqribiy integrallash usullari. Zaruriy aniqlikni ta’minlovchi qadamini tanlash

#include