//第3回 課題１
#include <stdio.h>
#include <stdlib.h>
 
//この関数を実装する
int binary_search(int a[],int n,int x){
	//この関数の内側だけを書く
  int l=0,r=n-1;
  while(l<=r){
    int m = (l+r)/2;
    if(a[m]==x) return m;
    else if(x<a[m]) r=m-1;
    else l = m+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+8kQojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPHN0ZGxpYi5oPgogCi8v44GT44Gu6Zai5pWw44KS5a6f6KOF44GZ44KLCmludCBiaW5hcnlfc2VhcmNoKGludCBhW10saW50IG4saW50IHgpewoJLy/jgZPjga7plqLmlbDjga7lhoXlgbTjgaDjgZHjgpLmm7jjgY8KICBpbnQgbD0wLHI9bi0xOwogIHdoaWxlKGw8PXIpewogICAgaW50IG0gPSAobCtyKS8yOwogICAgaWYoYVttXT09eCkgcmV0dXJuIG07CiAgICBlbHNlIGlmKHg8YVttXSkgcj1tLTE7CiAgICBlbHNlIGwgPSBtKzE7CiAgfQogIHJldHVybiAtMTsKfQogCmludCBtYWluKHZvaWQpIHsKCWludCBuLHgsaTsKCWludCAqYTsKCWludCBhbnMgPSAtMTsKCXNjYW5mKCIlZCAlZCIsJm4sJngpOwoJYSA9IChpbnQqKW1hbGxvYyhzaXplb2YoaW50KSpuKTsKCWlmKGE9PU5VTEwpewoJCXByaW50ZigiRVJST1JcbiIpOwoJCXJldHVybiAtMTsKCX0KCWZvcihpPTA7aTxuO2krKyl7CgkJc2NhbmYoIiVkIiwmYVtpXSk7Cgl9CglhbnMgPSBiaW5hcnlfc2VhcmNoKGEsbix4KTsKCWlmKGFucyAhPSAtMSkgcHJpbnRmKCJhWyVkXSA9ICVkXG4iLGFucyxhW2Fuc10pOwoJZWxzZSBwcmludGYoIm5vdCBmb3VuZFxuIik7CglmcmVlKGEpOwoJcmV0dXJuIDA7Cn0=

MTIgNQoxIDIgMyA0IDUgOCA5IDEzIDE2IDIxIDI1IDI3

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