DETERMINAREA MAXIMULUI

DETERMINAREA MINIMULUI

DESCOMPUNEREA ÎN FACTORI PRIMI

CMMDC

NUMĂR PRIM
DETERMINAREA DIVIZORILOR PROPRII

INVERSUL UNUI NUMĂR

#include<iostream>
using namespace std;
int main()
{
int n,inv=0,c,copie;
cin>>n;
copie=n;
while(n!=0)
{
c=n%10;
inv=inv*10+c;
n=n/10;
}
cout<<inv;
return 0;
}

PALINDROM
#include<iostream>
using namespace std;
int main()
{
int n,inv=0,c,copie;
cin>>n;
copie=n;
 while(n!=0)
{
c=n%10;
inv=inv*10+c;
if(copie==inv) cout<<"Palindrom";
else cout<<"Nu";
return 0;
}

CĂUTAREA BINARĂ (DIVIDE ET IMPERA)

#include <iostream>
using namespace std;
int v[]={1,5,7,8,9,11,13,14,16,20},n=10;
int cauta(int li, int ls, int x)
{
int m;
if(li<=ls)
{
m=(li+ls)/2;
if(x==v[m]) return m;
else if(x<v[m]) return cauta(li, m-1, x);
else return cauta (m+1,ls,x);
}
else return -1;
}
int main()
{
int x,m;
cout<<"x=";cin>>x;
m=cauta(0,n-1,x);
if(m==-1) cout<<"Nu l-am gasit.";
else cout <<"Gasit pe pozitia "<<m<<".";
return 0;
}
INTERCLASAREA A DOI VECTORI
#include <iostream>
using namespace std;
int main()
{
int i,j,k,a[100],b[100],c[100],m,n;
cout<<"n=";cin>>n;
cout<<"m=";cin>>m;
for(i=0;i<=n-1;i++)
{
cout<<"a["<<i<<"]=";
cin>>a[i];
}
for(j=0;j<=m-1;j++)
{
cout<<"b["<<j<<"]=";
cin>>b[j];
}

i=0;j=0;k=0;
while(i<=n-1 && j<=m-1)

if(a[i]<b[j])
{
c[k]=a[i];
i++;
k++;
}
else if (b[j]<a[i])
{
c[k]=b[j];
j++;
k++;
}
else
 {
c[k++]=a[i++];
j++;
}

while(i<=n-1)
{
c[k]=a[i];
i++;
k++;
}
while (j<=m-1)
{
c[k]=b[j];
j++;
k++;
}
for (i=0;i<=k-1;i++)
{
cout<<c[i]<<" ";
}
return 0;
}