//第3回 課題１
#include <stdio.h>
#include <stdlib.h>
 
//この関数を実装する
int binary_search(int a[],int n,int x){
    int left = 0;
    int right = n - 1;
    int mid;
    while (left <= right) {
        mid = (left + right) / 2;
        if (a[mid] == x) {
            return mid;
        } else if (a[mid] < x) {
            left = mid + 1;
        } else {
            right = 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+8kQojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPHN0ZGxpYi5oPgogCi8v44GT44Gu6Zai5pWw44KS5a6f6KOF44GZ44KLCmludCBiaW5hcnlfc2VhcmNoKGludCBhW10saW50IG4saW50IHgpewogICAgaW50IGxlZnQgPSAwOwogICAgaW50IHJpZ2h0ID0gbiAtIDE7CiAgICBpbnQgbWlkOwogICAgd2hpbGUgKGxlZnQgPD0gcmlnaHQpIHsKICAgICAgICBtaWQgPSAobGVmdCArIHJpZ2h0KSAvIDI7CiAgICAgICAgaWYgKGFbbWlkXSA9PSB4KSB7CiAgICAgICAgICAgIHJldHVybiBtaWQ7CiAgICAgICAgfSBlbHNlIGlmIChhW21pZF0gPCB4KSB7CiAgICAgICAgICAgIGxlZnQgPSBtaWQgKyAxOwogICAgICAgIH0gZWxzZSB7CiAgICAgICAgICAgIHJpZ2h0ID0gbWlkIC0gMTsKICAgICAgICB9CiAgICB9CiAgICByZXR1cm4gLTE7Cn0KIAppbnQgbWFpbih2b2lkKSB7CglpbnQgbix4LGk7CglpbnQgKmE7CglpbnQgYW5zID0gLTE7CglzY2FuZigiJWQgJWQiLCZuLCZ4KTsKCWEgPSAoaW50KiltYWxsb2Moc2l6ZW9mKGludCkqbik7CglpZihhPT1OVUxMKXsKCQlwcmludGYoIkVSUk9SXG4iKTsKCQlyZXR1cm4gLTE7Cgl9Cglmb3IoaT0wO2k8bjtpKyspewoJCXNjYW5mKCIlZCIsJmFbaV0pOwoJfQoJYW5zID0gYmluYXJ5X3NlYXJjaChhLG4seCk7CglpZihhbnMgIT0gLTEpIHByaW50ZigiYVslZF0gPSAlZFxuIixhbnMsYVthbnNdKTsKCWVsc2UgcHJpbnRmKCJub3QgZm91bmRcbiIpOwoJZnJlZShhKTsKCXJldHVybiAwOwp9

MTIgNQoxIDIgMyA0IDUgOCA5IDEzIDE2IDIxIDI1IDI3

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