Welcome to collectivesolver - Programming & Software Q&A. A website you can trust. I check, compile and run every program. Contact me at: aviboots(AT)netvision.net.il
Hostgator 1 Penny

BlueHost Web Hosting

Ecommerce Software - Best Ecommerce Platform Made for You - Free Trial

Ecommerce Software - Best Ecommerce Platform Made for You - Free Trial

getflywheel wordpress hosting


Distribute your Resume to 500+ Job Boards & Recruiters


6,849 questions

9,751 answers

573 users

How to find all the strong numbers in given range with Java

1 Answer

0 votes
package javaapplication1;
 
// Strong numbers are the numbers that the sum of factorial of its digits 
// is equal to the original number
  
// 145 is a strong number: 1 + 24 + 120 = 145
 
public class JavaApplication1 {
  
    public static void main(String[] args) {
         
        int reminder, sum, tmp;
  
        for (int n = 1; n <= 1000000; n++)
        {
            tmp = n;
            sum = 0;
  
            while (tmp != 0)
            {
                reminder = tmp % 10;
                sum = sum + factorial(reminder);
                tmp /= 10;
            }
            if (sum == n)
                System.out.format("%d\n", n);
        }
    }
    public static int factorial(int n)
    {
        int fact = 1;
  
        for (int i = 2; i <= n; i++)
             fact = fact * i;
  
        return fact;
    }
}
    
/*
run:
   
1
2
145
40585
    
*/

 




answered May 10, 2017 by avibootz
...