import java.util.Scanner; public class Main { static long[] f = new long[105]; static void binarySearch(long x) { int l = 1, r = f.length - 3; int mid = 0; while (l <= r) { mid = l + (r - l) / 2; if (f[mid] >= x) { r = m...