首页 > 代码库 > 507. 完全数 Perfect Number

507. 完全数 Perfect Number

2024-09-12 08:30:34   215人阅读

We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself.

Now, given an integer n, write a function that returns true when it is a perfect number and false when it is not.

Example:

Input: 28
Output: True
Explanation: 28 = 1 + 2 + 4 + 7 + 14

Note: The input number n will not exceed 100,000,000. (1e8)


  1. static public bool CheckPerfectNumber(int num) {
  2. 	if (num == 0 || num == 1) return false;
  3. 	int sum = 1;
  4. 	for (int i = 2; i < Math.Sqrt(num); i++) {
  5. 		if (num % i == 0) {
  6. 			sum += i + num / i;
  7. 		}
  8. 	}
  9. 	return sum == num;
  10. }




null


507. 完全数 Perfect Number


联系
我们