RECURSION

BridgeCrossing

Code import java.util.Arrays; public class BridgeCrossing{ int n, min; boolean[] a; int[] times; void go(int t, int num) { for (int i = 0; i < n; i++) { if (!a[i]) continue; a[i] = false; for (int j = i+1; j < n; j++) { if (!a[j]) continue; a[j] = false; if (num==2 && t+time