UVA10474 Where is the Marble?

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1415

水题 简单排序查找 快排+哈希

#include <stdio.h>
#include<string.h>
int cmp(const void*a,const void *b)
{
    return *(int *)a-*(int *)b;
}
int main()
{
    int i,j,n, m, a[10001],b[10001],x[10001],k = 0;
    while(scanf("%d%d", &n, &m)!=EOF)
    {
        if(n == 0&&m == 0)
        break;
        k++;
        memset(b,0,sizeof(b));
        for(i = 0 ; i < n ; i++)
            scanf("%d", &a[i]);
        qsort(a,n,sizeof(a[0]),cmp);
        for(i = 0;  i < n ; i++)
        {
            if(!b[a[i]])
            b[a[i]] = i+1;
        }
        for(i = 1 ; i <= m ; i++)
            scanf("%d", &x[i]);
        printf("CASE# %d:\n",k);
        for(i = 1 ; i <= m ; i++)
        {
            if(b[x[i]]!=0)
            printf("%d found at %d\n",x[i],b[x[i]]);
            else
            printf("%d not found\n",x[i]);
        }
    }
    return 0;
}