#include <vector>
#include <map>
#include <sstream>
#include <string>
#include<iostream>
#include<cstdio>
#include <algorithm>
#include<iomanip>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
int n, q, kase = 1;
while (scanf("%d%d", &n, &q) == 2 && n != 0)
{
vector<int>a;
printf("CASE# %d:\n", kase++);
int temp;
for (int i = 0; i < n; ++i)
{
cin >> temp;
a.push_back(temp);
}
sort(a.begin(), a.end());
while (q-- > 0)
{
cin >> temp;
auto iter=find(a.begin(), a.end(), temp);
if (iter != a.end())
printf("%d found at %d\n", temp, iter - a.begin() + 1);
else
printf("%d not found\n", temp);
}
}
}
紫书UVa10474
最新推荐文章于 2022-01-18 15:51:31 发布