FIND ME - CODECHEF SOLUTION

Problem - FIND ME

Problem Code - FINDMELI

You are given a list of N$N$ integers and a value K$K$. Print 1$1$ if K$K$ exists in the given list of N$N$ integers, otherwise print −1$-1$.

Input:

• First-line will contain two numbers N$N$ and K$K$.
• Next line contains N$N$ space-separated numbers.

Output:

Print the answer in a new line.

Constraints

• 1≤N,K,Ai≤105
  

Sample Input 1:

4  2

1  2  3  4

Sample Output 1:

1

Sample Input 2:

4  4

1  2  6  9

Sample Output 2:

-1

EXPLANATION:

• In the first example, as 2$2$ is present in the list.
• In the second example, 4$4$ is not present in the list.

Solution :-

C++ :

#include <iostream>

using namespace std;

int main() {

    int N, K;

    cin >> N >> K;

    int a[N];

    for (int i=0; i<N; i++) {

        cin >> a[i];

    }

    for (int i=0; i<N; i++) {

        if (a[i]==K) {

            cout << "1";

            goto re;

        }

    }

    

    cout << "-1";

    re:

    return 0;

}