hdu 2040 亲和数

#include <iostream>using namespace std;long f(long x){    long result=0;    for(int i=1;i<x;i++)    {    if(x%i==0)        result+=i;    }    return result;} int main(){      int n;    long a,b;    cin>>n;    while(n--)    {    cin>>a>>b;        if(f(a)==b&&f(b)==a)        cout<<"YES"<<endl;        else cout<<"NO"<<endl;    }    return 0;}