For this Question: Design a system that takes big URLs like “http://www.geeksforgeeks.org/count-sum-of-digits-in-numbers-from1-to-n/” and converts them into a short 6 character URL. It is given that URLs are stored in database and every URL has an associated integer id. So your program should take an integer id and generate a 6 character long URL. 

A URL character can be one of the following

A lower case alphabet [‘a’ to ‘z’], total 26 characters
An upper case alphabet [‘A’ to ‘Z’], total 26 characters
A digit [‘0′ to ‘9’], total 10 characters
There are total 26 + 26 + 10 = 62 possible characters.

So the task is to convert an integer (database id) to a base 62 number where digits of 62 base are "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"The first line contains T denoting the number of test cases.
The next T lines contain a single integer N.

1 <= T <= 100000
1 <= N <= 1000000000For each test case, in a new line, print the shortened string.Sample Input:
1
12345

Sample Output:
dnh

Explanation:
Try to convert 12345 in base-62, replace the integer with the corresponding character, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
 static StringBuffer URL(int n)
    {
     StringBuffer c =new StringBuffer("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789");

        StringBuffer url = new StringBuffer();
         while (n > 0)
        {
            url.append(c.charAt(n % 62));
            n = n / 62;
        }

        return url.reverse();
    }

	public static void main (String[] args) throws IOException{

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    int l= Integer.parseInt(br.readLine());
    for(int i=0;i<l;i++){
    int n = Integer.parseInt(br.readLine());
    System.out.println(URL(n));
    }
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?