#include <iostream> #include <string> #include <bitset> #include <math.h> using namespace std; typedef long long int ll; int a = 0, b = 0, c = 0, d = 0, e = 0, err = 0, p = 0; bool ziwangyanma(int z[]) { //按位取反加一后正好为2^n则为正确掩码 //在十进制下就是2^(n+1)-X正好是2^i unsigned i...