史上最笨比做法

解题思路:

为了达到如题排序输出格式，采用类与容器结合方式，将一个数的最高位设置为排序字段，赋值给类的order属性

注意事项:

参考代码:

class ShuSort{

public:

ShuSort(int num,int order){

this->m_num=num;

this->m_order=order;

}

int m_num;

int m_order;

};

long long GetJC(int n){

long long temp=1;

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

temp*=i;

return temp;

}

bool Mycompare(ShuSort s1,ShuSort s2){

return s1.m_order<s2.m_order; //升序 

}

int main()

{

unsigned long long sum,temp;

int flag;

vector<ShuSort>v;

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

sum=0;

temp=i;

while(temp){

int weishu=temp%10;

if(weishu/10==0)

flag=weishu;

sum+=GetJC(weishu);

temp/=10;

}

if(sum==i){

ShuSort s(i,flag);

v.push_back(s);

}

}

sort(v.begin(),v.end(),Mycompare);

for(vector<ShuSort>::iterator it=v.begin();it!=v.end();it++)

cout<<it->m_num<<" ";

}