()
| 54 | public static boolean zero2; |
| 55 | |
| 56 | public static void compute2() { |
| 57 | len = 1; |
| 58 | for (long i = BIT; i >= 0; i--) { |
| 59 | for (int j = len; j <= n; j++) { |
| 60 | if ((basis2[j] & (1L << i)) != 0) { |
| 61 | swap(j, len); |
| 62 | break; |
| 63 | } |
| 64 | } |
| 65 | if ((basis2[len] & (1L << i)) != 0) { |
| 66 | for (int j = 1; j <= n; j++) { |
| 67 | if (j != len && (basis2[j] & (1L << i)) != 0) { |
| 68 | basis2[j] ^= basis2[len]; |
| 69 | } |
| 70 | } |
| 71 | len++; |
| 72 | } |
| 73 | } |
| 74 | len--; |
| 75 | zero2 = len != n; |
| 76 | } |
| 77 | |
| 78 | public static void swap(int a, int b) { |
| 79 | long tmp = basis2[a]; |