UVA 10474

最新推荐文章于 2021-01-31 16:41:27 发布

zytjyh

最新推荐文章于 2021-01-31 16:41:27 发布

阅读量288

点赞数

分类专栏： UVA 文章标签： UVA

本文链接：https://blog.csdn.net/JACK_JYH/article/details/52711367

版权

UVA 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

#pragma warning(disable:4996)#include#include#include#include#include#include#include#include#include #include#include#includeusing namespace std;const int INF = 0x3f3f3f3f;int a[10005];int vs_main(){int n, m;cin.sync_with_stdio(false);int cas = 1;while (cin >> n >> m, n || m){for (int i = 0; i < n; i++)cin >> a[i];sort(a, a + n);int temp;cout << "CASE# " << cas++ <<":"<< endl;for (int i = 0; i < m; i++){bool flag = false;cin >> temp;for (int j = 0; j < n; j++){if (a[j] == temp){cout << temp << " found at " << j+1 << endl;flag = true;break;}}if (!flag)cout << temp << " not found" << endl;}}return 0;}