HDU 1323 Perfection

最新推荐文章于 2020-02-15 21:03:14 发布

淡定的小鱼

最新推荐文章于 2020-02-15 21:03:14 发布

阅读量392

点赞数

分类专栏：杭电

本文链接：https://blog.csdn.net/qq_16767427/article/details/38825405

版权

杭电同时被 2 个专栏收录

196 篇文章 0 订阅

订阅专栏

简单题

156 篇文章 0 订阅

订阅专栏

/*
中文题目完美
中文翻译-大意如果这个数的所有因子之和等于这个数，就输出PERFECT，如果所有因子之和小于这个数，就输出DEFICIENT，如果所有因子之和比这个数大就输出ABUNDANT
解题思路：打一个表，求解一个数的所有因子之和
难点详解：用两个for循环求解，注意第二个for循环要的循环条件为i*j<MAXN;才不会超时
关键点：求一个数所有因子的和（不包括自身）
解题人：lingnichong
解题时间：2014-08-25 19:51:32
解题体会：水题
*/

Perfection

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 1712 Accepted Submission(s): 1024

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

Source

Mid-Atlantic USA 1996

#include<stdio.h>
#include<string.h>
#define MAXN 100000
int arr[MAXN];
int main()
{
	printf("PERFECTION OUTPUT\n");
	int n,i,j;
	memset(arr,0,sizeof(arr));
	for(i=1;i<MAXN;i++)
		for(j=1;i*j<MAXN;j++)
			arr[i*j]+=i;
	while(scanf("%d",&n),n)
	{
		
		if(arr[n]-n==n)
			printf("%5d  PERFECT\n",n);
		else if(arr[n]-n>n)
			printf("%5d  ABUNDANT\n",n);
		else if(arr[n]-n<n)
			printf("%5d  DEFICIENT\n",n);
	}
	printf("END OF OUTPUT\n");
	return 0;
}