hdoj.1323 Perfection 20140819
来源:互联网 发布:javashop4.0 源码 编辑:程序博客网 时间:2024/05/18 00:41
Perfection
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1708 Accepted Submission(s): 1021
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#include<stdio.h>int main(){ int n,sum[110],x,i,j,a[110]; while(1){ for(i=0;;i++){ scanf("%d",&a[i]); if(a[i]==0) break; n=a[i];sum[i]=1; for(j=2;j<n;j++){ if(n%j==0){ sum[i]+=j; } } } printf("PERFECTION OUTPUT\n"); for(j=0;j<i;j++){ if(sum[j]==a[j]) printf("%5d PERFECT\n",a[j]); if(sum[j]<a[j]) printf("%5d DEFICIENT\n",a[j]); if(sum[j]>a[j]) printf("%5d ABUNDANT\n",a[j]); } printf("END OF OUTPUT\n"); break; } return 0;}
0 0
- hdoj.1323 Perfection 20140819
- hdoj 1323 Perfection
- HDOJ 1323 Perfection(简单题)
- HDU 1323 Perfection
- hdu 1323 Perfection
- hdu 1323 Perfection
- HDU 1323 Perfection
- Perfection
- HDU 1323 Perfection (水题)
- 杭电 OJ 1323 Perfection
- HDU 1323 Perfection
- 杭电 HDU ACM 1323 Perfection
- POJ 1528 && HDU 1323 Perfection(水~)
- HDU 1323 Perfection(公因子)
- Blue Perfection
- HDU1323:Perfection
- poj_1528 Perfection
- hdu1323-Perfection
- 关于位运算
- OC UIView
- cocos2dx 3.1.1 mac上新建项目lua C++
- 解决vim 不能使用鼠标右键复制的问题
- 使用ADF Data Binding 之三:使用 Placeholder Data Control
- hdoj.1323 Perfection 20140819
- AngularJS
- poj 3077 Rounders(水题)
- rabbitmq技术的一些感悟(一)
- 数据挖掘精通到入门
- 使用github之:删除仓库
- ADF高级开发 之一:客制化与个性化 ADF 应用
- 杭电4135 Co-prime(容斥原理第一题)
- shell编程注意点