ICSE Class 9 Computer Applications
Question 16 of 29
Iterative Constructs in Java — Question 19
Back to all questions 19
Question Question 15
Write a program to accept a number and check and display whether it is a spy number or not. (A number is spy if the sum of its digits equals the product of the digits.)
Example: Consider the number, 1124. Sum of the digits = 1 + 1 + 2 + 4 = 8.
Product of the digits = 1 * 1 * 2 * 4 = 8.
import java.util.Scanner;
public class KboatSpyNumber
{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.print("Enter Number: ");
int num = in.nextInt();
int digit, sum = 0;
int orgNum = num;
int 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");
}
}Output
