
In this program, we are trying to check whether the two given numbers by the user through console, are friendly pair or not?
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.
齐博B2B系统是一款基于PHP程序和Mysql数据库为基础的开源B2B行业门户电子商务网站建站系统, 系统代码完整、开源,功能全面,架构优秀,提供良好的用户体验、及管理平台,是目前搭建B2B行业门户网站最好的程序之一。齐博B2B具有的功能特点包括:通行证整合功能通过通行证的整合,可以与流行的PHPWIND论坛或Discuz论坛以及Ucenter中心等进行通讯,从而为用户提供更多的交流场所,增加网站
0
if(result1==number1 && result2==number2)
If this condition is satisfied, then they are abundant pairs, otherwise they are not.
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 登录后复制
输出如下 −
Enter two numbers:6 28 Abundant Pairs
以上就是验证数字是否是盈数(友好数)的C程序?的详细内容,更多请关注php中文网其它相关文章!
每个人都需要一台速度更快、更稳定的 PC。随着时间的推移,垃圾文件、旧注册表数据和不必要的后台进程会占用资源并降低性能。幸运的是,许多工具可以让 Windows 保持平稳运行。
Copyright 2014-2025 https://www.php.cn/ All Rights Reserved | php.cn | 湘ICP备2023035733号