Preparing NOJ

Sequence Search

1000ms 65536K

Description:

Given a sequence S of N numbers. Find the least index id so that S[id] equals to K.

Input:

First line: two positive integers N (N <= 100) and K (K <= 100000).
Second line: N positive integers (<= 100000).

Output:

One integer id.

Sample Input:

8 5
2 4 7 8 5 3 9 5

Sample Output:

5

Info

NOIOPEN

Provider NOIOPEN

Origin 简单英文题

Code NOIOPJENGLISH25

Tags

Submitted 0

Passed 0

AC Rate 0%

Date 08/15/2021 18:56:24

Related

Nothing Yet