![:(](./images/smilies/icon_frown.gif)
Code: Select all
#include<stdio.h>
int compare (const void * , const void *) ;
int a[1000000] , b[1000000] ;
int main(void)
{
int N , i , v = 0 , Q , j ;
while(++v){
scanf("%d%d",&N,&Q) ;
if(N == 0 && Q == 0)break ;
for(i = 0 ; i < N ; i ++)
{
scanf("%d",&a[i]);
}
for(i = 0 ; i < Q ; i++)
{
scanf("%d",&b[i]) ;
}
qsort(a,N,sizeof(int),compare) ;
printf("CASE# %d:\n",v);
for(i = 0 ; i < Q ; i ++)
{
for(j = 0 ; j < N ; j ++)
{
if(a[j] == b[i])break ;
}
if(a[j] == b[i])printf("%d found at %d\n",b[i],j+1);
else printf("%d not found\n",b[i]) ;
}
}
return 0 ;
}
int compare(const void *i , const void *j)
{
return *((const int*)i ) - *((const int*)j ) ;
}