poj 2288 Islands and Bridges

#include #include #include #include using namespace std; //poj 2288 Islands and Bridges int n,m; int a[15]; int con[15][15]; __int64 dp[1<<13][15][15]; //权值和路径数可能都会超过整数范围 __int64 way[1<<13][15][15]; int ones (int key) //计算一个整数二进制表示中1的个数 { int c=0; while (key) { key&=(key-1); c++; } return c; } int main() { int t,d,b; scanf("%d",&t); while (t--) { memset(con,0,sizeof(con)); memset(dp,-1,sizeof(dp)); memset(way,0,sizeof(way)); scanf("%d%d",&n,&m); for (int i=0;i ans) { ans=dp[(1<