#include<iostream>pr5

#include<cstdio>
using namespace std;
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 i,n,x;
int s=0;
freopen("vector5.in","r",stdin);
freopen("vector5.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<fstream> pr2
using namespace std;
int n,x[10010];
int main()
{float s=0;
int nr=0;
ifstream f("vector.in");
ofstream g("vector.out");
f>>n;
int i,aux;
for(i=1;i<=1;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> pr4
#include<cstdio>
using namespace std;

struct elev
{char nume[30];
float media;};
int main()
{int n,i,t;
elev x[40],aux;
freopen("vector4.in","r",stdin);
freopen("vector4.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.h>
#include<fstream>
using namespace std;
int main()
{
int v[100],i=0,nr=0,max,div=1,n;
ifstream f("date6.in");
while(!f.eof())
{
i++;
f>>v[i];
nr++;
}
f.close();
for(i=1;i<=n;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("date6.out",ios ::app);
g<<"Divizorul maxim al elementului"<<v[i]<<"este"<<max<<endl;
g.close();
}
}
#include<iostream> pr7
#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.h>pr8
using namespace std;
long fib(int n)
{
if(n==0) return 0;
else
if(n==1)
return 1;
else
return fib(n-1) +fib(n-2);
}
int main()
{
int n;
cout<<"n=";
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--)
{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;
}
#include<iostream>pr12
#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;
}
#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;
}
int main()
{
int v[50],i;
unsigned n;
do
{
cout<<"n=";cin>>n;
}
while(n<1||n>50);
for(i=0;i<n;i++)
{
cout<<"v["<<i<<"]=";
cin>>v[i];
}
cout<<endl;
for(i=0;i<n;i++)
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";
return 0;
}
#include<iostream.h> pr16
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)
{
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]<<" ";
}
int 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);
return 0;
}
#include<iostream.h> pr18
#include<fstream.h>
void citire(int &n,int a[][20])
{int i,j;
ifstream f("graf18.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;
}
int 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;
}
return 0;
}
#include<iostream> 22
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);
a[i][j]=i;
cout<<a[i][j]<<" ";
}
cout<<"\n";
}
return 0;
}
#include<fstream>23
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("graf23.in");
ofstream out("graf23.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 esxista";
in.close();
out.close();
return 0;
}
#include<iostream.h>27
#include<fstream.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;
}
int main()
{ifstream f("numere.txt");
unsigned nr;
while(f>>nr)
if(palin(nr)&&scifre(nr)%2==0)
cout<<nr<<" ";
f.close();
return 0;
}
#include<iostream.h>28
#include<fstream.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;
}
int main()
{
ifstream f("numere.txt");
unsigned nr,k;
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";
return 0;
}
#include<iostream.h>31
#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 incepanad cu pozitia "<<poz;
else

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

}
else
cout<<"\nCei doi vectori sunt identici";
}
int main()
{
int a[100], b[100],n, m;
citire(a,n);
citire(b,m);
identici(a,b,n,m);
}
#include<iostream.h>34
#include<fstream.h>
#include<math.h>
int transforma(int v[], int n)
{
int nr=0,i;
for(i=1;i<=n;i++)
nr=nr+v[i]*pow(2,n-i);
return nr;
}
int main()
{
int a[101][11], n, m, i, j;
ifstream f("date34.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;
}
#include<fstream> pr`1
using namespace std;
int n,x[510],y[510];
int main()
{
ifstream f("vector.in");
ofstream g("vector.out");
f>>n;
int i,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<iostream.h> 17
#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;
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=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 <<"\n Graful este complet";

else{cout<<"\n Graful nu este complet";

cout<<"\n Pentru a deveni complet trebuie adaugate muchiile: " ;
muchii(n,a);
}
}