VongLapPractice/bai1.cpp at master · trnthsn/VongLapPractice · 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
52
53
54
55
56
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

bool checkPrime(int number)
{
    for (int i = 2; i < number; i++)
    {
        if (number % i == 0)
            return false;
    }
    return true;
}

int sumDivisor(int number)
{
    int sum = 0;
    for (int i = 1; i < number; i++)
    {
        if (number % i == 0)
            sum += i;
    }
    return sum;
}

bool checkPerfectNum(int number)
{
    if (number == sumDivisor(number))
        return true;
    return false;
}

bool checkSquareNum(int number)
{
    if (int(sqrt(number)) * int(sqrt(number)) == number)
        return true;
    return false;
}

int main()
{
    int n;
    cin >> n;
    for (int i = 2; i <= n; i++)
    	if (checkPrime(i))
    		cout << i << " ";
    cout << endl;
    for (int i = 2; i <= n; i++)
    	if (checkPerfectNum(i))
    		cout << i << " ";
    cout << endl;
    for (int i = 2; i <= n; i++)
    	if (checkSquareNum(i))
    		cout << i << " ";
}