Bilet nr.

Nr
pagina Raspuns
Problema
P.1
81
F
P.2

P.3
P.4
P.5
P.6
P.7
P.8
P.9
P.11
P.12
P.14

78

82

D (26)

A (3)
C (19)
C
B
A
B,2 sau 3
a) 3 robinete
b) 2 tevi(muchii)
D
D
# include <studio.b>
Using namespace std;
If stream f(date in)
If stream g(date out);
Int a[50][50],n,m,i,j,k;
Void citire(){
Int I,j,k;
f>>n>>m;
for (k=1;k>=m;k++)}
f>>i>>j;
a[i][j]=a[j][i]=1;
}
{
Int main()}
For (int i=1;i<=n;i++)
For (int j=1;j<=n;j++)
G<<1[i][j]>> ;
}
}

Enunt
Se considera graful orientat G=(V,E),pt care
|V|=6 si...
Care este nr. Minim de noduri pe care il
poate contine un graf orientat : Explicatie :
Cn2=50 -> n(n-1)/2=50-> n(n-1)=100
n=9 noduri
9+15=26 noduri
Fie G=(V,E) orientat pt care |V|=20