Interactive Problems in Competitive Programming

// Setting the lower and upper bounds
let lowerBound = 2;
let upperBound = 10;

// Number to be guessed is 6

// Iterating from lowerBound to upperBound
for (let i = lowerBound; i <= upperBound; i++) {
    console.log(i);

    // Simulating input from the judge
    // (For actual input, you can use prompt() in a browser environment)
    let response = prompt("Enter 0 if the number is guessed correctly:");

    // Converting the response to an integer
    response = parseInt(response);

    if (response === 0) {
        console.log("Number guessed is: " + i);
        break;
    }
}

// This code is contributed by divyeshrabadiya07

const readline = require('readline');

const rl = readline.createInterface({
  input: process.stdin,
  output: process.stdout
});

function binarySearch() {
  let lowerBound = 2;
  let upperBound = 10;

  // Number to be guessed is 9

  // Applying Binary Search interactively
  while (lowerBound <= upperBound) {
    let mid = Math.floor((lowerBound + upperBound) / 2);

    // Print the guessed number
    console.log(mid);

    // Input the response from the judge
    rl.question('Enter -1 if the number is lower, 1 if higher, or 0 if guessed correctly: ', (response) => {
      response = parseInt(response);

      if (response === -1) {
        lowerBound = mid + 1;
      } else if (response === 1) {
        upperBound = mid - 1;
      } else if (response === 0) {
        console.log("Number guessed is: " + mid);
        rl.close();
        return;
      }

      binarySearch(); // Recursively call binarySearch function
    });
    return; // Exit the function after asking for user input
  }
}

binarySearch(); // Start the binary search