{"id":1077059,"date":"2025-01-08T11:58:49","date_gmt":"2025-01-08T03:58:49","guid":{"rendered":"https:\/\/docs.pingcode.com\/ask\/ask-ask\/1077059.html"},"modified":"2025-01-08T11:58:51","modified_gmt":"2025-01-08T03:58:51","slug":"python%e5%a6%82%e4%bd%95%e7%94%a8%e5%be%aa%e7%8e%af%e7%bb%93%e6%9e%84%e6%b1%82%e5%ae%8c%e6%95%b0-2","status":"publish","type":"post","link":"https:\/\/docs.pingcode.com\/ask\/1077059.html","title":{"rendered":"python\u5982\u4f55\u7528\u5faa\u73af\u7ed3\u6784\u6c42\u5b8c\u6570"},"content":{"rendered":"

\"python\u5982\u4f55\u7528\u5faa\u73af\u7ed3\u6784\u6c42\u5b8c\u6570\"<\/p>\n

Python\u4e2d\u53ef\u4ee5\u4f7f\u7528\u5faa\u73af\u7ed3\u6784\u6765\u6c42\u5b8c\u6570\uff0c\u5b8c\u6570\uff08Perfect Number\uff09\u662f\u6307\u4e00\u4e2a\u6b63\u6574\u6570\u7b49\u4e8e\u5b83\u6240\u6709\u6b63\u56e0\u5b50\u4e4b\u548c\uff08\u4e0d\u5305\u62ec\u5b83\u672c\u8eab\uff09\u3002\u4f7f\u7528for\u5faa\u73af\u3001while\u5faa\u73af\u5e76\u7ed3\u5408\u6761\u4ef6\u5224\u65ad\u53ef\u4ee5\u5b9e\u73b0\u5b8c\u6570\u7684\u6c42\u89e3\u3002\u53ef\u4ee5\u901a\u8fc7\u9010\u4e00\u68c0\u67e5\u6bcf\u4e2a\u6570\u7684\u56e0\u5b50\u6765\u5224\u65ad\u5b83\u662f\u5426\u4e3a\u5b8c\u6570\u3002<\/strong><\/p>\n<\/p>\n

\u5b8c\u6570\u7684\u57fa\u672c\u6982\u5ff5<\/h2>\n<\/p>\n

\u5b8c\u6570\u662f\u4e00\u4e2a\u6b63\u6574\u6570\uff0c\u5b83\u7b49\u4e8e\u9664\u4e86\u5b83\u672c\u8eab\u4ee5\u5916\u7684\u6240\u6709\u6b63\u56e0\u5b50\u4e4b\u548c\u3002\u4f8b\u5982\uff0c6\u662f\u4e00\u4e2a\u5b8c\u6570\uff0c\u56e0\u4e3a\u5176\u6b63\u56e0\u5b50\uff081, 2, 3\uff09\u7684\u548c\u4e3a6\u3002\u63a5\u4e0b\u6765\u6211\u4eec\u5c06\u8be6\u7ec6\u63cf\u8ff0\u5982\u4f55\u4f7f\u7528Python\u7684\u5faa\u73af\u7ed3\u6784\u6765\u6c42\u5b8c\u6570\u3002<\/p>\n<\/p>\n

\u4e00\u3001FOR\u5faa\u73af\u6c42\u5b8c\u6570<\/h2>\n<\/p>\n

1. \u4f7f\u7528FOR\u5faa\u73af\u627e\u51fa\u6240\u6709\u56e0\u5b50<\/h3>\n<\/p>\n

\u4e3a\u4e86\u627e\u51fa\u4e00\u4e2a\u6570\u7684\u6240\u6709\u56e0\u5b50\uff0c\u6211\u4eec\u53ef\u4ee5\u4f7f\u7528for\u5faa\u73af\u3002\u5047\u8bbe\u6211\u4eec\u9700\u8981\u68c0\u67e5\u7684\u6570\u662fnum\uff0c\u6211\u4eec\u53ef\u4ee5\u5faa\u73af\u904d\u5386\u4ece1\u5230num-1\u7684\u6240\u6709\u6570\uff0c\u68c0\u67e5\u5b83\u4eec\u662f\u5426\u662fnum\u7684\u56e0\u5b50\u3002\u6211\u4eec\u53ef\u4ee5\u901a\u8fc7\u68c0\u67e5num\u662f\u5426\u80fd\u88ab\u8fd9\u4e9b\u6570\u6574\u9664\u6765\u5224\u65ad\u5b83\u4eec\u662f\u5426\u662f\u56e0\u5b50\u3002<\/p>\n<\/p>\n

num = 6<\/p>\n
sum_of_factors = 0<\/p>\n
for i in range(1, num):<\/p>\n
    if num % i == 0:<\/p>\n
        sum_of_factors += i<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u5728\u8fd9\u4e2a\u4ee3\u7801\u7247\u6bb5\u4e2d\uff0ci<\/code>\u4ece1\u5230num-1<\/code>\u5faa\u73af\uff0c\u5982\u679ci<\/code>\u662fnum<\/code>\u7684\u56e0\u5b50\uff08\u5373num % i == 0<\/code>\uff09\uff0c\u6211\u4eec\u5c31\u5c06i<\/code>\u52a0\u5230sum_of_factors<\/code>\u4e2d\u3002<\/p>\n<\/p>\n
2. \u68c0\u67e5\u662f\u5426\u4e3a\u5b8c\u6570<\/h3>\n<\/p>\n
\u6211\u4eec\u53ef\u4ee5\u901a\u8fc7\u6bd4\u8f83sum_of_factors<\/code>\u548cnum<\/code>\u6765\u5224\u65adnum<\/code>\u662f\u5426\u662f\u5b8c\u6570\u3002\u5982\u679c\u76f8\u7b49\uff0c\u5219num<\/code>\u662f\u5b8c\u6570\u3002<\/p>\n<\/p>\n
if sum_of_factors == num:<\/p>\n
    print(f"{num} is a perfect number")<\/p>\n
else:<\/p>\n
    print(f"{num} is not a perfect number")<\/p>\n
<\/code><\/pre>\n<\/p>\n
3. \u5b8c\u6574\u4ee3\u7801\u793a\u4f8b<\/h3>\n<\/p>\n
\u4e0b\u9762\u662f\u4e00\u4e2a\u5b8c\u6574\u7684\u4ee3\u7801\u793a\u4f8b\uff0c\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u5426\u4e3a\u5b8c\u6570\uff1a<\/p>\n<\/p>\n
def is_perfect_number(num):<\/p>\n
    sum_of_factors = 0<\/p>\n
    for i in range(1, num):<\/p>\n
        if num % i == 0:<\/p>\n
            sum_of_factors += i<\/p>\n
    return sum_of_factors == num<\/p>\n
\u6d4b\u8bd5<\/strong><\/h2>\n
num = 6<\/p>\n
if is_perfect_number(num):<\/p>\n
    print(f"{num} is a perfect number")<\/p>\n
else:<\/p>\n
    print(f"{num} is not a perfect number")<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u4e8c\u3001WHILE\u5faa\u73af\u6c42\u5b8c\u6570<\/h2>\n<\/p>\n
1. \u4f7f\u7528WHILE\u5faa\u73af\u627e\u51fa\u6240\u6709\u56e0\u5b50<\/h3>\n<\/p>\n
\u4e0efor\u5faa\u73af\u7c7b\u4f3c\uff0c\u6211\u4eec\u4e5f\u53ef\u4ee5\u4f7f\u7528while\u5faa\u73af\u6765\u627e\u51fa\u4e00\u4e2a\u6570\u7684\u6240\u6709\u56e0\u5b50\u3002\u6211\u4eec\u4f7f\u7528\u4e00\u4e2a\u8ba1\u6570\u5668\u53d8\u91cfi\u4ece1\u5f00\u59cb\uff0c\u5faa\u73af\u68c0\u67e5\u5b83\u662f\u5426\u662fnum\u7684\u56e0\u5b50\uff0c\u5e76\u5c06\u5176\u52a0\u5230sum_of_factors\u4e2d\u3002<\/p>\n<\/p>\n
num = 6<\/p>\n
sum_of_factors = 0<\/p>\n
i = 1<\/p>\n
while i < num:<\/p>\n
    if num % i == 0:<\/p>\n
        sum_of_factors += i<\/p>\n
    i += 1<\/p>\n
<\/code><\/pre>\n<\/p>\n
2. \u68c0\u67e5\u662f\u5426\u4e3a\u5b8c\u6570<\/h3>\n<\/p>\n
\u540c\u6837\u7684\uff0c\u6211\u4eec\u53ef\u4ee5\u901a\u8fc7\u6bd4\u8f83sum_of_factors<\/code>\u548cnum<\/code>\u6765\u5224\u65adnum<\/code>\u662f\u5426\u662f\u5b8c\u6570\u3002<\/p>\n<\/p>\n
if sum_of_factors == num:<\/p>\n
    print(f"{num} is a perfect number")<\/p>\n
else:<\/p>\n
    print(f"{num} is not a perfect number")<\/p>\n
<\/code><\/pre>\n<\/p>\n
3. \u5b8c\u6574\u4ee3\u7801\u793a\u4f8b<\/h3>\n<\/p>\n
\u4e0b\u9762\u662f\u4e00\u4e2a\u5b8c\u6574\u7684\u4ee3\u7801\u793a\u4f8b\uff0c\u4f7f\u7528while\u5faa\u73af\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u5426\u4e3a\u5b8c\u6570\uff1a<\/p>\n<\/p>\n
def is_perfect_number(num):<\/p>\n
    sum_of_factors = 0<\/p>\n
    i = 1<\/p>\n
    while i < num:<\/p>\n
        if num % i == 0:<\/p>\n
            sum_of_factors += i<\/p>\n
        i += 1<\/p>\n
    return sum_of_factors == num<\/p>\n
\u6d4b\u8bd5<\/strong><\/h2>\n
num = 6<\/p>\n
if is_perfect_number(num):<\/p>\n
    print(f"{num} is a perfect number")<\/p>\n
else:<\/p>\n
    print(f"{num} is not a perfect number")<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u4e09\u3001\u67e5\u627e\u591a\u4e2a\u5b8c\u6570<\/h2>\n<\/p>\n
1. \u67e5\u627e\u4e00\u5b9a\u8303\u56f4\u5185\u7684\u5b8c\u6570<\/h3>\n<\/p>\n
\u5982\u679c\u6211\u4eec\u9700\u8981\u67e5\u627e\u4e00\u5b9a\u8303\u56f4\u5185\u7684\u6240\u6709\u5b8c\u6570\uff0c\u53ef\u4ee5\u4f7f\u7528\u5d4c\u5957\u5faa\u73af\u3002\u5916\u5c42\u5faa\u73af\u904d\u5386\u4e00\u5b9a\u8303\u56f4\u5185\u7684\u6240\u6709\u6570\uff0c\u5185\u5c42\u5faa\u73af\u68c0\u67e5\u6bcf\u4e2a\u6570\u662f\u5426\u4e3a\u5b8c\u6570\u3002<\/p>\n<\/p>\n
def find_perfect_numbers(limit):<\/p>\n
    perfect_numbers = []<\/p>\n
    for num in range(1, limit + 1):<\/p>\n
        sum_of_factors = 0<\/p>\n
        for i in range(1, num):<\/p>\n
            if num % i == 0:<\/p>\n
                sum_of_factors += i<\/p>\n
        if sum_of_factors == num:<\/p>\n
            perfect_numbers.append(num)<\/p>\n
    return perfect_numbers<\/p>\n
\u67e5\u627e10000\u4ee5\u5185\u7684\u6240\u6709\u5b8c\u6570<\/strong><\/h2>\n
limit = 10000<\/p>\n
perfect_numbers = find_perfect_numbers(limit)<\/p>\n
print(f"Perfect numbers up to {limit}: {perfect_numbers}")<\/p>\n
<\/code><\/pre>\n<\/p>\n
2. \u4f18\u5316\u56e0\u5b50\u67e5\u627e<\/h3>\n<\/p>\n
\u4e3a\u4e86\u4f18\u5316\u56e0\u5b50\u67e5\u627e\u8fc7\u7a0b\uff0c\u53ef\u4ee5\u53ea\u904d\u5386\u5230num\u7684\u4e00\u534a\uff0c\u56e0\u4e3a\u4e00\u4e2a\u6570\u7684\u56e0\u5b50\u4e0d\u4f1a\u5927\u4e8e\u5b83\u7684\u4e00\u534a\u3002\u4f8b\u5982\uff0c\u5bf9\u4e8e6\uff0c\u6700\u5927\u56e0\u5b50\u662f3\u3002<\/p>\n<\/p>\n
def find_perfect_numbers(limit):<\/p>\n
    perfect_numbers = []<\/p>\n
    for num in range(1, limit + 1):<\/p>\n
        sum_of_factors = 0<\/p>\n
        for i in range(1, num \/\/ 2 + 1):<\/p>\n
            if num % i == 0:<\/p>\n
                sum_of_factors += i<\/p>\n
        if sum_of_factors == num:<\/p>\n
            perfect_numbers.append(num)<\/p>\n
    return perfect_numbers<\/p>\n
\u67e5\u627e10000\u4ee5\u5185\u7684\u6240\u6709\u5b8c\u6570<\/strong><\/h2>\n
limit = 10000<\/p>\n
perfect_numbers = find_perfect_numbers(limit)<\/p>\n
print(f"Perfect numbers up to {limit}: {perfect_numbers}")<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u56db\u3001\u603b\u7ed3<\/h2>\n<\/p>\n
\u901a\u8fc7\u672c\u6587\uff0c\u6211\u4eec\u5b66\u4e60\u4e86\u5982\u4f55\u4f7f\u7528Python\u7684\u5faa\u73af\u7ed3\u6784\u6765\u6c42\u5b8c\u6570\u3002\u5b8c\u6570\u7684\u5b9a\u4e49\u662f\u4e00\u4e2a\u6570\u7b49\u4e8e\u5176\u6240\u6709\u6b63\u56e0\u5b50\u4e4b\u548c<\/strong>\u3002\u6211\u4eec\u53ef\u4ee5\u901a\u8fc7for\u5faa\u73af\u6216while\u5faa\u73af\u6765\u904d\u5386\u4e00\u4e2a\u6570\u7684\u6240\u6709\u56e0\u5b50\uff0c\u5e76\u68c0\u67e5\u5b83\u4eec\u7684\u548c\u662f\u5426\u7b49\u4e8e\u8be5\u6570\u3002\u901a\u8fc7\u4f18\u5316\u56e0\u5b50\u67e5\u627e\u7684\u8fc7\u7a0b\uff0c\u6211\u4eec\u53ef\u4ee5\u63d0\u9ad8\u7b97\u6cd5\u7684\u6548\u7387\u3002\u5e0c\u671b\u901a\u8fc7\u8fd9\u4e9b\u793a\u4f8b\u4ee3\u7801\uff0c\u80fd\u591f\u5e2e\u52a9\u8bfb\u8005\u66f4\u597d\u5730\u7406\u89e3\u5e76\u638c\u63e1\u5982\u4f55\u5728Python\u4e2d\u6c42\u5b8c\u6570\u3002<\/p>\n<\/p>\n
\u76f8\u5173\u95ee\u7b54FAQs\uff1a<\/strong><\/h2>\n
 \u5982\u4f55\u5b9a\u4e49\u5b8c\u6570\uff1f<\/strong>
\u5b8c\u6570\u662f\u6307\u4e00\u4e2a\u6b63\u6574\u6570\u7b49\u4e8e\u5b83\u7684\u6240\u6709\u6b63\u56e0\u5b50\uff08\u4e0d\u5305\u62ec\u81ea\u8eab\uff09\u4e4b\u548c\u3002\u4f8b\u5982\uff0c6\u7684\u56e0\u5b50\u662f1\u30012\u30013\uff0c\u5b83\u4eec\u7684\u548c\u662f6\uff0c\u56e0\u6b646\u662f\u4e00\u4e2a\u5b8c\u6570\u3002\u4e86\u89e3\u5b8c\u6570\u7684\u5b9a\u4e49\u53ef\u4ee5\u5e2e\u52a9\u6211\u4eec\u66f4\u597d\u5730\u7406\u89e3\u5982\u4f55\u5728Python\u4e2d\u5b9e\u73b0\u76f8\u5e94\u7684\u8ba1\u7b97\u3002<\/p>\n
\u5728Python\u4e2d\u5982\u4f55\u4f7f\u7528\u5faa\u73af\u7ed3\u6784\u6765\u627e\u51fa\u5b8c\u6570\uff1f<\/strong>
\u53ef\u4ee5\u901a\u8fc7\u7f16\u5199\u4e00\u4e2a\u5faa\u73af\u904d\u5386\u4e00\u5b9a\u8303\u56f4\u5185\u7684\u6574\u6570\uff0c\u8ba1\u7b97\u6bcf\u4e2a\u6574\u6570\u7684\u56e0\u5b50\u548c\uff0c\u7136\u540e\u5224\u65ad\u8be5\u548c\u662f\u5426\u7b49\u4e8e\u8be5\u6574\u6570\u3002\u53ef\u4ee5\u4f7f\u7528for<\/code>\u5faa\u73af\u6765\u5b9e\u73b0\u8fd9\u4e00\u8fc7\u7a0b\u3002\u4ee5\u4e0b\u662f\u4e00\u4e2a\u7b80\u5355\u7684\u793a\u4f8b\uff1a<\/p>\n
for num in range(1, 10000):  # \u904d\u53861\u52309999\u7684\u6570\n    sum_of_divisors = 0\n    for i in range(1, num):  # \u627e\u5230num\u7684\u56e0\u5b50\n        if num % i == 0:\n            sum_of_divisors += i\n    if sum_of_divisors == num:  # \u5224\u65ad\u662f\u5426\u4e3a\u5b8c\u6570\n        print(num)  # \u8f93\u51fa\u5b8c\u6570\n<\/code><\/pre>\n
\u8ba1\u7b97\u5b8c\u6570\u65f6\u5982\u4f55\u4f18\u5316\u4ee3\u7801\u4ee5\u63d0\u9ad8\u6548\u7387\uff1f<\/strong>
\u901a\u8fc7\u9650\u5236\u56e0\u5b50\u7684\u641c\u7d22\u8303\u56f4\uff0c\u53ef\u4ee5\u663e\u8457\u63d0\u9ad8\u6548\u7387\u3002\u53ea\u9700\u904d\u5386\u5230num<\/code>\u7684\u5e73\u65b9\u6839\uff0c\u5e76\u5728\u53d1\u73b0\u56e0\u5b50\u65f6\u540c\u65f6\u8ba1\u7b97\u5bf9\u5e94\u7684\u914d\u5bf9\u56e0\u5b50\u3002\u53ef\u4ee5\u4f7f\u7528\u4e00\u4e2a\u6761\u4ef6\u8bed\u53e5\u6765\u68c0\u67e5\u5e76\u6dfb\u52a0\u8fd9\u4e24\u4e2a\u56e0\u5b50\uff0c\u8fdb\u4e00\u6b65\u51cf\u5c11\u5faa\u73af\u6b21\u6570\u3002<\/p>\n
import math\n\nfor num in range(1, 10000):\n    sum_of_divisors = 0\n    for i in range(1, int(math.sqrt(num)) + 1):\n        if num % i == 0:\n            sum_of_divisors += i\n            if i != num \/\/ i and i != 1:  # \u907f\u514d\u91cd\u590d\u6dfb\u52a0\u56e0\u5b50\n                sum_of_divisors += num \/\/ i\n    if sum_of_divisors == num:\n        print(num)\n<\/code><\/pre>\n
\u9664\u4e86\u5faa\u73af\u7ed3\u6784\uff0cPython\u4e2d\u8fd8\u6709\u54ea\u4e9b\u65b9\u6cd5\u53ef\u4ee5\u6c42\u5b8c\u6570\uff1f<\/strong>
\u9664\u4e86\u4f7f\u7528\u5faa\u73af\u7ed3\u6784\uff0cPython\u8fd8\u652f\u6301\u5176\u4ed6\u65b9\u6cd5\uff0c\u4f8b\u5982\u9012\u5f52\u3001\u5217\u8868\u63a8\u5bfc\u5f0f\u7b49\u3002\u5bf9\u4e8e\u5b8c\u6570\u7684\u8ba1\u7b97\uff0c\u4f7f\u7528\u5217\u8868\u63a8\u5bfc\u5f0f\u53ef\u4ee5\u66f4\u7b80\u6d01\u5730\u83b7\u53d6\u56e0\u5b50\u548c\u3002\u4f8b\u5982\uff0c\u53ef\u4ee5\u521b\u5efa\u4e00\u4e2a\u5305\u542b\u5b8c\u6570\u7684\u5217\u8868\uff0c\u901a\u8fc7\u6761\u4ef6\u5224\u65ad\uff0c\u9009\u62e9\u6027\u5730\u5c06\u5b8c\u6570\u6dfb\u52a0\u5230\u5217\u8868\u4e2d\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"Python\u4e2d\u53ef\u4ee5\u4f7f\u7528\u5faa\u73af\u7ed3\u6784\u6765\u6c42\u5b8c\u6570\uff0c\u5b8c\u6570\uff08Perfect Number\uff09\u662f\u6307\u4e00\u4e2a\u6b63\u6574\u6570\u7b49\u4e8e\u5b83\u6240\u6709\u6b63\u56e0\u5b50\u4e4b\u548c […]","protected":false},"author":3,"featured_media":1077068,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[37],"tags":[],"acf":[],"_links":{"self":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1077059"}],"collection":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/comments?post=1077059"}],"version-history":[{"count":"1","href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1077059\/revisions"}],"predecessor-version":[{"id":1077070,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1077059\/revisions\/1077070"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media\/1077068"}],"wp:attachment":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media?parent=1077059"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/categories?post=1077059"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/tags?post=1077059"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}