Codeforces1334E - Divisor Paths

Description You are given a positive integer D. Let’s build the following graph from it:c++ each vertex is a divisor of D (not necessarily prime, 1 and D itself are also included); two vertices x and

>>阅读原文<<