原题:
Sequence Search
1000ms 65536K
描述:
Given a sequence S of N numbers. Find the least index id so that S[id] equals to K.
输入:
First line: two positive integers N (N <= 100) and K (K <= 100000).
Second line: N positive integers (<= 100000).
输出:
One integer id.
翻译:
给出N个数的序列s,找出数组中第一个为K的数字的序号
输入
第一行:两个正整数,N (N <= 100) and K (K <= 100000).
第二行:N个正整数(<= 100000).
输出:一个整数