uva10474

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1415

10474 - Where is the Marble?

Time limit: 3.000 seconds

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:

• `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
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

---

Problem-setter: Monirul Hasan Tomal, Southeast University

 

题意：先给你一组数据（可以是任意的），你输入一个数判断这个数是否和献给定的数据有相同的，有的话，输出它在数据里的位置（必须先自己排好序），没有输出没找到。。

思路：先给输出的数据排序，然后 再把和输入的一个数和这组数按顺序比较就行了。。数组开了1001WA了一次。原来看错了，不认真，要开10000

 

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[10010];//开大点啊
int main()
{
 int n,q;//n表示输入数组的个数,q表示有几次询问。。
 int count=0;
 while(scanf("%d %d",&n,&q)!=EOF)
 {
  if(n==0&&q==0)//结束标志
   return 0;
  int i,j;
  for(i=1;i<=n;i++)
   scanf("%d",&a[i]);
  sort(a+1,a+n+1);//排序
  int x;
  printf("CASE# %d:\n",++count);
  while(q--)//有几次询问（用for居然出问题了）
  {
   int flag=0;
   scanf("%d",&x);//要询问的数
   for(i=1;i<=n;i++)
   {
    if(x==a[i])//如果相等
    {
     flag=1;
     printf("%d found at %d\n",x,i);
     break;//就不再比较了
    }
    else
    {
     flag=0;
     continue;
    }
   }
   if(flag==0)
    printf("%d not found\n",x);
  }
 }
 return 0;
}