add 3637 mod + tests

java/search/BinarySearchTest.java

@@ -12,6 +12,8 @@ import java.util.function.Function;
 import java.util.stream.IntStream;
 import java.util.stream.Stream;
 
+import static java.util.stream.IntStream.range;
+
 /**
  * @author Georgiy Korneev (kgeorgiy@kgeorgiy.info)
  */
@@ -28,10 +30,18 @@ public final class BinarySearchTest {
     }
 
 
+    // === 3637
+
+    private static int count(final int c, final int x, final int[] a) {
+        return (int) range(0, a.length).filter(i -> a[i] == x).count();
+    }
+
+
     // === Common code
 
     public static final Selector SELECTOR = new Selector(BinarySearchTest.class)
             .variant("Base",    Solver.variant0("", Kind.DESC, BinarySearchTest::base))
+            .variant("3637",    Solver.variant0("3637", Kind.DESC,  BinarySearchTest::count))
             ;
 
     public static void main(final String... args) {