507. Perfect Number

最新推荐文章于 2021-05-12 17:06:47 发布

心向暖

最新推荐文章于 2021-05-12 17:06:47 发布

阅读量134

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/fadbgfnbxb/article/details/89395146

版权

leetcode 专栏收录该内容

96 篇文章 0 订阅

订阅专栏

第一次faster than 100.00% and less than 100.00% ,开心，(●'◡'●)

#include <iostream>
#include <algorithm>
#include "vector"
#include "string"
#include "set"
#include "map"
#include "unordered_set"
#include "unordered_map"
#include "queue"
#include "stack"
using namespace std;

bool checkPerfectNumber(int num)
{
	if (num == 0)
		return false;
	int number = 0;
	for (int divisor = 1; divisor < sqrt(num); divisor++)
	{
		if (num%divisor == 0)
		{
			number = number + divisor + num / divisor;
		}
	}
	return (number - num) == num;
}

int main()
{
	
	cout << checkPerfectNumber(99999996);
    
	system("pause");
	return 0;
}