In this program, we are trying to check whether the two given numbers by the user through console, are friendly pair or not?
Example
If sum of all divisors of number1 is equal to number1 and sum of all divisors of number2 is equal to number2, then we can say, those two numbers are abundant numbers.
The logic that we used to find friendly pairs is as follows −
For the sum of all divisors of number 1.
for(i=1;i<number1;i++){ if(number1 % i == 0){ result1= result1 +i; }}
对于数字2的所有除数的总和。
for(i=1;i<number2;i++){ if(number2 % i == 0){ result2=result2+i; }}
For the friendly pairs.
if(result1==number1 && result2==number2)
If this condition is satisfied, then they are abundant pairs, otherwise they are not.
Example
Following is the C program to find whether the given numbers are abundant pairs or not −
Live Demo
#includeint main(){ int number1,number2,i; printf("Enter two numbers:"); scanf("%d%d",&number1,&number2); int result1=0,result2=0; for(i=1;i<number1;i++){ if(number1 % i == 0){ result1= result1 +i; } } for(i=1;i<number2;i++){ if(number2 % i == 0){ result2=result2+i; } } if(result1==number1 && result2==number2) printf("Abundant Pairs"); else printf("Not abundant Pairs"); return 0;}
输出
输出如下 −
Enter two numbers:6 28Abundant Pairs
以上就是验证数字是否是盈数（友好数）的C程序？的详细内容，更多请关注创想鸟其它相关文章！
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。
如发现本站有涉嫌抄袭侵权/违法违规的内容， 请发送邮件至 chuangxiangniao@163.com 举报，一经查实，本站将立刻删除。
发布者：程序猿，转转请注明出处：https://www.chuangxiangniao.com/p/1443935.html
微信扫一扫 
支付宝扫一扫 
