helped for me 3 17 answer 1 3 3 18 17 first I tried this problem with 10 bfs, but it was giving me wa5. when I coded it int dijkstra with edges of 0,1,2,3, I got AC. so is minimal k necessary? This tests helped me to find bugs with wa5 and wa84 5 8 answer: 1 3 5 4 8  5 18 answer: 1 3 5 6 18  7 25 answer: 2 3 7 5 25 vertexes are 1..10 and d , d + 1, d1, d+2, d2, t + 3, t  3, where d's are divisors of t. Edited by author 17.01.2017 16:15 WA#10 s == t Edited by author 18.01.2017 00:46 AC! Hell yeah! Can you give me test №76? I got AC with a wrong solution during the contest, so I think the test cases might be a bit weak. One example my wrong solution didn't pass is: 7 63713822 It printed 3, while the best answer is 2: 7 > 8 > 31856912 > 31856911 > 63713822. Can you please add it to the testset? (Edit: I've fixed my solution now, but others may fail.) Edited by author 03.12.2016 18:42 Can members of the director board be subordinates? For example, is 6 a subordinate of 3? Yes, 6 is a subordinate of 1, 2, and 3. Edited by author 19.11.2016 15:45 Для теста 5 5 что нужно вывести 0 2 5 5 или 0 1 5 "An employee can send a memo only to another employee. The route of memo can consist of one employee." So the answer should be 0 1 5. 
