Está en la página 1de 12

//se citesc 2 nr a, b. sa se determine suma cifrelor nr a care nu-l divid pe nr b.

ex: a=184465709, b=18, se


va afisa 28
#include <iostream>
int a, b, s;
using namespace std;

int main()
{ cin>>a>>b;
while(a!=0)
{ if(a%10!=0)
if(b%(a%10)!=0)
s=s+a%10;
a=a/10;

cout<<s;
}

//2) sa se afiseze nr prime din intervalul inchis [a,b]


#include <iostream>
using namespace std;
int x, d, ok, a, b;
int main()
{
cin>>a>>b;
for(x=a; x<=b; x++)
{ ok=1;
for(d=2; d<=x/2; d++)
if(x%d==0)
ok=0;
if(x==1)
ok=0;
if(ok==1)
cout<<x<<" ";

}
}
//sa se determine cmmmc a 2 nr a si b
#include <iostream>
int a, b, aux, bux;
using namespace std;

int main()
{ cin>>a>>b;
aux=a;//20
bux=b;//36
while(a!=b)
if(a>b)
a=a-b;
else b=b-a;
//a, b==4;
cout<<aux*bux/a;
}

#include <iostream>
int x, nr;
using namespace std;

int main()
{ cin>>x;
while(x!=0)
{if(x%5==0)
nr++;
cin>>x;
}
cout<<nr;

//se citeste un nr n sa se afiseze nr de divizori primi ai dr n


#include <iostream>

using namespace std;


int n, d, nr;
int main()
{ cin>>n;
d=2;
while(n!=1)
{ if(n%d==0)
{ nr++;
while(n%d==0)
n=n/d;
}
else d++;
} cout<<nr;}

//se citesc 2 nr a, b. sa se determine suma cifrelor nr a care nu-l divid pe nr b. ex: a=184465709, b=18, se
va afisa 28
#include <iostream>
int a, b, s;
using namespace std;

int main()
{ cin>>a>>b;
while(a!=0)
{ if(a%10!=0)
if(b%(a%10)!=0)
s=s+a%10;
a=a/10;

cout<<s;
}

//1) sa se afiseze nr prime pana la n


#include <iostream>
using namespace std;
int x, n, d, ok;
int main()
{
cin>>n;
for(x=1; x<=n; x++)
{ ok=1;
for(d=2; d<=x/2; d++)
if(x%d==0)
ok=0;
if(x==1)
ok=0;
if(ok==1)
cout<<x<<" ";

}
}

///Se citesc de la tastatura n numere intregi. Sa se afiseze perechile de numere consecutive cu


proprietatea ca primul numar este inversul celui de-al doilea.
///n=6

#include <iostream>

using namespace std;


int x, y, n, auy, inv, i;
int main()
{
cin>>n>>x;
for(i=2; i<=n; i++)
{
cin>>y;
auy=y;
inv=0;
while(auy!=0)
{
inv=inv*10+auy%10;
auy=auy/10;
}
if(x==inv)
cout<<x<<" "<<y<<endl;
x=y;
}
}

//sa se afiseze primele n nr care contin acelasi nr de cifre a si b


//a=2, b=4, 248462
#include <iostream>

using namespace std;


int n, a, b, ca, cb, aux, x, k;
int main()
{
cin>>n>>a>>b;
while(k<n)
{aux=x;
ca=0;
cb=0;
while(aux!=0)
{
if(aux%10==a)
ca++;
if(aux%10==b)
cb++;
aux=aux/10;
}
if(ca==cb)
{
cout<<x<<" ";
k++;
}
x++;
}

//sa se afiseze primele n patrate perfecte


#include <iostream>
#include <cmath>
using namespace std;
int n, x, k;
int main()
{
cin>>n;
x=1;
while(k<n)
{
if(sqrt(x)==(int)sqrt(x))
{
cout<<x<<" ";
k++;
}
x++;
}
}

//se citesc n nr, sa se afiseze primul nr palindrom.


//n=10 17 21 121 8 11 13 333 77 241 93
#include <iostream>

using namespace std;


int u, i, p, n, inv, aux, x;
int main()
{ cin>>n;
for(i=1; i<=n && p==0; i++)
{ cin>>x;
aux=x;
inv=0;
while(aux!=0)
{inv=inv*10+aux%10;
aux=aux/10;

}
if(inv==x && p==0)

p=x;

}
cout<<p;
}

//sa se afiseze primele nr nr palindrom de cel putin 4 cifre


#include <iostream>

using namespace std;


int x, n, k, aux, inv;
int main()
{
cin>>n;
x=1000;
while(k<n)
{
aux=x;
inv=0;
while(aux!=0)
{
inv=inv*10+aux%10;
aux=aux/10;
}
if(inv==x)
{
cout<<x<<" ";
k++;
}
x++;
}
}

//sa se genereze primele n nr formate din 4 cifre pt care primele doua cifre formeaza un nr prim si
ultimele doua cifre formeaza un patrat perfect
#include <iostream>
#include <cmath>

using namespace std;


int n, x, aux, bux, ok, k, d;
int main()
{
cin>>n;
x=1000;
while(k<n && x<=9999)
{
aux=x/100;
ok=1;
for(d=2; d<=aux/2; d++)
if(aux%d==0)
ok=0;

bux=x%100;
if(sqrt(bux)==(int)sqrt(bux) && ok==1)
{
cout<<x<<" ";
k++;

}
x++;
}
if(k<n)
cout<<"nu mai am numere";

#include <fstream>

using namespace std;


ifstream f("date.in");
ofstream g("date.out");
int i, j, n;
char c;
int main()
{
f>>n;

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


{
for(j=1; j<=(n-i)*2; j++)
g<<" ";

for(j=1; j<=2*i-1; j++)


g<<"* ";
g<<endl;
}
for(i=1; i<=n; i++)
{
for(j=1; j<=2*i; j++)
g<<" ";

for(j=1; j<=(n-i)*2-1; j++)


g<<"* ";
g<<endl;
}
return 0;
}
VECTORI
///se citeste un vector din fisier. Sa se afiseze
///elementele in ordine inversa
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int v[100], n, i;
int main()
{

f>>n;
for(i=1; i<=n; i++)
f>>v[i];
for(i=n; i>=1; i--)
g<<v[i]<<" ";
return 0;
}

///se citeste un vector cu n elemente. sa se determine media aritmetica a elementelor din vector
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int v[100],n,i,s;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
s=s+v[i];
g<<(float)s/n;
return 0;
}

///se citeste un vector cu n elemente


///sa se determine media aritmetica a elementelor pare de pe pozitii impare din vector
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int v[100],i,n,s,nr;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
if(v[i]%2==0&& i%2!=0)
{
s=s+v[i];
nr++;
}
g<<(float)s/nr;
return 0;
}

#include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int v[100],i,n,s,nr;
int main()
//Se citeste un vector cu n elemente. Sa se determine valoarea minima si dde cate ori apare ea si
valoarea maxima din vector;
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int v[100],i,n, mini = 99999999, maxi, nr;
int main()
{
f >>n;
for (i = 1; i<= n; i++)
f >> v[i];
for (i = 1; i<= n; i++)
{
if (v[i] < mini)
{
mini = v[i];
nr = 1;
}
else if (v[i] == mini)
nr ++;
if (v[i] > maxi)
maxi = v[i];
}
g << mini<<", "<<nr<<endl;
g<< maxi;
}

/// Se citeste un vector cu n elemente. Sa se determine daca oricare 2 elemente alaturate au paritati
diferite.
#include <fstream>
using namespace std;
ifstream f("main.in");
ofstream g("main.out");
int v[100], n, i, ok;
int main()
{
f>>n;
ok = 1;

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


f>>v[i];

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


{
if(v[i] % 2 == v[i + 1] % 2)
ok = 0;
}

if(ok == 1)
g<<"Da, au paritati diferite";
else g<<"Nu";
}

/// Se citeste un vector cu n elemente. Sa se determine daca oricare 2 elemente alaturate au semne
diferite.
#include <fstream>
using namespace std;
ifstream f("main.in");
ofstream g("main.out");
int v[100], n, i, ok;
int main()
{
f>>n;
ok = 1;

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


f>>v[i];

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


{
if(v[i] * v[i + 1] > 0)
ok = 0;
}

if(ok == 1)
g<<"Da, au semne diferite";
else g<<"Nu";
}

También podría gustarte