zoukankan      html  css  js  c++  java
  • Uva10474

    <span style="color:#330099;">/*
    E - E
    Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu
    Submit
     
    Status
     
    Practice
     
    UVA 10474
    Description
    
    
      Where is the Marble?

    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 By Grant Yuan 2014.7.14 UVA10474 */ #include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> using namespace std; int m,n; int a[10001]; int b[10001]; int cmp(const void *a,const void *b) { return(*(int*)a-*(int*)b); } int slove(int k) { for(int i=0;i<m;i++) if(a[i]==k) return i+1; return -1; } int main() {int l;int count; while(1){ count=1; cin>>m>>n; if(m==0&&n==0) break; for(int i=0;i<m;i++) cin>>a[i]; for(int i=0;i<n;i++) cin>>b[i]; qsort(a,m,sizeof(a[0]),cmp); for(int i=0;i<m;i++) cout<<a[i]<<" "; for(int i=0;i<n;i++) { l=slove(b[i]); printf("CASE# %d: ",count++); if(l==-1) printf("%d not found ",b[i]); else printf("%d found at %d ",b[i],l); }} return 0; } </span>


  • 相关阅读:
    JDBC学习笔记一
    MySql学习笔记四
    MySql学习笔记三
    MySql学习笔记二
    将select 转为json
    这个网站病毒挺有意思,下载我网站的图片,我说怎么爬虫爬我几十个G的图片
    学习新知识的“填--捋--磨”策略
    谈下程序设计算法的准备心得与体会-nCov隔离也许帮你提升能力
    关于青少年,编程,教育的一些感悟(写在农历鼠年前)
    数据库敏捷版本控制之3个数据库策略
  • 原文地址:https://www.cnblogs.com/blfbuaa/p/6791302.html
Copyright © 2011-2022 走看看