杭电 HDU ACM 1323 Perfection
来源:互联网 发布:淘宝uujuly品牌女装 编辑:程序博客网 时间:2024/05/21 18:28
Perfection
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1912 Accepted Submission(s): 1141
Problem Description
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.
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
Source
Mid-Atlantic USA 1996
#include<iostream>using namespace std;int main(){int n,i,sum; cout<<"PERFECTION OUTPUT"<<endl; while(cin>>n,n) { sum=1; //很是神奇 如果把printf语句移到这里就是答案错误!谁知道? for(int j=2;j<=n/2;j++) if(n%j==0) sum+=j; printf("%5d ",n); if(sum>n) cout<<"ABUNDANT"<<endl; else if(sum==n) cout<<"PERFECT"<<endl; else cout<<"DEFICIENT"<<endl; } cout<<"END OF OUTPUT"<<endl; return 0;}
0 0
- 杭电 HDU ACM 1323 Perfection
- 杭电 OJ 1323 Perfection
- HDU 1323 Perfection
- hdu 1323 Perfection
- hdu 1323 Perfection
- HDU 1323 Perfection
- HDU 1323 Perfection (水题)
- HDU 1323 Perfection
- hdu 杭电acm 1002
- 杭电ACM HDU 1004
- 杭电ACM HDU 1002
- 杭电ACM HDU 1008
- 杭电ACM HDU 1013
- 杭电ACM HDU 1014
- 杭电 acm Saving HDU
- 杭电 HDU ACM 圆桌会议
- 杭电 HDU ACM Milk
- 杭电ACM--HDU-1061
- springMVC文件上传
- Java的继承与多态
- Android源代码的下载
- c语言编程练习(一)
- 判断父节点是否存在
- 杭电 HDU ACM 1323 Perfection
- 黑马程序员------7k月薪面试题-银行业务调度系统
- 进入PE系统后找不到硬盘该怎么办?
- java高新之类加载器
- Drazil and Factoria
- 只能通过chrome网上应用商店安装该程序”的解决方法
- 黑马程序员——C 语言指针总结
- 20150403杂记
- offsetof和container_of