UVa 10474 Where is the Marble?

最新推荐文章于 2022-01-18 15:51:31 发布

原创最新推荐文章于 2022-01-18 15:51:31 发布 · 984 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#2010

UVa 专栏收录该内容

92 篇文章

订阅专栏

本文提供了一篇关于UVa10474问题“Where is the Marble?”的解题报告。报告中详细介绍了使用C++实现的解决方案，包括读取输入数据、对数据进行排序并查找特定元素的位置。此算法通过了在线评测系统的测试。

/* coder: ACboy date: 2010-2-25 result: 1AC description: UVa 10474 Where is the Marble? */ #include <iostream> #include <algorithm> #include <vector> using namespace std; int main() { int i, j; int N, Q; vector<int> ve; int count = 0; #ifndef ONLINE_JUDGE freopen("10474.txt", "r", stdin); #endif while (cin >> N >> Q) { if (N == Q && Q == 0) break; for (i = 0; i < N; i++) { int temp; cin >> temp; ve.push_back(temp); } sort(ve.begin(), ve.end()); cout << "CASE# " << ++count << ":" << endl; for (j = 0; j < Q; j++) { int find; cin >> find; int position = -1; int len = ve.size(); for (i = 0; i < len; i++) { if (ve[i] == find) { position = i; break;} } if (position == -1) { cout << find << " not found" << endl; } else { cout << find << " found at " << position + 1 << endl; } } ve.clear(); } return 0; }