Where is the Marble? ACM problem 10474 Solved.

Where is Marble?

Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. In the beginning, Raju would place the marbles one after another in ascending order of the

Raju and Meena

Numbers are written on them. Then Meena would ask Raju to find the first marble with a certain number. She would count 1...2...3. Raju gets one point for the correct answer, and Meena gets the point if Raju fails. After a fixed number of trials, the game ends, and the player with the maximum points wins. Today it's your chance to play as Raju. Being the smart kid, you'd be taking the favor of a computer. But don't underestimate Meena; she had written a program.

to keep track of how much time you're taking to give all the answers. So now you have to write a program, which will help you in your role as Raju.

Input 

There can be multiple test cases. The total number of test cases is less than 65. Each test case begins with 2 integers: N, the number of marbles, and Q, the number of queries Mina would make. The following N lines would contain the numbers written on the N marbles. These marble numbers will not come in any particular order. THE Following Q lines will have Q queries. Be assured, that none of the input numbers are greater than 10000 and none of them are negative.
Input is terminated by a test case where N = 0 and Q = 0.

Output 

For each test case output the serial number of the case.
For each of the queries, print one line of output. The format of this line will depend upon whether or not the query number is written upon any of the marbles. The two different formats are described below:

• `x found at y' if the first marble with number x was found at position y. Positions are numbered 1, 2,..., N.
• `x not found' if the marble with the number x is not present.

Look at the output for sample input for details.

Sample Input 

4 1 2 3 5 1 5 5 2 1 3 3 3 1 2 3 0 0

Sample Output

CASE# 1: 5 found at 4 CASE# 2: 2 not found 3 found at 3

Solved Code 

/*http://amaderkotha-diu.blogspot.com*/ import java.util.Scanner ; public class MarbleGame { int ar[] ; int length ; static Scanner w = new Scanner(System.in); int point, md, tp, btm ; public void QuickSort (int [] a) { Sort(a) ; } public void Sort(int [] a) { this.ar = a ; this.length = a.length ; QuickSort(0,length - 1) ; if(ar == null || ar.length == 0) { return ; } } private void QuickSort(int low, int high) { int i = low ; int j = high ; int pivot = ar [low + (high - low) / 2] ; while(i <= j) { while(ar[i] < pivot) { i++ ; } while(ar[j] > pivot) { j-- ; } if(i <= j) { Exchange(i,j) ; i++ ; j-- ; } } if(low < j) { QuickSort(low,j) ; } if(i < high) { QuickSort(i,high) ; } } private void Exchange(int i, int j) { int temp = ar[i]; ar[i] = ar[j] ; ar[j] = temp ; } public int BinarySearch (int [] a){ btm = 0 ; tp = a.length - 1 ; point = w.nextInt() ; do{ md = (btm + tp) / 2 ; if(point < a[md]) { tp = md -1 ; } else if (point > a[md]) { btm = md + 1 ; } } while(point != a[md] && btm <= tp) ; if(point == a[md]) { System.out.println(point + " found at " + (md + 1 )); } else{ System.out.println(point + " Not Found"); } return 0 ; } public static void main(String[] args) { MarbleGame g = new MarbleGame() ; int N,Q,i; int cc = 1; int Case = 63 ; for(int j = cc ; j <= Case ; j++) { N = w.nextInt() ; Q = w.nextInt() ; int [] a = new int [N] ; if(N !=0 || Q != 0) { for(i = 0; i < N; i++) { a[i] = w.nextInt() ; } g.QuickSort (a) ; System.out.println(); System.out.printf("CASE# %d:\n",cc++); while(Q-- != 0) { g.BinarySearch(a) ; } } else { return ; } } } }

Happy Coding ...