### Question:
PerfectMatchingInKBipartite { public static boolean solve(int[][] relationships, int k) { return false; }  static boolean solve(int[][] relationships, int k);  }### Answer:
@Test public void basicTest() { for (int n = 4; n <= 16; n += 2) { for (int k = 1; k <= n / 2; k++) { int[][] relationship = new int[n][n]; if (!fullfill(relationship, k, n)) continue; Assert.assertEquals(true, PerfectMatchingInKBipartite.solve(relationship, k)); System.out.println("pass " + n + "," + k); } } }