Connected Components
题目：
Driver Fang is given Nnodes, each node is labeled with an integer between 1and 1000000(inclusive and labels are not necessarily distinct). Two nodes have an edge between them, if and only if the GCD (Greatest Common Divisor) of the labels of these nodes is greater than 1. Now, his task is to count the number of connected components in the graph. Driver Fang is giv
