KY272 完数与盈数
描述
一个数如果恰好等于它的各因子(该数本身除外)子和,如:6=3+2+1,则称其为“完数”;若因子之和大于该数,则称其为“盈数”。求出2 到60 之间所有“完数”和“盈数”,并以如下形式输出: E: e1 e2 e3 …(ei 为完数) G: g1 g2 g3 …(gi 为盈数)
思路
穷举法,遍历2-60,遍历比这个数小的数,判断是否为这个数的因子,将因子存入容器求和,判断是否等于这个数,是就存入v1,大于就存入v2
#include <iostream>
#include<vector>
using namespace std;
int main() {
vector<int> v1, v2;
for (size_t i = 2; i <= 60; i++) {
vector<int> v3;
int temp = 0;
for (size_t j = i - 1; j >= 1; j--) {
if ((i % j) == 0) {
v3.push_back(j);
}
}
for (size_t i = 0; i < v3.size(); i++) {
temp += v3[i];
}
if (i == temp) {
v1.push_back(i);
}
else if (i < temp) {
v2.push_back(i);
}
}
cout << "E: ";
for (size_t i = 0; i < v1.size(); i++) {
cout << v1[i] << " ";
}
cout << "G: ";
for (size_t i = 0; i < v2.size(); i++) {
cout << v2[i] << " ";
}
return 0;
}
王道例题5.2 约瑟夫问题 No.2
描述
思路
用队列解决问题,遍历整个队列,并计数,将计数不等于m的小孩出队并重新入队,将计数等于m的小孩出队,并将编号插入数组
代码
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
int main() {
queue<int> kids;
int number, p, m;
vector<int> v1;
cin >> number >> p >> m;
for (size_t i = 1; i <= number; i++) {
kids.push(i);
}
for (size_t i = 1; i < p; i++) {
kids.pop();
kids.push(i);
}
int count = 1;
while (kids.empty() != 1) {
int temp = kids.front();
kids.pop();
if (count == m) {
count = 1;
v1.push_back(temp);
}
else {
count++;
kids.push(temp);
}
}
for (size_t i = 0; i < v1.size(); i++) {
cout << v1[i] << ",";
}
return 0;
}
王道例题5.3 猫狗收容所
描述
思路
用两个队列分别存放猫与狗,用结构体存储动物的编号和进入次序,用if来判断是进还是出
动物出时从队列最前端元素出,将序号放入容器,最后输出容器
代码
#include<iostream>
#include<queue>
using namespace std;
class Animal {
public:
int A_number;
int A_order;
};
int main() {
queue<Animal> qCat, qDog;
int count, in_number = 0;
int m, t;
vector<int> ret;
cin >> count;
while ((count--) != 0) {
cin >> m >> t;
if (m == 1) { //入队,宠物进入
if (t > 0) {
Animal dog;
dog.A_number = t;
dog.A_order = in_number;
in_number++;
qDog.push(dog);
}
else if(t < 0){
Animal cat;
cat.A_number = t;
cat.A_order = in_number;
in_number++;
qCat.push(cat);
}
}
else if(m == 2){ //出队,宠物出
if (t == 0) { //第一种收养方式
if (qDog.front().A_order < qCat.front().A_order) {
ret.push_back(qDog.front().A_number);
qDog.pop();
}
else {
ret.push_back(qCat.front().A_number);
qCat.pop();
}
}
else if (t == 1) {
ret.push_back(qDog.front().A_number);
qDog.pop();
}
else if (t == -1) {
ret.push_back(qCat.front().A_number);
qCat.pop();
}
}
}
for (size_t i = 0; i < ret.size(); i++) {
cout << ret[i] << " ";
}
return 0;
}