uva-10474

这么简单的题叫我做，简直。。。。。。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define maxn 10080
using namespace std;

int n,m,t,a[maxn],b[maxn];

int main()
{
    t=1;
    while(cin>>n>>m)
    {if(!n&&!m)break;
        cout<<"CASE# "<<t++<<":"<<endl;

        for(int i=0;i<n;i++)
        cin>>a[i];
        sort(a,a+n);
        for(int i=0;i<m;i++)
        cin>>b[i];
        int j;
        for(int i=0;i<m;i++)
        {
            for(j=0;j<n;j++)
            if(b[i]==a[j]){cout<<b[i]<<" found at "<<j+1<<endl;break;}
            if(j>=n)cout<<b[i]<<" not found"<<endl;
        }
    }
}