zoukankan      html  css  js  c++  java
  • POJ1528问题解答

    #include <iostream>
    #include <cstdio>
    #include <cmath>

    #include <string>
    #include <vector>
    #include<numeric>

    using namespace std;

    int main()
    {
    vector<int> inputNums;
    vector<int> results;
    while (true)
    {
    int num;
    scanf_s("%d", &num);
    if (num == 0)
    {
    break;
    }

    inputNums.push_back(num);

    }

    for (int i = 0; i < inputNums.size(); i++)
    {
    int num = inputNums[i];

    vector<int> divisors;
    for (int j = 1; j < (num / 2 + 1); j++)
    {
    if (num % j == 0)
    {
    divisors.push_back(j);
    }
    }

    int sum = std::accumulate(divisors.begin(), divisors.end(), 0);

    int result;
    if (num > sum)
    {
    result = 1;
    }
    else if (num < sum)
    {
    result = -1;
    }
    else
    {
    result = 0;
    }

    results.push_back(result);

    }

    printf("PERFECTION OUTPUT\n");
    for (int i = 0; i < results.size(); i++)
    {
    int result = results[i];
    if (result>0)
    {
    printf("%5d DEFICIENT\n",inputNums[i]);
    }
    else if (result == 0)
    {
    printf("%5d PERFECT\n", inputNums[i]);
    }
    else
    {
    printf("%5d ABUNDANT\n", inputNums[i]);
    }
    }
    printf("END of OUTPUT\n");

    return 0;
    }

  • 相关阅读:
    python3.5+flask+mysql
    Python魔法师
    Redis
    Socket
    Python线程
    Python全栈之路--Django ORM详解
    基本算法
    Python_Select解析
    如何做好一名DBA【转】
    解决MySQL忘记root密码
  • 原文地址:https://www.cnblogs.com/guochen/p/5452771.html
Copyright © 2011-2022 走看看