24点算法

#include <stdio.h>
typedef float (__cdecl *TYPE_MYFUN)(float , float );
float FunAdd(float x, float y)
{
    return x + y;
}
float FunSub(float x, float y)
{
    return (x - y>0)?x-y:y-x;
}

float FunMul(float x, float y)
{
    return x * y;
}
float FunDiv(float x, float y)
{
    return x / y;
}
bool operatorFun( float a, float b ,float c ,float d);

int main(int argc, char* argv[])
{
    float Num[4] = { 3 , 3 , 8 , 8 };//答案为 8/(3-8/3) ;
    for( int a = 0 ; a < 4 ; a++ ){
        for( int b = 0 ; b < 4 ;b++ ){
            for( int c = 0 ; c < 4 ; c++ ){
                for( int d = 0 ; d < 4 ; d++ ){
     //不能有任何两个相同
                    if((a==b)||(a==c)||(a==d)||(b==c)||(b==d)||(c==d))
                        continue;
                    if ( operatorFun(Num[a],Num[b],Num[c],Num[d])  )
                        return 0;
                }
            }
        }
    }
    return 0;
}

bool operatorFun( float a, float b ,float c ,float d)
{
    static TYPE_MYFUN Fun[4] = { FunAdd ,FunSub , FunMul , FunDiv };
    static char op[4] = { '+' , '-' , '*' ,'/'};

    for( int x = 0 ; x < 4 ; x++ ){
        for( int y = 0 ; y < 4 ; y++ ){
            for( int z = 0 ; z < 4 ; z++ ){
                float sum = Fun[z](  Fun[y]( Fun[x](a,b)  ,c)   ,d);
                if( (sum >23.9)&&(sum<24.1) ){
                    printf("((%d%c%d)%c%d)%c%d",(int)a,op[x] ,(int)b,op[y] ,(int)c,op[z],(int)d);
                    return true;
                }
                sum =  Fun[z](   Fun[x](a,b) , Fun[y](c ,d) );
                if( (sum >23.9)&&(sum<24.1) ){
                    printf("(%d%c%d)%c(%d%c%d)",(int)a,op[x] ,(int)b,op[z] ,(int)c,op[y],(int)d);
                    return true;
                }
                sum =  Fun[z]( a , Fun[y](b , Fun[x](c,d) ) );
                if( (sum >23.9)&&(sum<24.1) ){
                    printf("%d%c(%d%c(%d%c%d))",(int)a,op[z] ,(int)b,op[y] ,(int)c,op[x],(int)d);
                    return true;
                }
            }
        }              
    }
    return false;
}