uva - 10474 - Where is the Marble?

//#define Local
#include <iostream>
#include <cstring>
using namespace std;

struct Array
{
	int num[10001];
	int len;
};

void Sort (Array *hoodle)
{
	int i = 0, j = 0, temp = 0;
	for (i = 0; i < (*hoodle).len; i++)
		for (j = (*hoodle).len - 1; j > i; j--)
			if ((*hoodle).num[j] < (*hoodle).num[j-1])
			{
				temp = (*hoodle).num[j-1];
				(*hoodle).num[j-1] = (*hoodle).num[j];
				(*hoodle).num[j] = temp;
			}
}

int main()
{
#ifdef Local
	freopen("a.in", "r", stdin);
	freopen("a.out", "w", stdout);
#endif
	Array hoodle = {0, 0}, ques = {0, 0};
	int a = 0, b = 0, x = 0, i = 0, j = 0, flag = 0, count = 0;
	while (cin >> a >> b && a !=0 && b != 0)
	{
		cout << "CASE# " << ++count << ":" <<endl;
		hoodle.len = a;
		ques.len = b;
		for (i = 0; i < a; i++)
		{
			cin >> x;
			hoodle.num[i] = x;
		}
		for (i = 0; i < b; i++)
		{
			cin >> x;
			ques.num[i] = x;
		}
		Sort(&hoodle);
		for (i = 0; i < b; i++)
		{
			flag = 0;
			for (j = 0; j < a; j++)
			{
				if (ques.num[i] == hoodle.num[j])
				{
					flag = 1;
					cout << ques.num[i] <<	" found at " << j+1 << endl;
					break;
				}
			}
			if (0 == flag)
				cout << ques.num[i] << " not found" <<endl;
		}
	}
	return 0;
}
/*数组开小了
倒数那个if刚开始放在了for里边
*/