OJ_完数和盈数

题干

c++实现

#include<stdio.h>
#include<vector>
using namespace std;

int IsWanOrYing(int a) {
	int sum = 1;
	for (int i = 2; i < a; i++) {
		if (a % i == 0) {
			sum += i;
		}
	}
	if (sum == a) {
		return 1;
	}
	else if (sum > a) {
		return 2;
	}
	return -1;
}

int main() {
	vector<int> wan;
	vector<int> ying;

	for (int i = 2; i <= 60; i++) {
		if (IsWanOrYing(i) == 1) {
			wan.push_back(i);
		}
		else if (IsWanOrYing(i) == 2) {
			ying.push_back(i);
		}
	}

	printf("E:");

	for (vector<int>::iterator it = wan.begin(); it != wan.end(); it++) {
		printf(" %d", *it);
	}
	
	printf("\n");

	printf("G:");

	for (vector<int>::iterator it = ying.begin(); it != ying.end(); it++) {
		printf(" %d", *it);
	}

	return 0;
}