************ problema 6 **************
#include <iostream>
using namespace std;
int main()
{
int n, i, num, pal;
cout << "n= "; cin >> n;
int v[n], j;
cout << "introdu " << n << " numere naturale \n";
for (i=0; i<n; ++i) cin >> v[i];
for (i=0; i<n; ++i)
{
num=v[i];
pal=0;
while (num)
{
pal=pal*10+num%10;
num/=10;
}
if (pal==v[i])
{
for (j=i; j<n-1; ++j)
v[j]=v[j+1];
--n;
}
}
cout << "vectorul modificat, in lipsa de palindroame: \n";
for (i=0; i<n; ++i)
cout << v[i] << " ";
}
***************** problema 7 ***************
#include <iostream>
using namespace std;
int main()
{
int n, i, num;
cout << "n= "; cin >> n;
int v[2*n], j;
cout << "introdu " << n << " numere naturale \n";
for (i=0; i<n; ++i)
{
cin >> num;
v[i]=num;
if (num%2==0)
{
for (j=n; j>i+1; --j)
v[j]=v[j-1];
++n;
++i; v[i]=num;
}
}
cout << "vectorul modificat, cu dublarea parelor: \n";
for (i=0; i<n; ++i)
cout << v[i] << " ";
}
**************** problema 8 ***********
#include <iostream>
using namespace std;
int main()
{
int n, i, num;
cout << "n= "; cin >> n;
int v[2*n], s;
cout << "introdu " << n << " numere naturale \n";
for (i=0; i<n; ++i)
{
cin >> num;
v[i]=num;
s=0;
while (num)
{
s=s+num%10;
num/=10;
}
++i; v[i]=s;
++n;
}
cout << "vectorul modificat, cu inserarea sumei cifrelor pt fiecare element: \n";
for (i=0; i<n; ++i)
cout << v[i] << " ";
}
************* problema 9 **********
#include <iostream>
using namespace std;
int prim(int n)
{
int p=1;
if (n==0 || n==1) p=0;
else
{
if (n>2)
{
if (n%2==0) p=0;
else
{
for (int d=3; d*d<=n && p==1; d+=2)
{
if (n%d==0) { p=0; break; }
}
}
}
}
return p;
}
int main()
{
int m, i, j=-1, num;
cout << "m= "; cin >> m;
int v[m], u[m];
cout << "introdu " << m << " numere naturale \n";
for (i=0; i<m; ++i)
{
cin >> num;
v[i]=num;
if (prim(num)) {++j; u[j]=num; }
}
cout << "vectorul primelor: \n";
for (i=0; i<=j; ++i)
cout << u[i] << " ";
}
*************** problema 10 *************
#include <iostream>
using namespace std;
int prim(int n)
{
int p=1;
if (n==0 || n==1) p=0;
else
{
if (n>2)
{
if (n%2==0) p=0;
else
{
for (int d=3; d*d<=n && p==1; d+=2)
{
if (n%d==0) { p=0; break; }
}
}
}
}
return p;
}
int main()
{
int n;
cout << "n= "; cin >> n;
int v[n], i, num;
if (n==1) { v[0]=2; }
else
{
num=3; v[0]=2;
i=0;
while (i<n)
{
if (prim(num)) { ++i; v[i]=num; }
num+=2;
}
}
cout << "vectorul cu primele " << n << " numere prime \n";
for (i=0; i<n; ++i)
cout << v[i] << " ";
}
