본문 바로가기

Algorithm/백준

백준 1920 수 찾기

package practice;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;

public class Boj1920 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt(br.readLine());
        StringTokenizer st = new StringTokenizer(br.readLine());
        int[] arr = new int[N];
        for(int i = 0; i < N; i ++){
            arr[i] = Integer.parseInt(st.nextToken());
        }
        Arrays.sort(arr);
        int M = Integer.parseInt(br.readLine());
        st = new StringTokenizer(br.readLine());
        for(int i=0; i< M; i++ ){
            boolean find = false;
            int target = Integer.parseInt(st.nextToken());
            int start = 0;
            int end = arr.length-1;
            while(start <= end){
                int mid = (start+end) / 2;
                int midValue = arr[mid];

                if(target > midValue){
                    start = mid+1;
                }else if(target < midValue){
                    end = mid-1;
                }else{
                    find = true;
                    break;
                }


            }
            if(find) System.out.println(1);
            else System.out.println(0);


        }
    }



}