For this Question: A shop sells candies of sweetness ranging from 1 to 1000000000. Price of a candy with sweetness X is <b>A*X + B*f(X)</b> units, where f(X) returns number of digits in the decimal notation of X. Given A, B, and T, find the candy with maximum sweetness that Andy can buy if he has T units of money. If he cannot buy any candy, print 0.The first and the only line of input contains three integers A, B and T.

Constraints:
1 <= A, B <= 10^9
1 <= T <= 10^18Print the maximum sweetness that Andy can buy if he has T units of money. If he cannot buy any candy, print 0.Sample Input 1
10 7 100

Sample Output 1
9

Explanation: Cost of 9 level candy = 9*10 + 7*f(9) = 9*10 + 7*1 = 97.

Sample Input 2
1000000000 1000000000 100

Sample Output 2
0, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException {
    BufferedReader s=new BufferedReader(new InputStreamReader(System.in));
	String []S=s.readLine().split(" ");
	long A=Long.parseLong(S[0]);
	long B=Long.parseLong(S[1]);
	long T=Long.parseLong(S[2]);

	findmaxsweetness(A,B,T);

	}

	public static void findmaxsweetness(long A,long B,long T){

	 long start=0;
	 long end=1000000001;

	 while(start<end){

	 long mid=start+(end-start)/2;

	 long amount=findsweetness(A,B,mid);

	 if(amount>T){
      end=mid;
	 }
    else{
	  start=mid+1;
	}
	 }
	 if(start==0)
	 System.out.println(start);
	 else
	 System.out.println(start-1);
	}

	public static long findsweetness(long A,long B,long mid){
		String S=String.valueOf(mid);
		long len=S.length();
		long result= (A*mid)+(B*len);
		return result;
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?