# PTS
This is a [well-known](http://www.math.caltech.edu/~2014-15/2term/ma006b/13%20Counting%20Trees.pdf) problem in graph theory. It has a pretty boring solution with a pretty interesting proof! Having said that, for this task it suffices to calculate determinant of a slightly modified matrix.

Iterating through the challenges results in:
```
| Congratz! the flag is S4CTF{y3s_0lD__8u7__G0lD_s7ufF_0N__G_M4Tr1c3S}
```