东方博宜1140-亲密数对

#include <iostream>

#include <cmath>

using namespace std;

int he(int n)

{

int r = 0;

for (int i = 2; i <= sqrt(n); i++)

{

if (n % i == 0)

{

if (i != n / i)

{

r = r + i + n / i;

}

else {

r += i; }

}

}

return r;

}

int main() {

int n, x; cin >> n;

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

x = he(i);

if (he(x) == i && i != x && x <= n) {

cout << i << " " << x << endl;

}

}

return 0;

}