向量

// 常用操作

#include <iostream>

#include <vector>

#include <cstdio>

using namespace std;

vector<int> myVector;

int main()

{

    for (int i = 0; i < 5; ++i)

    {

        myVector.push_back(i); // 从尾部逐一添加元素

    }

    myVector.insert(myVector.begin(), 3, 15); // 头部插入 3 个 15

    myVector.pop_back();

    for (int i = 0; i < myVector.size(); ++i)

    {

        printf("%d ", myVector[i]);

    }

    printf("\n");

    printf("the 5th element of myVector:%d\n", myVector[4]);

    printf("the size of myVector:%d\n", myVector.size());

    myVector.erase(myVector.begin() + 5, myVector.end()); // 删除第 5 后续的元素

    vector<int>::iterator it;                             // 定义迭代器

    for (it = myVector.begin(); it != myVector.end(); it++)

    {

        printf("%d ", *it); // 遍历向量

    }

    printf("\n");

    myVector.clear();

    return 0;

}

#include <iostream>

#include <vector>

#include <cstdio>

using namespace std;

vector<int> numberE; // 完数

vector<int> numberG; // 盈数

int Sum(int x)

{

    int sum = 0;

    for (int i = 1; i < x; ++i)

    {

        if (x % i == 0)

        {

            sum += i;

        }

    }

    return sum;

}

int main()

{

    for (int i = 2; i <= 60; ++i)

    {

        if (i == Sum(i))

        {

            numberE.push_back(i);

        }

        else if (i < Sum(i))

        {

            numberG.push_back(i);

        }

    }

    printf("E:");

    for (int i = 0; i < numberE.size(); ++i)

    {

        printf("%d ", numberE[i]);

    }

    printf("\n");

    printf("G:");

    for (int i = 0; i < numberG.size(); ++i)

    {

        printf("%d ", numberG[i]);

    }

    printf("\n");

    return 0;

}