BILET 1

C++

#include<iostream.h>
#include<conio.h>
void main()
{float v[100],m1=0,s=0,s1;
int i,j,n;

cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
{cout<<"v["<<i<<"]=";
cin>>v[i];}

for(i=1;i<=n;i++)
s=s+v[i];
s1=s/n;
cout<<"ma a elem vect="<<s1<<endl;

for(i=1;i<=n;i=i+2)
{m1=(v[i]+v[i+1])/2;
for(j=n;j>=i+1;j=j-1)
v[j+1]=v[j];
v[i+1]=m1;
n++;
}
cout<<endl;
n--;
for(i=1;i<=n;i++)
cout<<v[i]<<" ";

}

VISUAL FOX
1

create elevi.dbf
a) accept "x=clasa" to x
input "y=medie" to y
list all for clasa = x .and. medie > y
b) delete all for medie <s
list
recall
list
c) modi stru
d) list record 3
e) sort to elevi1 on nume
use elevi1
list

BILET 2

#include<iostream.h>
#include<conio.h>
void main()
{int max,n,i,j,k;float s[100]={0},v[100];
clrscr();
cout<<"n=";
cin>>n;
for(i=1;i<=n;i++)
{cout<<"v["<<i<<"]=";
cin>>v[i];}
max=v[1];
for(i=2;i<=n;i++)
if(max<v[i])
max=v[i];
cout<<"maximul="<<max<<endl;
k=0;
for(i=1;i<n;i++)
{float q=0;
for(j=1;j<=n;j++)
if(j!=i&&j!=i+1)
q+=v[j];
q=q/(n-2);
s[++k]=q;}
int q=1;
for(i=1;i<n;i+=2)
{for(j=n;j>=i+1;j--)
v[j+1]=v[j];
v[i+1]=s[q];
n++;
q++;}
cout<<"vectorul dupa inserare este:"<<endl;
for(i=1;i<=n;i++)
cout<<v[i]<<endl;
getch();
}

BILET 3

#include<iostream.h>
void main()
{int n,i,k,x,y;
cin>>k;
for(x=0;x<=k;x++)
for(y=0;y<=k;y++)
if(x*x+y*y==k)
cout<<"("<<x<<","<<y<<")";
cout<<endl;
}

BILET 4

#include<iostream.h>
int n, i, j, aux, min, poz, gasit;
float x, y, a[100], b[100];
void citire(float v[100], int m)
{for(int i=1;i<=m;i++)
{cout<<"elementul "<<i<<" este ";
cin>>v[i];}
}
void main()
{cout<<"n";
cin>>n;
citire(a,n);
citire(b,n);
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(a[i]>a[j]) {aux=a[i];
a[i]=a[j];
a[j]=aux;}

for(i=1;i<n;i++)
{min=b[i];poz=i;
for(j=i+1;j<=n;j++)
if(min>b[j]){poz=j;
min=b[j];}
aux=b[poz];
b[poz]=b[i];
b[i]=aux;
}
gasit=0;
x=a[1]/b[1];
for(i=2;i<=n && !gasit;i++)
{y=a[i]/b[i];
if(y!=x) gasit=1;
}
if(gasit) cout<<"vectorii nu sunt proportionali";
else cout<<"vectorii sunt proportionali";
}

BILET 5

#include<iostream.h>
#include<math.h>
int cifre(int t)
{int v[10],i=1,j,k;
do
{v[i]=t%10;
t=t/10;
i++;}
while (t!=0);
for(j=1;j<i;j++)
for(k=j+1;k<=i;k++)
if(v[j]==v[k])
return 0;
return 1;
}

void main()
{int i,k;
cin>>k;
for(i=1;i<=k;i++)
if(sqrt(i)==ceil(sqrt(i)) && cifre(i)==1)
cout<<i<<" ";}

BILET 6

#include<iostream.h>
void main()
{unsigned x[50],a[50][50],i,j,k,n,m;
cout<<"dati nr de linii si de coloane:";
cin>>n>>m;
cout<<"dati vectorul:";
for(i=1;i<=n;i++)
cin>>x[i];
cout<<"dati matricea:";
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];

cout<<"matricea introdusa este:";
for(i=1;i<=m;i++)
{for(j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;}
cout<<"dati nr liniei care se inlocuieste:";
cin>>k;
for(i=1;i<=n;i++)
a[k][i]=x[i];

for(k=1;k<=m;k++)
{for(j=1;j<=n;j++)
cout<< a[k][j]<<" ";
cout<<endl;}
}

BILET 7

#include <iostream.h>
#include <math.h>

void main()
{
int p[100], n, a;
float r=0;
cout<<"Gradul polinomului este: ";
cin>>n;
cout<<"Introducem coeficientii, incepand de la x^"<<n<<": "<<endl;
for (int i=n;i>=0;i--)
{
cout <<"x^"<<i<<": ";
cin>>p[i];
}
cout<<"Calculam impartirea lui P(X) la x-a; introduceti a: ";
cin>>a;
for (i=n;i>=0;i--)
r=r+p[i]*pow(a,i);
cout<<"Restul este: "<<r<<".";
}

BILET 8

#include<iostream.h>
int prim (int x)
{ int i,nr=0;
for(i=2;i<x/2;i++)
if(x%i==0) return 0;

return 1;

}
void main()
{ int v[105],n,i,s=0;
cout<<"n="; cin>>n;
for(i=1;i<=n;i++)
{ cout<<"v["<<i<<"]=";
cin>>v[i];
if(prim(v[i])) s=s+v[i];
}
cout<<s;
}

return 1;

}
void main()
{ int v[105],n,i,s=0;
cout<<"n="; cin>>n;
for(i=1;i<=n;i++)
{ cout<<"v["<<i<<"]=";
cin>>v[i];
if(prim(v[i])) s=s+v[i];
}
cout<<s;
}

BILET 21

#include<iostream.h>
#include<conio.h>
int prim(int n)
{if(n==0||n==1)
return 1;
else
for(int i=2;i<=n/2;i++)
if(n%i==0) return 0;
return 1;
}
void main()
{int n,i,j,n1;
clrscr();
cout<<"n=";cin>>n;n1=n;
while(prim(n)==0)
n++;
cout<<"cel mai mic nr prim >=n este:"<<n<<endl;

n=n1;
while(prim(n)==0)n--;
cout<<"cel mai mare nr prim <=n este:"<<n;

getch();
}

BILET 22

#include<fstream.h>
#include<conio.h>
fstream f("media.txt",ios::out);
void main()
{ int n,s=0,k=0;
clrscr();
do
{cout<<"n=";cin>>n;
if(n%2==0){s+=n;
k++;} }
while(n!=0);
if(--k)
f<<(float)s/k;
}

BILET 23

#include<iostream.h>
#include<conio.h>
void main()
{int n,i,fib[1000]={0};
clrscr();
cout<<"n=";cin>>n;
fib[0]=0;fib[1]=1;
cout<<"/nfib["<<0<<"]=0 ";
cout<<"/nfib["<<1<<"]=1 /n";
for(i=2;i<n;i++)

{fib[i]=fib[i-1]+fib[i-2];
cout<<"fib["<<i<<"]="<<fib[i]<<endl;
}
getch();
}

BILET 24

#include <iostream.h>

int n;

int fib (int k)
{
if (k==0)
return 0;
else
if (k==1)
return 1;
else
return fib(k-1)+fib(k-2);
}

int det_fib_max (int k)
{
int i=0;
int q;
while (fib(i+1)<=k)
i++;
return fib(i);
}

void main()
{
cout<<"n= ";
cin>>n;
cout<<n<<"= ";
int v[100];
int i=0;
do
{
i++;
v[i]=det_fib_max(n);
n=n-det_fib_max(n);
}
while (n);
for (int j=1;j<i;j++)
cout<<v[j]<<"+";
cout<<v[i];
}

BILET 25

#include<iostream.h>
void main()
{int n, x, y;
cout<<"Introduceti nr de scris ca suma de 2 nr consecutive:";
cin>>n;

if(n%2!=0)
{ cout<<"Nr poate fi scris ca sume de 2 nr consecutive\n";
cout<<n/2<<"+"<<n/2+1<<"="<<n<<endl;}
else cout<<"Nr nu poate fi scris ca suma de 2 nr consecutive\n";

}

BILET 26

#include <iostream.h>
void main()
{
int a,b;
cout<<"a= ";
cin>>a;
cout<<"b= ";
cin>>b;
int v[10], x[10];
int n=0,m=0;
while (a)
{
n++;
v[n]=a%10;
a=a/10;
}
while (b)
{
m++;
x[m]=b%10;
b=b/10;
}
int i,j, z[10], t=0;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
if(v[i]==x[j])
{
t++;
z[t]=v[i];
}
for (i=t;i>=1;i--)
cout<<z[i]<<" ";
}

BILET 27

#include <iostream.h>

int n, v[100];

void citire_date()
{
cout<<"n= ";
cin>>n;
for (int i=1;i<=n;i++)
cin>>v[i];
}

void sortare()
{
int i,j, aux;
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++)
if (v[j]<v[i])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
}

void afisare_adunari()
{
for (int i=1;i<n;i++)
{
cout<<v[i]<<"+"<<v[i+1]-v[i]<<"="<<v[i+1];
cout<<endl;
}

BILET 28

#include<iostream.h>
int cmmdc(int m,int n)
{if(m>0&&n>0)
if (m==n)return m;
else
if (m<n)return cmmdc(m,n-m);
else return cmmdc(m-n,n);
return 1;
}
void main()
{int n,i,a[100];
cout<<" n= ";
cin>>n;
cout<<endl;
cout<<"da numerele ";
cout<<endl;
for(i=1;i<=n;i++)
cin>>a[i];
cout<<endl;
int d;
d=cmmdc(a[1],a[2]);
for(i=3;i<=n;i++)
d=cmmdc(d,a[i]);
cout<<d;}

BILET 29

#include<iostream.h>
void main()
{int n, f,p;
cout<<"n=";
cin>>n;
cout<<"n=";
f=2;
while(n>1)
{p=0;
while(n%f==0)
{p++;
n=n/f;}
if(p!=0)cout<<f<<"^"<<p<<" ";
f++;}
}

BILET 30

#include<iostream.h>
#include<math.h>
void main()
{int k,n,i,r[100],s=0;
cout<<"dati numarul";
cin>>n;
s=n;
k=0;
while(n!=0)
{

r[++k]=n%2;
n=n/2;
}
cout<<s<<"=";
for(i=1;i<=k;i++)
if(r[i]!=0&&i<k)
cout<<"2^"<<i-1<<"+";
else
if (i==k&&r[i]!=0)cout<<"2^"<<i-1;

}

BILET 31

#include<iostream.h>
#include<conio.h>

int p,n,fact=0,temp,i;

void main()

{ clrscr();
cout<<"n=";cin>>n;
cout<<"p=";cin>>p;
for(i=2;i<=n;i++)
{temp=i;
while(temp%p==0)
{fact++;
temp=temp/p;
} }

cout<<"ordinul de multiplicitate al lui "<<p<<" este "<<fact;
getch(); }

BILET 32

#include <iostream.h>

int n;

struct nod
{
int nr;
nod* adr;
};

nod *p, *u;

void citire_date()
{
nod *q;
cout<<"n= ";
cin>>n;
for (int i=1;i<=n;i++)
if(!p)
{
p=new nod;
cin>>p->nr;
p->adr=0;
u=p;
}
else
{
q=new nod;
cin>>q->nr;
q->adr=0;
u->adr=q;
u=q;
}
u->adr=p;
}

void permutari()
{
nod *aux;
aux=p;
nod *q;
do
{
q=p;
do
{
cout<<q->nr<<" ";
q=q->adr;
}
while(q!=p);
p=p->adr;
cout<<endl;
}
while (aux!=p);
}

void main()
{
citire_date();
permutari();
}

BILET 33

#include <iostream.h>
int n, k;

int nr_ap (int nr)
{
int i=0;
while (nr)
{
if(nr%10==k)
i++;
nr=nr/10;
}
return i;
}

int nr_ap_total()
{
int count=0;
for (int i=1;i<=n;i++)
count+=nr_ap(i);
return count;
}

void main()
{
cout<<"n= ";
cin>>n;
cout<<"k= ";
cin>>k;
cout<<nr_ap_total();
}

BILET 34

#include<iostream.h>
int prim(unsigned int a)
{if(a==1||a==0)
return 0;
for(unsigned int i=2;i<a;i++)
if(a%i==0)
return 0;
return 1;
}
void main()
{unsigned int i,n,v[100],s=0;
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
{cout<<"v["<<i<<"]=";
cin>>v[i];}

for(i=1;i<=n;i++)
if(prim(v[i]))
s+=v[i];
cout<<"suma elementelor prime este "<<s;
}

BILET 35

#include<iostream.h>
int nrdiv(unsigned int a)
{int k=1;
for(int i=1;i<=a;i++)
if(a%i==0)
k++;
return k;
}
void main()
{unsigned int v[100];
int n,i,max;
cout<<"n=";
cin>>n;
for(i=1;i<=n;i++)
{cout<<"v["<<i<<"]=";
cin>>v[i];}
max=nrdiv(v[1]);
for(i=2;i<=n;i++)
if(max<nrdiv(v[i]))
max=nrdiv(v[i]);
for(i=1;i<=n;i++)
if(nrdiv(v[i])==max)
cout<<v[i]<<" ";
}

BILET 36

#include<iostream.h>
#include<conio.h>
int suma(int m)
{int
s=0;
do
{s=s+m%10;
m=m/10;
}
while(m!=0);
return s;}
void main()
{int n;
clrscr();
cout<<"n=";cin>>n;
cout<<"numerele mai mici decat n divizibile cu suma cifrelor lor sunt:"<<endl;
for(int i=1;i<n;i++)
if(i%suma(i)==0)
cout<<i<<endl;

getch();
}

BILET 37

#include<iostream.h>
#include<conio.h>
//un nr este perfect daca este egal cu suma divizorilor sai proprii plus 1//
int perfect(int n)
{int i;
int s=1;
for(i=2;i<=n/2;i++)
if(n%i==0)
s=s+i;
return n==s;
}
void main()
{int n,j;
clrscr();
cout<<"n=";cin>>n;
cout<<"numarele perfecte mai mici sau egale cu n sunt:"<<endl;
for(j=1;j<=n;j++)
if(perfect(j))
cout<<j<<endl;
getch();
}

BILET 38

#include <iostream.h>

void main()

{int i,j,k,n;

{ cout<<"n="<<endl;
cin>>n;}

k=0;
for(i=1;i<=n;i++)
{ j=i;
while (j%5==0)

{k++;

j=j/5; }}
cout<<k;}

BILET 39

#include<fstream.h>
fstream f("distincte.out",ios::out);
long int m,i,j,v[1000];aparut[100];

void aparitie(long int k,int o)
{int ap=0,a=0;
for(j=1;j<=o;j++)
if(k==aparut[j])a=1;
if(a==0)
{for(j=1;j<=m;j++)
if(k==v[j]) ap++;

if(ap>1) {f<<"pentru numarul "<<k<<" avem "<<ap<<" aparitii";
f<<endl;}}}
void main()
{cout<<" cate numere are sirul ";
cin>>m;
cout<<endl;
cout<<"introdu nuemrele:";
cout<<endl;
for(i=1;i<=m;i++)
cin>>v[i];
int h=1;
aparut[1]=v[1];;
aparitie(v[1],0) ;
h++;
for(i=2;i<=m;i++)
{
aparut[h]=v[i];
aparitie(v[i],h-1);
h++;
}
}

BILET 40

#include <fstream.h>

fstream f("numere.txt",ios::in);

struct nod
{
int nr;
nod* adr;
};

nod *p, *u;

void adaug_nod (int n)
{
nod *q;
if(!p)
{
p=new nod;
p->nr=n;
p->adr=0;
u=p;
}
else
{
q=new nod;
q->nr=n;
q->adr=0;
u->adr=q;
u=q;
}
}

int valid (int n)
{
nod *q;
for (q=p;q;q=q->adr)
if (q->nr==n)
return 0;
adaug_nod(n);
return 1;
}

int citire_date()
{
int n;
long int i=0;
nod *q;
while(f>>n)
if(n<100&valid(n))
i++;
return i;
}

void main()
{
cout<<citire_date();
}