Algorithm/acmicpc.net/source/14563.cpp at master · tdm1223/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
// 14563. 완전수
// 2021.12.03
// 수학
#include<iostream>
#include<set>

using namespace std;

set<int> numSet;

int main()
{
    int t;
    cin >> t;
    while (t-- > 0)
    {
        numSet.clear();
        int n;
        cin >> n;

        for (int i = 1; i * i <= n; i++)
        {
            if (n % i == 0)
            {
                numSet.insert(i);
                numSet.insert(n / i);
            }
        }

        int sum = 0;
        for (auto num : numSet)
        {
            sum += num;
        }
        sum -= n;

        if (sum > n)
        {
            cout << "Abundant" << endl;
        }
        else if (sum < n)
        {
            cout << "Deficient" << endl;
        }
        else
        {
            cout << "Perfect" << endl;
        }
    }
    return 0;
}