TOJ 1571. Perfection
来源:互联网 发布:马列维奇 知乎 编辑:程序博客网 时间:2024/06/03 20:38
From the article Number Theory in the 1994 Microsoft Encarta: "If a, b, c are integers such that a = bc, a is called a multiple of b or of c, and b or c is called a divisor or factor of a. If c is not 1/-1, b is called a proper divisor of a. Even integers, which include 0, are multiples of 2, for example, -4, 0, 2, 10; an odd integer is an integer that is not even, for example, -5, 1, 3, 9. A perfect number is a positive integer that is equal to the sum of all its positive, proper divisors; for example, 6, which equals 1 + 2 + 3, and 28, which equals 1 + 2 + 4 + 7 + 14, are perfect numbers. A positive number that is not perfect is imperfect and is deficient or abundant according to whether the sum of its positive, proper divisors is smaller or larger than the number itself. Thus, 9, with proper divisors 1, 3, is deficient; 12, with proper divisors 1, 2, 3, 4, 6, is abundant."
Given a number, determine if it is perfect, abundant, or deficient.
Input
A list of N positive integers (none greater than 60,000), with 1 < N < 100. A 0 will mark the end of the list.
Output
The first line of output should read PERFECTION OUTPUT. The next N lines of output should list for each input integer whether it is perfect, deficient, or abundant, as shown in the example below. Format counts: the echoed integers should be right justified within the first 5 spaces of the output line, followed by two blank spaces, followed by the description of the integer. The final line of output should read END OF OUTPUT.
Sample Input
15 28 6 56 60000 22 496 0
Sample Output
PERFECTION OUTPUT 15 DEFICIENT 28 PERFECT 6 PERFECT 56 ABUNDANT60000 ABUNDANT 22 DEFICIENT 496 PERFECTEND OF OUTPUT
#include<iostream>#include<iomanip>using namespace std;int b[101][60001];int main(){int a[101],c[101],i,num,sum;i=0;while(cin>>a[i]){if(a[i]==0)break;else{num=0;sum=0;for(int j=1;j<a[i];j++){if(a[i]%j==0){b[i][num]=j;num++;}}for(int j=0;j<num;j++)sum=sum+b[i][j];if(sum==a[i])c[i]=0;else if(sum<a[i])c[i]=1;elsec[i]=2;}i++;} cout << "PERFECTION OUTPUT" << endl;for(int j=0;j<i;j++){cout<<setw(5)<<a[j]<<" ";if(c[j]==0) cout << "PERFECT"<<endl;else if(c[j]==1)cout << "DEFICIENT"<<endl;else cout << "ABUNDANT"<<endl;}cout << "END OF OUTPUT" << endl;//system("pause");return 0;}
0 0
- TOJ 1571. Perfection
- Perfection
- Blue Perfection
- HDU1323:Perfection
- poj_1528 Perfection
- hdu1323-Perfection
- hd1323 Perfection
- poj1528 Perfection
- HDU1323 Perfection
- Say No to Perfection
- fjnu 1319 Perfection
- 魔盒 Perfection CMS 系统
- poj 1528 Perfection
- zoj 1284 Perfection
- poj 1528 Perfection
- poj 1528 Perfection
- POJ 1528 perfection
- POJ 1528 Perfection
- [JavaScript]-----数据类型上
- 将博客搬至CSDN
- hdu 1877居然第一次wr是因为没有考虑a=b=0
- hdu1106
- maven命令小结 .
- TOJ 1571. Perfection
- CSS3中浏览器私有属性
- iPad适配相关
- Java基础温习 (3)
- Cocos2dx3.2学习准备(一):C++11新特性
- Android获取状态栏、标题栏、ActionBar以及屏幕的高度
- OpenCV简介以及向Android平台的移植
- 启动Tomcat服务器报错,端口报错解决方案
- 生成简单的 验证码