Added 25 solutions

This commit is contained in:
rshaghoulian
2017-02-24 00:24:47 -06:00
parent 05ce4b1476
commit af8c2969a4
50 changed files with 1562 additions and 277 deletions
+68
View File
@@ -0,0 +1,68 @@
// Author: Rodney Shaghoulian
// Github: github.com/rshaghoulian
// HackerRank: hackerrank.com/rshaghoulian
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.lang.reflect.*;
import static java.lang.System.in;
class Prime {
void checkPrime(int... numbers) {
for (int num : numbers) {
if (isPrime(num)) {
System.out.print(num + " ");
}
}
System.out.println();
}
boolean isPrime(int n) {
if (n < 2) {
return false;
}
for (int i = 2; i <= (int) Math.sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
public class Solution {
public static void main(String[] args) {
try {
BufferedReader br = new BufferedReader(new InputStreamReader(in));
int n1 = Integer.parseInt(br.readLine());
int n2 = Integer.parseInt(br.readLine());
int n3 = Integer.parseInt(br.readLine());
int n4 = Integer.parseInt(br.readLine());
int n5 = Integer.parseInt(br.readLine());
Prime ob = new Prime();
ob.checkPrime(n1);
ob.checkPrime(n1,n2);
ob.checkPrime(n1,n2,n3);
ob.checkPrime(n1,n2,n3,n4,n5);
Method[] methods = Prime.class.getDeclaredMethods();
Set<String> set = new HashSet<>();
boolean overload = false;
for (int i = 0; i < methods.length; i++) {
if (set.contains(methods[i].getName())) {
overload = true;
break;
}
set.add(methods[i].getName());
}
if (overload) {
throw new Exception("Overloading not allowed");
}
} catch (Exception e) {
System.out.println(e);
}
}
}