摘要：
原题： Description Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex coverproblem very interesting. Supp 阅读全文
摘要：
原题： Description Mike and !Mike are old childhood rivals, they are opposite in everything they do, except programming. Today they have a problem they c 阅读全文
摘要：
原题： Description Mike wants to prepare for IMO but he doesn't know geometry, so his teacher gave him an interesting geometry problem. Let's define f([l 阅读全文