Ŀ

գҪıйص䡣 
һ repeat (0<repeat<10) repeat 㣺
һ n (1<n<=10) n Ǵ a Уһ xȻ a в x ͬԪأҵ x  a жӦԪصС±꣬ûҵӦϢ
ʾΪ˵
룺
2		(repeat=2)
6		(n=6)
1 3 5 7 9 5
5		(x=5)
4		(n=4)
1 3 5 7
2		(x=2)

5: a[2]
2: not found



#include <stdio.h>
int main(void)
{
    int flag, i, n, x;
    int repeat, ri;
    int a[10];

    scanf("%d", &repeat);
    for(ri = 1; ri <= repeat; ri++){ 	
        scanf("%d", &n);
        for(i = 0; i < n; i++)
            scanf("%d", &a[i]);
        scanf("%d", &x);
/*---------*/
        if(flag != 0)
            printf( "%d: a[%d]\n", x, i); 
        else
            printf( "%d: not found\n", x);

    }
}