Evildoer_llc的博客

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1878 欧拉回路是指不令笔离开纸面，可画过图中每条边仅一次，且可以回到起点的一条回路。现给定一个图，问是否存在欧拉回路？     Input 测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是节点数N ( 1 < N < 1000...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5348 As we all kown, MZL hates the endless loop deeply, and he commands you to solve this problem to end the loop. You are given an undirected g...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5883 Alice is planning her travel route in a beautiful valley. In this valley, there are N lakes, and M rivers linking these lakes. Alice wants to ...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3018 Ant Country consist of N towns.There are M roads connecting the towns. Ant Tony,together with his friends,wants to go through every part of...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1116 The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line con...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3472 IELTS is around the corner! love8909 has registered for the exam, but he still hasn’t got prepared. Now he decides to take actions. But when h...

原创博客 ：https://blog.youkuaiyun.com/a709743744/article/details/51457790题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2894第一问的答案毫无疑问是2^n第二问的答案长度肯定是2^n   因为要求前n个必然是0原问题是要求能够表示出0-(2^n-1)的数 每个数只能出现一次 一圈...