Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class F {
- // Exercise Seassion 3 - 4
- static boolean isDivisor(int num, int div) {
- int result = num % div;
- if (result == 0)
- return true;
- return false;
- }
- static boolean isPrime(int num) {
- boolean result = true;
- for (int i = 2; i < num; i++) {
- if (num % i == 0) {
- // System.out.println(i + " " + num);
- result = false;
- break;
- }
- }
- return result;
- }
- static void allPrimeDivisors(int num) {
- for (int i = 2; i < num; i++) {
- if (isPrime(i) && num % i == 0) {
- System.out.println(i);
- }
- }
- }
- public static void main(String[] args) {
- // System.out.println(isDivisor(Integer.parseInt(args[0]),
- // Integer.parseInt(args[1])));
- // System.out.println(isPrime(Integer.parseInt(args[0])));
- allPrimeDivisors(Integer.parseInt(args[0]));
- // for (int i = 3; i < 20; i++)
- // System.out.println(isPrime(i));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement