Algoritmi fundamentali

INTERSCHIMBAREA A DOUA SUMA CIFRELOR UNUI NUMAR MEDIA ARITMETICA A CIFRELOR PRIME CU 3
NUMERE ZECIMALE
#include <iostream> #include <iostream> #include <iostream>
using namespace std; using namespace std; #include <iomanip>
long a,b; long n,s; using namespace std;
int main() int main() long n,nr,s;
{ { float ma;
cin a>>b; cin>>n; int main()
a=a+b; s=0; {
b=a-b; while(n!=0) cin>>n;
a=a-b; { nr=0;
cout<<a<<" "<<b; s=s+n%10; s=0;
//long aux; aux=a; a=b; b=aux; n/=10; while(n!=0)
//a=a*b b=a/b a=a/b; } {
//swap(a,b); cout<<s; if(n%10==2||n%10==3||n%10==5||n%10==7)
return 0; return 0; {
} } s=s+n%10;
nr++;
}
n=n/10;
}
ma=(10*s)/nr;
cout<fixed<<setprecision(3)<<ma;
return 0;
}

OGLINDITUL NUMARUL DE CIFRE DINTR UN CIFRA MAXIMA

NUMAR CARE APARTIN (A,B)
#include <iostream> #include <iostream> #include <iostream>
using namespace std; using namespace std;
long a,s; long a, b, x, nr, aux; using namespace std;
int main() long n, maxi=0;
int main() { int main()
{ cin>>a>>b; {
cin>>a; if(a>b) cin>>n;
while(n) {aux=a; while(n)
{ a=b; {
s=n%10+s*10; b=aux;} if(n%10>maxi)
n/=10; cin>>x; maxi=n%10;
} while(x) n/=10;
cout<<s; { }
return 0; if(x%10>a && x%10<=b) cout<<maxi;
} nr++; return 0;
x/=10;} }
cout<<nr;
return 0;
}
NR PALINDROM ELIMINAREA CIF. IMPARE CREAREA UNUI NR CU CIFRELE PRIME ALE LUI
N
#include <iostream> #include <iostream> #include <iostream>
using namespace std; using namespace std; using namespace std;
long n, m, ogl; long a, b, p=1; long n, p=1, b;
int main() int main() int main()
{cin>>n; { {
m=n; cin>>a; cin>>n;
while (n) while(a) while(n)
{ { {
ogl=ogl*10+n%10; if(a%10%2!=0) if(n%10==2||n%10==3||n%10==5||n%10==7)
n/=10; a/=10; {
} else b=n%10*p+b;
if (ogl==m) { p*=10;
cout<<"nr palindrom"; b=a%10*p+b; }
else p*=10; n/=10;
cout<<"nu"; a/=10; }
return 0; } cout<<b;
} } return 0;
cout<<b; }
return 0;
}
CONVERSIA DIN BAZA 10 IN BAZA DIN BAZA 2 IN BAZA 10 BAZA MINIMA A UNUI NR
2
#include <iostream> #include <iostream> #include <iostream>
using namespace std; using namespace std; using namespace std;
long n, p=1, nr; long n, p=1, nr; long n, maxi=0;
int main() int main() int main()
{cin>>n; {cin>>n; {
while(n) while(n) cin>>n;
{ {nr=n%10*p+nr; while(n)
nr=n%2*p+nr; p*=2; {
p*=10; n/=10; if(n%10>maxi)
n/=2; maxi=n%10;
} } n/=10;
cout<<nr; cout<<nr; }
return 0; return 0; cout<<maxi+1;
} } return 0;

VERIFICAM DACA TOATE CIFRELE VERIFICAM DACA TOATE VERIFICAM DACA PARITATEA CIFRELOR
SUNT PARE CIFRELE SUNT EGALE ALATURATE ESTE DIFERITA
#include <iostream> #include <iostream> #include <iostream>
using namespace std; using namespace std; using namespace std;
long n, ok; long n, ok, uc; long n, ok;
int main() int main() int main()
{ { {cin>>n;
cin>>n; cin>>n; ok=1;
ok=1; ok=1; while(n>9)
while(n) uc=n%10; {
{ while(n!=0&&ok==1) if(n%2==n/10%2)
if(n%2!=0) { ok=0;
ok=0; if(n%10!=uc) n/=10;
n/=10; ok=0; }
} n/=10; if(ok==1)
if(ok==1) } cout<<"da";
cout<<"da"; if(ok==1) else
else cout<<"da"; cout<<"nu";
cout<<"nu"; else return 0;
return 0; cout<<"nu"; }
} return 0;
}
//
cin>>n;
ok=1;
uc=n%10;
while(n>9)
{if(n%10!=n/10%10)
ok=0;
n/=10;
}
if(ok==1)
cout<<"da";
else
cout<<"nu";
return 0;
}

C.M.M.D.C C.M.M.M.C VERIFICARE NR PRIM

#include <iostream> #include <iostream> #include <iostream>
using namespace std; using namespace std; using namespace std;
long a, b; long a, b, p, r; long a, x, i;
int main() int main() int main()
{cin>>a>>b; { {cin>>a;
while(a!=b) cin>>a>>b; x=1;
{ p=a*b; for(i=1; i<=a/2; i++)
if(a>b) while(b) {
a-=b; { if(a%i==0)
else r=a%b; x++;
b-=a; a=b; }
} b=r; if(x==2 && a>=2)
cout<<a; } cout<<"Da";
return 0; cout<<p/a; else
} return 0; cout<<"Nu";
// } return 0;
#include <iostream> }
using namespace std; //
long a, b; #include <iostream>
int main() using namespace std;
{cin>>a>>b; long a, ok, i;
while(a!=b) int main()
{ {cin>>a;
if(a>b) ok=1;
a-=b; for(i=2; i*i<=a; i++)
else {
b-=a; if(a%i==0)
} ok=0;
cout<<a; }
return 0; if(ok==1 && a>=2)
cout<<"Da";
} else
cout<<"Nu";
return 0;
}

NR DIVIZORI SIRUL LUI FIBONACCI DESCOMPUNEREA IN FACTORI PRIMI

#include <iostream> #include <iostream> #include <iostream>
using namespace std; using namespace std; using namespace std;
long a, nr, i; long n, a, b, c, i; long n, p, d;
int main() int main() int main()
{ { {cin>>n;
cin>>a; cin>>n; d=2;
nr=0; a=1; while(n>1)
for(i=1; i<=a; i++) b=1; {
{ if(n==1) if(n%d==0)
if(a%i==0) cout<<a; {p=0;
nr++; else while(n%d==0)
} if(n==2) {p++;
cout<<nr; cout<<a<<" "<<b; n=n/d;
return 0; else }
} {cout<<a<<" "<<b<<" "; cout<<d<<" "<<p<<endl;
// for(i=3; i<=n; i++) }
#include <iostream> { d++;
using namespace std; c=a+b; if(d*d>n)
long a, nr, i; a=b; d=n;
int main() b=c;
{ cout<<c<<" "; }
cin>>a; }} return 0;
nr=2; }
for(i=2; i<=a/2; i++)
{
if(a%i==0) return 0;
nr++; }
}
cout<<nr;
return 0;
}
//
#include <iostream>
using namespace std;
long a, nr, i;
int main()
{
cin>>a;
nr=0;
for(i=1; i*i<a; i++)
{
if(a%i==0)
nr+=2;
}
if(i*i==a)
nr++;
cout<<nr;
return 0;
}

SUMA FACTORI PRIMI SUMA PUTERILOR FACTORILOR

PRIMI
#include <iostream> #include <iostream>
using namespace std; using namespace std;
long n, d, s; long n, d, p, s;
int main() int main()
{cin>>n; {cin>>n;
d=2; d=2;
while(n>1) while(n>1)
{ {
if(n%d==0) if(n%d==0)
{s+=d; {
while(n%d==0) p=0;
n/=d; while(n%d==0)
} {
d++; n/=d;
if(d*d>n) p++;
d=n;} }
cout<<s; s+=p;
return 0; }
} d++;
if(d*d>n)
d=n;
}
cout<<s;
return 0;
}