验证数字是否是盈数（友好数）的C程序？-C++-PHP中文网

验证数字是否是盈数（友好数）的C程序？

WBOY

发布： 2023-08-28 16:57:03

转载

952人浏览过

验证数字是否是盈数（友好数）的c程序？

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.

1.1.8PbootCMS

PbootCMS是一款高效、简洁、强悍的开源PHP企业网站开发建设管理系统。 PbootCMS 1.1.8 更新日志：2018-08-07 1.修复提交表单多选字段接收数据问题； 2.修复登录过程中二次登陆在页面不刷新时验证失败问题； 3.新增搜索结果fuzzy参数来控制是否模糊匹配； 4.新增父分类，顶级分类名称及链接独立标签，具体见手册； 5.新增内容多图拖动排序功能。

243

查看详情

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

#include<stdio.h>
int 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;
}

登录后复制