From 014dd934765f6c0d6d6184da186971034bd3af69 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Julian=20Guzm=C3=A1n?= Date: Wed, 8 Jul 2026 16:55:27 -0500 Subject: [PATCH] Refactor JavaPrimalityTest for primality checking Refactored JavaPrimalityTest to use BufferedReader and BigInteger for primality testing, removed BitSet operations. --- .../CodeWhiz.java 2016/JavaPrimalityTest.java | 57 ++++++++----------- 1 file changed, 24 insertions(+), 33 deletions(-) diff --git a/Contests/CodeWhiz.java 2016/JavaPrimalityTest.java b/Contests/CodeWhiz.java 2016/JavaPrimalityTest.java index 8117024..eb62c06 100644 --- a/Contests/CodeWhiz.java 2016/JavaPrimalityTest.java +++ b/Contests/CodeWhiz.java 2016/JavaPrimalityTest.java @@ -52,40 +52,31 @@ allowing us to easily manipulate bits while optimizing space (when compared to o */ import java.io.*; -import java.util.*; -import java.text.*; import java.math.*; +import java.security.*; +import java.text.*; +import java.util.*; +import java.util.concurrent.*; +import java.util.function.*; import java.util.regex.*; - -public class JavaPrimalityTest -{ - - public static void main(String[] args) - { - Scanner sc = new Scanner(System.in); - int bitSetSize = sc.nextInt(); - int numOperations = sc.nextInt(); - BitSet[] bitSetArray = new BitSet[2]; - bitSetArray[0] = new BitSet(bitSetSize); - bitSetArray[1] = new BitSet(bitSetSize); - sc.nextLine(); - for(int i = 0;i < numOperations; i++) - { - String[] opArray = sc.nextLine().split(" "); - switch(opArray[0]){ - case "AND": bitSetArray[Integer.parseInt(opArray[1])-1].and(bitSetArray[Integer.parseInt(opArray[2])-1]); - break; - case "OR": bitSetArray[Integer.parseInt(opArray[1])-1].or(bitSetArray[Integer.parseInt(opArray[2])-1]); - break; - case "XOR": bitSetArray[Integer.parseInt(opArray[1])-1].xor(bitSetArray[Integer.parseInt(opArray[2])-1]); - break; - case "FLIP": bitSetArray[Integer.parseInt(opArray[1])-1].flip(Integer.parseInt(opArray[2])); - break; - case "SET": bitSetArray[Integer.parseInt(opArray[1])-1].set(Integer.parseInt(opArray[2])); - break; - } - System.out.println(bitSetArray[0].cardinality() + " " + bitSetArray[1].cardinality()); - +import java.util.stream.*; +import static java.util.stream.Collectors.joining; +import static java.util.stream.Collectors.toList; + +public class Solution { + public static void main(String[] args) throws IOException { + BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); + + String n = bufferedReader.readLine(); + + bufferedReader.close(); + + BigInteger bigInteger = new BigInteger(n); + + if (bigInteger.isProbablePrime(10)) { + System.out.println("prime"); + } else { + System.out.println("not prime"); } } -} \ No newline at end of file +}