comefrom: <gouthampradhan>dynamic_programming_MakeArrayStrictlyIncreasing_1.java
code: private int binarySearch(int[] A, int k) {
      int l = 0, h = A.length;
      int ans = -1;
      while (l < h) {
        int m = l + (h - l) / 2;
        if (A[m] > k) {
          ans = m;
          h = m;
        } else l = m + 1;
      }
      return ans;
    }
masked: private int sample_funcname ( int [ ] var_0 , int var_1 ) {
    int var_3 = 0 , var_5 = var_0 . length ;
    int var_7 = - 1 ;
    while ( var_3 < var_5 ) {
      int var_9 = var_3 + ( var_5 - var_3 ) / 2 ;
      if ( var_0 [ var_9 ] > var_1 ) {
        var_7 = var_9 ;
        var_5 = var_9 ;
      }
      else var_3 = var_9 + 1 ;
    }
    return var_7 ;
  }
  