hdu 1323 Perfection
来源:互联网 发布:眼镜零售店软件 编辑:程序博客网 时间:2024/05/21 19:51
Perfection
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2027 Accepted Submission(s): 1213
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
求一个数的所有真因子的和与这个数比大小,,2015,7,24
#include<stdio.h>int f(int n){int sum=0;for(int i=2;i<=n/2;i++){if(n%i==0)sum+=i;if(sum>n) break;}if(sum+1>n) return 2;//开始忘加1了,,,找了半天错,擦擦擦 else if(sum+1==n) return 1; else return 0; } int main() { int m,i,k=0; int a[60005]; while(scanf("%d",&m),m) { a[k++]=m; } printf("PERFECTION OUTPUT\n"); for(i=0;i<k;i++) { if(f(a[i])==1) printf("%5d PERFECT\n",a[i]); else if(f(a[i])==0) printf("%5d DEFICIENT\n",a[i]); else printf("%5d ABUNDANT\n",a[i]); } printf("END OF OUTPUT\n"); return 0; }
0 0
- HDU 1323 Perfection
- hdu 1323 Perfection
- hdu 1323 Perfection
- HDU 1323 Perfection
- HDU 1323 Perfection (水题)
- HDU 1323 Perfection
- 杭电 HDU ACM 1323 Perfection
- POJ 1528 && HDU 1323 Perfection(水~)
- HDU 1323 Perfection(公因子)
- hdoj.1323 Perfection 20140819
- hdoj 1323 Perfection
- Perfection
- hdu 1326(Perfection)(水题)
- 杭电 OJ 1323 Perfection
- HDOJ 1323 Perfection(简单题)
- Blue Perfection
- HDU1323:Perfection
- poj_1528 Perfection
- SQL中数据定义语言(DDL)、数据操纵语言(DML)、数据控制语言(DCL)
- VBScript详解(一)
- ch4 初始化和清除
- ch5 隐藏实施过程
- 关于将navigationBar的背景设置成透明,并且让navigationItem展示出来
- hdu 1323 Perfection
- 事件冒泡和事件捕获
- 机器学习-组合算法总结
- ch6 类再生
- jQuery 2.x 不支持IE9以下的IE浏览器
- CvArr, CvMat, IplImage, cv::Mat, cv::InputArray
- To find the kth to Last Element of a Singly Linked List
- ch7 多态
- 当本地html能访问的css和js文件在tomcat里访问不了,巧用cygwin解决