For this Question: Given a function f(x) = ax<sup>2 </sup> + bx + c and an integer K. Find the minimum non - negative integer value of <b>t</b> such that f(t) >= K.First line contains four positive integers a, b, c, K.

Constraints
1 <= a, b, c <=100
0 <= K <= 10^16Print the value of <b>t</b>.Sample Input 1:
1 1 1 1

Output 
0

Explanation:
f(0) = (0 + 0 + 1) >=  1

Sample Input 2:
1 1 1 2

Output 
1

Explanation:
f(0) = 1 < 2
f(1) = 3 >=2 , I have written this Solution Code: import java.io.*;
import java.util.*;
class Main
{
    static long binary_search(long a, long b, long c, long k) {
    	long l = 0;
    	long r = 100000000;
    	long ans = 0;
    	while (l <= r) {
    		long t = (l + r) / 2;
    		long f = a * t * t + b * t + c;
    		if (f >= k) {
    			ans = t;
    			r = t - 1;
    		}
    		else {
    			l = t + 1;
    		}
    	}
    	return ans;
    }
    public static void main (String args[]) throws IOException
    {   
        BufferedReader br = new BufferedReader (new InputStreamReader(System.in));
        String line = br.readLine();
        String[] strs = line.trim().split("\\s+");
        long  a=Long.parseLong(strs[0]);
        long  b=Long.parseLong(strs[1]);
        long  c=Long.parseLong(strs[2]);
        long  k=Long.parseLong(strs[3]);
    	System.out.print(binary_search(a, b, c, k));
    }
}

, In this Programming Language: Java, Now tell me if this Code is compilable or not?