Professional Documents
Culture Documents
Cel Mai Mare Divisor Comun: #Include Using Namespace STD
Cel Mai Mare Divisor Comun: #Include Using Namespace STD
n=i3 + j3
i<
j<
i [1, max]
j [i, max]
max = | |
n = i13 + j13 = i23 + j23
Sa se scrie in pseudocod:
#include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
int m=a, n=b;
while(a!=b)
{
if(a>b) {a=a-b;}
else{b=b-a;}
}
cout<<"cel mai mare divizor comun "<<a;
cout<<"cel mai mic multiplu comun "<<(m*n)/a;
}
#include <iostream>
using namespace std;
int main()
{
int dc,a,b;
cin>>a>>b;
dc=cmmdc(a,b);
cout<<"cel mai mare divizor comun "<<dc<<endl;
cout<<"cel mai mic multiplu comun "<<(a*b)/dc;
}
Palindrom
Citeste m<n, afla toate numerele palindrom intre m si n
#include <iostream>
using namespace std;
int palindrom(int n)
{
int orig=n, inv=0;
while(n)
{
inv=inv*10+i%10;
n=n/10;
}
return (orig==inv);
}
int main()
{
int m,n,i;
cin>>m>>n
for(i=m;i<n;i++)
{
if(palindrom(i)) {cout<<i<<endl;}
}
return 0;
}
superpalindrom
n=12321= palindrom
daca n2= palindrom=>n=superpalindrom
#include <iostream>
using namespace std;
int palindrom(int n)
{
int orig=n, inv=0;
while(n)
{
inv=inv*10+i%10;
n=n/10;
}
return (orig==inv);
}
int main()
{
long m,n,i;
cin>>m>>n
for(i=m;i<n;i++)
{
if(palindrom(i))
{
if(palindrome(i*i)) { cout<<i<<" "<<i*i<<endl;}
}
}
return 0;
}
int main()
{
int nr,sum=0;
cin>>nr;
while(nr)
{ sum=sum+nr%10;
nr=nr/10;
}
return 0;
}
Inverseaza numarul:
#include <iostream>
using namespace std;
int main()
{
int nr,inv=0;
cin>>nr;
while(nr)
{ inv=inv*10+nr%10;
nr=nr/10;
}
cout<<inv;
return 0;
}
Do while
#include <iostream>
using namespace std;
int main()
{
int nr,sum=0,i=1;
cin>>nr;
do
{ sum=sum+i;
i=i+1;
} while(i<nr);
cout<<sum;
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int nr,fm,i=2;
cin>>nr;
do
{ fm=0;
while(nr%i==0)
{ fm++;
nr/=i;
}
if(fm) cout<<i<<"la puterea "<<fm<<endl;
i++;
}while(nr!=1);
return 0;
}