lyb-PW6/Student/task3/function_test2021/99_bin_search.sy

int main()
{
    //newline=10;
    int i;
    int sum;
    int a[10];
    sum=0;
    //m = 1478;
    //int t;
    i=0;
    while(i<10)
    {
        a[i]=i+1;
        i=i+1;
    }
    int x;
    int high;
    int low;
    int mid;
    int n;
    n=10;
    x=getint();
    high=n-1;
    low=0;
    mid=(high+low)/2;
    while(a[mid]!=x && low < high)
    {
        mid=(high+low)/2;
        if(x<a[mid])
            high=mid-1;
            else
            {
                low = mid +1;
            }
       
    }

     if(x==a[mid])
        putint(x);
        else
        {
            x = 0;
            putint(x);
        }
    
    x = 10;
    putch(x);

    return 0;
}