Funksiyalarga massivlarni uzatish

FUNKSIYALARGA MASSIVLARNI UZATISH

1) Funksiyaga char turidagi satrlarni uzatish. 3 ta matn berilgan. Ushbu matndagi so’zlar miqdorini aniqlash funksiyasini yozing.

#include

#include

using namespace std;

int WordCount(char S[])

{

int k=1;

if(strlen(S)==0)

return 0;

for(int i=0; i

if(S[i]==' ')

k++;

return k;

}

int main()

{

char S[100];

for(int i=1; i<=3; i++)

{

cout<<"1-matnni kiriting: ";

cin.getline(S,100);

cout<

}

}
2) N ta elementdan iborat massiv berilgan. Ushbu massivning elementlari yig’indisini topish funksiyasini yozing.

#include

#include

using namespace std;

int Summa(int n, int *A)

{

int S=0;

for(int i=0; i

{

S+=A[i];

}

return S;

}

int main()

{

int n;

cin>>n;

int *A = new int[n];

for(int i=0; i

cin>>A[i];

cout<

return 0;

}

3) K ta massiv berilgan. Har bir massivning eng katta elementlarini topib beruvchi funksiya yozing.
#include

#include

using namespace std;

int MaxMassiv(int n, int *A)

{

int max1=A[0];

for(int i=1; i

{

if(max1

max1=A[i];

}

return max1;

}

int main()

{

int K;

cout<<"K="; cin>>K;
int n; //Massiv elementlari soni

for(int i=1; i<=K; i++)

{

cout<>n;

int *A = new int[n];

for(int j=0; j

{

cin>>A[j];

}

cout<

delete[] A;

}

return 0;

}
4) N ta elementdan iborat massiv berilgan. Ushbu massivning elementlarini k marta oshiradigan funksiya yozing

#include

#include

using namespace std;

void MultiArray(int n, int *A, int k)

{

for(int i=1; i

{

A[i]=k*A[i];

}

}

int main()

{

int n, k;

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

int *A=new int [n];

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

for(int i=0; i

{

cin>>A[i];

}

cout<<"Dastlabki massiv:"<

for(int i=0; i

{

cout<

}

cout<

MultiArray(n, A, k);

cout<<"Keyingi massiv:"<

for(int i=0; i

{

cout<

}

return 0;

}

N sonini tub ko’paytuvchilarga ajratish

#include

using namespace std;

bool TubSon(int k)

{

int S=0;

for(int i=1; i<=k; i++)

if(k%i==0)

S++;

if(S==2)

return true;

else return false;

}

int main()

{

int n;

cin>>n;

int i=2;

while(n>1)

{

if(TubSon(i))

{

if(n%i==0)

{

cout<

n=n/i;

}

else i++;

}

else

i++;

}

return 0;

}

DINAMIK MASSIVLARDAN FOYDALANIB DASTURLAR YOZISH

3) Bir o’lchamli massiv berilgan. Ushbu massivda faqat bir marta qatnashgan elementlar sonini aniqlab, shuncha elementdan iborat yangi massiv hosil qiling.

#include

#include

using namespace std;

int main()

{

int n;

cin>>n;

int A[n], n1=0, k=0;

srand(time(NULL));

for(int i=0; i

{

A[i]=rand()%100;

cout<

}

cout<

for(int i=0; i

for(int j=0; j

{

if(A[i]==A[j])

k++;

}

if(k==1)

{

cout<

n1++;

}

k=0;

}

cout<

int *B = new int[n1];

return 0;

}

2. Massivning barcha tub son bo’lgan elementlarini yangi massivga yozing.

#include

#include

using namespace std;

bool TubSon(int a)

{

int S=0;

for(int i=1; i<=a; i++)

if(a%i==0)

S++;

if(S==2)

return true;

else

return false;
}

int main()

{

int n;

cin>>n;

int A[n], a, n1=0;

srand(time(NULL));

for(int i=0; i

{

A[i]=rand()%100;

cout<

a=A[i];

if(TubSon(a))

n1++;

}

cout<

int *B = new int[n1];

int j=0;

for(int i=0; i{

a=A[i];

if(TubSon(a))

{

B[j]=A[i];

j++;

}

}

for(int i=0; i
cout<