BEAKJOON JAVA ALGORITHM #11723(집합)

https://www.acmicpc.net/problem/11723

import java.util.Scanner; public class a11723 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = Integer.parseInt(sc.nextLine()); int s = 0; StringBuilder result = new StringBuilder(); for(int i=0 ; i<num ; i++) { switch(sc.next()) { case "add" : int add = Integer.parseInt(sc.next()); if((s & (1 << add)) == 0) { s = s | (1 << add); } break; case "remove" : int remove = Integer.parseInt(sc.next()); if((s & (1 << remove)) != 0) { s = s & ~(1 << remove); } break; case "check" : int check = Integer.parseInt(sc.next()); if((s & (1 << check)) == 0) { result.append(0).append("\n"); }else { result.append(1).append("\n"); } break; case "toggle" : int toggle = Integer.parseInt(sc.next()); s = s ^ (1 << toggle); break; case "all" : for(int j=1 ; j<=20 ; j++) { if((s & (1 << j)) == 0) { s = s | (1 << j); } } System.out.println(s); break; case "empty" : s = 0; break; } } System.out.println(result.toString()); } }