《程序设计实践》——祥瑞生辉

/*
          aa[4] aa[3] aa[5] aa[6]
     +    aa[0] aa[1] aa[2] aa[3]
    -----------------------------
    aa[0] aa[1] aa[5] aa[3] aa[7]
*/
#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
    int aa[10]={0,1,2,3,4,5,6,7,8,9};
    int sum=0;
    int sum1=0;
    int sum2=0;
    int ans=0;
    //全排列 next_permutation(数组头地址,数组尾地址)
    while(next_permutation(aa,aa+10))
    {
        if(aa[0]!=0 && aa[4]!=0)
        {
            sum1=aa[4]*1000+aa[3]*100+aa[5]*10+aa[6];
            sum2=aa[0]*1000+aa[1]*100+aa[2]*10+aa[3];
            sum=aa[0]*10000+aa[1]*1000+aa[5]*100+aa[3]*10+aa[7];
            if(sum=sum1+sum2)
            {
                break;
            }
        }    
    }
    
    cout<<"祥瑞生辉:"<<endl;
    cout<<sum1<<endl;
    cout<<"三羊献瑞:"<<endl;
    cout<<sum2<<endl;
    cout<<"三羊生瑞气:"<<endl;
    cout<<sum<<endl;
    return 0;
}