PAT 7-1 找完數 (20 分)
阿新 • • 發佈:2018-12-14
#include<iostream> #include<vector> #include<cstdio> #include<set> #include<map> #include<string> #include<string.h> #include<algorithm> #include<cmath> #include<stdlib.h> #include<ctype.h> #include<stack> #include<queue> #include<list> using namespace std; vector<int>v; int flge = 0; int main(){ int m,n; scanf("%d%d",&m,&n); for(int i=m;i<=n;i++){ int sum = 0; for(int j=1;j<=i/2;j++){ if(i%j==0){ sum += j; v.push_back(j); } } if(sum==i){ flge = 1; printf("%d = 1",i); for(int x=1; x<v.size(); x++){ printf(" + %d",v[x]); } printf("\n"); } v.clear(); } if(!flge) printf("None"); return 0; }