Calculati cmmdc-ul nr. naturale a si b.

Calculati cmmmc-ul nr. naturale a si b.

#include<iostream>

#include<iostream>

using namespace std;

using namespace std;

int main(){

int main(){

unsigned int a,b;

unsigned int a,b,p;

cin>>a>>b;

cin>>a>>b;

while(a!=b)

while(a!=b)

p=a*b;

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

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

else b=b-a;

else b=b-a;

cout<<"cmmdc= "<<a;

cout<<"cmmmc= "<<p/a;

return 0;}

return 0;}

Calculati suma cifrelor numarului nN.

Calculati produsul cifrelor numarului nN.

#include<iostream>

#include<iostream>

using namespace std;

using namespace std;

int main(){

int main(){

unsigned int n, s=0;

unsigned int n, p=1;

cin>>n;

cin>>n;

while(n!=0){

while(n!=0){

s=s+n%10;

p=p*(n%10);

n=n/10;}

n=n/10;}

cout<<"suma= "<<s;

cout<<"produs= "<<p;

return 0;}

return 0;}
Numarati cifrele numarului natural n.

#include<iostream>
using namespace std;

while(n!=0){k++;
n=n/10;}

int main(){unsigned int n, k=0;

cout<<"nr_cifre= "<<k;

cin>>n;

return 0;}

Suma divizorilor numarului n

Verificati daca n e perfect(6=1+2+3)

#include<iostream>

#include<iostream>

using namespace std;

using namespace std;

unsigned int main(){

int main(){

int i,n,s=0;

unsigned int i,n,s=0;

cin>>n;

cin>>n;

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

for(i=1; i<=n/2; i++)

if (n%i==0) s=s+i;

if (n%i==0) s=s+i;

cout<<s;

if(s==n) cout<<"perfect";else cout<<"nu";

return 0;}

return 0;}

Produsul divizorilor numarului n

Numarul divizorilor numarului n

#include<iostream>

#include<iostream>

using namespace std;

using namespace std;

int main(){

int main(){

unsigned int i,n,p=1;

unsigned int i,n,k=0;

cin>>n;

cin>>n;

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

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

if (n%i==0) p=p*i;

if (n%i==0) k++;

cout<<p;

cout<<k

return 0;}

return 0;}

Verificati daca n este prim.

#include<iostream>
using namespace std;
int main(){
unsigned int i,n,prim=1;
cin>>n;
if (n<2) prim=0;
for(i=2; i<=n/2 && prim =1; i++)
if (n%i==0) prim=0;
if (prim==1) cout<<n<<este prim;
else cout<<n<<nu este prim;
return 0;}
Calculati "oglinditul"numarului nN.

verificati daca n e palindrom

ex. x =123 inv=321

ex. x =121 inv=121

#include<iostream>

#include<iostream>

using namespace std;

using namespace std;

int main(){

int main(){

unsigned int n, inv=0;

unsigned int n,cn, inv=0;

cin>>n;

cin>>n; cn=n

while(n!=0){

while(cn!=0){

inv=inv*10+n%10;

inv=inv*10+cn%10;

n=n/10;}

cn=cn/10;}

cout<<"oglindit= "<<inv;

if (n==inv) cout<<"palindrom";else cout<<"nu";

return 0;}

return 0;}