Page 239 - Computer science 868 Class 12
P. 239
Scanner sc = new Scanner(System.in);
if (n <= 0)
{
System.out.println(n + " is not a Smith Number.");
return;
}
int i;
boolean isComposite = false;
for (i = 2; i < n; i++)
{
if (n % i == 0)
{
isComposite = true;
break;
}
}
if (isComposite && n != 1)
{
int sumDigits = 0;
int t = n;
while (t != 0)
{
int d = t % 10;
sumDigits += d;
t /= 10;
}
int sumPrimeDigits = 0;
t = n;
for(i = 2; i < t; i++)
{
while(t % i == 0)
{
t /= i;
int temp = i;
while (temp != 0)
{
int d = temp % 10;
sumPrimeDigits += d;
temp /= 10;
}
}
}
if(t > 2)
{
while (t != 0)
{
int d = t % 10;
sumPrimeDigits += d;
t /= 10;
}
}
237
Methods 237

