检查强数的程序-yiteyi-C++库

强大的数字 数字的阶乘和等于原始数的数。给定一个数字，检查它是否为强数。 例如：

null

Input  : n = 145Output : YesSum of digit factorials = 1! + 4! + 5!                        = 1 + 24 + 120                        = 145Input :  n = 534Output : No

建议：请在“上解决” 实践 “首先，在讨论解决方案之前。

1) Initialize sum of factorials as 0. 2) For every digit d, do following   a) Add d! to sum of factorials.3) If sum factorials is same as given    number, return true.4) Else return false.

优化是预先计算从0到10的所有数字的阶乘。

C++

                         // C++ program to check if a number is                       
                         // strong or not.                       
                         #include <bits/stdc++.h>                       
                         using                                     namespace                                     std;                       
           
                         int                                     f[10];                       
           
                         // Fills factorials of digits from 0 to 9.                       
                         void                                     preCompute()                       
                         {                       
                                                 f[0] = f[1] = 1;                       
                                                 for                                     (                                     int                                     i = 2; i<10; ++i)                       
                                                 f[i] = f[i-1] * i;                       
                         }                       
           
                         // Returns true if x is Strong                       
                         bool                                     isStrong(                                     int                                     x)                       
                         {                       
                                                 int                                     factSum = 0;                       
           
                                                 // Traverse through all digits of x.                       
                                                 int                                     temp = x;                       
                                                 while                                     (temp)                       
                                                 {                       
                                                 factSum += f[temp%10];                       
                                                 temp /= 10;                       
                                                 }                       
           
                                                 return                                     (factSum == x);                       
                         }                       
           
                         // Driver code                       
                         int                                     main()                       
                         {                       
                                                 preCompute();                       
           
                                                 int                                     x = 145;                       
                                                 isStrong(x) ? cout <<                                     "Yes"                                     : cout <<                                     "No"                                     ;                       
                                                 x = 534;                       
                                                 isStrong(x) ? cout <<                                     "Yes"                                     : cout <<                                     "No"                                     ;                       
                                                 return                                     0;                       
                         }                       

JAVA

                         // Java program to check if                       
                         // a number is Strong or not                       
           
                         class                                     CheckStrong                       
                         {                       
                                                 static                                     int                                     f[] =                                     new                                     int                                     [                                     10                                     ];                       
                                   
                                                 // Fills factorials of digits from 0 to 9.                       
                                                 static                                     void                                     preCompute()                       
                                                 {                       
                                                 f[                                     0                                     ] = f[                                     1                                     ] =                                     1                                     ;                       
                                                 for                                     (                                     int                                     i =                                     2                                     ; i<                                     10                                     ; ++i)                       
                                                 f[i] = f[i-                                     1                                     ] * i;                       
                                                 }                       
                                   
                                                 // Returns true if x is Strong                       
                                                 static                                     boolean                                     isStrong(                                     int                                     x)                       
                                                 {                       
                                                 int                                     factSum =                                     0                                     ;                       
                                   
                                                 // Traverse through all digits of x.                       
                                                 int                                     temp = x;                       
                                                 while                                     (temp>                                     0                                     )                       
                                                 {                       
                                                 factSum += f[temp%                                     10                                     ];                       
                                                 temp /=                                     10                                     ;                       
                                                 }                       
                                   
                                                 return                                     (factSum == x);                       
                                                 }                       
                                   
                                                 // main function                       
                                                 public                                     static                                     void                                     main (String[] args)                       
                                                 {                       
                                                 // calling preCompute                       
                                                 preCompute();                       
                                   
                                                 // first pass                       
                                                 int                                     x =                                     145                                     ;                       
                                                 if                                     (isStrong(x))                       
                                                 {                       
                                                 System.out.println(                                     "Yes"                                     );                       
                                                 }                       
                                                 else                       
                                                 System.out.println(                                     "No"                                     );                       
                                   
                                                 // second pass                       
                                                 x =                                     534                                     ;                       
                                                 if                                     (isStrong(x))                       
                                                 {                       
                                                 System.out.println(                                     "Yes"                                     );                       
                                                 }                       
                                                 else                       
                                                 System.out.println(                                     "No"                                     );                       
                                                 }                       
                         }                       

Python3

                         # Python program to check if a number is                       
                         # strong or not.                       
           
                         f                                     =                                     [                                     None                                     ]                                     *                                     10                       
           
                         # Fills factorials of digits from 0 to 9.                       
                         def                                     preCompute() :                       
                                                 f[                                     0                                     ]                                     =                                     f[                                     1                                     ]                                     =                                     1                                     ;                       
                                                 for                                     i                                     in                                     range                                     (                                     2                                     ,                                     10                                     ) :                       
                                                 f[i]                                     =                                     f[i                                     -                                     1                                     ]                                     *                                     i                       
                                   
                         # Returns true if x is Strong                       
                         def                                     isStrong(x) :                       
                                   
                                                 factSum                                     =                                     0                       
                                                 # Traverse through all digits of x.                       
                                                 temp                                     =                                     x                       
                                                 while                                     (temp) :                       
                                                 factSum                                     =                                     factSum                                     +                                     f[temp                                     %                                     10                                     ]                       
                                                 temp                                     =                                     temp                                     /                                     /                                     10                       
           
                                                 return                                     (factSum                                     =                                     =                                     x)                       
                                   
                         # Driver code                       
                         preCompute()                       
                         x                                     =                                     145                       
                         if                                     (isStrong(x) ) :                       
                                                 print                                     (                                     "Yes"                                     )                       
                         else                                     :                       
                                                 print                                     (                                     "No"                                     )                       
                         x                                     =                                     534                       
                         if                                     (isStrong(x)) :                       
                                                 print                                     (                                     "Yes"                                     )                       
                         else                                     :                       
                                                 print                                     (                                     "No"                                     )                       
           
                         # This code is contributed by Nikita Tiwari.                       

C#

                         // C# program to check if                       
                         // a number is Strong or not                       
                         using                                     System;                       
           
                         class                                     CheckStrong                       
                         {                       
                                                 static                                     int                                     []f =                                     new                                     int                                     [10];                       
           
                                                 // Fills factorials of digits from 0 to 9.                       
                                                 static                                     void                                     preCompute()                       
                                                 {                       
                                                 f[0] = f[1] = 1;                       
                                                 for                                     (                                     int                                     i = 2; i < 10; ++i)                       
                                                 f[i] = f[i - 1] * i;                       
                                                 }                       
                                   
                                                 // Returns true if x is Strong                       
                                                 static                                     bool                                     isStrong(                                     int                                     x)                       
                                                 {                       
                                                 int                                     factSum = 0;                       
                                   
                                                 // Traverse through all digits of x.                       
                                                 int                                     temp = x;                       
                                                 while                                     (temp > 0)                       
                                                 {                       
                                                 factSum += f[temp % 10];                       
                                                 temp /= 10;                       
                                                 }                       
                                   
                                                 return                                     (factSum == x);                       
                                                 }                       
                                   
                                                 // Driver Code                       
                                                 public                                     static                                     void                                     Main ()                       
                                                 {                       
                                                 // calling preCompute                       
                                                 preCompute();                       
                                   
                                                 // first pass                       
                                                 int                                     x = 145;                       
                                                 if                                     (isStrong(x))                       
                                                 {                       
                                                 Console.WriteLine(                                     "Yes"                                     );                       
                                                 }                       
                                                 else                       
                                                 Console.WriteLine(                                     "No"                                     );                       
                                   
                                                 // second pass                       
                                                 x = 534;                       
                                                 if                                     (isStrong(x))                       
                                                 {                       
                                                 Console.WriteLine(                                     "Yes"                                     );                       
                                                 }                       
                                                 else                       
                                                 Console.WriteLine(                                     "No"                                     );                       
                                                 }                       
                         }                       
           
                         // This code is contributed by Nitin Mittal.                       

PHP

                         <?php                       
                         // PHP program to check if a number                       
                         // is strong or not.                       
           
                         $f                                     [10] =                                     array                                     ();                       
           
                         // Fills factorials of digits                       
                         // from 0 to 9.                       
                         function                                     preCompute()                       
                         {                       
                                                 global                                     $f                                     ;                       
                                                 $f                                     [0] =                                     $f                                     [1] = 1;                       
                                                 for                                     (                                     $i                                     = 2;                                     $i                                     < 10; ++                                     $i                                     )                       
                                                 $f                                     [                                     $i                                     ] =                                     $f                                     [                                     $i                                     - 1] *                                     $i                                     ;                       
                         }                       
           
                         // Returns true if x is Strong                       
                         function                                     isStrong(                                     $x                                     )                       
                         {                       
                                                 global                                     $f                                     ;                       
                                                 $factSum                                     = 0;                       
           
                                                 // Traverse through all digits of x.                       
                                                 $temp                                     =                                     $x                                     ;                       
                                                 while                                     (                                     $temp                                     )                       
                                                 {                       
                                                 $factSum                                     +=                                     $f                                     [                                     $temp                                     % 10];                       
                                                 $temp                                     = (int)                                     $temp                                     / 10;                       
                                                 }                       
           
                                                 return                                     (                                     $factSum                                     ==                                     $x                                     );                       
                         }                       
           
                         // Driver code                       
                         preCompute();                       
                         $x                                     = 145;                       
           
                         if                                     (isStrong(!                                     $x                                     ))                       
                                                 echo                                     "Yes"                                     ;                       
                         else                       
                                                 echo                                     "No"                                     ;                       
                         $x                                     = 534;                       
                         if                                     (isStrong(                                     $x                                     ))                       
                                                 echo                                     "Yes"                                     ;                       
                         else                       
                                                 echo                                     "No"                                     ;                       
                                   
                         // This code is contributed by jit_t                       
                         ?>                       

Javascript

                         <script>                       
           
                         // Javascript program to check if a number is                       
                         // strong or not.                       
           
           
                         let f =                                     new                                     Array(10);                       
           
                         // Fills factorials of digits from 0 to 9.                       
                         function                                     preCompute()                       
                         {                       
                                                 f[0] = f[1] = 1;                       
                                                 for                                     (let i = 2; i<10; ++i)                       
                                                 f[i] = f[i-1] * i;                       
                         }                       
           
                         // Returns true if x is Strong                       
                         function                                     isStrong(x)                       
                         {                       
                                                 let factSum = 0;                       
           
                                                 // Traverse through all digits of x.                       
                                                 let temp = x;                       
                                                 while                                     (temp)                       
                                                 {                       
                                                 factSum += f[temp%10];                       
                                                 temp = Math.floor(temp/10);                       
                                                 }                       
           
                                                 return                                     (factSum == x);                       
                         }                       
           
                         // Driver code                       
           
                                                 preCompute();                       
           
                                                 let x = 145;                       
                                                 isStrong(x) ? document.write(                                     "Yes"                                     +                                     "<br>"                                     ) :                       
                                                 document.write(                                     "No"                                     +                                     "<br>"                                     );                       
                                                 x = 534;                       
                                                 isStrong(x) ? document.write(                                     "Yes"                                     +                                     "<br>"                                     ) :                       
                                                 document.write(                                     "No"                                     +                                     "<br>"                                     );                       
           
           
                         //This code is contributed by Mayank Tyagi                       
           
                         </script>                       

输出：

YesNo

本文由 普拉莫德·库马尔 .如果你喜欢GeekSforgek，并想贡献自己的力量，你也可以使用写极客。组织或者把你的文章寄去评论-team@geeksforgeeks.org.看到你的文章出现在Geeksforgeks主页上，并帮助其他极客。如果您发现任何不正确的地方，或者您想分享有关上述主题的更多信息，请写下评论。

文章版权归作者所有，未经允许请勿转载。

THE END

技术文章