刷题、OJ 1912 亲和数

//Language C++#include<iostream>#include<cmath>using namespace std;int  yinzi(int n)             //因子拆分函数{int i,sum=0;for(i=1;i<n;i++){if(n%i==0)          {sum=i+sum;        //将因子相加求和}}return sum;}int main(){int n,i,k,l;cin>>n;for(i=0;i<n;i++){cin>>k>>l;if(yinzi(k)==l&&k==yinzi(l))       //判断两数因子和{cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}}return 0;}