摘要：
就是判断单词能否接龙， 是一个有向图的欧拉道路。同样用dfs判断连通性（注意判断基图的连通性） 然后判断只有一个点入度>出度，一个点出度> 入度。题目：Play on WordsSome of the secret doors contain avery interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very important 阅读全文
摘要：
题目就是求一个无向图的欧拉回路，用dfs判断连通性然后判断度是偶数就行了。 特别注意R=0的情况输出not题目：Problem HMorning WalkTime Limit3 SecondsKamal is a Motashota guy. He has got a new job in Chittagong. So, he has moved to Chittagong from Dinajpur. He was getting fatter in Dinajpur as he had no work in his hand there. So, moving to Chittagong 阅读全文