Bbhs codes 2022-2023

Automorphic
import java.util.Scanner;

public class PrimeAutomorphic

{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.println("1. Prime number");
System.out.println("2. Automorphic number");
System.out.print("Enter your choice: ");
int choice = in.nextInt();
System.out.print("Enter number: ");
int num = in.nextInt();

switch (choice) {
case 1:
int c = 0;
for (int i = 1; i <= num; i++) {
if (num % i == 0) {
c++;
}
}
if (c == 2)
System.out.println(num + " is Prime");
else
System.out.println(num + " is not Prime");
break;

case 2:
int numCopy = num;
int sq = num * num;
int d = 0;

/*
* Count the number of
* digits in num
*/
while(num > 0) {
d++;
num /= 10;
}

/*
* Extract the last d digits
* from square of num
*/
int ld = (int)(sq % Math.pow(10, d));

if (ld == numCopy)
System.out.println(numCopy + " is automorphic");
else
System.out.println(numCopy + " is not automorphic");
break;

default:
System.out.println("Incorrect Choice");
 break;
}
}
}
Special number

import java.util.Scanner;

public class SpecialNumber

{
public void checkNumber() {

Scanner in = new Scanner(System.in);

System.out.print("Enter a 2 digit number: ");

int orgNum = in.nextInt();

int num = orgNum;

int count = 0, digitSum = 0, digitProduct = 1;

while (num != 0) {
int digit = num % 10;
num /= 10;
digitSum += digit;
digitProduct *= digit;
count++;
}

if (count != 2)
System.out.println("Invalid input, please enter a 2-digit number");
else if ((digitSum + digitProduct) == orgNum)
System.out.println("Special 2-digit number");
else
System.out.println("Not a special 2-digit number");

}
}

Neon number

import java.util.Scanner;

public class NeonNumber

{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.print("Enter the number to check: ");
int n = in.nextInt();
int sq = n * n;
int sqSum = 0;

while (sq != 0) {
int d = sq % 10;
sqSum += d;
 sq /= 10;
}

if (sqSum == n)
System.out.println("Neon Number");
else
System.out.println("Not a Neon Number");
}

Spynumber

import java.util.Scanner;

public class SpyNumber

{
public void spyCheck() {
Scanner in = new Scanner(System.in);

System.out.print("Enter Number: ");

int num = in.nextInt();
int orgNum = num;

int digit, sum = 0, prod = 1;

while (num > 0) {

digit = num % 10;

sum += digit;
prod *= digit;
num /= 10;
}

if (sum == prod)
System.out.println(orgNum + " is Spy Number");
else
System.out.println(orgNum + " is not Spy Number");
 Dissarium
import java.util.Scanner;

public class DisariumNumber

{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.print("Enter the number: ");
int num = in.nextInt();
int orgNum = num;
int digitCount = 0;

while (num != 0) {
num /= 10;
digitCount++;
}

num = orgNum;
int sum = 0;

while (num != 0) {
int d = num % 10;
sum += Math.pow(d, digitCount);
digitCount--;
num /= 10;
}

if (sum == orgNum)
System.out.println("Disarium Number");
else
System.out.println("Not a Disarium Number");
}
}

Pattern code pg 265

public class Pattern

{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.println("1");
System.out.println("2");
System.out.print("Enter your choice: ");
int choice = in.nextInt();
System.out.print("Enter number: ");
int num = in.nextInt();

switch (choice) {
case 1:

for (int i = 1; i <=5; i++) {

 for (int j = 5; j >= i; j--) {
System.out.print(j + " ");
}
System.out.println();
}
case 2:

for (int i = 5; i <=1; i--) {

for (int j = 5; j >= i; j--) {
System.out.print(j + " ");
}
System.out.println();
}
}
}

Code 2 on pg on 258

palindrome

import java.util.Scanner;

public class PalindromeNumber

{
public void checkPalindrome() {
Scanner in = new Scanner(System.in);
System.out.print("Enter Number: ");
int orgNum = in.nextInt();
int copyNum = orgNum;

int revNum = 0;

while(copyNum != 0) {
int digit = copyNum % 10;
copyNum /= 10;
revNum = revNum * 10 + digit;
}

if (revNum == orgNum)
System.out.println(orgNum + " is palindrome");
else
System.out.println(orgNum + " is not palindrome");

}
Prime number
import java.util.Scanner;

public class PrimeCheck

{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.print("Enter number: ");
int n = in.nextInt();
int c = 0;

for (int i = 1; i <= n; i++) {

if (n % i == 0) {
c++;
}
}

if (c == 2) {
System.out.println(n + " is a prime number");
}
else {
System.out.println(n + " is not a prime number");
}
}
}
Palindrome
import java.util.Scanner;

public class PalinOrPerfect

{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.println("1. Palindrome number");
System.out.println("2. Perfect number");
System.out.print("Enter your choice: ");
int choice = in.nextInt();
System.out.print("Enter number: ");
int num = in.nextInt();

switch (choice) {
case 1:
int copyNum = num;
int revNum = 0;

while(copyNum != 0) {
int digit = copyNum % 10;
copyNum /= 10;
revNum = revNum * 10 + digit;
}

if (revNum == num)
System.out.println(num + " is palindrome");
else
System.out.println(num + " is not palindrome");
break;

case 2:
int sum = 0;
 for (int i = 1; i <= num / 2; i++) {
if (num % i == 0) {
sum += i;
}
}

if (num == sum)
System.out.println(num + " is a perfect number");
else
System.out.println(num + " is not a perfect number");
break;

default:
System.out.println("Incorrect Choice");
break;
}
}
}
Factorial
import java.util.Scanner;

public class FactRange

{
public static void main(String args[]) {

Scanner in = new Scanner(System.in);

System.out.print("Enter m: ");
int m = in.nextInt();
System.out.print("Enter n: ");
int n = in.nextInt();

if (m < n && m > 0 && n > 0) {

for (int i = m; i <= n; i++) {
long fact = 1;
for (int j = 1; j <= i; j++)
fact *= j;
System.out.println("Factorial of " + i + " = " + fact);
}
}
else {
System.out.println("Invalid Input");
}

}
Niven number
import java.util.Scanner;

public class NivenNumber

{
public void checkNiven() {
Scanner in = new Scanner(System.in);
System.out.print("Enter number: ");
int num = in.nextInt();
int orgNum = num;
 int digitSum = 0;

while (num != 0) {
int digit = num % 10;
num /= 10;
digitSum += digit;
}

if (digitSum != 0 && orgNum % digitSum == 0)

System.out.println(orgNum + " is a Niven number");
else
System.out.println(orgNum + " is not a Niven number");
}
}
Ci and si
import java.util.Scanner;

public class Interest

{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.print("Enter the sum: ");
double p = in.nextDouble();
System.out.print("Enter rate: ");
double r = in.nextDouble();
System.out.print("Enter time: ");
int t = in.nextInt();
System.out.println("Enter type of Interest");
System.out.print("('S'- Simple Interest 'C'- Compound Interest): ");
char type = in.next().charAt(0);
boolean isTypeValid = true;

double interest = 0.0;

switch (type) {
case 'S':
interest = p * r * t / 100;
break;

case 'C':
interest = p * (Math.pow((1 + (r / 100)), t) - 1);
break;

default:
isTypeValid = false;
System.out.println("Incorrect Interest type");
break;
}

if (isTypeValid) {
double amt = p + interest;
System.out.println("Sum = " + p);
System.out.println("Interest = " + interest);
System.out.println("Sum + Interest = " + amt);
}
 }
}

Fibonacci
import java.util.Scanner;

public class FibonacciNDigitSum

{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.println("1. Fibonacci Series");
System.out.println("2. Sum of digits");
System.out.print("Enter your choice: ");
int ch = in.nextInt();

switch (ch) {
case 1:
int a = 0, b = 1;
System.out.print(a + " " + b);
for (int i = 3; i <= 10; i++) {
int term = a + b;
System.out.print(" " + term);
a = b;
b = term;
}
break;

case 2:
System.out.print("Enter number: ");
int num = in.nextInt();
int sum = 0;
while (num != 0) {
sum += num % 10;
num /= 10;
}
System.out.println("Sum of Digits " + " = " + sum);
break;

default:
System.out.println("Incorrect choice");
break;
}
}
}