HDOJ 1323 Perfection(简单题)
来源:互联网 发布:python json库 编辑:程序博客网 时间:2024/05/21 12:45
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.
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 ABUNDANT
60000 ABUNDANT
22 DEFICIENT
496 PERFECT
END OF OUTPUT
题意也比较容易理解:找一个数的约数之和是不是和这个数相等,
或者是大于,还是小于。
如果相等,后面接:PERFECT
如果约数和小于这个数,后面接:DEFICIENT
如果约数和大于这个数,后面接:ABUNDANT
然后。。。就写吧。水题
import java.util.Scanner;public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); String strNum = sc.nextLine(); String strsNum[] = strNum.split(" "); int[] num = new int[strsNum.length-1]; for(int i=0;i<num.length;i++){ num[i]=Integer.parseInt(strsNum[i]); } System.out.println("PERFECTION OUTPUT"); for(int i=0;i<num.length;i++){ strNum = "ABUNDANT"; if(isTrue(num[i])==-1){ strNum = "DEFICIENT"; } if(isTrue(num[i])==0){ strNum = "PERFECT"; } System.out.printf("%5d",num[i]); System.out.println(" "+strNum); } System.out.println("END OF OUTPUT"); } private static int isTrue(int i) { int sum=0;//约数之和 for(int k=1;k<=i/2;k++){ if(i%k==0){ sum=sum+k; } } if(sum<i){ return -1; } if(sum==i){ return 0; } return 1; }}
- HDOJ 1323 Perfection(简单题)
- hdoj.1323 Perfection 20140819
- hdoj 1323 Perfection
- HDU 1323 Perfection (水题)
- POJ 1528 && HDU 1323 Perfection(水~)
- HDU 1323 Perfection(公因子)
- HDU 1323 Perfection
- hdu 1323 Perfection
- hdu 1323 Perfection
- HDU 1323 Perfection
- Perfection
- hdoj 1058(简单题)
- 杭电 OJ 1323 Perfection
- HDU 1323 Perfection
- hdoj Card Game 5494 ()简单题
- hdoj Exam 5240 (简单逻辑题)
- hdoj 1035 Robot Motion(简单题)
- 杭电 HDU ACM 1323 Perfection
- Java中与时间相关的几个类(Date、Calendar、SimpleDateFormat)
- 2-链接-meta-表格-表单
- json 反序列化的时候遇到的问题整理
- C++实现栈
- java学习之路之数据库知识总结
- HDOJ 1323 Perfection(简单题)
- textarea如何实现高度自适应
- ArchLinux 扬声器和麦克风不能使用的问题
- php的tips(数组排序函数)
- div模拟textarea文本域轻松实现高度自适应
- UbuntuKylin13.10下安装配置Theano
- jquery ajax无刷新更新页面
- (Caffe,LeNet)前向计算(五)
- 杂项-近期思路