Where is the Marble?


Where is the Marble?

10474 Where is the Marble?

Raju and Meena love to play with Marbles. They have got a lot of marbles

with numbers written on them. At the beginning, Raju would place the

marbles one after another in ascending order of the numbers 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 correct answer,

and Meena gets the point if Raju fails. After some fixed number of trials

the game ends and the player with 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 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. Total no of test cases is less than 65.

Each test case consists begins with 2 integers: N the number of marbles and Q the number of queries

Mina would make. The next N lines would contain the numbers written on the N marbles. These

marble numbers will not come in any particular order. Following Q lines will have Q queries. Be

assured, 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:

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 number x is not present.

Look at the output for sample input for details.

Sample Input

4 1

235155

2

133

31230

0

Sample Output

CASE# 1:

5 found at 4

CASE# 2:

2 not found

3 found at 3

大意：

第一行给一组数字N 和Q 接下来N行给出N个数字  之后Q行给出Q个数字

然后对每个Q在N个数字中搜索，输出是否找到，以及找到的位置

要点：

在搜索前，要对N个数进行排序

有多个数时输出第一个位置

代码：

#include <iostream>
#include <algorithm>
using namespace std;

int num[10005];
int que[10005];

int main()
{
int n, q;
int c = 1;
while (cin >> n >> q && (n != 0 || q != 0))
{
cout << "CASE# " << c << ":" << endl;
c++;
for (int i = 0; i < n; i++)
cin >> num[i];
sort(num, num + n);
for (int i = 0; i < q; i++)
{
cin >> que[i];
bool f = false;
for (int j = 0; j < n; j++)
if (que[i] == num[j])
{
cout << que[i] << " found at " << j + 1 << endl;
f = true;
break;
}
if (!f)
cout << que[i] << " not found" << endl;
}
}
}