RECURSIV

SUMA CIFRELOR
#include <iostream.h>
int s(int n)
{
if(n==0) return 0;
else return n%10 + s(n/10);
}
int main()
{
int n;
cout<<"n=";cin>>n;
cout<<"suma cifrelor: "<<s(n);
}
CMMDC
#include<iostream.h>
int cmmdc(int a,int b)
{
if(a==b) return a;
else if (a>b) return cmmdc(a-b,b);
else return cmmdc(a,b-a);
}
void main()
{
int a,b;
cout<<"a=";cin>>a;
cout<<"b=";cin>>b;
cout<<"cmmdc: "<<cmmdc(a,b);
}

ITERATIV

#include<iostream.h>
int main()
{
int s=0;
long d,x;
cout<<"x=";cin>>x;
d=x;
while(d)
{
s=s+d%10;
d=d/10;
}
cout<<"s="<<s;
}

#include<iostream.h>
int main()
{
int a,b,r;
cout<<"a=";cin>>a;
cout<<"b=";cin>>b;
while(a!=b)
{
if(a>b) a=a-b;
else b=b-a;
}
cout<<"cmmdc: "<<b;
}

CMMDC EUCLID
#include<iostream.h>
void main()
{
int a,b,r;
cout<<"a=";cin>>a;
cout<<"b=";cin>>b;
r=a%b;
while(r)
{
a=b;
b=r;
r=a%b;
}
cout<<"cmmdc: "<<b;
}
SUMA DIVIZORILOR

#include<iostream.h>
int sumadiv(int n, int i)
{
if(n==1) return 1;
else if(d<2) return 1+n;
if (n%d==0) return sumadiv (n, d-1) + d;
else return sumadiv (n, d-1)
}
int main()
{
int n;cin>>n;
cout<< sumadiv(n, n/2);
}

#include<iostream.h>
int sumadiv(int n, int i)
{
if(n==1) return 1;
else if(d>n/2) return 1+n;
else if (n%d==0) return sumadiv (n, d+1) + d;
else return sumadiv (n, d+1)
}
int main()
{
int n;cin>>n;
cout<< sumadiv (n,1);
}

NUMAR PRIM
#include<iostream.h>
int prim(int n,int d)
{
if(n<=1) return 0;
else if (d<2) return 1;
else if(n%d==0) return 0;
else return prim(n,d-1);
}
int main()
{
Int n; cin>>n;
If(prim(n,n/2)==1) cout<<"este prim";
else cout<<"nu este prim";
}

CIFRA MINIMA
#include<iostream.h>
int cifmin (int n)
{
if(n<10) return n;
else
{
Int m= nrmin (n/10)
If (m< n%10) return m;
Else return (n%10);
}
int main()
{
Int n; cin>>n;
cout<<nrmin (n);
}

int prim(int x)
{
for(int i=2;i<=x/2;i++)
{
if(i % x == 0) return 0;
}
return 1;
}

#include<iostream.h>
int cifmin(int n)
{
int min=9;
if(n%10<min)
{
min=n%10;
n=n/10;
}
}
Int main ()
{ cin>>n;
cout<<"min="<<min;
}

FACTORIAL

Int factorial(int n)
{if(n>=2) return factorial(n-1)*n;
Else return 1;}
int main()

Int factorial (int n)

{ p=1;
for (int i=1; i<=n; i++)
{return p= p*I;}

int main()
{cout<<factorial(n) ;}

{cout<<factorial(n) ;}

PUTEREA LA CARE APARE B IN DECOMPUNEREA LUI N

Int putere (int n, int p)
{ if (n%p!=0) return 0;
Else return putere (n/p,p) +1;
}
Int main ()
{ int n,p; cin >>n>>p;
Cout << putere (n,p);
}

Int putere (int n, int p)

{ While (n!=1)
{p=0
while (n%p==0)
{p=p+1;
n=n/d;
return p;}
}
return 0;
}
Int main ()
{int n,p; cin >>n>>p;
Cout << putere (n,p);}