Google Code Jam 2017, Qualification Round, compact C solution

C.java

  /**
   * Complexity O(log(k))
   */
  private static String solve2(long n, long k) {
    while (k != 1) {
      n = ((n & 1) == 0 && (k & 1) == 1) ? (n / 2) - 1 : n / 2;
      k = k / 2;
    }

    long bigHalf = n / 2;
    long smallHalf = (n - 1) - bigHalf;

    return "" + bigHalf + " " + smallHalf;
  }