D25:sequence search (sequence search, translation + problem solving)

The original title is ：OpenJudge - 25:Sequence Search

translate ：

describe ： Given a by N A sequence of numbers . Find the smallest subscript id, send S[id] be equal to K;

Input ： first line ： Two positive integers N and K（N<=100,K<=100000）;

The second line ：N No more than one. 100000 The positive integer ;

Output ： An integer id.

Code ：

#include<iostream>
using namespace std;
int main()
{
	int n,k;
	cin>>n>>k;
	int ans,a,f=1;
	for(int i=1;i<=n;i++){
		cin>>a;
		if(a==k&&f){
			cout<<i;
			f=0;
		}
	}
	return 0;
}