Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
23798 | LeoWang | 求正整数2和n之间的完全数 | C++ | Accepted | 0 MS | 248 KB | 278 | 2023-07-31 22:14:10 |
#include<iostream> using namespace std; int ysh(int n) { int sum=0; for(int i=1;i<=n/2;i++){ if(n%i==0){ sum+=i; } } return sum; } int main() { int n; cin >> n; for(int i=2;i<=n;i++){ if(ysh(i)==i){ cout << i << endl; } } return 0; }