UVA 10474 - Where is the Marble?
来源:互联网 发布:对比度拉伸算法 编辑:程序博客网 时间:2024/05/20 03:41
Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. At the beginning, Raju would place the marbles one after another in ascending order of the numbers written on them. Then Meena would ask Raju to find the first marble with a certain number. She would count 1...2...3. Raju gets one point for correct answer, and Meena gets the point if Raju fails. After some fixed number of trials the game ends and the player with maximum points wins. Today it's your chance to play as Raju. Being the smart kid, you'd be taking the favor of a computer. But don't underestimate Meena, she had written a program to keep track how much time you're taking to give all the answers. So now you have to write a program, which will help you in your role as Raju.
Input
There can be multiple test cases. Total no of test cases is less than 65. Each test case consists begins with 2 integers: N the number of marbles andQ the number of queries Mina would make. The next N lines would contain the numbers written on the N marbles. These marble numbers will not come in any particular order. Following Q lines will have Q queries. Be assured, none of the input numbers are greater than 10000 and none of them are negative.
Input is terminated by a test case where N = 0 and Q = 0.
Output
For each test case output the serial number of the case.
For each of the queries, print one line of output. The format of this line will depend upon whether or not the query number is written upon any of the marbles. The two different formats are described below:
- `x found at y', if the first marble with number x was found at position y. Positions are numbered 1, 2,..., N.
- `x not found', if the marble with number x is not present.
Look at the output for sample input for details.
Sample Input
4 1235155 213331230 0
Sample Output
CASE# 1:5 found at 4CASE# 2:2 not found3 found at 3
先排序在用lower_bound查找,sort函数+lower_bound
#include<cstdio>#include<algorithm>using namespace std;const int MAXN=10000;int main(){int a[MAXN],n,q,x,sum=0;while (scanf("%d%d",&n,&q)&&n){printf("CASE# %d:\n",++sum);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);elseprintf("%d not found\n",x);}}return 0;}
- UVa 10474 Where is the Marble?
- Uva 10474 Where is the Marble?
- uva 10474 Where is the Marble?
- UVA 10474 Where is the Marble?
- UVA 10474 - Where is the Marble
- uva-10474 - Where is the Marble?
- uva 10474 - Where is the Marble?
- UVA 10474 - Where is the Marble?
- UVa 10474 - Where is the Marble?
- UVa 10474 - Where is the Marble
- UVa 10474 - Where is the Marble?
- UVA 10474 Where is the Marble?
- UVA 10474 - Where is the Marble
- UVa - 10474 - Where is the Marble?
- uva 10474 Where is the Marble?
- uva 10474 Where is the Marble?
- uva - 10474 - Where is the Marble?
- uva 10474 - Where is the Marble
- Android类动态加载技术
- 金庸武侠小说之我的见解
- web前端
- LevelDB源码剖析之SSTable_1(Block的创建与读取)
- python对文件进行读写操作
- UVA 10474 - Where is the Marble?
- 版本控制工具SVN在Windows平台下的平台搭建
- android 自定义键盘 KeyboardView的key 文字颜色发虚模糊
- 实例学习gcc+gdb+make
- 学习FPGA的网站推荐
- find命令总结
- STL之vector使用详解
- FreeBSD修改csh为bash后root无法登录解决办法
- 遇到问题解决问题-----VIsualSVN Server的安装