Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int nrCifre (int);
- int invers (int);
- int cmmdc(int, int);
- int main()
- {
- int pb; cout<<"Introdu nr pb."; cin>>pb;
- switch (pb){
- case 1:{
- /*1. Se citeste un numar natural, n, si o cifra, c. Sa se genereze si sa se afiseze numarul obtinut prin eliminarea tuturor aparitiilor cifrei c din numarul dat.*/
- int n; cout<<"n="; cin>>n;
- int c; cout<<"c="; cin>>c;
- int ind=nrCifre(n);
- int v[ind];
- for (int i=n, j=0; i; i/=10, j++)
- v[j]=i%10;
- for (int i=0; i<nrCifre(n); i++){
- if (v[i]==c){
- for (int k=i; k<ind; k++)
- v[k]=v[k+1];
- ind--;
- }
- }
- int nr_nou=0;
- for (int i=0; i<ind; i++){
- nr_nou=nr_nou*10+v[i];
- }
- cout<<"Nr format este: "<<invers(nr_nou);
- break;
- }
- case 2:{
- /*2. Se citeste un numar natural, nenul, n, si apoi un sir de n numere naturale. Sa se afiseze cel mai mare divizor comun al numerelor citite.*/
- int n; cout<<"n="; cin>>n;
- cout<<"Introdu nr:"<<endl;
- int cmmdc1, x, y;
- cin>>x>>y;
- cmmdc1=cmmdc(x,y);
- for (int i=2; i<n; i++){
- cin>>x;
- cmmdc1=cmmdc(cmmdc1, x);
- }
- cout<<"CMMDC este: "<<cmmdc1;
- break;
- }
- case 3:{
- /*3. Se citesc doua numere naturale a si b. Sa se verifice daca ele sunt termeni consecutivi ai sirului lui Fibonacci.*/
- int a, b;
- cout<<"a="; cin>>a;
- cout<<"b="; cin>>b;
- //a<b
- int nr1=1, nr2=1, nr3, v[100];
- int ind, ok=0;
- for (int i=3, j=0; nr3<a; i++, j++){
- nr3=nr1+nr2;
- if (a==nr3)
- ok=1;
- v[j]=nr3;
- ind=j;
- nr1=nr2;
- nr2=nr3;
- }
- if (a==1 & b==1)
- cout<<"DA";
- else{
- if (ok==1 && v[ind]+v[ind-1]==b)
- cout<<"DA";
- else
- cout<<"BUBA";
- }
- break;
- }
- }
- return 0;
- }
- int nrCifre (int n){
- int k=0;
- for (int i=n; i; i/=10)
- k++;
- return k;
- }
- int invers (int n){
- int k=0;
- while (n){
- k=k*10+n%10;
- n/=10;
- }
- return k;
- }
- int cmmdc(int a, int b)
- {
- int r;
- r = a % b;
- while(r)
- {
- a=b;
- b=r;
- r=a%b;
- }
- return b;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement