要求:
http://codeup.cn/problem.php?cid=100000585&pid=0
说明:
发现这一题可以直接暴力,所以。。
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int main(){
int n;
int numrecord[210];
int m;
int flag = 0;
while(scanf("%d",&n) != EOF){
for(int i = 0;i <n;i++){
scanf("%d",&numrecord[i]);
}
scanf("%d",&m);
for(int i = 0;i <n;i++){
if(numrecord[i] == m){
flag = 1;
printf("%d\n",i);
}
}
if(flag == 0){
printf("-1\n");
}
memset(numrecord,0,sizeof(numrecord));
flag = 0;
}
}