-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathAdvanceCalculator.java
52 lines (48 loc) · 1.09 KB
/
AdvanceCalculator.java
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
import java.util.Scanner;
import java.lang.*;
import java.io.*;
interface AdvCalculator {
public int crosssum(int a);
public boolean checkPrime(int a);
public int factorial(int a);
}
class Calculator implements AdvCalculator{
public int crosssum(int a){
int sum=0;
while(a!=0){
sum+=a%10;
a=a/10;
}
return sum;
}
public boolean checkPrime(int a){
int c=0;
for(int i=2;i<a;i++){
if(a%i==0)
c++;
}
if(c==0)
return true;
else return false;
}
public int factorial(int a){
int f=1;
while(a!=1){
f*=a;
a=a-1;
}
return f;
}
/*4Say cheese*/
}
class Test {
public static void main(String[] args) {
Scanner myObj = new Scanner(System.in);
int n = myObj.nextInt();
Calculator cal = new Calculator();
System.out.println(cal.checkPrime(n)?"Prime number":"Not prime number");
int fact=cal.factorial(n);
System.out.println(fact);
System.out.println(cal.crosssum(fact));
}
}