Skip to content

Commit 5c640f6

Browse files
curious-vasavicurious-vasavi
committed
Add Day 07 advance level number Programs
1 parent 8ea2455 commit 5c640f6

14 files changed

Lines changed: 660 additions & 0 deletions

‎src/number_Programming/advance/day_07/ArmstrongNumber_m2n.java‎

Lines changed: 58 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,58 @@
1+
package number_Programming.advance.day_07;
2+
3+
import java.util.Scanner;
4+
//8. WAP to print the Armstrong numbers present in the range of m to n.
5+
6+
public class ArmstrongNumber_m2n
7+
{
8+
public static int count(int num)
9+
{
10+
int count = 0;
11+
while(num > 0)
12+
{
13+
num = num/10;
14+
count++;
15+
}
16+
return count;
17+
}
18+
public static int exponential(int power,int base)
19+
{
20+
int expo = 1;
21+
for(int i = 1;i<=power;i++)
22+
{
23+
expo = expo * base;
24+
}
25+
return expo;
26+
}
27+
public static boolean sumOfExponential(int num)
28+
{
29+
int temp = num;
30+
int sum = 0;
31+
int power = count(num);
32+
while(num > 0)
33+
{
34+
int ld = num % 10;
35+
int expo = exponential(power, ld);
36+
sum = sum + expo;
37+
num = num/10;
38+
}
39+
return sum == temp;
40+
}
41+
public static void printInRange(int m , int n)
42+
{
43+
for(int i = m ; i<=n;i++)
44+
{
45+
if(sumOfExponential(i))
46+
System.out.println(i);
47+
}
48+
}
49+
public static void main(String[] args) {
50+
Scanner sc = new Scanner(System.in);
51+
System.out.println("Enter m value : ");
52+
int m = sc.nextInt();
53+
System.out.println("Enter n value : ");
54+
int n = sc.nextInt();
55+
printInRange(m, n);
56+
sc.close();
57+
}
58+
}

‎src/number_Programming/advance/day_07/AutomorphicNumber_m2n.java‎

Lines changed: 50 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,50 @@
1+
package number_Programming.advance.day_07;
2+
3+
import java.util.Scanner;
4+
//10. WAP to print the Automorphic numbers present in the range of m to n.
5+
6+
public class AutomorphicNumber_m2n
7+
{
8+
public static int count(int num)
9+
{
10+
int count = 0;
11+
while(num>0)
12+
{
13+
num = num/10;
14+
count++;
15+
}
16+
return count ;
17+
}
18+
public static int placeValue(int num)
19+
{
20+
int place = 1;
21+
int count = count(num);
22+
for(int i = 1;i<=count;i++)
23+
{
24+
place = place*10;
25+
}
26+
return place;
27+
}
28+
public static void printAutomorphicNumber(int m , int n)
29+
{
30+
System.out.println("The automorphic number from the range " + m + " to " + n + " are :");
31+
for(int i = m ;i<=n;i++)
32+
{
33+
int place = placeValue(i);
34+
int square = i * i;
35+
int endDigit = square%place;
36+
if(endDigit == i)
37+
System.out.println(i);
38+
}
39+
}
40+
public static void main(String[] args) {
41+
Scanner sc = new Scanner(System.in);
42+
System.out.println("Enter m value : ");
43+
int m = sc.nextInt();
44+
System.out.println("Enter n value : ");
45+
int n = sc.nextInt();
46+
printAutomorphicNumber(m, n);
47+
sc.close();
48+
}
49+
50+
}

‎src/number_Programming/advance/day_07/EvilNumber_m2n.java‎

Lines changed: 49 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,49 @@
1+
package number_Programming.advance.day_07;
2+
3+
import java.util.Scanner;
4+
//14. WAP to print the Evil numbers present in the range of m to n.
5+
public class EvilNumber_m2n
6+
{
7+
public static int numToBinary(int num)
8+
{
9+
int binary = 0;
10+
int place = 1;
11+
while(num>0)
12+
{
13+
int rem = num % 2;
14+
binary = binary + (rem*place);
15+
place = place * 10;
16+
num = num / 2;
17+
}
18+
return binary ;
19+
}
20+
public static boolean isEvil(int num)
21+
{
22+
int binary = numToBinary(num);
23+
24+
int count = 0;
25+
while(binary > 0) {
26+
int ld = binary % 10;
27+
if(ld == 1)
28+
count++;
29+
binary /= 10;
30+
}
31+
return count % 2 == 0; // even number of 1s
32+
}
33+
public static void evilNumber(int m, int n)
34+
{
35+
for(int i = m; i <= n; i++) {
36+
if(isEvil(i))
37+
System.out.println(i);
38+
}
39+
}
40+
public static void main(String[] args) {
41+
Scanner sc = new Scanner(System.in);
42+
System.out.println("Enter m value : ");
43+
int m = sc.nextInt();
44+
System.out.println("Enter n value : ");
45+
int n = sc.nextInt();
46+
evilNumber(m, n);
47+
sc.close();
48+
}
49+
}

‎src/number_Programming/advance/day_07/HarshadNumber_m2n.java‎

Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
package number_Programming.advance.day_07;
2+
3+
import java.util.Scanner;
4+
//13. WAP to print the Harshad (Niven) numbers present in the range of m to n.
5+
6+
public class HarshadNumber_m2n
7+
{
8+
public static int sum(int num)
9+
{
10+
int sum = 0;
11+
while(num>0)
12+
{
13+
int ld = num % 10;
14+
sum = sum + ld ;
15+
num = num/10;
16+
}
17+
return sum;
18+
}
19+
public static void checkHarshad(int m , int n)
20+
{
21+
for(int i = m ; i<= n ; i++)
22+
{
23+
24+
if(i % sum(i) == 0)
25+
System.out.println(i);
26+
}
27+
}
28+
public static void main(String[] args) {
29+
Scanner sc = new Scanner(System.in);
30+
System.out.println("Enter m value : ");
31+
int m = sc.nextInt();
32+
System.out.println("Enter n value : ");
33+
int n = sc.nextInt();
34+
checkHarshad(m, n);
35+
sc.close();
36+
}
37+
}

‎src/number_Programming/advance/day_07/MagicNumber_m2n.java‎

Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
package number_Programming.advance.day_07;
2+
3+
import java.util.Scanner;
4+
//11. WAP to print the Magic numbers present in the range of m to n.
5+
6+
public class MagicNumber_m2n
7+
{
8+
public static int sumOfDigits(int num)
9+
{
10+
int sum = 0;
11+
while(num>0)
12+
{
13+
int ld = num % 10;
14+
sum = sum + ld;
15+
num = num/10;
16+
}
17+
return sum;
18+
}
19+
public static boolean magicNumber(int num)
20+
{
21+
int result = num;
22+
while(result>9)
23+
{
24+
result = sumOfDigits(result);
25+
}
26+
return result == 1;
27+
}
28+
public static void printMagicNumber(int m , int n)
29+
{
30+
for(int i = m ; i<=n ;i++)
31+
{
32+
if(magicNumber(i))
33+
System.out.println(i);
34+
}
35+
}
36+
public static void main(String[] args) {
37+
Scanner sc = new Scanner(System.in);
38+
System.out.println("Enter m value : ");
39+
int m = sc.nextInt();
40+
System.out.println("Enter n value : ");
41+
int n = sc.nextInt();
42+
printMagicNumber(m, n);
43+
sc.close();
44+
}
45+
46+
}

‎src/number_Programming/advance/day_07/MegaPrime_m2n.java‎

Lines changed: 57 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,57 @@
1+
package number_Programming.advance.day_07;
2+
3+
import java.util.Scanner;
4+
//2. WAP to print the Mega Prime numbers present in the range of m to n.
5+
6+
public class MegaPrime_m2n
7+
{
8+
public static boolean checkPrime(int num)
9+
{
10+
if(num<2)
11+
{
12+
return false;
13+
}
14+
int count = 0;
15+
for(int i = 1;i<= num;i++)
16+
{
17+
if(num % i == 0)
18+
{
19+
count++;
20+
}
21+
}
22+
return count==2;
23+
}
24+
public static void checkMegaPrime(int m , int n)
25+
{
26+
for(int i = m ; i<=n;i++)
27+
{
28+
if(checkPrime(i))
29+
{
30+
int temp = i;
31+
boolean isDigitPrime = true;
32+
while(temp>0)
33+
{
34+
int ld = temp%10;
35+
if(!checkPrime(ld))
36+
{
37+
isDigitPrime =false;
38+
break;
39+
}
40+
temp = temp / 10;
41+
}
42+
if(isDigitPrime)
43+
System.out.println(i);
44+
}
45+
}
46+
}
47+
public static void main(String[] args)
48+
{
49+
Scanner sc = new Scanner(System.in);
50+
System.out.println("Enter m value : ");
51+
int m = sc.nextInt();
52+
System.out.println("Enter n value : ");
53+
int n = sc.nextInt();
54+
checkMegaPrime(m, n);
55+
sc.close();
56+
}
57+
}

‎src/number_Programming/advance/day_07/NeonNumber_m2n.java‎

Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
package number_Programming.advance.day_07;
2+
3+
import java.util.Scanner;
4+
//7. WAP to print the Neon numbers present in the range of m to n.
5+
6+
public class NeonNumber_m2n
7+
{
8+
public static boolean neonNumber(int num)
9+
{
10+
int square = num * num;
11+
int sum = 0;
12+
while(square>0)
13+
{
14+
int ld = square % 10;
15+
sum = sum + ld;
16+
square=square/10;
17+
}
18+
return sum == num;
19+
}
20+
public static void numberInRange(int m , int n)
21+
{
22+
for(int i = m ; i<= n;i++)
23+
{
24+
if(neonNumber(i))
25+
System.out.println(i);
26+
}
27+
}
28+
public static void main(String[] args) {
29+
Scanner sc = new Scanner(System.in);
30+
System.out.println("Enter m value : ");
31+
int m = sc.nextInt();
32+
System.out.println("Enter n value : ");
33+
int n = sc.nextInt();
34+
numberInRange(m, n);
35+
sc.close();
36+
}
37+
38+
}

‎src/number_Programming/advance/day_07/Palindrome_m2n.java‎

Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
package number_Programming.advance.day_07;
2+
3+
import java.util.Scanner;
4+
//3. WAP to print the Palindrome numbers present in the range of m to n.
5+
6+
public class Palindrome_m2n
7+
{
8+
public static boolean reverse(int num)
9+
{
10+
int temp = num;
11+
int reverse = 0;
12+
while(num > 0)
13+
{
14+
int ld = num % 10;
15+
reverse = reverse*10 + ld;
16+
num = num/10;
17+
}
18+
return temp == reverse;
19+
}
20+
public static void palindrome(int m,int n)
21+
{
22+
for(int i = m;i<=n;i++)
23+
{
24+
if(reverse(i))
25+
System.out.println(i);
26+
}
27+
}
28+
public static void main(String[] args) {
29+
Scanner sc = new Scanner(System.in);
30+
System.out.println("Enter m value : ");
31+
int m = sc.nextInt();
32+
System.out.println("Enter n value : ");
33+
int n = sc.nextInt();
34+
palindrome(m, n);
35+
sc.close();
36+
}
37+
}

0 commit comments

Comments
 (0)