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