杭电2040 亲和数

#include<iostream>

using namespace std;

int yueshu(int p);

int main()

{

int n;

while (cin >> n&&n)

{

int a, b;

for (int i = 1; i <= n; i++)

{

cin >> a >> b;

if ((yueshu(a) == b) || (yueshu(b) == a))

cout << "YES" << endl;

else cout << "NO" << endl;

}

}

}

int yueshu(int p)

{

int num,sum=0;

for (int i = 1; i <= p / 2; i++)

{

if (p%i == 0) {

num = i;

sum += i;

}

else continue;

}

return sum;

}