Topcodersrm 630 (500 floyed brute force _ builtin_popcount ())

Question: Give N points to ensure graph connectivity, give the distance between points, and find the most point. The distance between these points is the same.

Analysis:

The code below is the first great God in our room. It is very concise and I have the same idea as him, but I don't know where the error is.

The idea is brute-force enumeration. There can be a maximum of 10 points. Use floyed to calculate the distance between each two points, and then use bitwise to perform brute-force enumeration,

Enumerate whether each vertex is added in, and use set to add the distance between each vertex. If the distance is unique, all the distance between the vertex is the same,

Then, use _ builtin_popcount () to calculate the number of 1 points in the binary, that is, the number of points added and the maximum value is obtained.