现在的位置: 主页 > 公司荣誉 > 文章列表

HDU 5305 Friends(dfs)

作者:昆明飞华工贸有限公司 来源:www.kmfhgm.com    未知发布时间:2017-09-12 16:37:47
HDU 5305 Friends(dfs)


Friends
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 297 Accepted Submission(s): 127





Problem Description There are n people and m pairs of friends. For every pair of friends, they can choose to become online friends (communicating using online applications) or offline friends (mostly using face-to-face communication). However, everyone in these n people wants to have the same number of online and offline friends (i.e. If one person has x onine friends, he or she must have x offline friends too, but different people can have different number of online or offline friends). Please determine how many ways there are to satisfy their requirements.



Input The first line of the input is a single integer T (T=100), indicating the number of testcases.



For each testcase, the first line contains two integers n (1≤n≤8) and m (0≤m≤n(n−1)2), indicating the number of people and the number of pairs of friends, respectively. Each of the next m lines contains two numbers x and y, which mean x and y are friends. It is guaranteed that x≠y and every friend relationship will appear at most once.



Output For each testcase, print one number indicating the answer.

Sample Input

2
3 3
1 2
2 3
3 1
4 4
1 2
2 3
3 4
4 1


Sample Output

0
2


Source


/*

题意:n个人,m个关系,每个人和别人的关喜有线上和线下,求每个人线上和线下的关系一样多的方案数
思路: dfs
先贴别人代码,跑的快
,我的跑的慢

*/
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include

企业建站2800元起,携手武汉肥猫科技,做一个有见地的颜值派!更多优惠请戳:武汉网站推广 https://www.feimao666.com

上一篇:Thinkphp 无法使用-)order() 排序的两种解决办法! 下一篇:最后一页