[UVa] 10474 - Where is the Marble?

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;


int main(){

  //freopen("input.txt","r",stdin);
  int N,Q;
  int n[10000],q[10000];
  int cases=0;
  while(1){
    scanf("%d %d", &N, &Q);
    if(N==0 && Q==0)break;
    printf("CASE# %d:\n",++cases);
    memset(n,0,sizeof(n));
    memset(q,0,sizeof(q));
    for(int i=0;i<N;i++)scanf("%d",&n[i]);
    for(int i=0;i<Q;i++)scanf("%d",&q[i]);
    //for(int i=0;i<N;i++)printf("%d ",n[i]); 
    for(int i=0;i<N;i++){
      for(int j=i+1;j<N;j++){
        if(n[i]>n[j]){
          int tmp = n[i];
          n[i] = n[j];
          n[j] = tmp;
        }
      }
    }
    for(int i=0;i<Q;i++){
      for(int j=0;j<N;j++){
        if(n[j]==q[i]){
          printf("%d found at %d\n", q[i], j+1);
          break;
     }
        if(j==N-1 && n[j]!=q[i])printf("%d not found\n", q[i]);
        //break;
      }
    }
    //for(int i=0;i<N;i++)printf("%d ",n[i]); printf("\n");
    //for(int i=0;i<Q;i++)printf("%d ",q[i]); printf("\n");
   
  } 
  return 0;
}