Pagini recente » Concursuri Virtuale | Diferente pentru utilizator/jolgau intre reviziile 36 si 38 | Diferente pentru algoritmiada-2016/runda-finala/probleme intre reviziile 4 si 5 | Istoria paginii utilizator/daniel1502 | Cod sursa (job #2087711)
import java.io.*;
import java.util.*;
public class Main {
private static final String INPUT_FILE_PATH = "hashuri.in";
private static final String OUTPUT_FILE_PATH = "hashuri.out";
public static void main(String[] args) throws IOException {
Scanner in = new Scanner(new FileReader(INPUT_FILE_PATH));
PrintWriter out = new PrintWriter(OUTPUT_FILE_PATH);
int n = in.nextInt();
Set<Integer> hash = new HashSet<>();
while (n-- > 0) {
int opType = in.nextInt();
int val = in.nextInt();
switch (opType) {
case 1:
hash.add(val);
break;
case 2:
if (hash.contains(val)) {
hash.remove(val);
}
break;
case 3:
out.println((hash.contains(val) ? 1 : 0));
break;
}
}
out.flush();
in.close();
out.close();
}
}