摘要：
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... 阅读全文