Your title here...I am following the editorial for this problem 489D - Невыносимая запутанность бытия and am getting TLE on test case 7. 55729287
Can someone point out what is the difference between my implementation and Mike's.
I am also using brute force of selecting the two end nodes and then counting the number of intermediate nodes which provide path length of 2 between the selected nodes.
Anyone out there???