View Code of Problem 93

#include <iostream>
using namespace std;

//求亲密数
int sumFactory(int num){
    int sum=0;
    for (int i = 1; i < num; ++i) {
        if (num%i==0){
            sum+=i;
        }
    }
    return sum;
}
int main(){
    int m,n;
    cin>>m>>n;
    for (int i = m; i <=n ; ++i) {
        int sum=sumFactory(i);
        if (sum>i&&sum<=n&&i==sumFactory(sum)){
            cout<<i<<" "<<sum<<endl;
        }
    }
}