摘要:
B. Mr. Kitayuta's Colorful Graphtime limit per test1 secondMr. Kitayuta has just bought an undirected graph consisting of n vertices and m edges. The ... 阅读全文
摘要:
DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a stron... 阅读全文
摘要:
A very hard Aoshu probleProblem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathe... 阅读全文
摘要:
Destroying the bus stationsTime Limit:1000MSMemory Limit:65536KTotal Submissions:1832Accepted:595DescriptionGabiluso is one of the greatest spies in h... 阅读全文