//第3回 課題１
#include <stdio.h>
#include <stdlib.h>
 
//この関数を実装する
int binary_search(int a[],int n,int x){
	int lef=0,rig=n-1,mid;
	for(;lef<=rig;){
		mid=(lef+rig)/2;
		if(a[mid]==x)return mid;
		if(x<a[mid]){
			rig=mid-1;
		}else if(x>a[mid])lef=mid+1;
	}
	return -1;
}
 
int main(void) {
	int n,x,i;
	int *a;
	int ans = -1;
	scanf("%d %d",&n,&x);
	a = (int*)malloc(sizeof(int)*n);
	if(a==NULL){
		printf("ERROR\n");
		return -1;
	}
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	ans = binary_search(a,n,x);
	if(ans != -1) printf("a[%d] = %d\n",ans,a[ans]);
	else printf("not found\n");
	free(a);
	return 0;
}
 

Ly/nrKwz5ZueIOiqsumhjO+8kQojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPHN0ZGxpYi5oPgoKLy/jgZPjga7plqLmlbDjgpLlrp/oo4XjgZnjgosKaW50IGJpbmFyeV9zZWFyY2goaW50IGFbXSxpbnQgbixpbnQgeCl7CglpbnQgbGVmPTAscmlnPW4tMSxtaWQ7Cglmb3IoO2xlZjw9cmlnOyl7CgkJbWlkPShsZWYrcmlnKS8yOwoJCWlmKGFbbWlkXT09eClyZXR1cm4gbWlkOwoJCWlmKHg8YVttaWRdKXsKCQkJcmlnPW1pZC0xOwoJCX1lbHNlIGlmKHg+YVttaWRdKWxlZj1taWQrMTsKCX0KCXJldHVybiAtMTsKfQoKaW50IG1haW4odm9pZCkgewoJaW50IG4seCxpOwoJaW50ICphOwoJaW50IGFucyA9IC0xOwoJc2NhbmYoIiVkICVkIiwmbiwmeCk7CglhID0gKGludCopbWFsbG9jKHNpemVvZihpbnQpKm4pOwoJaWYoYT09TlVMTCl7CgkJcHJpbnRmKCJFUlJPUlxuIik7CgkJcmV0dXJuIC0xOwoJfQoJZm9yKGk9MDtpPG47aSsrKXsKCQlzY2FuZigiJWQiLCZhW2ldKTsKCX0KCWFucyA9IGJpbmFyeV9zZWFyY2goYSxuLHgpOwoJaWYoYW5zICE9IC0xKSBwcmludGYoImFbJWRdID0gJWRcbiIsYW5zLGFbYW5zXSk7CgllbHNlIHByaW50Zigibm90IGZvdW5kXG4iKTsKCWZyZWUoYSk7CglyZXR1cm4gMDsKfQo=

MTIgNQoKMSAyIDMgNCA1IDggOSAxMyAxNiAyMSAyNSAyNw==

12 5

1 2 3 4 5 8 9 13 16 21 25 27