Dasturlash 1 dan Abdimajidov Sardorbekning 7-labaratoriya ishi 1-jadval,2-nomer


Download 15.96 Kb.
Sana11.12.2020
Hajmi15.96 Kb.
#165137
Bog'liq
7-labaratoriya (Abdimajidov Sardorbek)


Dasturlash 1 dan Abdimajidov Sardorbekning 7-labaratoriya ishi

1-jadval,2-nomer

#include

using namespace std;

void PowerA234(float a)

{

cout<

cout<

cout<

}

int main()



{

float a,b,c,d,e;

cout<<"1-sonni kiriting:"; cin>>a;

cout<<"2-sonni kiriting:"; cin>>b;

cout<<"3-sonni kiriting:"; cin>>c;

cout<<"4-sonni kiriting:"; cin>>d;

cout<<"5-sonni kiriting:"; cin>>e;

system("cls");

void (*A234)(float);

A234=PowerA234;

A234(a);

A234(b);


A234(c);

A234(d);


A234(e);
}
2-jadval,2-nomer

#include

using namespace std;

int main()

{

int n;


cout<<"n="; cin>>n;

int *a;


a=new int[n];

for(int i=0;i

{

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



}

int *s,s1=0;

for(int i=0;i

{

if(a[i]%2==0) s1+=a[i];



}

s=&s1;


cout<<"Natija:"<<*s;

}

3-jadval,3-nomer

#include

using namespace std;

int main()

{

float *x;



int k;

cout<<"k="; cin>>k;

x=new float[k];

for(int i=0;i

{

cout<<"x["<>x[i];



}

// a)


float max=x[0]; int i1=0;

for(int i=0;i

{

if(max

max=x[i]; i1=i;

}

cout<<"Xmax => "<<" x["<

// b)

for(int i=0,j=k-1;i

{

x[j-1]=x[i];



}

for(int i=0;i

{

cout<<"x["<

}

// d)


for(int n=1,k=2; k{

x[k]=(x[k-1]+x[k]+x[k+1]);



}

for(int i=0;i

{

cout<<"x["<

}

// e)


for(int i=3;i{

x[i-3]=x[i];



}

for(int i=0;i

{

cout<<"x["<

}

}

}


4-jadval,2-nomer

#include

using namespace std;

int MaxNum(int n,int a[])

{

int max=a[0],t=0;



for (int i=0; i

{

if(max

max=a[i]; t=i;

}

}



return t;

}

int main()



{

int na,nb,nc;

cout<<"na="; cin>>na;

cout<<"nb="; cin>>nb;

cout<<"nc="; cin>>nc;

int *a,*b,*c;

a=new int[na];

b=new int[nb];

c=new int[nc];

for(int i=0; i

{

cout<<"a["<

}

for(int i=0; i

{

cout<<"b["<

}

for(int i=0; i

{

cout<<"c["<

}

cout<<"MAX(a)="<

cout<<"MAX(b)="<

cout<<"MAX(c)="<
}

Download 15.96 Kb.

Do'stlaringiz bilan baham:




Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©fayllar.org 2024
ma'muriyatiga murojaat qiling