Python 基礎知識簡單

完美數

“完美數”問題的詳細指南和 Python 實作。

問題陳述

簡單

寫一個函數 is_perfect(n) ,它接受一個正整數 n ,如果它是完美數,則傳回 True ,否則傳回 False 。完美數是等於其真因數(除該數本身之外的所有因數)之和的數。例如,6 = 1 + 2 + 3。

約束條件
  • 1 <= n <= 10^6

範例

Example 1
Input
n = 6
Output
True
Explanation

The proper divisors of 6 are 1, 2, 3. Their sum is 1 + 2 + 3 = 6.

Example 2
Input
n = 28
Output
True
Explanation

The proper divisors of 28 are 1, 2, 4, 7, 14. Their sum is 1 + 2 + 4 + 7 + 14 = 28.

Example 3
Input
n = 12
Output
False
Explanation

The proper divisors of 12 are 1, 2, 3, 4, 6. Their sum is 16, which is not 12.

Need a Hint?
考慮使用特定於基礎的資料結構,例如集合或堆。
Edge Cases to Watch
  • 空輸入結構
  • 單元素輸入
  • 大數值範圍

準備好解決了嗎?

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 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。