table(scoring). |_. Subtask |_. Punctaj |_. Constrangeri |
| 1
| 6 puncte

| 2 ≤ N ≤ 100, prag{~inf~} = 100, prag{~sup~} = 100
||
| 2
| 9 puncte

| 2 ≤ N ≤ 10, prag{~inf~} = 100, prag{~sup~} = 100
||

| 3
| 5 puncte
| 2 ≤ N ≤ 10000, prag{~inf~} = 34, prag{~sup~} = 34, *arborele este un lant de $N$ noduri*
||
| 4

| 1

| 6 puncte

| 2 ≤ N ≤ 10000, prag{~inf~} = 34, prag{~sup~} = 34, *arborele este binar complet*
||
| 5
| 42 puncte
| 2 ≤ N ≤ 10, prag{~inf~} = 101, prag{~sup~} = 200
||
| 6
| 32 puncte
| 2 ≤ N ≤ 10, prag{~inf~} = 34, prag{~sup~} = 42
|

| 2 ≤ N ≤ 10, prag{~inf~} = 100, prag{~sup~} = 100

h2. Exemplu
table(example). |_. wildcards.in |_. wildcards.out |

|4
1 2
1 3
1 4
|???
000
0?1
11?
||
|3
1 2
2 3
|0
?
1
||
|5
1 2
1 3
3 4
3 5
|?00
000
1??
110
101
||
|2
2 1
|?
?

 | This is some
   text written on
   multiple lines.
 | This is another
   text written on
   multiple lines.
 |

h3. Explicaţie