Subiectul II

Varianta 001
1. c
2. d
3. C.x=(A.x+B.x)/2;
C.y=(A.y+B.y)/2;
4. nlimea arborelui este 3. Nodurile frunz sunt 1, 2, 3, 8
5. //varianta 001 subII
#include<iostream.h>
void main()
{
int n,m,a[10][10],i,j;
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(i<j)
a[i][j]=i;
else
a[i][j]=j;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 002
1. a
2. c
3. Ultimele 2 elemente eliminate sunt 5 i 2.
4. s=0;
for(j=0; j<n/2; j++)
{
if (a[k][j]%2==1)
s+=a[k][j];
if (a[k][j+n/2]%2==1)
s+=a[k][j+n/2];
} cout<<s;
5. //varianta 002 subII pr5
#include<stdlib.h>
#include<iostream.h>
#include<string.h>
char a[21];
void main()
{
cin.get(a,21);
for(int i=0;i<strlen(a);i++)
if(strchr("aeiou",a[i]))
a[i]=toupper(a[i]);

cout<<a;
}
Varianta 003
1. b
2. c
3. f.x=f1.x*f2.y+f2.x*f1.y;
f.y=f1.y*f2.y;
4. ideale
5. //varianta 003 sub II pr5
#include<iostream.h>
int n,a[24][24],i,j;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j)
a[i][j]=0;
else
a[i][j]=n-j+1;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 004
1. b
2. a
3.
AD(4
3
)
2

1
4. i=0;
while(i<strlen(s))
{
if(a<=s[i] && s[i]<=z)
strcpy(s+i,s+i+1);
else
i++;
}
cout<<s;
5. //var 004 subII pr5
#include<iostream.h>
int n,a[24][24],i,j;
void main()
{

4
AD(5
3 EL 3 EL
)
2 2 2

1
1
1

5 EL
2 2
1
1

cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==n-j+1)
a[i][j]=0;
else
a[i][j]=n-i+1;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 005
1. b
2. d
3. 14 frunze
4. i=0;
j=strlen(s)-1;
while(i<j;
{
c=s[i];
s[i]=s[j];
s[j]=c;
i++;
j--;
}
5. //var 005 subII pr5
#include<iostream.h>
int n,m,a[10][10],i,j;
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(i>j)
a[i][j]=i;
else
a[i][j]=j;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}

Varianta 006
1. c
2. a
3. 12 noduri
4. 8 componente conexe
5. //varianta 006 subII pr.5
#include<iostream.h>
#include<string.h>
#include<stdlib.h>
char s[256];
int i;
void main()
{
cin.get(s,256);
s[0]=toupper(s[0]);
for(i=1;i<strlen(s);i++)
{
while(s[i]==' ')
i++;
if(s[i-1]==' ')
s[i]=toupper(s[i]);
}
cout<<s;
}
Varianta 007
1. a
2. b
3. 2 muchii
4. 128 grafuri pariale
5. //varianta 007, sub II, pr5
#include<iostream.h>
#include<string.h>
char s[256];
int i;
void main()
{
cin.get(s,256);
i=strlen(s);
while(strchr("aeiou ",s[i]))
i--;
strcpy(s+i,s+i+1);
cout<<s;
}
Varianta 008
1. b
2. c
3. abefgh 6
4. s=pinfo;

while(purm!=NULL)
{
p=purm;
s=s+pinfo;
}
cout<<s;
5. //varianta 008 sub II pr 5
#include<iostream.h>
int a[20][20],n,p,i,j,k=1;
void main()
{
cout<<"n= ";cin>>n;
cout<<"p= ";cin>>p;
for(i=1;i<=n;i++)
{
for(j=1;j<=p;j++)
{
a[i][j]=k*k;
k+=2;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 009
1. a
2. a
3. Gradul extern maxim poate fi 4.
4. abcd123efg
5. //varianta 009 sub II pr5
#include<iostream.h>
int a[23][23],n,i,j;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
for(i=1;i<=n;i++)
cout<<a[1][i]<<' ';
for(i=2;i<=n;i++)
cout<<a[i][n]<<' ';
for(i=n-1;i>=1;i--)
cout<<a[n][i]<<' ';
for(i=n-1;i>=2;i--)
cout<<a[i][1]<<' ';
}
Varianta 010

1. a
2. d
3. 3081 muchii
4. abacde
5. //varianta 010 sub II pr 5
#include<iostream.h>
int a[20][20],n,p,i,j,k=0;
void main()
{
cout<<"n= ";cin>>n;
cout<<"p= ";cin>>p;
for(i=1;i<=n;i++)
{
for(j=1;j<=p;j++)
{
a[i][j]=k*k;
k+=2;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 011
1. a
2. d
3. 11 brcdbr
4. s = p -> nr + p->urm->nr + p->urm->urm->nr;
5. //varianta 011 sub II pr5
#include<iostream.h>
int a[10][10], m, n, i, j,min,max;
int minim(int i)
{
int min=a[i][1];
for(j=2;j<=n;j++)
if(min>a[i][j])
min=a[i][j];
return min;
}
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
max=minim(1);
for(i=2;i<=m;i++)
if(max<minim(i))
max=minim(i);
cout<<max;
}

Varianta 012
1. b
2. a
3. Rdcina arborelui este 2. Descendenii direci ai nodului 3 sunt nodurile: 4,6,9
4. 11 AbcdEfghOId
5. //varianta 012 pr5 sub II
#include<iostream.h>
int a[50][50],i,j,n;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n-i;j++)
{
a[i][j]=i;
a[n-j+1][n-i+1]=i;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 013
1. c
2. b
3.
1 2,3,4,
5
2 1,3
3 1,2
4 1,6
5 1,6
6 4,5
4. 11 bcdfghd
5. //varianta 013 pr5 sub II
#include<iostream.h>
int a[50][50],i,j,n;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n-i;j++)
{
a[i][j]=j;
a[n-j+1][n-i+1]=a[i][j];
}
for(i=1;i<=n;i++)
{

for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 014
1. b
2. c
3. 9 bdued
4. Frunzele: 2,4,3,6
5. //varianta 14 sub II pr 5
#include<iostream.h>
int a[9][9],i,j,k;
long n;
void main()
{
cout<<"n= "; cin>>n;
while(n>0)
{
a[1][++i]=n%10;
n/=10;
}
for (j=2;j<=i;j++)
for(k=1;k<=i;k++)
a[j][k]=a[1][k];
for(j=1;j<=i;j++)
{
for(k=1;k<=i;k++)
cout<<a[j][k]<<" ";
cout<<endl;
}
}
Varianta 015
1. a
2. d
3. 9 bemeut
4. Gradul minim =2. Nodurile cu grad minim: 5,7,8
5. //varianta 15 sub II pr 5
#include<iostream.h>
int a[7][7],i,j;
long n;
void main()
{
cout<<"n= "; cin>>n;
for(i=1;i<=6;i++)
{
for(j=i;j<=6;j++)
if(i==j)
a[i][j]=0;

else
{
a[i][j]=n%10;
a[j][i]=a[i][j];
}
n/=10;
}
for (i=1;i<=6;i++)
{
for(j=1;j<=6;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
}
Varianta 016
1. b
2. a
3. ((x->nr+x->urm->nr)/2<=4.75)
4. clasa a-XII-a A
CLASA A-XII-A A
5. //varianta 016 pr5 sub II
#include<iostream.h>
int a[16][16],i,j,n;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i==j || i+j==n+1)
a[i][j]=0;
else
if((i+j<n+1 && i>j) || (i+j>n+1 && i<j))
a[i][j]=3;
else
if(i+j<n+1 && i<j)
a[i][j]=1;
else
a[i][j]=2;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 017
1. a

2. b
3. Gradul maxim n-1; gradul minim 1
4. 11
******
5. //varianta 017 pr5 sub II
#include<iostream.h>
int a[20][20],i,j,n;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
a[i][j]=i+j-1;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 018
1. c
2. a
3. Inaltimea=3; nr frunze=4
4. strcpy(a,informatica);
for(i=0;i<strlen(a);i++)
if(strchr(aeiouAEIOU,a[i])
cout<<*;
else
cout<<a[i];
5. //varianta 018 pr5 sub II
#include<iostream.h>
int a[20][20],i,j,n;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i%2==1)
a[i][j]=i;
else
a[i][j]=j;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';

cout<<endl;
}
}
Varianta 019
1. a
2. c
3. bac2008
bac
4. if(a.y==b.y)cout<<DA;
else cout<<NU:
5. //varianta 019 pr5 sub II
#include<iostream.h>
int a[20][20],i,j,n;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i%2==1)
a[i][j]=i+j;
else
if(j==1)
a[i][j]=a[i-1][j];
else
a[i][j]=a[i-1][j-1];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}}
Varianta 020
1. a
2. d
3. Se va afisa: 5
4
4. strcpy(a,Bac 2007 iulie);
for(i=0;i<strlen(a);i++)
if(a[i]>=A && s[i]<=z)
cout<<a[i];
5. //varianta 020 pr5 sub II
#include<iostream.h>
int a[20][20],i,j,n;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)

{
if(i==1 || j==1 || i==n || j==n)
a[i][j]=i+j;
else
a[i][j]=a[i-1][j-1]+a[i-1][j]+a[i-1][j+1];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 021
1. d
2. c
3. ev.data_nasterii.an=1990;
4. Ultima valoare introdusa in stiva este 4
5. //var 21 sub II pr 5
#include<iostream.h>
#include<string.h>
char sir [251];
void main()
{
cin.get(sir,251);
for(int i=0;i<strlen(sir)-1;i++)
if(sir[i]==sir[i+1] && sir[i]!='*')
cout<<sir[i]<<sir[i+1]<<endl;
}
Varianta 022
1. b
2. a
3. 5
4. 8 subgrafuri
5. //var 22 sub II pr 5
#include<iostream.h>
int n,m,a[100][100],i,j,k;
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
k=m*n;
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
a[i][j]=k--;
cout<<a[i][j]<<' ';
}

cout<<endl;
}
}
Varianta 023
1. b
2. d
3. Nodurile 1 si 2 au cate 2 descendenti (nodul 2 are ca descendenti nodurile 5 si
6, iar nodul 1 are ca descendenti nodurile 4 si 7. Nodurile 3 si 2 au cate 2
descendenti directi.
4. 300
5. //var 23 sub II pr 5
#include<iostream.h>
int n,m,a[100][100],i,j;
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
if(i==1)
a[i][j]=j;
else
if(j==1)
a[i][j]=i;
else
a[i][j]=a[i-1][j]+a[i][j-1];
}
cout<<a[m][n];
}
Varianta 024
1. a
2. b
3. strcpy(s+1,s+2);
4. //var 24 sub II pr 4
#include<iostream.h>
int n,a[100][100],i,j;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
a[i][j]=(i+j)%n+1;
cout<<a[i][j]<<' ';
}
cout<<endl;
}

}
5. //var 024 sub II pr 5
#include<iostream.h>
#include<string.h>
char a[101],b[101];
int i,j;
void main()
{
cout<<"Dati sirurile: ";
cin.get(a,101);
cin.get();
cin.get(b,101);
i=strlen(a)-1;
j=strlen(b)-1;
while(a[i]==b[j])
{
i--;j--;
}
cout<<a+i+1;
}
Varianta 025
1. c
2. d
3. y=sqrt(x)+1.0/x+abs(x);
4. //var 025 sub II pr 4
#include<iostream.h>
#include<string.h>
char sir[101];
void main()
{
int ok=1,n;
cin.get(sir,101);
n=strlen(sir);
for(int i=0;i<n/2;i++)
if(sir[i]!=sir[n-i-1])
ok=0;
if(ok) cout<<"Corect";
else
cout<<"Incorect";
}
5. //var 25 sub II pr25
#include<iostream.h>
int m,n,i,j,a[100][100],p[100],max;
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];

for(j=1;j<=n;j++)
for(i=1;i<=m;i++)
if(a[i][j]==2)
p[j]++;
else
if (a[i][j]==0)
{
p[j]=0;
break;
}
max=p[1];
for(j=2;j<=n;j++)
if(max<p[j])
max=p[j];
for(j=1;j<=n;j++)
if(p[j]==max)
cout<<j<<' ';
}
Varianta 026
1. d
2. c
3. roton
4. 4 elemente
5. //var 26 sub II pr25
#include<iostream.h>
int m,n,i,j,a[100][100],max,p;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
for(j=1;j<=n;j++)
{
max=a[1][j];
p=a[1][j];
for(i=2;i<=n;i++)
{
if(a[i][j]>max)
max=a[i][j];
p*=a[i][j];
}
if(max==p/max)
cout<<max<<' ';
}
}
Varianta 027
1. a

2. b
3. H.x=F.x*G.y+G.x*F.y;
H.y=F.y*G.y;
4. 120
5. //var 27 sub II pr 5
#include<iostream.h>
int n,m,a[10][10],i,j;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i==1 || j==1 || j==n)
a[i][j]=1;
else
a[i][j]=a[i-1][j-1]+a[i-1][j]+a[i-1][j+1];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 028
1. b
2. c
3. 0
4. 2, 3, 4, 5, 1
5. //var 28 sub II pr5
#include<iostream.h>
#include<string.h>
char s[21], vocale[]="aeiou";
int i,j;
void main()
{
cin.get(s,21);
for(j=0;j<=4;j++)
if(strchr(s,vocale[j]))
{
for(i=0;i<strlen(s);i++)
if(s[i]!=vocale[j])
cout<<s[i];
cout<<endl;
}
}
Varianta 029
1. a

2. d
3. atac
4. 7
5. //var 029 sub II pr 5
#include<iostream.h>
int i,n,a[50][50],p=1,j,k,x;
int pivot(int k)
{
x=a[1][k]/a[1][1];
for(i=2;i<=n;i++)
if (a[i][k]/a[i][1]!=x)
return 0;
return 1;
}
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
for(j=2;j<=n;j++)
if(pivot(j))
p*=a[1][j]/a[1][1];
cout<<p;
}
Varianta 030
1. b mutam muchia [3,6] intre nodurile 2 si 4
2. a
3. 2,3,4,5
4. al 3-lea
5. //var 30 sub II pr 5
#include<iostream.h>
int n,m,a[15][15],i,j;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i==1 || j==1)
a[i][j]=1;
else
a[i][j]=a[i-1][j]+a[i][j-1];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}

}
Varianta 031
1. c
2. b
3. struct autoturism
{
char marca[21];
unsigned int anul_fabricatiei;
} x;
4. 5 7 9 11
5. //varianta 031 sub II pr 5
#include<iostream.h>
#include<string.h>
struct nod
{
char info[21];
nod *urm;
};
nod *p,*u,*q;
char sir[21];
void main()
{
int n;
cout<<"n= ";cin>>n;
for(int i=1;i<=n;i++)
{
cin.get(sir,21);
cin.get();
if(sir[0]==sir[strlen(sir)-1])
{
q=new nod;
strcpy(q->info,sir);
if(p==NULL)
{
q->urm=NULL;
u=p=q;
}
else
{
q->urm=p;
p=q;
}
}
}
q=p;
while(q!=NULL)
{
cout<<q->info<<' ';
q=q->urm;
}

}
Varianta 032
1. b
2. d
3. 8
4. 3 4 5 6 7 8
5. //varianta 032 pr 5 sub II
#include<iostream.h>
#include<string.h>
char a[251],c1,c2;
int i;
void main()
{
cin.get(a,251);
cin.get();
cin>>c1>>c2;
cout<<a<<endl;
i=0;
while(i<strlen(a))
{
if(a[i]==c1)
a[i]=c2;
else
if(a[i]==c2)
a[i]=c1;
i++;
}
cout<<a;
}
Varianta 033
1. a
2. c
3. struct
{
int abscisa, ordonata
float raza;
}x;
4.
2
3
4
5
6
7
8
9
10
1
1
13
1
2
1
1
16
4
5
5. //varianta 033 pr 5 sub II
struct nod
{
float info;
nod *urm,*prec;

};
nod *p,*u,*q;
q=p;
while(q!=NULL)
{
if(q->info<0)
{
nod *r;
r=new nod;
r->info=0;
if(q==u)
{
r->urm=NULL;
r->prec=u;
q->urm=r;
u=r;
}
else
{
r->urm=q->urm;
q->urm->prec=r;
q->urm=r;
r->prec=q;
}
}
q=q->urm;
}
Varianta 034
1. b
2. c
3. 9
4. 111111
5. //varianta 034 pr 5 sub II
#include<iostream.h>
void main()
{
int i,j,a[20][20],k=2,n;
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
a[i][j]=k;
if((k+2)%3==0)
k=k+4;
else
k=k+2;
cout<<a[i][j]<<' ';
}

cout<<endl;
}
}
Varianta 035
1. d
2. c
3. amaara
4. Graful are 5 componente conexe. Trebuie adaugate 4 muchii.
5. //varianta 035 pr 5 sub II
#include<iostream.h>
void main()
{
int i,j,a[50][50],k=2,n,min;
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
for(j=1;j<=n;j++)
{
min=a[1][j];
for(i=2;i<=n;i++)
if(min>a[i][j])
min=a[i][j];
cout<<min<<' ';
}
}
Varianta 036
1. b
2. c
3. 3 muchii
4. 171 muchii
5. //varianta 036 sub II pr 5
#include<iostream.h>
void main()
{
int i,j,a[50][50],k=2,n,min,m;
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
for(j=1;j<=m;j++)
{
min=a[1][j];
for(i=2;i<=n;i++)
if(min>a[i][j])
min=a[i][j];
cout<<min<<' ';
}
}
Varianta 037

0
1
0
0
1

1.
2.
3.
1
0
0
0
0

d
b
0
1
0
0
0

1
0
1
0
0

1
0
0
1
0

4. 2, 3
5. //varianta 037 sub II pr 5
#include<iostream.h>
#include<string.h>
#include<stdlib.h>
void main()
{
char s[256];
int i,n;
cin.get(s,256);
i=1;
s[0]=toupper(s[0]);
s[strlen(s)-1]=toupper(s[strlen(s)-1]);
while(i<strlen(s)-2)
{
if((s[i]!=' ' && s[i+1]==' ')|| (s[i-1]==' ' && s[i]!=' '))
s[i]=toupper(s[i]);
i++;
}
cout<<s;
}
Varianta 038
1. c
2. d
3. 2 muchii
4. 6 cicluri elementare
5. //varianta 038 pr 5 sub II
#include<iostream.h>
void main()
{
int i,j,a[50][50],k=2,n,min,ok;
long p=1;
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
for(j=1;j<=n;j++)
{
min=a[1][j];
for(i=2;i<=n;i++)
if(min>a[i][j])
{

min=a[i][j];
if(i+j==n+1)
ok=1;
else
ok=0;
}
if(ok)
p*=min;
}
cout<<p;
}
Varianta 039
1. b
2. c
3. 144
4.
2 3 4
3 4 5
4 5 6
5. //varianta 039 pr 5 sub II
#include<iostream.h>
#include<string.h>
void main()
{
char s[256],*p;
int i,l,j;
cin.get(s,256);
i=0;s[-1]=' ';
while(i<strlen(s))
{
if(!(strchr("aeiou",s[i]) && s[i-1]==' '))
while(s[i]!=' ')
{
cout<<s[i];
i++;
}
i++;
}
}
Varianta 040
1. d
2. b
3. 3 componente conexe
4.
1 1 1
1 2 2
1 2 3
5. //varianta 040 sub II pr 5

#include<iostream.h>
#include<string.h>
char sir[256],sir2[20],*p;
int lcuvant ;
void main()
{
cout<<"Sirul este:";
cin.get(sir,255);
p=strchr(sir,'*');
strcpy(sir2,sir);
sir2[p-sir]='\0';
lcuvant=strlen(sir2);
p=strstr(sir,sir2);
while (p)
{
strcpy(p,p+lcuvant);
p=strstr(sir,sir2);
}
cout<<sir;
}
Varianta 041
1. a
2. a
3. 1, 3, 5, 7, 9
4. fino
5. //varianta 041 sub II pr 041
#include<iostream.h>
void main()
{
unsigned int a[23][23],n,i,j;
do
{
cout<<"n= ";cin>>n;
}
while(n==0 || n>23);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
a[i][j]=i+j;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 042
1. a
2. a
3. 6 muchii {(1,5)(5,3)(3,2)(2,7)(7,4)(4,8)}
4. cea mai mare valoare 5
5. //varianta 042 sub II pr 5

#include<iostream.h>
#include<string.h>
void main()
{
char a[41];
unsigned int i;
cin.get(a,41);
for(i=0;i<strlen(a);i++)
if(strchr("aeiou",a[i]))
cout<<a[i]<<' ';
}
Varianta 043
1. a
2. a
3. radacina este 4; frunzele sunt 1,3,5,7,9
4. inmatica
5. //varianta 043 sub II pr 5
6. #include<iostream.h>
void main()
{
unsigned int n,a[23][23],i,j;
do
{
cout<<"n= ";cin>>n;
}while(n==0 || n>23);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j)
a[i][j]=2;
else
if(i>j)
a[i][j]=3;
else
a[i][j]=1;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 044
1. a
2. a
3. Nodurile cu 2 descendenti> 2,7,6
4. jogp
5. //varianta 044 sub II pr 5
#include<iostream.h>
void main()
{
unsigned int n,a[23][23],i,j;

do
{
cout<<"n= ";cin>>n;
}while(n==0 || n>23);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i<j)
a[i][j]=i;
else
a[i][j]=j;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 045
1. a
2. a
3. descendentii radacinii: 1 si 7. Frunze 4 (5,6,7,8)
4. cel mai mic element este -3
5. //varianta 045 sub II pr 5
#include<iostream.h>
#include<string.h>
void main()
{
char a[41];
unsigned int i,j;
cin.get(a,41);
for(i=0;i<strlen(a);i++)
{
for(j=0;j<strlen(a);j++)
if(i!=j)
cout<<a[j];
cout<<endl;
}
}
Varianta 046
1. b
2. a
3. 6 frunze (1,2,3,4,5,9)
4. k=13
5. //varianta 045 sub II pr 5
#include<iostream.h>
#include<string.h>
void main()
{
char a[101];
unsigned int i;
cin.get(a,101);

for(i=0;i<strlen(a);i++)
if(strchr("aeiou",a[i]))
a[i]=a[i]+1;
cout<<a;
}
Varianta 047
1. c
2. b
3. k=1
4. if(f.a%k==0 && f.b%k==0)
cout<<DA;
5. //varianta 045 sub II pr 5
#include<iostream.h>
#include<string.h>
void main()
{
char a[41];
unsigned int i,j;
cin.get(a,41);
for(i=0;i<strlen(a);i++)
{
for(j=0;j<strlen(a);j++)
if(i!=j)
cout<<a[j];
cout<<endl;
}
}
Varianta 048
1. d
2. a
3. 3
4. sqrt(a.x*a.x+a.y*a.y);
5. //varianta 048 sub II pr 5
#include<iostream.h>
void main()
{
unsigned int a[10][10],i,n,j,k=2;
do
{
cout<<"n= ";cin>>n;
}while(n<=2 && n>=10);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
a[i][j]=k;
k+=2;
cout<<a[i][j]<<' ';
}
cout<<endl;
}

}
Varianta 049
1. d
2. c
3. (x.med1+x.med2)/2;
4. 1,2,3,5,4,2
5. //varinta 049 sub2
#include<string.h>
#include<iostream.h>
void main()
{
char s[21];
unsigned i,n;
cin.get(s,21);
i=0;
n=strlen(s);
while(i<n)
{
if(strchr("aeiou",s[i])==0)
strcpy(s+i,s+i+1);
else
i++;
}
cout<<s;
}
Varianta 050
1. a
2. d
3. 6 noduri (4, 6, 7, 8, 9, 10)
4. 5
5. //sub II varianta 050 pr 5
#include<iostream.h>
#include<string.h>
char s[21];
int i,n;
void main()
{
cin.get(s,21);
n=strlen(s);
i=0;
while(strchr("aeiou",s[i])==0)
i++;
strcpy(s+i,s+i+1);
i=n-2;
while(strchr("aeiou",s[i])==0)
i--;
strcpy(s+i,s+i+1);
cout<<s;
}

Varianta 051
1. a
2. d
3. a[1][3]=12
4. 6 muchii
5. //varianta 051 sub II pr5
#include<iostream.h>
#include<string.h>
char s[53],k;
int i;
void main()
{
cin.get(s,53);
for(i=0;i<strlen(s);i+=2)
for(k='1';k<=s[i+1];k++)
cout<<s[i];
}
Varianta 052
1. a
2. b
3. a[3][3]=8
4. se sterge primul nod al listei
5. //varianta 052, sub II, pr5
#include<iostream.h>
#include<string.h>
int i,j,n,ok,nr;
char s[31];
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
{
cin.get();
cin.get(s,31);
ok=1;
j=0;
while(j<strlen(s) && ok)
{
if(strchr("aeiou",s[j])==0)
ok=0;
j++;
}
if(ok) nr++;
}
cout<<nr;
}
Varianta 053
1. c

2. a
3. x=12
4. 2
5. //sub II var 053 pr5
#include<iostream.h>
#include<stdlib.h>
struct nod
{
int info;
nod*urm;
};
nod*prim,*ultim,*p;
int n,r,a,i;
void main()
{
cout<<"n= ";cin>>n;
cout<<"a= ";cin>>a;
cout<<"r= ";cin>>r;
p=new nod;
p->info=a;
prim=ultim=p;
p->urm=NULL;
for(i=2;i<=n;i++)
{
p=new nod;
p->info=a+(i-1)*r;
p->urm=NULL;
ultim->urm=p;
ultim=p;
}
p=prim;
while(p!=NULL)
{
cout<<p->info<<' ';
p=p->urm;
}
}
Varianta 054
1. d
2. a
3. k1=7; k2=4
4. 2 4
5. //sub II var 054 pr5
#include<iostream.h>
int n,i,a[10][10],j,x;
void main()
{
do
{
cout<<"n= ";cin>>n;

}while(n%2==1);
do
{
cout<<"x= ";cin>>x;
}while(x<100 || x>=1000);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j)
a[i][j]=x/100;
else
if(j==n-i+1)
a[i][j]=x%10;
else
a[i][j]=x/10%10;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 055
1. c
2. a
3. a[0][9]=2; a[9][0]=1;
4. sterge al doilea nod al listei
5. //var 055 pr 5 sub II
#include<iostream.h>
#include<string.h>
char s[11];
int suma,f,i;
void main()
{
cin.get(s,11);
i=0;
while(s[i]!='.' && i<strlen(s))
{
suma=suma*10+s[i]-(int)'0';
i++;
}
i++;
while(i<strlen(s))
{
f=f*10+s[i]-(int)'0';
i++;
}
suma=suma+f;
cout<<suma;
}

Varianta 056
1. c
2. d
3. 2,3,5,8
4. c>=a && c<=z;
5. //var 056 sub II pr5
#include<iostream.h>
int n,a[25][25],i,j,k;
void main()
{
cout<<"n= ";cin>>n;
cout<<"k= ";cin>>k;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i<=k)
if(j<=k)
a[i][j]=1;
else
a[i][j]=2;
else
if(j<=k)
a[i][j]=3;
else
a[i][j]=4;
cout<<a[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 057
1. c
2. a
3. 5
4. strchr(aeiou,c)!=0
5. //var 057 sub II pr5
#include<iostream.h>
int n,m[25][25],i,j,a,b;
void main()
{
cout<<"n= ";cin>>n;
cout<<"a= ";cin>>a;
cout<<"b= ";cin>>b;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==a||j==b)
m[i][j]=0;

else
if(i<a)
if(j<b)
m[i][j]=1;
else
m[i][j]=2;
else
if(j<b)
m[i][j]=3;
else
m[i][j]=4;
cout<<m[i][j]<<' ';
}
cout<<endl;
}
}
Varianta 058
1. b
2. b
3. 2
4. i!=j
5. //var 058 sub II pr5
#include<iostream.h>
#include<string.h>
char s[51];
int i;
void main()
{
cin.get(s,51);
i=0;
while(i<strlen(s))
if(s[i]>'z' || s[i]<'A')
strcpy(s+i,s+i+1);
else
i++;
cout<<s;
}
Varianta 059
1. a
2. c
3. 1, 2, 6, 7, 8
4. i+j==11
5. //var 059 sub II pr5
#include<iostream.h>
#include<string.h>
char s[51];
int i,v[10],poz,max;
void main()
{

cin.get(s,51);
i=0;
while(i<strlen(s))
{
if(s[i]>='0' && s[i]<='9')
v[s[i]-'0']++;
i++;
}
max=v[0];poz=0;
for(i=1;i<=9;i++)
if(max<v[i])
{
max=v[i];
poz=i;
}
if(poz==0 && max==0)
cout<<"NU";
else
cout<<poz;
}
Varianta 060
1. d
2. c
3. 1 frunza
4. 65
5. //var 060 sub II pr5
#include<iostream.h>
#include<string.h>
char s[51],c,lit;
int i,k,max;
void main()
{
cin.get(s,51);
for(c='a';c<='z';c++)
{
i=0;k=0;
while(i<strlen(s))
{
if(s[i]==c)
k++;
i++;
}
if(max<k)
{
max=k;
lit=c;
}
}
if(max==0)
cout<<"NU";

else
cout<<lit;
}
Varianta 061
1. d
2. c
3. 15
4. 4
5. //sub II var 061 pr5
#include<iostream.h>
int a[100][100],n,i,j;
void main()
{
cout<<"n= ";cin>>n;
for(i=n;i>=1;i--)
for(j=1;j<=i;j++)
if(i==n)
a[i][j]=j;
else
if(j==1)
a[i][j]=a[i+1][1]+a[i+1][2];
else
a[i][j]=a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 062
1. a
2. b
3.
0 1 1 0 0 1
0 0 1 0 0 0
0 0 0 0 0 0
0 0 1 0 0 0
0 0 1 1 0 1
0 0 1 0 0 0
4. elementul din varful stivei S1 va fi 6
5. //varianta 062 sub II pr 5
#include<iostream.h>
#include<string.h>
char s[256],c;
int i,v[28];
void main()
{
cin.get(s,256);

for(c='a';c<='z';c++)
if(strchr(s,c))
v[c-97]=1;
i=0;
while(i<strlen(s))
{
if(v[s[i]-97]==1)
{
cout<<s[i]<<' ';
v[s[i]-97]=0;
}
i++;
}
}
Varianta 063
1. b
2. b
3. 2 varfuri
4. if(strcmp(s1,s2)<0)
cout<<s1<< <<s2;
else
cout<<s2<< <<s1;
5. //varianta 063 sub II pr5
#include<iostream.h>
int n,m,i,j,a[50][50],k;
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
a[i][j]=++k;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 064
1. d
2. a
3. 3 muchii
4. 3 varfuri
5. //varianta 064 sub II pr5
#include<iostream.h>
#include<string.h>
char s[201];
int i,n,nr,ok;

void main()
{
cin.get(s,201);
n=strlen(s);
i=0;
while(i<n)
{
ok=0;
if(strchr("aeiouAEIOU",s[i]))
ok=1;
while(s[i]!=' ' && i<n)
i++;
if(strchr("aeiouAEIOU",s[i-1]) && ok)
nr++;
i++;
}
if(nr)
cout<<nr;
else
cout<<"Nu exista";
}
Varianta 065
1. c
2. d
3. 4 muchii
4. 101 noduri
//varianta 065 sub II pr5
#include<iostream.h>
int n,m,i,j,a[50][50],k;
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=n;i++)
if(i%2!=0)
for(j=1;j<=m;j++)
a[i][j]=++k;
else
for(j=1;j<=m;j++)
a[i][m-j+1]=++k;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 066
1. c

2. b
3. 3 si 5
4. afiseaza informatia memorata in ultimul nod
5. //varianta 066 sub II pr 5
#include<iostream.h>
#include<string.h>
char s[51];
int i,j,n;
void main()
{
cin.get(s,51);
n=strlen(s);
for(i=0;i<n;i++)
{
for(j=0;j<=i;j++)
cout<<s[j];
cout<<endl;
}}
Varianta 067
1. a
2. c
3. 2 descendenti: 5 si 7
4. 222
5. //varianta 67 sub II pr 5
#include<iostream.h>
#include<string.h>
char s[51];
int i,j,n;
void main()
{
cin.get(s,51);
n=strlen(s);
for(i=n-1;i>=0;i--)
{
for(j=i;j<=n-1;j++)
cout<<s[j];
cout<<endl;
}
}
Varianta 068
1. d
2. a
3. t=(0,1,1,2,2,5,5)
4. z->next=y;
x->next=z;
5. //varianta 068 sub II pr 5
#include<iostream.h>
int m,n,a[50][50],i,j,p=1;
void main()

{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cin>>a[i][j];
if(i%2==0 && j%2==1 && a[i][j]>0)
p*=a[i][j];
}
cout<<p;
}
Varianta 069
1. b
2. c
3. t=(0,1,1,3,3,4,4)
u->next=v;
u=v;
4. //varianta 069 sub II pr 5
#include<iostream.h>
int n,a[50][50],i,j,ok;
void main()
{
cout<<"n= ";cin>>n;
ok=1;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cin>>a[i][j];
if(i>j && a[i][j]!=0)
ok=0;
}
if(ok)
cout<<"Este triunghiulara superior";
else
cout<<"Nu este triunghiulara superior";
}
Varianta 070
1. a
2. d
3. t=(2,0,2,5,2)
4. u1->next=p1;
5. //varianta 070 sub II pr 5
#include<iostream.h>
int m,n,a[50][50],i,j,x;
void main()
{
cout<<"n= ";cin>>n;

cout<<"m= ";cin>>m;
cout<<"x= ";cin>>x;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
for(i=x;i<m;i++)
for(j=1;j<=n;j++)
a[i][j]=a[i+1][j];
for(i=1;i<m;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 071
1. a
2. a
3. s1=0; s2=0;
for(i=0;i<n;i++)
{
s1+=a[i][i];
s2+=a[i][n-i-1];
}
4. cin.get(); cin.get(e1.nume,31);
cin>>e1.nota;
cin.get(); cin.get(e2.nume,31);
cin>>e2.nota;
if(e1.nota>=e2.nota)
cout<<e1.nume;
else
cout<<e2.nume;
5. //varianta 71 sub II pr 5
#include<iostream.h>
#include<string.h>
void main()
{
char s[256],c[21],*p;
int i,n,ok=0;
cin.get(s,256);
cin.get();
cin.get(c,21);
n=strlen(c);
p=strstr(s,c);
while(p)
{
ok=1;
for(i=p-s;i<p-s+n;i++)
s[i]='*';
p=strstr(p,c);

}
if(!ok) cout<<"nu exista";
else
cout<<s;
}
Varianta 072
1. c
2. d
3. Graful are o componenta conexa. Daca eliminam nodurile 1, 4, 5 obtinem 4
componente conexe.
4. u->urm=p->urm;
p->urm->urm=p;
p->urm=NULL:
5. //varianta 072 sub II pr 5
#include<iostream.h>
int a[100][100],i,j,n;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n-i+1;j++)
{
if(i==1)
a[i][j]=j*(j+1)/2;
else
a[i][j]=a[i-1][j+1]-1;
a[n-j+1][n-i+1]=a[i][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 073
1. b
2. c
3. 2 arce
4. float aux;
for(i=0;i<n;i++)
{
aux=a[q][i]; a[q][i]=a[p][i];a[p][i]=aux;
}
5. //varianta 073 probl 5 sub II
#include<iostream.h>
#include<string.h>
char s[256],aux[256];
int i,j,n,nr,min=256;
void main()
{

cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
{
cin.get();
cin.get(s,256);
nr=0;
j=0;
while(j<strlen(s))
{
if(strchr("aeiou",s[j]))
nr++;
j++;
}
if(min>=nr)
{
strcpy(aux,s);
min=nr;
}
}
cout<<aux;
}
Varianta 074
1. a
2. c
3. Descendentii nodului 2: 4,5,6,7,9. Descendentii directi ai nodului 2 sunt 4, 6, 9.
Noduri frunza 5 (1.3.4.5.7)
4. a. 2 muchii
b. 1 muchie
5. //varianta 074 sub II pr 5
#include<iostream.h>
int a[50][50],i,j,n,f0=1,f1=1;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i==1 && (j==1 || j==2))
a[i][j]=1;
else
{
a[i][j]=(f0+f1)%10;
f0=f1;
f1=a[i][j];
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;

}
}
Varianta 075
1. b
2. d
3. q->urm=p;
p=q;
r->urm=q;
4. 2 arce
5. //varianta 075 sub II pr 5
#include<iostream.h>
int a[100][100],i,j,n;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
a[i][j]=(i+j)*(i+j);
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 076
1. b
2. a
3. 2 arce (1,8) si (4,3)
4. t=(5,3,6,6,7,0,6,3)
5. //varianta 076 sub II pr 5
#include<iostream.h>
#include<string.h>
char s[21];
int i,n;
void main()
{
cin.get(s,21);
n=strlen(s);
while(i<=n/2)
{
strcpy(s,s+1);
s[strlen(s)-1]='\0';
cout<<s<<endl;
i++;
}
}

Varianta 077
1. a
2. a
3. 2 arce
4. 2 noduri
5. //varianta 077 sub II pr 5
#include<iostream.h>
#include<string.h>
#include<stdlib.h>
void main()
{
char s[51];
int i,n;
cin.get(s,51);
i=1;
s[0]=toupper(s[0]);
s[strlen(s)-1]=toupper(s[strlen(s)-1]);
while(i<strlen(s)-2)
{
if((s[i]!=' ' && s[i+1]==' ')|| (s[i-1]==' ' && s[i]!=' '))
s[i]=toupper(s[i]);
i++;
}
cout<<s;
}
Varianta 078
1. c
2. b
3. 2 arce
4. 99 muchii
5. //var78
#include<iostream.h>
#include<string.h>
void main()
{
char s[101],c[16],aux[150],*p;
int i,n;
cin.get(s,101);
cin.get();
cin.get(c,16);
n=strlen(c);
p=strstr(s,c);
while(p)
{
strcpy(aux,p+n);
strcpy(p+n,"?");
strcpy(p+n+1,aux);
p=strstr(p+n,c);
}
cout<<s;
}

Varianta 079
1. a
2. a
3. t=(4,0,6,9,2,5,4,3,2,6,4,6,2)
4. 4 muchii
5. //var 79
#include<iostream.h>
#include<string.h>
void main()
{
char s[101],aux[101];
int i,j;
cin.get(s,101);
i=0;j=0;
while(i<strlen(s))
{
aux[j]=s[i];
j++;
if(strchr("aeiouAEIOU",s[i]))
aux[j++]='*';
i++;
}
aux[j]='\0';
cout<<aux;
}
Varianta 080
1. d
2. d
3. 6 varfuri
4. 2 muchii
5. //varianta 80 sub II pr5
#include<iostream.h>
#include<string.h>
char s[21],aux;
int i,m;
void main()
{
cin.get(s,21);m=(strlen(s)+1)/2;
for(i=0;i<strlen(s)/2;i++)
{
aux=s[i];
s[i]=s[m+i];
s[m+i]=aux;
}
cout<<s;
}
Varianta 081
1. c
2. a
3. a=a+b;

b=a-b;
a=a-b;
4. p=prim;
while(p!=NULL)
{
if(p->info%7==0)
cout<<p->info<< ;
p=p->adr;
}
5. //varianta 081 sub II pr 5
#include<iostream.h>
int a[10][10],k,m,n,i,j,ok,s;
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
cout<<"k= ";cin>>k;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
for(j=1;j<=m;j++)
{
ok=0;
for(i=1;i<=m;i++)
{
if(a[i][j]==k)
ok=1;
}
if(ok)
s+=j;
}
cout<<s;
}
Varianta 082
1. b
2. a
3. tarta
4. p=prim;
while(p!=NULL)
{
if(p->info%10==0)
cout<<p->info<< ;
p=p->adr;
}
5. //varianta 082 sub II pr 5
#include<iostream.h>
int a[10][10],k,m,n,i,j,ok,p=1;
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;

cout<<"k= ";cin>>k;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
for(j=1;j<=m;j++)
{
ok=0;
for(i=1;i<=m;i++)
{
if(a[i][j]==k)
ok=1;
}
if(ok)
p*=j;
}
cout<<p;
}
Varianta 083
1. c
2. a
3.
0 1 1 0 0 0
1 0 1 0 0 0
1 1 0 0 0 0
0 0 0 0 1 1
0 0 0 1 0 1
0 0 0 1 1 0
4. for(j=1;j<=m;j++)
if(a[k][j]%2==1)
cout<<a[k][j]<< ;
5. //var 83
struct nod
{
char info;
nod*prec,*urm;
}*prim,*ultim,*q,*r;
q=prim;r=ultim;
while(q->prec!=r)
{
aux=q->info;
q->info=r->info;
r->info=aux;
q=q->urm;
r=r->prec;
}
Varianta 084
1. d
2. a
3. char c;
cin>>c;

if(c!=Z && c!=z)

c=c+1;
cout<<c;
4. long p=1;
for(i=1;i<=4;i++)
p*=a[i]*a[5-i];
cout<<p;
5. //var84
struct nod
{
unsigned int info;
nod *urm;
}*prim,*q;
long produs;
produs=prim->info;
q=prim;
while(q->urm!=NULL)
q=q->urm;
produs*=q->info;
cout<<produs;
Varianta 085
1. a
2. b
3. cout<<s[0]<< <<s[strlen(s)-1];
4. p=1;
for(i=1;i<=4;i++)
p*=a[i][i];
cout<<p;
5. #include<iostream.h>
struct nod{unsigned info;
nod *adr;} *prim, *q;
void main()
{//crearea listei
q=prim;
while(q)
{if(sqrt(q->info)==int(sqrt(q->info))
cout<<q->info<< ;
q=q->adr;}}
Varianta 086
1. a
2. a
3.
0 1 1 1 0 0
1 0 0 0 0 0
1 0 0 0 1 1
1 0 0 0 0 0
0 0 1 0 0 0
0 0 1 0 0 0
4. a=2; b=9
5. //varianta 086 sub II pr 5

#include<iostream.h>
int a[20][20],i,j,n,x;
void main()
{
cout<<"n= ";cin>>n;
x=1;
for(i=1;i<=2*n;i=i+2)
for(j=1;j<=2*n;j++)
{
a[i][j]=x;
x+=2;
}
x=2;
for(i=2;i<=2*n;i=i+2)
for(j=1;j<=2*n;j++)
{
a[i][2*n-j+1]=x;
x+=2;
}
for(i=1;i<=2*n;i++)
{
for(j=1;j<=2*n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 087
1. a
2. b
3. {1,2}
4. a=2;b=-1;
5. //varianta 087 sub II pr 5
#include<iostream.h>
int a[20][20],n,i,j,s,nr;
float ma;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cin>>a[i][j];
if(i>j && a[i][j]>0)
{
s+=a[i][j];
nr++;
}
}
ma=(float)s/nr;
cout<<ma;
}

Varianta 088
1. a
2. b
3. {6,3,5,4}
4. a=2;b=1;
5. //varianta 088 sub II pr 5
#include<iostream.h>
int a[20][20],n,i,j,s,nr;
float ma;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cin>>a[i][j];
if(i<j && a[i][j]>0)
{
s+=a[i][j];
nr++;
}
}
ma=(float)s/nr;
cout<<ma;
}
Varianta 089
1. a
2. a
3. t=(0,1,1,2,3,3,2)
0 1 1 0 0 0 0
1 0 0 1 0 0 1
1 0 0 0 1 1 0
0 1 0 0 0 0 0
0 0 1 0 0 0 0
0 0 1 0 0 0 0
0 1 0 0 0 0 0
4. a=2;b=23;
5. //varianta 089 sub II pr 5
#include<iostream.h>
int a[50][50],i,j,n,f0=1,f1=1,f;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i%2==1)
if(i==1 && (j==1 || j==2))
a[i][j]=1;
else

a[i][j]=f;
else
a[i][n-j+1]=f;
f0=f1;
f1=f;
f=f0+f1;
}
a[1][1]=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 090
1. a
2. b
3. {1,2}
4. a=2;b=16;
5. //varianta 090 sub II pr 5
#include<iostream.h>
int a[20][20],n,i,j,s1,nr1,s2,nr2;
float m1,m2;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cin>>a[i][j];
if(i<j && a[i][j]>0)
{
s1+=a[i][j];
nr1++;
}
if(i>j && a[i][j]>0)
{
s2+=a[i][j];
nr2++;
}
}
m1=(float)s1/nr1;
m2=(float)s2/nr2;
cout<<m1-m2;
}
Varianta 091
1. d
2. a
3. for(j=1;j<=10;j++)

A[j][3]=100;
4. da
dacarba
5. //varianta 091 sub II pr 5
#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
#include<string.h>
struct nod{char info;
nod*prec,*urm;}*p, *u;
void creare(char s[31],nod*&p,nod*&u)
{nod *q;
u=p=new nod;
p->info=s[0];p->urm=p->prec=NULL;
for (int i=1;i<strlen(s);i++)
{q=new nod;
q->info=s[i];
q->urm=NULL;
q->prec=u;
u->urm=q;
u=q;}
}
void listare(nod*q)
{while(q)
{cout<<q->info; q=q->prec;}
cout<<endl;
}
void main()
{char s[31];
cout<<"dati cuvantul ";cin>>s;
creare(s,p,u);
cout<<"lista este ";
listare(u);
}
Varianta 092
1. b
2. b
3. t=(3,6,0,1,8,1,1,3)
4. v.extremitate.x==v.origine.x && v.extremitate.y==v.origine.y
5. //varianta 092 sub II pr 5
#include<iostream.h>
int a[50][50],m,n,min=9999,i,j,imin,jmin;
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
cin>>a[i][j];
if(min>a[i][j])

{
min=a[i][j];
imin=i;
jmin=j;
}
}
for(i=imin;i<m;i++)
for(j=1;j<=n;j++)
a[i][j]=a[i+1][j];
for(j=jmin;j<n;j++)
for(i=1;i<m;i++)
a[i][j]=a[i][j+1];
for(i=1;i<m;i++)
{
for(j=1;j<n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 093
1. d
2. b
3. {1}
4. 50 noduri
5.
Varianta 094
1. b
2. t=(2,5,5,5,0)
3.
1 2
2 3,
5
3 1,
4
4 5
5 3
4. //var 94
#include<iostream.h>
#include<string.h>
void main()
{
char s1[21],s2[21],*p;
int i;
cin.get(s1,21);
p=strchr(s1,' ');
i=p-s1+1;
while(s1[i]==' ')
i++;
strcpy(s2,s1+i);
strcat(s2," ");

strncat(s2,s1, p-s1);
cout<<s2;
}
Varianta 095
1. b
2. d
3.
1 2,3,4
2 1,3,4,
5
3 1,2,4,
5
4 2,3,5
5 1,2,3,
4
4. 5 ({(1,2)(2,4)(4,3)(3,2)(2,5)}
5. //var 95
#include<iostream.h>
#include<string.h>
void main()
{
char s1[21],s2[21],*p;
int i;
cin.get(s1,21);
p=strchr(s1,' ');
i=p-s1+1;
while(s1[i]==' ')
i++;
s2[0]=s1[i];s2[1]='.';
s2[2]=' ';s2[3]='\0';
strncat(s2,s1, p-s1);
cout<<s2;
}
Varianta 096
1. d
2. a
3.
1 2,3,4,
5
2 1,3,4,
5
3 1,2,5
4 1,2,5
5 1,2,3,
4
4. {(1,2)(2,4)(4,3)(3,2)(2,5)}
5. //var 96
#include<iostream.h>
#include<string.h>

void main()
{
char s1[21],s2[21],s3[43];
int i;
cin.get(s1,21);
cin.get();
cin.get(s2,21);
strcpy(s3,s2);
strcat(s3," ");
strcat(s3,s1);
cout<<s3;
}
Varianta 097
1. c
2. a
3. TITA
4. struct nod
{
int info;
nod*adr;
};
nod*p;
cout<<p->adr->adr->info;
5. // varianta 097 sub II pr 5
#include<iostream.h>
int a[50][50],n,i,j,m,aux;
void main()
{
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
for(i=1;i<=n/2;i++)
for(j=1;j<=m;j++)
{
aux=a[i][j];
a[i][j]=a[n-i+1][j];
a[n-i+1][j]=aux;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 098
1. b
2. a

3. t=(0,1,1,2,2,3)
4. struct colet
{
float cost, masa;
char oras[31];
}
colet x;
cin>>x.cost>>x.masa;
cin.get();
cin.get(x.oras,31);
5. //varianta 98 sub II pr 5
#include<iostream.h>
void main()
{
unsigned int n,k,i,j,a[50][50];
k=0;
do{
cout<<"=";cin>>n;
}while(n==0||n>50);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
a[i][j]=2*k++;
cout<<a[i][j]<<" ";
}
cout<<endl;
}
}
Varianta 099
1. d
2. a
3.
0 1 0 0 0
1 0 0 0 0
0 0 0 1 0
0 0 1 0 1
0 0 0 1 0
4.
1 3 5

EL
AD4
AD6
3 5
3 5 4
3 5 4 6

5. // varianta 099 sub II pr 5

#include<iostream.h>
int a[50][50],n,i,j;
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)

for(j=1;j<=i;j++)
{
a[i][j]=i;
a[j][i]=i;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
Varianta 100
1. d
2. a
3. 2,4,6
4. 3
5. //varianta 100 sub II pr 5
#include<iostream.h>
int n,i,j;
long a[100][100];
void main()
{
cout<<"n= ";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
for(i=0;i<=n+1;i++)
a[0][i]=a[n+1][i]=a[i][0]=a[i][n+1]=999999;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][j]<a[i-1][j] && a[i][j]<a[i+1][j] && a[i][j]<a[i][j-1] && a[i]
[j]<a[i][j+1])
cout<<a[i][j]<<' ';
}