Scribd
Upload
23 views

Probleme C++

Uploaded by

Claudia Radu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
23 views

Probleme C++

Uploaded by

Claudia Radu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1.

// sa se stearga elementele prime din vector

#include <iostream>

#include<cmath>

using namespace std;

int main()

{ int n,v[101],p,prim=1,i,j,k;

cin>>n;

for (i=0;i<n;i++) cin>>v[i];

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

prim=1;

for (j=2;j<=sqrt(v[i]) && prim;j++) if (v[i]%j==0)prim=0;

if(v[i]!=1 && prim ){

for (k=i;k<n-1;k++) v[k]=v[k+1];

n=n-1;i=i-1;

cout<<endl;

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

cout<<v[i]<<" ";

return 0; }
2.// sa se elimine toate elementele din vector care sunt prime cu ultimul element

// 2 numere sunt prime intre ele daca cmmdc pentru cele 2 numere este 1

#include <iostream>

using namespace std;

int main()

{ int n,v[101],i,k,d,a,b;

cin>>n;

for (i=0;i<n;i++) cin>>v[i];

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

a =v[i]; b=v[n-1];

while(a!=b) if(a>b)a=a-b;

else b=b-a;

d=a;

if(d==1 ){

for (k=i;k<n-1;k++) v[k]=v[k+1];

n=n-1;

i=i-1;

}
cout<<endl;

for (i=0;i<n-1;i++) cout<<v[i]<<" ";

return 0;

3.// sa se stearga elementele cu 3 divizori ( se sterg patratele perfecte de numere prime din
vector)

#include <iostream>

using namespace std;

int main()

{ int n,v[101],i,j,nrdiv=0,k;

cin>>n;

for (i=0;i<n;i++) cin>>v[i];

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

nrdiv=0;

for(j=1;j<=v[i];j++)if(v[i]%j==0)nrdiv++;

if(nrdiv==3 ){

for (k=i;k<n-1;k++) v[k]=v[k+1];

n=n-1;

i=i-1;

cout<<endl;

for (i=0;i<n;i++) cout<<v[i]<<" ";


return 0;}

4.// sa se stearga elementele cu nr impar de divizori

#include <iostream>

using namespace std;

int main()

{ int n,v[101],i,j,nrdiv=0,k;

cin>>n;

for (i=0;i<n;i++) cin>>v[i];

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

nrdiv=0;

for(j=1;j<=v[i];j++)if(v[i]%j==0)nrdiv++;

if(nrdiv%2==1 ){

for (k=i;k<n-1;k++) v[k]=v[k+1];

n=n-1;

i=i-1;

cout<<endl;

for (i=0;i<n;i++) cout<<v[i]<<" ";

return 0;}

You might also like