Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- void min_max()
- {
- int n,a[1001],i,min,max;
- cin>>n;
- for(i=1; i<=n; i++)
- cin>>a[i];
- min=a[1];
- max=a[1];
- for(i=1; i<=n; i++)
- {
- if(a[i]<min)
- min=a[i];
- if(a[i]>max)
- max=a[i];
- }
- cout<<min<<' '<<max<<'\n';
- }
- void suma_cifre()
- {
- //suma cifrelor
- int x,S=0;
- cin>>x;
- while(x!=0)
- {
- S=S+x%10;
- x=x/10;
- }
- cout<<S;
- }
- void oglindit()
- {
- //OGLINDITUL
- int x,o=0;
- cin>>x;
- while(x)
- {
- o=o*10+x%10;
- x=x/10;
- }
- cout<<o;
- }
- void palindrom()
- {
- //Palindrom
- int x,o=0,y;
- cin>>x;
- y=x;
- while(x)
- {
- o=o*10+x%10;
- x=x/10;
- }
- if(o==y)
- cout<<"PALINDROM";
- else
- cout<<"NU E PALINDROM";
- }
- void algoritm_euclid()
- {
- //ALGORITM EUCLID
- int a,b,r;
- cin>>a>>b;
- while(b!=0)
- {
- r=a%b;
- a=b;
- b=r;
- }
- cout<<a;
- }
- void numar_prim()
- {
- //NUMAR PRIM
- int d,n,prim=1;
- cin>>n;
- for(d=2; d*d<=n; ++d)
- if(n%d==0)
- prim=0;
- if(prim)
- cout<<"NUMAR PRIM";
- else
- cout<<"NUMAR NEPRIM";
- }
- void compunerea_unui_numar_din_cifrele_sale()
- {
- //COMPUNEREA UNUI NUMAR DIN CIFRELE SALE
- int x=0,n,c,i;
- cin>>n;
- for(i=1; i<=n; ++i)
- {
- cin>>c;
- x=x*10+c;
- }
- cout<<x;
- }
- int main()
- {
- int t;
- cin>>t;
- if(t==1) min_max();
- else if(t==2) suma_cifre();
- else if(t==3) oglindit();
- else if(t==4) palindrom();
- else if(t==5) algoritm_euclid();
- else if(t==6) numar_prim();
- else if(t==7) compunerea_unui_numar_din_cifrele_sale();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement