ACM-数论之Perfection——hdu1323
2013-11-08 20:34
295 查看
Perfection
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 shouldbe 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 这题也挺简单,题意为 输入一个数求它的因子和,并判断因子和与该数的大小关系,如果因子和大于该数输出 DEFICIENT,如果等于输出PERFECT,如果小于输出ABUNDANT,题意很简单,注意格式,输出前端有:
PERFECTION OUTPUT,末尾输出 END OF OUTPUT。还有数字宽度为5,数字与后面之间有两个空格,废话不多说,代码:
#include <iostream> #include <iomanip> #include <string.h> using namespace std; int main() { int n,sum; int i; char dey[8]="PERFECT",day[9]="ABUNDANT",xy[10]="DEFICIENT"; printf("PERFECTION OUTPUT\n"); while(scanf("%d",&n) && n) { sum=0; for(i=1;i<n;++i) { if(sum>n) { cout<<setw(5)<<n<<" "<<day<<endl; break; } if(n%i==0) sum+=i; } if(sum==n) cout<<setw(5)<<n<<" "<<dey<<endl; else if(sum<n) cout<<setw(5)<<n<<" "<<xy<<endl; } printf("END OF OUTPUT\n"); return 0; }
代码中,每一次sum都会判断一次 sum是否大于n,所以时间上可能慢一点。
相关文章推荐
- [ACM - 数论]Perfection
- [ACM - 数论]Perfection
- [ACM - 数论]Wolf and Rabbit
- ACM模板 数论
- ACM数论之旅12---康托展开((*゚▽゚*)装甲展开,主推进器启动,倒计时3,2,1......)
- ACM数论
- ACM: polya定理 数论题 poj 2409
- ACM: 矩阵变形题 数论题 poj 3150
- ACM 数论 HDU 3037 Saving Beans (Lucas定理,大数取魔)
- ACM数论题集(转)
- ACMSTEP 2.1.7 Leftmost Digit // 数论 求 N^N最高次位
- HDU 4794 Arnold ACM/ICPC 2013 Changsha(二次剩余+数论)
- [ACM - 数论]Eddy's digital Roots(九余数定理)
- ACM数论模版
- ACM: polay定理 数论题 poj 1286 …
- ACM数论总结
- ACM 数论 青蛙的约会 扩展欧几里得
- ACM 数论 SGU 444 Headstrong Student
- “玲珑杯”ACM比赛 Round #18 B -- 数论你还会快速幂【规律】
- ACM数论基础之一_______质因数分解