1-Masala. Massivning birinchi va oxirgi nol elementlari orasida joylashgan elementlar yig’indisini hisoblash dasturi

1-Masala.Massivning birinchi va oxirgi nol elementlari orasida joylashgan elementlar yig’indisini hisoblash dasturi

#include

using namespace std;

int main(){

int a[100], i, n, s = 0;

cout << "n = ";

cin >> n;

for (i = 1; i <= n; i++){

cout << " a["<cin >> a[i];

}

for (i = 2; i <= n-1; i++)

{

s = s + a[i];

}

cout << "Yig'indisi'" << " ";

cout << s << endl;

system("pause");

return 0;

}
Natija:

2-Masala. Berilgan bir o’lchovli massivda avval juft o’rinda, so’ngra toq o’rnidagi elementlari joylashtirish dasturini tuzing.

#include

using namespace std;

int main(){

int a[100], i, n, s = 0;

cout << "n = ";

cin >> n;

for (i = 1; i <= n; i++){
cout << " a["<

cin >> a[i];

}

for (i = 1; i <= n; i++)

{

if(i % 2==0)

cout <<"Massivning juft o'rinda turgan elementi" << endl<

else

cout << "Massivning toq o'rinda turgan elementi"<

}
system("pause");

return 0;

}

Natijasi:

3-Masala: Kvadrat tenglamaning yechimlarini topish dasturini tuzing

#include

#include

using namespace std;

int main(){

int a, b, c, x;

float D, x1, x2;

cout << "a = ";

cin>>a;

cout << "b = ";

cin>>b;

cout << "c = ";

cin>>c;

D = sqrt(b * b - 4 * a * c);

if(D > 0)

{

x1 = (-b + D)/ (2 * a);

x2 = (-b - D)/ (2 * a);

cout<<"Tenglama ikkita yechimga ega" <<" "<< x1 <

}
if(D == 0)

{

x1=(-b) / (2 * a);

cout << "Tenglama bitta yechimga ega" <<" "<< x1 <

}

else

cout << "Tenglama yechimga ega emas";
return 0;





}

Natijasi

4-Masala:Geometrik va arifmetik progessiyaning yig’indisini hisoblovchi dastur tuzing

#include

#include

using namespace std;

int main(){

int S, n, d,a1,a3;

cout << "n = ";

cin >> n;

cout << "a1 = ";

cin >> a1;

cout <<" a3 = ";

cin >> a3;

d = (a3 - a1) / 2;
S = ((2*a1+d*(n-1))*n) / 2;

cout << "Arifmetik progerssiyaning n ta hadi yig'indisi"<

return 0;



}

Natijasi:


4-Masala Geometrik Progressiyaning n ta hadi yig’indisi

#include

#include

using namespace std;

int main(){

int S, b1, q, n, b2;

cout << "n = ";

cin >> n;

cout << "b1 = ";

cin >> b1;

cout << "b2 = ";

cin >> b2;

q = b2/b1;

if(b1!=0 && q!=1){

S = b1*(1-pow(q,n))/(1-q);

cout << "Geometrik progerssiyaning n ta hadi yig'indisi"<

}

else

cout << "Kiritgan sonlaringizdan geometrik progressiya hosil bo'lmaydi" <<" ";

return 0;





}

Dastur natijasi:


5-Masala Berilgan a va b sonlar uchun, EKUB va EKUK ni hisoblang

1. 
   EKUB
   

#include

#include

using namespace std;

int main()

{

int a,b;

cout<<"a=";

cin>>a;

cout<<"b=";

cin>>b;

while(a!=b){

if(a>b)

a=a-b;

else

b=b-a;

}

cout <<"natija"<

system("pause");

return 0;





}

Natija:


5-Masala. Berilgan a va b sonlar uchun EKUK ni hisoblang.

EKUK

#include

#include

using namespace std;

int main(){

int a, b, n,s;

cout << " a = ";

cin >> a;

cout << " b = ";

cin >> b;

s = a * b;

while(a!=b){

if(a > b)

a = a - b;

else

b = b - a;

}

cout << "Ikki sonning EKUKi"<

system("pause");

return 0;

}

Dastur natijasi:

6-Masala. Sutkaning k-sekundi o’tib bormoqda. Ayni paytda necha soat, necha minut va necha sekund o’tganligini aniqlang.

#include

#include

using namespace std;

int main(){

int k, a, a1,b,b1;

cout<<"k = ";

cin >> k;

a = k % 60;

a1 = k / 60;

b = a1 % 60;

b1 = a1 / 60;

cout << " sutkaning \n"<

system("pause");

return 0;

}

Dastur natijasi:



7-Masala. Berilgan besh xonali sonning polindrom son ekanligini aniqlovchi dastur tuzing( masalan, 12321)

#include

using namespace std;

int main()

{

long n,s=0,t=10000,k=0,m;



cin>>n;

m=n;

while(n>0)

{



k=n%10;

s+=t*k;

t/=10;

n/=10;



}



if(s-m==0) cout<<"polindrom";

else

cout<<"polindrom emas";



}

Dastur natijasi:



8-Masala. Uch xonali sonlar ichida raqamlari yig’indisi berilgan 17 soniga teng bo’lgan sonlar miqdorini aniqlovchi dastur tuzing.

#include

#include

using namespace std;

int main()

{

int a, b, c, d,e,f;

cout << "a = ";

cin >> a;

b = a / 100;

c = a / 10;

d = c % 10;

e = a % 10;

f = b + d + e;

if( f % 17 == 0 )

cout << "Berilgan uch xonali sonlar raqamlari yig'indisi 17 ga qoldiqsiz bo'linadi"<< endl;

else

cout << "Berilgan uch xonali sonlar raqamlari yig'indisi 17 ga bo'linmaydi"<< endl;
system("pause");

return 0;





}

Dastur natijasi:



9-Masala Berilgan uchta nuqta: A(x1,y1), B(x2,y2), C(x3,y3) uchburchakning uchlarini tashkil qilish yoki tashkil qilmasligini aniqlash dasturini tuzing

#include

#include

using namespace std;

int main(){

int x1, x2,x3, y1,y2,y3;

float a,b,c;



cout << "x1 = ";

cin >> x1;

cout << "x2 = ";

cin >> x2;

cout << "x3 = ";

cin >> x3;

cout << "y1 = ";

cin >> y1;

cout << "y2 = ";

cin >> y2;

cout << "y3 = ";

cin >> y3;

a=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));

b=sqrt((x3-x1)*(x3-x1)+(y3-y1)*(y3-y1));

c=sqrt((x3-x2)*(x3-x2)+(y3-y2)*(y3-y2));

if( (a + b ) > c||(a + c ) > b||(b + c ) > a)

cout << "uchburchak qurish mumkin" << endl;

else

cout << "Uchburchak qurib bo'lmaydi" << endl;

system("PAUSE");

return 0;



}

Dastur natijasi:


10-Masala: Berilgan n sonning raqamlar yig’indisini hisoblash dasturini tuzing

#include

#include

using namespace std;

int main(){

int S, n;

cout << "n = ";

cin>>n;

while(n > 0){

S = S + (n % 10);

n = n / 10;



}

cout <<" Berilgan sonning raqamlar yig'indisi\n" << S << endl;

system("PAUSE");

return 0;







}

Dastur natijasi:


11-Masala: Berilgan x uchun quyidagi funksiyani hisoblash dasturini tuzing

#include

#include

using namespace std;

int main(){

int x;

double y;

cout << "x = ";

cin >> x;

if( x>=-5){



y = 4 * x * x + 2 * x - 19;

cout << "Natija\n"<

}

else

if(x < -5){

y = -2 * x /(-4 * x + 1);

cout << " Natija\n" << y << endl;



}

system("Pause");

return 0;



}

Dastur natijasi:



12-Masala:

#include

#include

using namespace std;

int main(){

int x;

double y;

cout << "x = ";

cin >> x;

if( x > 3)

y = 2 * x * x - 3 * x - 9;

else

y = 12/(2 * x * x + 1);

cout << " Natija\n" << y << endl;


system("Pause");

return 0;



}

Dastur natijasi:



13-Masala:

#include

#include

using namespace std;

int main(){

float x;

float y;

cout << "x = ";

cin >> x;

if( x <= 0){

y = 0;

cout << y << endl;

}
else

if(x > 0 && x <=1)

{

y = x;

cout << y << endl;

}

else

if( x > 1){

y = x * x * x * x;

cout << y << endl;

}
system("Pause");

return 0;

}

Dastur natijasi:

14-Masala:

#include

#include

using namespace std;

int main(){

float x;

float y;

cout << "x = ";

cin >> x;

if( x >= 0 && x <= 1){

y = x * x - x;

cout << y << endl;

}
else

if(x > 1)

{

y = 1 / (x * x + 4 * x);

cout << y << endl;



}

system("Pause");

return 0;



}

Dastur natijasi:



15-Masala: Berilgan n sonning tub yoki tub emasligini aniqlovchi dastur tuzing.

#include

#include

using namespace std;

int main()

{

int n, s, i;

cout << "n = ";

cin >> n;

for(i = 1; i<=n; i++){

if(n % i == 0)

s++;

}

if(s == 2)

cout<<"Berilgan son tub son"<

else

cout<<"Berilgan son tub emas"<

system("PAUSE");

return 0;

}

Dastur natijasi:



16-Masala: Berilgan n sonning faktralini hisoblovchi dastur tuzing

#include

#include

using namespace std;

int main()

{

int n, i, p = 1;

cout << "n = ";

cin >> n;

for(i = 1; i<=n; i++)

p = p * i;

cout<


system("PAUSE");

return 0;

}

Dastur natijasi:




17. Berilgan n soni uchun quyidagi yig’indini hisoblovchi dastur tuzing.

S = _ +……+_

#include

#include

using namespace std;

int main()

{

int n, i;

float s, p ;

cout << "n = ";

cin >> n;

s = 0;

p = 1;

for(i = 1; i<= n; i++){



p = p * i;

s = s + sqrt(p);
}

cout<

system("PAUSE");

return 0;

}

Dastur natijasi:



18-Masala: Berilgan n soni uchun quyidagi ko’paytmani hisoblovchi dasturini tuzing.

_

#include

#include

using namespace std;

int main()

{

int n, i;

double S, P;

cout << "n = ";

cin >> n;

S = 0;

P = 1;

for(i = 2; i<= n ; i++){

S = 1- (1 / i);

P = P * S;



}

cout<


system("PAUSE");

return 0;

}

19.Masala: Berilgan n soni uchun quyidagi ko’paytmani hisoblovchi dastur tuzing



#include

#include

using namespace std;

int main()

{

int n, i;

double s, p, k;

cout << "n = ";

cin >> n;

k = 1;

for(i = 1; i<= n ; i++){

p = 1 / pow(2,i);

k = k *( 1- p);



}

cout<

system("PAUSE");

return 0;

}

Dastur natijasi:



20-Masala: Berilgan n soni uchun quyidagi yig’indini hisoblash



#include

#include

using namespace std;

int main(){

int i, n;

double S, p, b ;

cout<<"n = ";

cin >> n;

for(i = 1; i<=n; i++){

p = pow(i,2);

b = 1 / p;

S = S + b;



}

cout << " Yig'indisi \n" << S << endl;

system("Pause");

return 0;

}

Dastur natijasi:


21.Masala: Berilgan massiv elementining o’rta arifmetik qiymatini hisoblang

#include

#include

using namespace std;

int main(){

int a[10], i, n;

float s = 0, p ;

cout << "n = ";

cin >> n;

for(i = 1; i<=n; i++){

cout << "a["<

cin >>a[i];

}

for(i= 1; i<=n; i++){



s = s + a[i];

p = s / n;



}

cout << "Massiv elementlarining o'rta arifmetik qiymati\na[n]="<


system("pause");

return 0;

}

Dastur natijasi:



22-Masala: Berilgan massivning minimum va maksimum elementlarini hisoblash dasturini tuzing

#include

#include

using namespace std;

int main(){

int a[10], i, n, min, max,k;

min = a[0];

max = a[0];

cout << "n = ";

cin >> n;

for(i = 0; i

cout << "a["<

cin >>a[i];

}

for(i= 0; i

if(min > a[i])

min = a[i];

else

max = a[i];
}

cout << "Massivning minimal elementi\n"<

system("pause");

return 0;

}Dastur natijasi:



23-Masala. Berilgan bir xil o’lchamli ikkita massivning skalyar ko’paytmasini hisoblovchi dastur tuzing

#include

#include

using namespace std;

int main(){

int a[30],b[30], i, j,n,m,s=0,k;

cout << "n = ";

cin >> n;

for(i = 1; i<=n; i++){

cout << "a["<

cin >> a[i];

}

for(j = 1; j<=n; j++){

cout << "b["<

cin >> b[j];

}

for(i=1;i<=n; i++){

for(j=1; j<=n;j++)



if(i==j){

k = a[i]*b[j];

}

s = s + k;



}

cout <<"Ikkita massivning sklayar ko'paytmasi\n"<



system("pause");

return 0;

}

Dastur natijasi:



25-Masala. Berilgan massiv elementlarini o’sish va kamayish tartibida saralash dasturini tuzing

#include

using namespace std;

int main(){

long n, i, j;

cin >> n;

long a[n];

for (i = 1; i <= n; i++)

cin >> a[i];

for (i = 1; i < n; i++)

for (j = i + 1; j <= n; j++)

{

if (a[i] > a[j])

{

a[0] = a[i];

a[i] = a[j];

a[j] = a[0];

}

}

for (i = 1; i <= n; i++)

cout << a[i] << " ";

return 0;

} }

// Aks holda if(a[i] < a[j])

Dastur natijasi



26-Masala: Berilgan massivda nechta manfiy va nechta musbat elementlar borligini aniqlovchi dastur tuzing

#include

#include

using namespace std;

int main(){

int a[100], i, n, b,k;

cout << "n = ";

cin >> n;

for(i = 0; i

cout << "a["<

cin >>a[i];

}

for(i= 0; i

if(a[i] > 0)

a[i] = b[k];

k++;

cout << "Massivning musbat elementlar soni\n"<

system("pause");

return 0;

}

Dastur natijasi:
27-Masala: Berilgan massiv manfiy elementlari yig’indisini hisoblovchi dastur tuzing.

#include

#include

using namespace std;

int main()

{

int n, i, a[100], s = 0;

cout << "n = ";

cin >> n;

for(i=1;i<=n;i++)

{

cout << " a["<

cin >> a[i];



}
for(i = 1; i<=n; i++)

{

if(a[i] < 0)

s = s + a[i];
}



cout << "Manfiy elementlari yig'indisi'\n"<

system("PAUSE");

return 0;

}

Dastur natijasi:



28-Masala:Berilgan n*n o’lchamli matrittsaning yordamchi dioganalidan yuqorida joylashgan elementlari yig’indisini hisoblovchi dastur tuzing.

#include

#include

using namespace std;

int main()

{

int n, s = 0, a[100][100];

cin>>n;

for(int i=0; i

for(int j=0;j

cin>>a[i][j];

}

}

for(int i=0;i

for(int j=0;j

s+=a[i][j];

}

cout << "yig'indisi\n"<

system("PAUSE");

return 0;

}

Dastur natijasi:



29-Masala: Berilgan n*n o’lchamli matritsaning bosh dioganalida joylashgan elementlarining yig’indisini hisoblovchi dastur tuzing.

#include

#include

using namespace std;

int main()

{

int n,m, a[20][20],i,j, s = 0;

cout << "n = ";

cin >> n;

cout << "m = ";

cin >> m;

for(i = 1; i<=n;i++)

for(j = 1; j<=m; j++){

cout << "a["<

cin >> a[i][j];

}

for(i=1; i<=n; i++)

for(j=1;j<=m; j++){



if(i-j==0)

s = s + a[i][j];





}



cout << "Matritssaning bosh dioganalida joylashgan elementlari yig'indisi\n"<

system("PAUSE");

return 0;

}

Dastur natijasi:



30-Masala: Berilgan n*n o’lchamli matritssaning birlik matritsa ekanligini aniqlovchi dastur tuzing

#include

#include

using namespace std;

int main(){

int a[10][10],i, j, n, m,s;

cout << "n = ";

cin>>n;

cout<<"m = ";

cin>>m;

bool b = true;

for(int i = 0; i

for(int j = 0; j

cout <<"a["<

cin >>a[i][j];

}



}

for(int i=0; i

for(int j = 0; j

if(a[i][j]!=1){

b = false;

break;

}

}

}

if(b==true)

cout<<"birlik matritssa";

else

cout<<"birlik matritssa emas";

return 0;





}

Dastur natijasi: