摘要:
You are given an undirected graph G(V, E). Each vertex has a mark which is an integer from the range [0..231 – 1]. Different vertexes may have the sam 阅读全文
摘要:
1277. Cops and Thieves Time limit: 1.0 secondMemory limit: 64 MB The Galaxy Police (Galaxpol) found out that a notorious gang of thieves has plans for 阅读全文
摘要:
Xiao Ming is an expert in computer science and technology, so he can get a lot of projects every month. The projects always bring him a lot of money, 阅读全文
摘要:
Jedi knights, Qui-Gon Jinn and his young apprentice Obi-Wan Kenobi, are entrusted by Queen Padmé Amidala to save Naboofrom an invasion by the Trade Fe 阅读全文
摘要:
The citizens of a small village are tired of being the only inhabitants around without a connection to the Internet. After nominating the future netwo 阅读全文
摘要:
A group of n castle guards are voting to determine whether African swallows can carry coconuts. While each guard has his own personal opinion on the m 阅读全文