이진 탐색 연습: 숫자 카드 존재 여부 확인

function solve(input) {
    const t = input.trim().split(/\s+/).map(Number);
    const n = t[0], a = t.slice(1, n + 1);
    a.sort((x, y) => x - y);
    const m = t[n + 1], out = [];
    for (const x of t.slice(n + 2, n + 2 + m)) {
        let l = 0, r = n - 1, found = false;
        while (l <= r) {
            const mid = l + Math.floor((r - l) / 2);
            if (a[mid] === x) {
                found = true;
                break;
            }
            if (a[mid] < x) l = mid + 1;
            else r = mid - 1;
        }
        out.push(found ? 1 : 0);
    }
    return out.join(' ');
}

def solve(input):
    t = list(map(int, input.split()))
    n, a = t[0], t[1:1+t[0]]
    a.sort()
    out = []
    for x in t[n+2:n+2+t[n+1]]:
        left, right, found = 0, n-1, False
        while left <= right:
            mid = (left + right) // 2
            if a[mid] == x:
                found = True
                break
            if a[mid] < x: left = mid + 1
            else: right = mid - 1
        out.append('1' if found else '0')
    return ' '.join(out)

import java.util.*;
class Solution {
    public String solve(String input) {
        Scanner sc = new Scanner(input);
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) a[i] = sc.nextInt();
        Arrays.sort(a);
        int m = sc.nextInt();
        StringJoiner out = new StringJoiner(" ");
        for (int i = 0; i < m; i++) out.add(Arrays.binarySearch(a, sc.nextInt()) >= 0 ? "1" : "0");
        return out.toString();
    }
}

#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
std::string solve(const std::string & input) {
    std::istringstream in(input);
    int n;
    in >> n;
    std::vector < int > a(n);
    for (int & x : a) in >> x;
    std::sort(a.begin(), a.end());
    int m;
    in >> m;
    std::ostringstream out;
    for (int i = 0; i < m; i++) {
        int x;
        in >> x;
        if (i) out << " ";
        out <<(std::binary_search(a.begin(), a.end(), x) ? 1 : 0);
    }
    return out.str();
}

using System;
using System.Collections.Generic;
public class Solution {
    public string Solve(string input) {
        string[] t = input.Split((char[]) null, StringSplitOptions.RemoveEmptyEntries);
        int n = int.Parse(t[0]);
        int[] a = new int[n];
        for (int i = 0; i < n; i++) a[i] = int.Parse(t[i + 1]);
        Array.Sort(a);
        int m = int.Parse(t[n + 1]);
        string[] outp = new string[m];
        for (int i = 0; i < m; i++) outp[i] = Array.BinarySearch(a, int.Parse(t[n + 2 + i])) >= 0 ? "1" : "0";
        return string.Join(" ", outp);
    }
}