HDU 2040 亲和数

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main()
{
    int i,j,num;
    scanf("%d",&num);
    while(num--)
    {
        int n1,n2;
        int sum1=0,sum2=0;
        scanf("%d %d",&n1,&n2);
        if(n1>n2) swap(n1,n2);
        for(i=1;i<n1;i++)
        {
            if(n1 % i == 0)
                sum1 += i;
        }
        for(j=1;j<n2;j++)
        {
            if(n2 % j == 0)
                sum2 += j;
        }
        if(sum1 == n2 && sum2 == n1)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}