Skip to content

Refactor JavaPrimalityTest for primality checking #18

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
julianguzmantv wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Refactor JavaPrimalityTest for primality checking #18

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
57 changes: 24 additions & 33 deletions Contests/CodeWhiz.java 2016/JavaPrimalityTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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");
}
}
}
}