10474Where is the Marble?

/***  @author:heiqiaoxiang*  @time:2013/10/18 17:24*  @theme:Where is the Marble ?*  @将输入的N个marble上的数字利用库函数按照升序排列，然后查找要搜索的数字在排好序的数组中的位置*/#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>//#define LOCALusing namespace std;int marble_number[10000];void find(int N,int query){    int i;    for(i=0;i<N;i++){if(marble_number[i] == query){    printf("%d found at %d\n",query,i+1);    return;}    }    printf("%d not found\n",query);    return;}int main(){#ifdef LOCAL    freopen("in.txt","r",stdin);     #endif    int n=0;//n<=65 test cases    int N;//number of marbles    int Q;//number of queries Mina would make    //all input numbers 0<=x<=10000 and input is terminated by N=0 and Q=0    while(scanf("%d%d",&N,&Q)==2&&(N|Q)){        printf("CASE# %d:\n",++n);        memset(marble_number,0,sizeof(marble_number));    int i,query;        for(i=0;i<N;i++){//因为后面要调用sort函数所以此处i应该从1开始而不是0            scanf("%d",&marble_number[i]);}sort(marble_number,marble_number+N);//按升序排列  for(i=0;i<Q;i++){    scanf("%d",&query);    find(N,query);}    }    return 0;}