zoukankan      html  css  js  c++  java
  • rwkj 1518

    #include<stdio.h>
    int f(int a[],int low,int high,int x)
    {    int mid;
         while (low<=high)
         {
            mid=(low+high)/2;
            if(a[mid]>x) high=mid-1;
                else if(a[mid]<x) low=mid+1;
                    else return mid+1; 
         }
         return 0;
    }
    
    int main()
    {
        int a[30],n,i,x,y;
    
        while(scanf("%d",&n)!=EOF)
        {
            for(i=0;i<=n;i++)
            scanf("%d",&a[i]);
            x=a[n];
            y=f(a,0,n,x);
            if (  y==0 ) printf("No found!
    "); 
            else printf("%d
    ",y);
        }
        return 0;
    } 
    View Code

    #include<stdio.h>
    int f(int a[],int low,int high,int x)
    {    int mid;
         while (low<=high)
         {
            mid=(low+high)/2;
            if(a[mid]>x) high=mid-1;
                else if(a[mid]<x) low=mid+1;
                    else return mid+1;
         }
         return 0;
    }

    int main()
    {
        int a[30],n,i,x,y;

        while(scanf("%d",&n)!=EOF)
        {
            for(i=0;i<=n;i++)
            scanf("%d",&a[i]);
            x=a[n];
            y=f(a,0,n,x);
            if (  y==0 ) printf("No found! ");
            else printf("%d ",y);
        }
        return 0;
    }

    #include<stdio.h>
    int a[30],x;
    int f(int low,int high)
    {    int mid;
         while (low<=high)
         {
            mid=(low+high)/2;
            if(a[mid]>x) high=mid-1;
                else if(a[mid]<x) low=mid+1;
                    else return mid; 
         }
         return -1;
    }
    
    int main()
    {
        int n,i,y;
        while(scanf("%d",&n)!=EOF)
        {   for(i=0;i<=n;i++)
              scanf("%d",&a[i]);
            x=a[n];
            y=f(0,n-1);
            if (  y==-1 ) printf("No found!
    "); 
            else printf("%d
    ",y+1);
        }
        return 0;
    } 
    View Code

    #include<stdio.h>
    int a[30],x;
    int f(int low,int high)
    {    int mid;
         while (low<=high)
         {
            mid=(low+high)/2;
            if(a[mid]>x) high=mid-1;
                else if(a[mid]<x) low=mid+1;
                    else return mid;
         }
         return -1;
    }

    int main()
    {
        int n,i,y;
        while(scanf("%d",&n)!=EOF)
        {   for(i=0;i<=n;i++)
              scanf("%d",&a[i]);
            x=a[n];
            y=f(0,n-1);
            if (  y==-1 ) printf("No found! ");
            else printf("%d ",y+1);
        }
        return 0;
    }

    #include<stdio.h>
    int f(int a[],int low,int high,int x)
    {    int mid;
         while (low<=high)
         {
            mid=(low+high)/2;
            if(a[mid]>x) high=mid-1;
                else if(a[mid]<x) low=mid+1;
                    else return mid; 
         }
         return -1;
    }
    
    int main()
    {
        int a[30],n,i,x,y;
    
        while(scanf("%d",&n)!=EOF)
        {
            for(i=0;i<=n;i++)
            scanf("%d",&a[i]);
            x=a[n];
            y=f(a,0,n,x);
            if (  y==-1 ) printf("No found!
    "); 
            else printf("%d
    ",y+1);
        }
        return 0;
    } 
    View Code

    #include<stdio.h>
    int f(int a[],int low,int high,int x)
    {    int mid;
         while (low<=high)
         {
            mid=(low+high)/2;
            if(a[mid]>x) high=mid-1;
                else if(a[mid]<x) low=mid+1;
                    else return mid; 
         }
         return -1;
    }

    int main()
    {
        int a[30],n,i,x,y;

        while(scanf("%d",&n)!=EOF)
        {
            for(i=0;i<=n;i++)
            scanf("%d",&a[i]);
            x=a[n];
            y=f(a,0,n,x);
            if (  y==-1 ) printf("No found! ");
            else printf("%d ",y+1);
        }
        return 0;
    }

    #include<stdio.h>
    int f(int a[],int low,int high,int x)
    {    int mid;
         while (low<=high)
         {
            mid=(low+high)/2;
            if(a[mid]>x) high=mid-1;
                else if(a[mid]<x) low=mid+1;
                    else return mid+1; 
         }
         return -1;
    }
    
    int main()
    {
        int a[30],n,i,x,y;
    
        while(scanf("%d",&n)!=EOF)
        {
            for(i=0;i<=n;i++)
            scanf("%d",&a[i]);
            x=a[n];
            y=f(a,0,n,x);
            if (  y==-1 ) printf("No found!
    "); 
            else printf("%d
    ",y);
        }
        return 0;
    } 
    View Code

    #include<stdio.h>
    int f(int a[],int low,int high,int x)
    {    int mid;
         while (low<=high)
         {
            mid=(low+high)/2;
            if(a[mid]>x) high=mid-1;
                else if(a[mid]<x) low=mid+1;
                    else return mid+1;
         }
         return -1;
    }

    int main()
    {
        int a[30],n,i,x,y;

        while(scanf("%d",&n)!=EOF)
        {
            for(i=0;i<=n;i++)
            scanf("%d",&a[i]);
            x=a[n];
            y=f(a,0,n,x);
            if (  y==-1 ) printf("No found! ");
            else printf("%d ",y);
        }
        return 0;
    }

  • 相关阅读:
    使用Razor模板构建应用注意的细节
    分享一个秒计数器
    有效提高命中率的缓存设计
    伟大的C语言
    关于在使用Visual C++中使用MMX、SSE指令集的问题
    如何用SVN 或 WINCVS 下载x264 ffdshow T264 Kevinlib
    Visual C++图形特技
    图象处理部分文章列表
    C++,VC资源
    Visual C++ 如何:在各种字符串类型之间进行转换
  • 原文地址:https://www.cnblogs.com/2014acm/p/3902507.html
Copyright © 2011-2022 走看看