Gerry99的博客

Problem Statement      Hero owns a factory. There are n robots working at the factory. The robots are numbered 0 through n-1. Today, exactly one of the robots became corrupted. Hero has

Problem Statement      Hero has a simple undirected graph. (Simple means that each edge connects two different vertices, and each pair of vertices is connected by at most one edge.) A g