Python Basics簡単

Strong number

Detailed guide and Python implementation for the 'Strong number' problem.

問題提起

簡単

Write a function is_strong(n) that takes a positive integer n and returns True if it is a Strong number, or False otherwise. A Strong number is a number where the sum of the factorials of its individual digits equals the number itself. For example, 145 = 1! + 4! + 5! = 1 + 24 + 120 = 145.

制約
  • 1 <= n <= 10^6

Example 1
Input
n = 145
Output
True
Explanation

1! + 4! + 5! = 1 + 24 + 120 = 145, which equals n.

Example 2
Input
n = 2
Output
True
Explanation

2! = 2, which equals n.

Example 3
Input
n = 123
Output
False
Explanation

1! + 2! + 3! = 1 + 2 + 6 = 9, which is not 123.

Need a Hint?
Consider using Basics-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

解決する準備はできましたか?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

エディタで開く
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推奨される Python リソース

関連するインタラクティブなチュートリアル、チートシート、コード比較で知識を深めてください。