dfs:每次从元素个数为n的num数组中拿出两个元素做运算,得到的运算结果和剩余n-2元素放入数组进行下一次探索
注意 : 浮点数的比较不能直接用==
#include <iostream>
#include <memory.h>
#include <string>
#include <stdio.h>
#include <queue>
#include <math.h>
#include <stdlib.h>
using namespace std;
double a[5];
#define eps 1e-6
bool isZero( double x )
{
if( fabs(x) <= eps )
return true;
else
return false;
}
bool cal24(double num[],int n)
{
if( n==1 )
{
if( isZero( num[0] - 24.0 ) )
return true;
else
return false;
}
double b[5];
for( int i = 0; i < n; i++ )
for( int j = i+1; j < n; j++ )
{
int m = 0;
for( int k = 0; k < n; k++ )
if( k != i && k != j)
{
b[m++] = num[k];
}
b[m] = num[i] + num[j];
if( cal24(b, m+1) )
return true;
b[m] = num[i] - num[j];
if( cal24(b, m+1) )
return true;
b[m] = num[j] - num[i];
if( cal24(b,m+1) )
return true;
b[m] = num[i] * num[j];
if( cal24(b, m+1) )
return true;
if( !isZero(num[j]) )
{
b[m] = num[i] / num[j];
if( cal24(b,m+1) )
return true;
}
if( !isZero(num[i]) )
{
b[m] = num[j] / num[i];
if( cal24(b, m+1) )
return true;
}
}
return false;
}
int main()
{
while( scanf("%lf%lf%lf%lf",&a[0],&a[1],&a[2],&a[3]), a[0] != 0 || a[1] != 0 || a[2] != 0 || a[3] != 0 )
{
if( cal24(a,4) )
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}