摘要：
Problem DescriptionMarica is very angry with Mirko because he found a new girlfriend and she seeks revenge.Since she doesn't live in the same city, sh... 阅读全文
摘要：
Problem Description杭州有N个景区，景区之间有一些双向的路来连接，现在8600想找一条旅游路线，这个路线从A点出发并且最后回到A点，假设经过的路线为V1,V2,....VK,V1,那么必须满足K>2,就是说至除了出发点以外至少要经过2个其他不同的景区，而且不能重复经过同一个景区。现... 阅读全文
摘要：
Problem DescriptionClarke is a patient with multiple personality disorder. One day, Clarke split into two personality a and b, they are playing a game... 阅读全文
摘要：
Problem DescriptionClarke is a patient with multiple personality disorder. One day, Clarke turned into a student and read a book.Suddenly, a difficult... 阅读全文
摘要：
Problem DescriptionClarke is a patient with multiple personality disorder. One day, Clarke turned into a game player of minecraft. On that day, Clarke... 阅读全文
摘要：
Problem DescriptionRompire is a robot kingdom and a lot of robots live there peacefully. But one day, the king of Rompire was captured by human beings... 阅读全文
摘要：
Problem DescriptionI used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.The nation looks like a con... 阅读全文
摘要：
Problem DescriptionA thief is running away!We can consider the city where he locates as an undirected graph in which nodes stand for crosses and edges... 阅读全文
摘要：
DescriptionThere are N cities in a country, and there is one and only one simple path between each pair of cities. A merchant has chosen some paths an... 阅读全文
摘要：
DescriptionThe cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their h... 阅读全文