//第3回 課題1
#include <stdio.h>
#include <stdlib.h>
//この関数を実装する
int binary_search(int a[],int n,int x){
//この関数の内側だけを書く
int lef=0,rig=n-1,ans=-1;
int mid;
while(lef<=rig){
mid=(lef+rig)/2;
if(a[mid]==x){
ans=mid;
break;
}else if(mid>x){
rig=mid-1;
}else{
lef=mid+1;
}
}
return ans;
}
int main(void) {
int n,x,i;
int *a;
int ans = -1;
a
= (int*)malloc(sizeof(int)*n
); if(a==NULL){
return -1;
}
for(i=0;i<n;i++){
}
ans = binary_search(a,n,x);
if(ans
!= -1) printf("a[%d] = %d\n",ans
,a
[ans
]); return 0;
}
Ly/nrKwz5ZueIOiqsumhjO+8kQojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPHN0ZGxpYi5oPgoKLy/jgZPjga7plqLmlbDjgpLlrp/oo4XjgZnjgosKaW50IGJpbmFyeV9zZWFyY2goaW50IGFbXSxpbnQgbixpbnQgeCl7CgkvL+OBk+OBrumWouaVsOOBruWGheWBtOOBoOOBkeOCkuabuOOBjwogICBpbnQgbGVmPTAscmlnPW4tMSxhbnM9LTE7CiAgIGludCBtaWQ7CiAgIHdoaWxlKGxlZjw9cmlnKXsKICAgIG1pZD0obGVmK3JpZykvMjsKICAgICBpZihhW21pZF09PXgpewogICAgICAgICBhbnM9bWlkOwogICAgICAgICAgYnJlYWs7CiAgICAgICB9ZWxzZSBpZihtaWQ+eCl7CiAgICAgICAgICAgcmlnPW1pZC0xOwogICAgICAgfWVsc2V7CiAgICAgICAgICBsZWY9bWlkKzE7CiAgICAgICB9CiAgICAgICAgICAgCiAgIH0KICAgIHJldHVybiBhbnM7Cn0KCmludCBtYWluKHZvaWQpIHsKCWludCBuLHgsaTsKCWludCAqYTsKCWludCBhbnMgPSAtMTsKCXNjYW5mKCIlZCAlZCIsJm4sJngpOwoJYSA9IChpbnQqKW1hbGxvYyhzaXplb2YoaW50KSpuKTsKCWlmKGE9PU5VTEwpewoJCXByaW50ZigiRVJST1JcbiIpOwoJCXJldHVybiAtMTsKCX0KCWZvcihpPTA7aTxuO2krKyl7CgkJc2NhbmYoIiVkIiwmYVtpXSk7Cgl9CglhbnMgPSBiaW5hcnlfc2VhcmNoKGEsbix4KTsKCWlmKGFucyAhPSAtMSkgcHJpbnRmKCJhWyVkXSA9ICVkXG4iLGFucyxhW2Fuc10pOwoJZWxzZSBwcmludGYoIm5vdCBmb3VuZFxuIik7CglmcmVlKGEpOwoJcmV0dXJuIDA7Cn0=