zoukankan      html  css  js  c++  java
  • 例题 5-1 STL

    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
    23515 5 2 13331
    23 0 0 Sample Output CASE# 1: 5 found at 4 CASE# 2: 2 not found 3 found at 3

        题目的 意思  大概就是       第一行  给你两个数字  第一个 代表了  第二行数字的个数   第二个 代表了 第三行数字的个数         将第二行的由小到大  排序之后        从第三行  中的 数字 和 第二行比较 如果 有相同的  就 打印  出  他排序之后   是第几个数字.

     1 //  关键是 第17行的    标准模板库  里面 的  一点东西  这也算是 第一次  有意识到  接触  标准模板库了吧.
     2 #include<cstdio>
     3 #include<algorithm>
     4 using namespace std;
     5 int main()
     6 {
     7     int q,n,a[10000],b,c,i,x,p,m,j,kase=0;
     8     while(scanf("%d%d",&n,&m)==2&&n)
     9     {
    10         printf("CASE# %d
    ",++kase);
    11         for(i=0;i<n;i++)
    12             scanf("%d",&a[i]);
    13         sort(a,a+n);
    14         while(m--)
    15         {
    16             scanf("%d",&x);
    17             p=lower_bound(a,a+n,x)-a;                //   返回的 是  数组的  下标
    18             if(a[p]==x)
    19                 printf("%d found at %d
    ",x,p+1);
    20             else
    21                 printf("%d not found
    ",x);
    22         }
    23     }
    24     return 0;
    25 }
  • 相关阅读:
    通过DataSet操作XML
    什么是网站流量
    JavaScript总结(2)网页上显示时间
    对xml操作的主要方法
    xml保存图片和读取图片(三)
    SharePoint初探sharepoint 安装宝典(2)
    SharePoint初探启用wss的全文搜索(6)
    转载:sharepoint portal server2003安装小记
    SharePoint初探装完Wss后,无法创建或打开原有Web项目问题(7)
    SharePoint初探SharePoint网站整理(8)
  • 原文地址:https://www.cnblogs.com/A-FM/p/5169572.html
Copyright © 2011-2022 走看看