Matsushita's Blog


GCDGraph TopCoder グラフに置ける2点間に経路があるか否か

問題URL Problem Statement You are given four s: n, k, x, and y. The s n and k describe a simple undirected graph. The graph has n nodes, numbered 1 through n. Two distinct vertices i and j are connected by an edge if and…