zoukankan      html  css  js  c++  java
  • H

    Description

    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
    解题思路:用set容器查看是否含有这个元素,用vector来存所有元素,先排序,再查询。
    AC代码:
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int main(){
     4     int n,q,x,y,cnt=1;
     5     set<int> se;vector<int> vec;
     6     while(cin>>n>>q&&(n+q)){
     7         se.clear();vec.clear();
     8         while(n--){
     9             cin>>x;
    10             se.insert(x);
    11             vec.push_back(x);
    12         }
    13         cout<<"CASE# "<<cnt++<<':'<<endl;
    14         sort(vec.begin(),vec.end());
    15         while(q--){
    16             cin>>y;
    17             if(!se.count(y))cout<<y<<" not found"<<endl;
    18             else cout<<y<<" found at "<<(lower_bound(vec.begin(),vec.end(),y)-vec.begin()+1)<<endl;
    19         }
    20     }
    21     return 0;
    22 }
    
    
  • 相关阅读:
    原创《小白的Java自学课》第一课:Java是什么?Java到底能干嘛?
    谷歌chrome浏览器
    QT学习之QPair类
    char 与 signed char 和 unsigned char三者之间的关系
    QT学习之QT判断界面当前点击的按钮和当前鼠标坐标
    QT学习之QScript
    QT Creater 配色方案及下载
    QT学习之QString的arg方法
    QT创建与调用Dll方法(包括类成员)--显式调用
    C++学习之显式类型转换与运行时类型识别RTTI
  • 原文地址:https://www.cnblogs.com/acgoto/p/9413573.html
Copyright © 2011-2022 走看看