题解 | #完全数计算#
完全数计算
http://www.nowcoder.com/practice/7299c12e6abb437c87ad3e712383ff84
include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n){
auto isPerfect = [](const int& n) -> bool {
int sum = 1;
for(int i = 2;i<sqrt(n);i++){
if(n % i == 0){
sum += i + n / i;
}
}
return sum == n;
};
int count = 0;
for(int i = 6;i<=n;i++){
count += isPerfect(i);
}
cout << count << endl;
}
}