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;
    }

  • 相关阅读:
    黑马程序员:3分钟带你读懂C/C++学习路线
    大学毕业的你,满腔洪荒之力却找不到出口?
    从零基础到精通的前端学习路线
    Python学习笔记(2)——Python的函数、模块、包和库
    Python学习笔记(1)——Python的概述(Python的环境、变量、数据类型、基本运算)
    MATLAB优化——减少for的使用
    初识Python(windows)——下载、安装、使用
    高维数据稀疏表示-什么是字典学习(过完备词典)
    用1天快速上手org-mode(windows系统)
    零基础数据挖掘学习清单
  • 原文地址:https://www.cnblogs.com/2014acm/p/3902507.html
Copyright © 2011-2022 走看看