[Jiudu OJ 08] simple search x

【 Nine degrees OJ 08】 Easy to find x

One 、 The question

Two 、 The answer process

Ideas ：

Is to enumerate violent solutions , It's not hard to

#include <iostream>

int main() {
    
    int buf[200];
    int n;
    while(scanf("%d",&n)!=EOF)
    {
    
        for (int i = 0; i <n ; ++i)
        {
    
            scanf("%d",&buf[i]);
        }
        int x,ans=-1;
        scanf("%d",&x);
        for (int i = 0; i <n ; ++i)// Traverse the array elements in turn 
        {
    
                if(buf[i]==x){
    // The target number is compared with the array elements in turn 
                    ans=i;
                    break;// Find the answer and jump out of the loop 
                }
        }
        printf("%d\n",ans);
    }
    return 0;
}