UVA 10474 - Where is the Marble
2013-08-09 14:47
477 查看
Where is the Marble? |
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 and Q 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 1 2 3 5 1 5 5 2 1 3 3 3 1 2 3 0 0
Sample Output
CASE# 1: 5 found at 4 CASE# 2: 2 not found 3 found at 3
======================================
直接排个序看它是第几个就行了
#include <iostream> #include <cstdio> #include <algorithm> using namespace std; int n,q,a[11111]; int main() { int t=0,x; while(~scanf("%d%d",&n,&q)) { if(n==0&&q==0) break; printf("CASE# %d:\n",++t); for(int i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n); for(int i=0;i<q;i++) { int ok=0; scanf("%d",&x); for(int i=0;i<n;i++) { if(x==a[i]) { printf("%d found at %d\n",x,i+1); ok=1; break; } } if(!ok) printf("%d not found\n",x); } } return 0; }
相关文章推荐
- UVa 10474 Where is the Marble?
- 算法竞赛入门经典第五章例题5-1 Where is the Marble? UVA - 10474
- UVa - 10474 - Where is the Marble?
- Where is the Marble? UVA - 10474
- UVa 10474 Where is the Marble?
- UVa-10474-Where is the Marble?
- uva 10474 Where is the Marble?
- UVA 10474 Where is the Marble? (STL)
- UVA10474_Where is the Marble?【sort】【lower_bound】
- 【例题5-1 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? (STL最简单运用)
- 10474--Where is the Marble?--Uva
- UVa 10474 - Where is the Marble?
- UVA - 10474 Where is the Marble?
- UVa 10474 Where is the Marble?
- UVA - 10474 Where is the Marble?
- 例题5-1 UVA 10474 Where is the Marble?大理石在哪?