zoukankan      html  css  js  c++  java
  • ACM Where is the Marble?

    Description

    Download as PDF
     

    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 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

     1 /*
     2     Name: Where is the Marble? 
     3     Copyright: 
     4     Author: 
     5     Date: 10/08/17 14:11
     6     Description: 
     7 */
     8 
     9 #include<stdio.h>
    10 #include<iostream>
    11 #include<algorithm>
    12 using namespace std; 
    13 int main()
    14 {
    15     int n,q,count,num[10005],s;
    16     count = 0;
    17     while(cin>>n>>q&&n!=0||q!=0)
    18     {
    19         count++;
    20         cout<<"CASE# "<<count<<":"<<endl;
    21         for(int i = 0; i < n;i++)
    22             scanf("%d",&num[i]);
    23         sort(num,num+n); //排序 
    24         for(int i = 0; i < q; i++)
    25         {
    26             scanf("%d",&s);
    27             int temp = lower_bound(num,num+n,s)-num; //使用lower_bound函数简化代码量 
    28             if(num[temp] == s)
    29                 cout<<s<<" found at " <<temp+1<<endl;
    30             else
    31                 cout<<s<<" not found"<<endl;
    32         } 
    33         
    34     }
    35 
    36 return 0;
    37 }
  • 相关阅读:
    【URAL 1004】 floyd最小环
    【UVA 10881】 经典模拟题
    【HDU 1541】 树状数组(入门题)
    【HDU 4000】 树状数组
    【HDU 3391 && HDU 4431】 dfs+模拟
    【HDU 1058 & HDU 3199 类似丑数】 简单DP思想
    Acdream原创群赛3(部分题解)
    vfor实现双层循环嵌套
    vue获取当前时间并实时刷新时间
    vue+element ui实现左侧导航栏动态路由跳转
  • 原文地址:https://www.cnblogs.com/jj81/p/7339121.html
Copyright © 2011-2022 走看看