////////////////////////////////

/////////////////////////////////

/////////////////////////////////

#include<fstream>
using namespace std;
int n,x[51000],y[51000];
int main()
{
ifstream f("vector.in");
ofstream g("vector.out");
f>>n;
inti,aux;
for(i=1;i<=n;i++)
{
f>>x[i];
y[i]=x[i]%100;
g<<x[i]<<" ";
}
g<<'\n';
//sortarea
int sort=0;
while(sort==0)
{
sort=1;
for(i=1;i<n;i++)
if(y[i]>y[i+1])
{
aux=y[i];
y[i]=y[i+1];
y[i+1]=aux;
aux=x[i];
x[i]=x[i+1];
x[i+1]=aux;
sort=0;
}
}
for(i=1;i<=n;i++)
g<<x[i]<<" ";
return 0;
}
////////////////////////////////
#include<fstream>
using namespace std;
int n,x[10010];
int main()
{
float s=0;
int nr=0;

1|Page

ifstream f("vector.in");
ofstream g("vector.out");
f>>n;
int i,aux;
for(i=1;i<=n;i++)
{
f>>x[i];
if(x[i]%3==0)
{
s+=x[i];
nr++;
}
}
for(i=n;i>=1;i--)
g<<x[i]<<" ";
g<<'\n';
g<<s/nr;
return 0;
}
////////////////////////////////
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
int n,i,a,b,maxx,minn;
freopen("vector.in","r",stdin);
freopen("vector.out","w",stdout);
cin>>n;
cin>>a>>b;
maxx=a; minn=b;
for(i=2;i<=n;i++)
{
cin>>a>>b;
if(a>maxx)
maxx=a;
if(b<minn)
minn=b;
}
int s=0;
if(maxx>minn)
cout<<"Niciun element!";
else
{
for(i=maxx;i<=minn;i++)
s+=i;
cout<<s;
}

2|Page

/////////////////////////////////

return 0;
}
////////////////////////////////

/////////////////////////////////

#include <iostream>
#include<cstdio>
using namespace std;
structelev{
char nume[30];
float media;};
int main()
{
int n,i,t;
elev x[40],aux;
freopen("vector.in","r",stdin);
freopen("vector.out","w",stdout);
cin>>n;
for(i=1;i<=n;i++)
{
cin>>x[i].nume;
cin>>x[i].media;
}
t=0;
while(!t)
{
t=1;
for(i=1;i<n;i++)
if(x[i].media<x[i+1].media)
{
t=0;
aux=x[i];
x[i]=x[i+1];
x[i+1]=aux;
}
}
for(i=1;i<=n;i++)
cout<<x[i].nume<<" "<<x[i].media<<"\n";
return 0;
}
////////////////////////////////
#include <iostream>
#include<cstdio>
using namespace std;

3|Page

/////////////////////////////////

int perfect(int nr)

{
int s=0;
for(int i=1;i<=nr/2;i++)
if(nr%i==0)
s+=i;
return (s==nr);
}
int main()
{
int n,i,x;
int s=0;
freopen("vector.in","r",stdin);
freopen("vector.out","w",stdout);
cin>>n;
for(i=1;i<=n;i++)
{
cin>>x;
if(perfect(x))
s+=x;
}
if(s)
{
cout<<"Exista"<<"\n";
cout<<s;
}
else
{
cout<<"Nu exista"<<"\n";
cout<<"-1";
}
return 0;
}
////////////////////////////////

#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int v[100],i=0,nr=0,max,div=1;
ifstream f("date.in");
while(!f.eof())
{
i++;
f>>v[i];
nr++;
}
f.close();

4|Page

/////////////////////////////////

for(i=1;i<=nr;i++)
{
max=1;
for(int j=1;j<=v[i]/2;j++)
{
if(v[i]%j==0)
div=j;
if(div>max)
max=div;
}
ofstream g("date.out",ios::app);
g<<"Divizorul maxim al elementului "<<v[i]<<" este
"<<max<<endl;
g.close();
}
}
////////////////////////////////

/////////////////////////////////

#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int nxn[100][100],i,n,j,s=0;
fstream f("date.in",ios::in);
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>nxn[i][j];
fstream g("date.out",ios::out);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
s=nxn[i][j]+s;
g<<"linie "<<i<<" ->"<<s<<endl;
s=0;
}
return 0;
}
////////////////////////////////

#include<iostream>
using namespace std;
int n;
long fib ( int n)
{
if( n==0 || n==1)
return 1;
else
return fib(n-1)+fib(n-2);

5|Page

/////////////////////////////////

}
int main()
{
cin>>n ;
cout<<fib(n);
return 0;
}
////////////////////////////////
#include<fstream>
using namespace std;
int a[50][50],b[50],n,i,j,nr,k;
int prim(int x)
{
int i;
for(i=2;i*i<=x;i++)
if(x%i==0)
return 0;
return 1;
}
int main()
{
ifstream f("contur.in");
ofstream g("contur.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(j=1;j<=n;j++)
{
k++;
b[k]=a[1][j];
}
for(i=2;i<=n;i++)
{
k++;
b[k]=a[i][n];
}
for(j=n-1;j>=1;j--)
{
k++;
b[k]=a[n][j];
}
for(i=n-1;i>=2;i--)
{

6|Page

/////////////////////////////////

k++;
b[k]=a[i][1];
}
for(i=1;i<=k;i++)
g<<b[i]<<" ";
g<<"\n";
for(i=1;i<=k;i++)
if(prim(b[i]))
nr++;
g<<nr;
return 0;
}
////////////////////////////////
#include<fstream>
using namespace std;
int a[50][50],n,i,j,x;
int cmmdc(int a, int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
ifstream f("linie.in");
ofstream g("linie.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
{
x=cmmdc(a[i][1],a[i][2]);
for(j=3;j<=n;j++)
x=cmmdc(x,a[i][j]);
g<<x<<" ";
}
return 0;
}

7|Page

10

////////////////////////////////

////////////////////////////////

11

////////////////////////////////

12

////////////////////////////////

#include<iostream>
using namespace std;
int a[50],n,i,nr,inv,x;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
nr=nr*10+a[i]%10;
}
x=nr;
while(nr)
{
inv=inv*10+nr%10;
nr=nr/10;
}
if(inv==x)
cout<<"palindrom";
else
cout<<" nu estepalindrom";
return 0;
}
////////////////////////////////

#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
int fr[26];
int main()
{
char sir[255];
int i,x;
ifstream f("date.in");
f.get(sir,255); f.get();
for(i=0;i<strlen(sir);i++)
{
x=sir[i]-'a';
fr[x]++;
}
for(i=0;i<26;i++)
if(fr[i])
cout<<(char)(i+'a')<<" apare de "<<fr[i]<<" ori "<<endl;
return 0;
}

8|Page

////////////////////////////////

13

////////////////////////////////

#include <iostream>
#include <fstream.h>
#include <string.h>
using namespace std;
int main()
{
char sir1[25],sir2[25],*p;
int ok;
ifstream f("date.in");
cin>>sir1>>sir2;
if(strlen(sir1)==strlen(sir2)) ok=1;
else ok=2;
while(strlen(sir1) && ok)
{p=strchr(sir2,sir1[0]);
if(p)
{strcpy(sir1,sir1+1);
strcpy(p,p+1);}
else ok=0;
}
if(ok) cout<<" sirurile sunt anagrame";
else cout<<"sirurile nu sunt anagrame";
return 1;
}
////////////////////////////////

14

////////////////////////////////

#include<iostream.h>
int suma_poz(int n, int v[])
{
if(n==0) return 0;
else if(v[n-1]>0) return suma_poz(n-1,v)+v[n-1];
else return suma_poz(n-1,v);
}
int verific_ord(int n, int v[])
{
if(n==1) return 1;
else if(v[n-2]<=v[n-1]) return verific_ord(n-1,v);
else return 0;
}
void main()
{int v[50],i;unsigned n;
do {cout<<"n=";cin>>n;} while (n<1 || n>50);
for(i=0;i<n;i++)
cin>>v[i];
cout<<endl;
for(i=0;i<n;i++)

9|Page

cout<<v[i]<<" ";
cout<<"\nSuma componentelor pozitive este "<<suma_poz(n,v);
if(verific_ord(n,v)) cout<<"\nVectorul este ordonat";
else cout<<"\nVectorul nu este ordonat";
}
////////////////////////////////

15

////////////////////////////////

#include<iostream.h>
int nrd(unsigned n,unsigned k)
{ if(n==0) return 0;
else if(n==k) return 1;
else if(n%k==0) return nrd(n,k+1)+1;
else return nrd(n,k+1);
}
void inlocuire(unsigned n, unsigned v[])
{ if(n>0)
{if(nrd(v[n-1],1)!=2)
v[n-1]=nrd(v[n-1],1);
inlocuire(n-1,v);
}
}
void afisare(unsigned n, unsigned v[])
{unsigned i;
cout<<endl;
for(i=0;i<n;i++)
cout<<v[i]<<" ";
}
void main()
{unsigned n,i,v[50];
do {cout<<"n=";cin>>n;} while (n<1 || n>50);
for(i=0;i<n;i++)
cin>>v[i];
afisare(n,v);
inlocuire(n,v);
afisare(n,v);
}
////////////////////////////////

16

////////////////////////////////

#include<iostream.h>
int verific(unsigned n,unsigned c)
{
if(n==0) return 0;
else if(n%10==c) return 1;
else return verific(n/10,c);
}
void afis(unsigned n, unsigned v[], unsigned c)
{
if(n>0)

10 | P a g e

{if(verific(v[n-1],c))
cout<<v[n-1]<<" ";
afis(n-1,v,c);
}
}
void afisare(unsigned n, unsigned v[])
{unsigned i;
cout<<endl;
for(i=0;i<n;i++)
cout<<v[i]<<" ";
}
void main()
{unsigned n,i,v[50],c;
do
{cout<<"n=";cin>>n;}
while (n<1 || n>50);
for(i=0;i<n;i++)
cin>>v[i];
afisare(n,v);
do
{cout<<"cifra: ";cin>>c;}
while (c<1 || c>9);
afis(n,v,c);
}
////////////////////////////////

17

#include<iostream.h>
#include<fstream.h>
void citire(int &n, int a[][20])
{int i,j;
ifstream f("graf.txt");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) a[i][j]=0;
while(!f.eof())
{f>>i>>j;
a[i][j]=a[j][i]=1;
}
f.close();
}
int grad(int n, int a[][20], int nod)
{int i,nr=0;
for(i=1;i<=n;i++)
nr=nr+a[nod][i];
return nr;
}
int complet(int n, int a[][20])
{int i,ok;

11 | P a g e

////////////////////////////////

ok=1;
for(i=1;i<=n;i++)
if(grad(n,a,i)!=n-1) ok=0;
return ok;
}
void muchii(int n,int a[][20])
{int i,j;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(a[i][j]==0)
cout<<endl<<i<<" "<<j;
}
void main()
{int n,a[20][20];
citire(n,a);
if(complet(n,a)) cout<<"\nGraful este complet";
else {cout<<"\nGraful nu este complet";
cout<<"\nPentru a deveni complet trebuie adaugate muchiile:";
muchii(n,a);
}
}
////////////////////////////////

18

#include<iostream.h>
#include<fstream.h>
void citire(int &n, int a[][20])
{int i,j;
ifstream f("graf.txt");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) a[i][j]=0;
while(!f.eof())
{f>>i>>j;
a[i][j]=a[j][i]=1;
}
f.close();
}
int grad(int n, int a[][20], int nod)
{int i,nr=0;
for(i=1;i<=n;i++)
nr=nr+a[nod][i];
return nr;
}
int regulat(int n, int a[][20])
{int i,ok,g;
ok=1;
g=grad(n,a,1);
for(i=2;i<=n;i++)
if(grad(n,a,i)!=g) ok=0;
return ok;

12 | P a g e

////////////////////////////////

}
void main()
{int n,a[20][20],i,nr;
citire(n,a);
if(regulat(n,a)) cout<<"\nGraful este regulat";
else {cout<<"\nGraful nu este regulat";
cout<<"\nNodurile terminale sunt: ";
for(i=1;i<=n;i++)
if(grad(n,a,i)==1) cout<<i<<" ";
nr=0;
for(i=1;i<=n;i++)
if(grad(n,a,i)==0) nr++;
cout<<"\nNumarul de noduri terminale este "<<nr;
}
}
////////////////////////////////

19

////////////////////////////////

#include<iostream.h>
#include<fstream.h>
void citire(int &n, int a[][20])
{int i,j;
ifstream f("graf.txt");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) a[i][j]=0;
while(!f.eof())
{f>>i>>j; a[i][j]=a[j][i]=1; }
f.close();
}
void citire_v(int &m, int v[])
{int i;
cout<<"Nr. componente "; cin>>m;
for(i=1;i<=m;i++) cin>>v[i];
}
int verific_lant(int n,int a[][20],int m,int v[])
{int ok=1,i;
if(v[1]<1 || v[1]>n) ok=0;
else
for(i=2;i<=m;i++)
if(v[i]<1 || v[i]>n) ok=0;
else if(a[v[i-1]][v[i]]==0) ok=0;
return ok;
}
int elementar(int m,int v[])
{int i,j,ok=1;
for(i=1;i<m;i++)
for(j=i+1;j<=m;j++)
if(v[i]==v[j]) ok=0;
return ok;
}

13 | P a g e

void main()
{int n,a[20][20],m,v[20];
citire(n,a);
citire_v(m,v);
if(verific_lant(n,a,m,v))
{cout<<"\nSecventa data formeaza lant in graf";
if(elementar(m,v)) cout<<"\nLantul este elementar";
else cout<<"\nLantul nu este elementar";}
else cout<<"\nSecventa data nu formeaza lant in graf";}
////////////////////////////////

20

////////////////////////////////

#include<iostream>
usingnamespacestd;
intmain()
{
int n,nr,prim=1,ultim=1,i;
cout<<"Dati nr de elemente al seriei: ";
cin>>n;
for(i=0;i<n;i++)
{
cout<<"Dati elementul: ";
cin>>nr;
if(nr%2==0 && prim==1)
prim=nr;
else
if(nr%2==0)
ultim=nr;
}
if(prim!=1 && ultim!=1)
{
cout<<"Primul numar par din serie este: "<<prim;
cout<<"\nUltimulnumar par din serie este: "<<ultim;
}
else
cout<<"Nu exista!";
return 0;
}
////////////////////////////////

21

////////////////////////////////

#include<fstream>
Using namespace std;
int main()
{
int n ,k, pas, i, v[1000], aux, min, poz;
ifstream fin("atestat.in");
ofstreamfout("atestat.out");
//citim prima linie a fisierului
fin>>n>>k;
//citim vectorul din fisier

14 | P a g e

for(i=0;i<n;i++)
fin>>v[i];
//rulam algoritmul de sortare doar pentru primele k minime
for(pas=0;pas<k;pas++)
{
//initializam minimul cu primul element din subvector si ii
retinempozitia
min=v[pas], poz=pas;
//rulam algoritmul de minim pentru restul elementelor si
retinempozitia
for(i=pas+1;i<n;i++)
if(min>v[i])
{
min=v[i], poz=i;
}
//interschimbam primul element din subvector cu elementul care
realizeaza minimul
aux=v[pas], v[pas]=v[poz], v[poz]=aux;
//minimul obtinutilafisam in fisierul de iesire
fout<<v[pas]<<" ";
}
return 0;
}
////////////////////////////////

22

////////////////////////////////

#include<iostream>
using namespace std;
int main()
{
int n, m, i, j, a[100][100];
cout<<"Dati nr de linii si de coloane";
cin>>n>>m;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
a[i][j]=((i>=j)?i:j);//if(i>=j)
= j;
cout<<a[i][j]<<" ";
}
cout<<"\n";
}
return 0;
}

15 | P a g e

a[i][j] = i else

a[i][j]

////////////////////////////////

23

////////////////////////////////

24

////////////////////////////////

#include <fstream>
using namespace std;
int a[20][20],n;
int grad(int x)
{
int j,k=0;
for(j=1;j<=n;j++)
k=k+a[x][j];
return k;
}
int main()
{
int i,j,gasit=0;
ifstream in("graf.in");
ofstream out("graf.out");
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
in>>a[i][j];
for(i=1;i<=n;i++)
if(grad(i)==1)
{
out<<i<<" ";
gasit=1;
}
if(gasit==0)
out<<"Nu exista";
in.close();
out.close();
return 0;
}
////////////////////////////////
#include <fstream>
using namespace std;
int a[20][20],v[20],n;
int grad(int x)
{
int j,k=0;
for(j=1;j<=n;j++)
k=k+a[x][j];
return k;
}
int main()
{
int i,max,m,x,y;
ifstream in("muchii.txt");
ofstream out("grade.txt");

16 | P a g e

in>>n>>m;
for(i=1;i<=m;i++)
{
in>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
for(i=1;i<=n;i++)
v[i]=grad(i);
max=0;
for(i=1;i<=n;i++)
if(v[i]>max)
max=v[i];
for(i=1;i<=n;i++)
if(v[i]==max)
out<<i<<" ";
in.close();
out.close();
return 0;
}
////////////////////////////////

25

////////////////////////////////

#include <fstream>
using namespace std;
int a[20][20],n;
int grad_intern(int x)
{
int j,k=0;
for(j=1;j<=n;j++)
k=k+a[x][j];
return k;
}
int grad_extern(int x)
{
int i,k=0;
for(i=1;i<=n;i++)
k=k+a[i][x];
return k;
}
int main()
{
int i,j;
ifstream in("adiacenta.in");
ofstream out("noduri.out");
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
in>>a[i][j];
for(i=1;i<=n;i++)
if(grad_extern(i)==grad_intern(i))

17 | P a g e

out<<i<<" ";
in.close();
out.close();
return 0;
}
////////////////////////////////

26

////////////////////////////////

#include <fstream>
using namespace std;
int a[20][20],n;
int grad_intern(int x)
{
int j,k=0;
for(j=1;j<=n;j++)
k=k+a[x][j];
return k;
}
int grad_extern(int x)
{
int i,k=0;
for(i=1;i<=n;i++)
k=k+a[i][x];
return k;
}
int main()
{
int i,x,y,gasit=0,m;
ifstream in("arce.txt");
ofstream out("izolate.txt");
in>>n>>m;
for(i=1;i<=m;i++)
{
in>>x>>y;
a[x][y]=1;
}
for(i=1;i<=n;i++)
if(grad_intern(i)==0 && grad_extern(i)==0)
{
out<<i<<" ";
gasit=1;
}
if(gasit==0)
out<<"Nu exista";
in.close();
out.close();
return 0;
}

18 | P a g e

////////////////////////////////

27

////////////////////////////////

#include<fstream.h>
#include<conio.h>
unsigned palin (unsigned nr)
{ unsigned nri,inv ;
nri=nr;
inv=0;
while(nr)
{inv=inv*10+nr%10;
nr=nr/10;
}
return nri==inv;
}
unsigned scifre(unsigned nr)
{unsigned s;
s=0;
while(nr)
{s=s+nr%10;
nr=nr/10;
}
return s;
}
void main()
{
ifstream f("numere.txt");
unsigned nr;
clrscr();
while(f>>nr)
if(palin(nr)&&scifre(nr)%2==0) cout<<nr<<" ";
f.close();
}
////////////////////////////////

28

#include<fstream.h>
#include<conio.h>
unsigned cifre_impare(unsigned nr)
{unsigned c,da=1;
while(nr&&da)
{
c=nr%10;
if(c%2==0) da=0;
nr=nr/10;
}
return da;
}
void main()
{
ifstream f("numere.txt");

19 | P a g e

////////////////////////////////

unsigned nr,k;
clrscr();
k=0;
while(f>>nr)
if(cifre_impare(nr)) k++;
f.close();
if(k) cout<<k;
else cout<<"\nNu exista nici un numar cu proprietatea ceruta";
}
////////////////////////////////

29

////////////////////////////////

#include<fstream.h>
#include<math.h>
#include<conio.h>
int cmmdc(int a, int b)
{
a=abs(a); b=abs(b);
while(a!=b)
if(a>b) a=a-b;
else b=b-a;
return a;
}
void main()
{ifstream f("numere.txt");
int nr,n,a,b,p,s;
clrscr();
f>>n>>a>>b;
s=0; p=1;
for(int i=1;i<=n;i++)
{f>>nr;
s=s+nr;
if(nr>=a&&nr<=b) p=p*nr;
}
f.close();
cout<<"CMMDC("<<s<<","<<p<<")="<<cmmdc(s,p);}
////////////////////////////////

30

////////////////////////////////

#include <iostream.h>
#include<math.h>
#include<conio.h>
void citire(int x[100],int &n)
{int i;
cout<<"Cate elemente are vectorul?";
cin>>n;
for(i=0;i<n;i++){cout<<"\nIntrodu numarul "<<i<<":";
cin>>x[i];
}
}

20 | P a g e

int cmmdc(int a, int b)

{
a=abs(a); b=abs(b);
while(a!=b)
if(a>b) a=a-b;
else b=b-a;
return a;
}
void main()
{int a[100],b[100],n,m,i,j;
citire(a,n);
citire(b,m);
clrscr();
for(i=0;i<n;i++)
{ int da=1;
for(j=0;j<m&&da;j++)
if(cmmdc(a[i],b[j])!=1) da=0;
if(da) cout<<a[i]<<" ";
}
}

////////////////////////////////

31

////////////////////////////////

#include <iostream.h>
#include<conio.h>
void citire(int x[100],int &n)
{int i;
cout<<"Cate elemente are vectorul?";
cin>>n;
for(i=0;i<n;i++){cout<<"\nIntrodu numarul "<<i<<":";
cin>>x[i];
}
}
void identici(int x[100],int y[100],int n, int m)
{ int i,ok,poz;
poz=-1;
if(n!=m) ok=0;
else
{ok=1;
for(i=0;i<n&&ok;i++)
if(x[i]!=y[i]) {ok=0;
poz=i;
}
}
if(ok==0) {
if(poz!=-1) cout<<"\nCei doi vectori nu sunt identici incepand cu
pozitia "<<poz;

21 | P a g e

else cout<<"\nCei doi vectori nu au nici macar acelasi numar de

elemente";
}
else cout<<"\nCei doi vectori sunt identici";
}
void main()
{int a[100],b[100],n,m;
citire(a,n);
citire(b,m);
clrscr();
identici(a,b,n,m);
}
////////////////////////////////

32

////////////////////////////////

#include<iostream>
#include<fstream>
using namespace std;
int prim(int nr)
{
int i;
if(nr<2)
return 0;
for(i=2; i*i<=nr; i++)
if(nr%i==0)
return 0;
return 1;
}
int main()
{
int a[21][21], n, m=0, s=0, i, j;
ifstream f("date.in");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
f.close();
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(prim(a[i][j]))
{
s+=a[i][j];
m++;
}
if(!m)
cout<<"Nu exista!";
else
cout<<(float)s/m;
return 0;

22 | P a g e

}
////////////////////////////////

33

////////////////////////////////

#include<iostream>
#include<fstream>
using namespace std;
int palindrom(unsigned nr)
{
unsigned ogl=0, copie=nr;
while(copie>0)
{
ogl=ogl*10+copie%10;
copie/=10;
}
if(ogl==nr)
return 1;
return 0;
}
int main()
{
int a[51][51], n, m=0, i, j;
ifstream f("date.in");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
f.close();
for(i=1;i<n;i++)
for(j=1;j<=n-i;j++)
if(palindrom(a[i][j]))
m++;
if(!m)
cout<<"Nu exista!";
else
cout<<m;
return 0;
}
////////////////////////////////
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
int transforma(int v[], int n)
{
int nr=0, i;
for(i=1;i<=n;i++)

23 | P a g e

34

////////////////////////////////

nr=nr+v[i]*pow(2,n-i);
return nr;
}
int main()
{
int a[101][11], n, m, i, j;
ifstream f("date.in");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
f.close();
for(i=1;i<=n;i++)
cout<<transforma(a[i],m)<<'\n';
return 0;
}

24 | P a g e