자서 제7장---폭력 구해법(간단하게 열거한 예제 7-1, 7-2, 7-3)

#include

using namespace std;

int n;
bool flag;

void solve(){
    flag=0;
    for(int a=0;a<=9;a++){
        for(int b=0;b<=9;b++){
            if(b==a) continue;
            for(int c=0;c<=9;c++){
                if(c==b || c==a) continue;
                for(int d=0;d<=9;d++){
                    if(d==a || d==b || d==c) continue;
                    for(int e=0;e<=9;e++){
                        if(e==a || e==b || e==c || e==d) continue;
                        for(int f=0;f<=9;f++){
                            if(f==a || f==b || f==c || f==d || f==e) continue;
                            for(int g=0;g<=9;g++){
                                if(g==a || g==b || g==c || g==d || g==e || g==f) continue;
                                for(int h=0;h<=9;h++){
                                    if(h==a || h==b || h==c || h==d || h==e || h==f || h==g) continue;
                                    for(int i=0;i<=9;i++){
                                        if(i==a || i==b || i==c || i==d || i==e || i==f || i==g || i==h) continue;

                                        for(int j=0;j<=9;j++){
                                            if(j==a || j==b || j==c || j==d || j==e || j==f || j==g || j==h || j==i) continue;
                                            int x=a*10000+b*1000+c*100+d*10+e;
                                            int y=f*10000+g*1000+h*100+i*10+j;
                                            if(x==y*n){
                                                flag=1;
                                                cout<" / "<" = "<if(!flag) cout<<"There are no solutions for "<"."<int main()
{
int first=1;
while(cin>>n){
if(n==0) break;
if(first) {first=0;solve();}
else{
cout<return 0;
}

#include

using namespace std;

int n;
bool flag;
int first=1;

int arr[10];

bool not_equal(int a[],int n){
    for(int i=0;ifor(int j=i+1;jif(a[j]==a[i]) return false;
        }
    }
    return true;
}

void solve(){
    if(first) first=0;
    else cout<0;
    for(int a=0;a<=9;a++){
        for(int b=0;b<=9;b++){
            for(int c=0;c<=9;c++){
                for(int d=0;d<=9;d++){
                    for(int e=0;e<=9;e++){
                        arr[0]=a;arr[1]=b;arr[2]=c;arr[3]=d;arr[4]=e;
                        if(not_equal(arr,5)){
                            int x=a*10000+b*1000+c*100+d*10+e;
                            int y=x*n;
                            arr[5]=y%10,arr[6]=y%100/10,arr[7]=y%1000/100,arr[8]=y%10000/1000;arr[9]=y/10000;
                            if(not_equal(arr,10) && y>=10000 && y<=99999){
                                flag=1;
                                for(int i=9;i>=5;i--) cout<cout<<" / ";
                                for(int i=0;i<5;i++) cout<cout<<" = "<if(!flag) cout<<"There are no solutions for "<"."<int main()
{
    while(cin>>n){
        if(n==0) break;
        solve();
    }
    return 0;
}

#include
#include

using namespace std;

long long int a[20];
int n;
int kase=0;

void solve(){
    while(cin>>n){
        for(int i=0;icin>>a[i];
        long long int mmax=0;
        for(int i=1;i<=n;i++){  //          
            for(int j=0;j<=n-i;j++){    //          
                long long int t=1;
                for(int k=j;k//  
                    t*=a[k];
                }
                mmax=max(mmax,t);
            }
        }
        cout<<"Case #"<": The maximum product is "<"."<int main()
{
    solve();
    return 0;
}

#include
#include

using namespace std;

const int maxn=20000+5;

typedef struct Node{
    int x,y;
    Node(int xx=0,int yy=0):x(xx),y(yy){}
}node;

int k,x,y;
node a[maxn];
int cnt;

void solve(){
    while(cin>>k){
        cnt=0;
        for(int y=1;y<=20000;y++){
            if(y>k && (y*k)%(y-k)==0){
                int x=(y*k)/(y-k);
                if(x>=y)
                    a[cnt++]=node(x,y);
            }
        }
        cout<for(int i=0;icout<<1<<"/"<" = "<<1<<"/"<" + "<<1<<"/"<int main()
{
solve();
return 0;
}