【盈数】 盈数（丰数，过剩数，abundant number)是一种特殊的自然数，除去它本身以外的一切正约数的和大于它本身。 【奇怪数】 奇怪数是盈数，同时满足： 在其约数构成的所有子集中，找不到任何一个子集的和等于它本身
pragma once
#include
class Sort {
public:
Sort(int N, int K);
template
void bubbling_sort(std::vector& vec);
private:
int N, K;
};
#include"Sort.h"
Sort::Sort(int N, int K) :N{ N }, K{ K } {}
template
void Sort::bubbling_sort(std::vector& vec)
{
for (int i = 0;i < K;++i) {
for (int j = i + 1;j < K;++j) {
if (vec[i] < vec[j]) {
T tmp = vec[i];
vec[i] = vec[j];
vec[j] = tmp;
}
}
}
}
#include
#include
#include
#include"Sort.h"
using namespace std;
void find_factors(int N, vector& factors) {
factors.push_back(1);
for (int i = 2;i * i <= N;++i) {
if (N % i == 0) {
factors.push_back(i);
if (i * i, N)factors.push_back(N / i);
}
}
}
void find_power_sets(
const vector& originalSet,
vector>& powerSets
) {
int n = originalSet.size();
for (int i = 0; i < pow(2, n); ++i) {
vector powerSet;
for (int j = 0; j < n; ++j) {
if ((i >> j) % 2 == 1) {
powerSet.push_back(originalSet[j]);
}
}
powerSets.push_back(powerSet);
}
}
int main()
{
int N, sum = 0;
int rest, sum2 = 0, s[100000], a = 2, b;
cout << "Input N:\n";
cin >> N;
srand((unsigned)time(NULL));
vector factors;
find_factors(N, factors);
cout << "Factors of " << N << " are: ";
for (auto& it : factors) cout << it << " ";
cout << endl;
for (auto& it : factors)
sum = it + sum;
cout << sum << endl;
rest = sum - N;
if (rest > 0)
{
cout << "N是盈数\n";
vector> powerSets;
find_power_sets(factors, powerSets);
cout << "Power sets:\n";
for (vector& ps : powerSets)
{
cout << "{ ";
for (int& i : ps) cout << i << " ";
cout << "}\n";
for (int& i : ps)
sum2 = sum2 + i;
s[a] = sum2;
s[1] = 0;
b = s[a] - s[a - 1];
a++;
cout << b << endl;
}
if (b = N)
cout << "N不是奇怪数" << N << endl;
else
cout << "N是奇怪数" << N << endl;
}
else {
vector> powerSets;
find_power_sets(factors, powerSets);
cout << "Power sets:\n";
for (vector& ps : powerSets)
{
cout << "{ ";
for (int& i : ps) cout << i << " ";
cout << "}\n";
}
cout << "N不是奇怪数\n" << N << endl;
}
cout << endl;
return 0;
}
代码都没有贴对，第二行include后面的东西呢
建议自己看看 https://blog.csdn.net/pfdvnah/article/details/102832648