Where is the Marble?UVa 10474

题目就不再多说了，把代码放上。我写的：

#include<cstdio>
#include<algorithm>
using namespace std;
bool cmp(int a,int b)
{
	return a<b;
}
int main()
{
	int p, q, n, i, x;
	int a[10050];
	int k=0;
	while(scanf("%d %d",&n,&q)!=EOF)
	{
		if(n==0&&q==0)
		break;
		k++;
		int flag=0;
		printf("CASE# %d:\n",k);
		for(i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
		}
		sort(a,a+n,cmp);
		for(i=0;i<q;i++)
		{
			flag=0;
			scanf("%d",&x);
			for(int j=0;j<n;j++)
			{
				if(a[j]==x)
				{
					printf("%d found at %d\n",x,j+1);
					flag=1;
					break; 
				}
			}
			if(flag==0)
				{
					printf("%d not found\n",x);
				}
		}
	}
	return 0;
 } 

在把书上的程序放上：

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 10000;
int main()
{
	int n, q, x ,a[maxn],kase = 0;
	while(scanf("%d%d", &n, &q) == 2 && n){
		printf("CASE# %d:\n", ++kase);
		for(int i =0; i < n; i++) scanf("%d", &a[i]);
		sort(a, a+n);
		while(q--)
		{
			scanf("%d", &x);
			int p = lower_bound(a, a+n, x)-a;
			if(a[p] == x)printf("%d found at %d\n", x, p+1);
			else printf("%d not found\n",x);
		}
	}
	return 0;
}

有空再补点题解，算法竞赛入门经典第五章的例题我添加到了Vjudge judge。方便练习：

https://vjudge.net/contest/215177#overview