-
Notifications
You must be signed in to change notification settings - Fork 105
Expand file tree
/
Copy path5.1.cpp
More file actions
46 lines (41 loc) · 1.03 KB
/
5.1.cpp
File metadata and controls
46 lines (41 loc) · 1.03 KB
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
/*
* 题目名称：完数VS盈数
* 题目来源：清华大学复试上机题
* 题目链接：http://t.cn/AiKEyQWW
* 代码作者：杨泽邦(炉灰)
*/
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
vector<int> perfectNumber; //完数
vector<int> abundantNumber; //盈数
int DivisorSum(int number) {
int sum = 0;
for (int i = 1; i < number; ++i) {
if (number % i == 0) {
sum += i;
}
}
return sum;
}
int main() {
for (int i = 2; i <= 60; ++i) {
if (i == DivisorSum(i)) {
perfectNumber.push_back(i);
} else if (i < DivisorSum(i)) {
abundantNumber.push_back(i);
}
}
printf("E:");
for (int i = 0; i < perfectNumber.size(); ++i) {
printf(" %d", perfectNumber[i]);
}
printf("\n");
printf("G:");
for (int i = 0; i < abundantNumber.size(); ++i) {
printf(" %d", abundantNumber[i]);
}
printf("\n");
return 0;
}