//第3回 課題１
#include <stdio.h>
#include <stdlib.h>
 
//この関数を実装する
int binary_search(int a[],int n,int x){
	//この関数の内側だけを書く
	int ret = -1;
	int lef=0, rig=n-1;
	int mid;
	while(lef<=rig){
		mid=(lef+rig)/2;
		//printf("lef=%d, rig=%dmid=%d\n",lef,rig,mid);
		if(a[mid]==x){
			ret=mid;
			break;
		}
		if(a[mid]>x) rig=mid-1;
		else lef=mid+1;
	}
	return ret;
}
 
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/oo4XjgZnjgosKaW50IGJpbmFyeV9zZWFyY2goaW50IGFbXSxpbnQgbixpbnQgeCl7CgkvL+OBk+OBrumWouaVsOOBruWGheWBtOOBoOOBkeOCkuabuOOBjwoJaW50IHJldCA9IC0xOwoJaW50IGxlZj0wLCByaWc9bi0xOwoJaW50IG1pZDsKCXdoaWxlKGxlZjw9cmlnKXsKCQltaWQ9KGxlZityaWcpLzI7CgkJLy9wcmludGYoImxlZj0lZCwgcmlnPSVkbWlkPSVkXG4iLGxlZixyaWcsbWlkKTsKCQlpZihhW21pZF09PXgpewoJCQlyZXQ9bWlkOwoJCQlicmVhazsKCQl9CgkJaWYoYVttaWRdPngpIHJpZz1taWQtMTsKCQllbHNlIGxlZj1taWQrMTsKCX0KCXJldHVybiByZXQ7Cn0KCmludCBtYWluKHZvaWQpIHsKCWludCBuLHgsaTsKCWludCAqYTsKCWludCBhbnMgPSAtMTsKCXNjYW5mKCIlZCAlZCIsJm4sJngpOwoJYSA9IChpbnQqKW1hbGxvYyhzaXplb2YoaW50KSpuKTsKCWlmKGE9PU5VTEwpewoJCXByaW50ZigiRVJST1JcbiIpOwoJCXJldHVybiAtMTsKCX0KCWZvcihpPTA7aTxuO2krKyl7CgkJc2NhbmYoIiVkIiwmYVtpXSk7Cgl9CglhbnMgPSBiaW5hcnlfc2VhcmNoKGEsbix4KTsKCWlmKGFucyAhPSAtMSkgcHJpbnRmKCJhWyVkXSA9ICVkXG4iLGFucyxhW2Fuc10pOwoJZWxzZSBwcmludGYoIm5vdCBmb3VuZFxuIik7CglmcmVlKGEpOwoJcmV0dXJuIDA7Cn0K

MTIgNQoxIDIgMyA0IDUgOCA5IDEzIDE2IDIxIDI1IDI3

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