More Detailed Problem Description
I understand the theory for this problem (fast matrix exponentiation), but I need a problem to test my code on, as I was not able to find one after multiple Internet searches. Could someone please provide a problem that asks for a solution along these lines?
Thanks in advance!
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
166E - Tetrahedron: This is basically same problem, but here you are given the graph in problem statement.
http://mirror.codeforces.com/gym/101081/problem/G
Hey lucaasdamaso, Could you take a look at my code? I've tried to solve it, but It gave me "wrong answer on test 15" https://ideone.com/FvMNbo
its possible a situation where the number of paths is 0 modulo 1e9+7, so u have to print 0 instead of -1. sorry for bad english
That was my mistake. Thanks lucaasdamaso!