-
Notifications
You must be signed in to change notification settings - Fork 858
Expand file tree
/
Copy pathJavaLambdaExpressions.java
More file actions
83 lines (75 loc) · 1.9 KB
/
Copy pathJavaLambdaExpressions.java
File metadata and controls
83 lines (75 loc) · 1.9 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
/**
*
*/
package com.javaaid.hackerrank.solutions.languages.java.advanced;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/**
* @author Kanahaiya Gupta
*
*/
interface PerformOperation {
boolean check(int a);
}
class MyMath {
public static boolean checker(PerformOperation p, int num) {
return p.check(num);
}
// Write your code here
public static PerformOperation isOdd() {
return n -> ((n & 1) == 1);
}
public static PerformOperation isPrime() {
return n -> {
if (n < 2) {
return false;
} else {
int k = (int) Math.sqrt(n);
for (int i = 2; i <= k; i++) {
if (n % i == 0)
return false;
}
return true;
}
};
}
public static PerformOperation isPalindrome() {
return n -> {
String org = n + "";
String newString = new StringBuffer(org).reverse().toString();
return org.equals(newString);
};
}
}
public class JavaLambdaExpressions {
public static void main(String[] args) throws IOException {
MyMath ob = new MyMath();
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int T = Integer.parseInt(br.readLine());
PerformOperation op;
boolean ret = false;
String ans = null;
while (T-- > 0) {
String s = br.readLine().trim();
StringTokenizer st = new StringTokenizer(s);
int ch = Integer.parseInt(st.nextToken());
int num = Integer.parseInt(st.nextToken());
if (ch == 1) {
op = ob.isOdd();
ret = ob.checker(op, num);
ans = (ret) ? "ODD" : "EVEN";
} else if (ch == 2) {
op = ob.isPrime();
ret = ob.checker(op, num);
ans = (ret) ? "PRIME" : "COMPOSITE";
} else if (ch == 3) {
op = ob.isPalindrome();
ret = ob.checker(op, num);
ans = (ret) ? "PALINDROME" : "NOT PALINDROME";
}
System.out.println(ans);
}
}
}