题目
思路
递归边界条件:最后剩一个数等于24
代码
#include<iostream>
#include<cmath>
using namespace std;
#define EPS 1e-6
double a[5];
bool isZero(double x)//检验x是否为0
{
return fabs(x) <= EPS;
}
bool count24(double a[],int n)//用数组a里的n个数,计算24
{
if(n == 1){
if(isZero(a[0] - 24)){
return true;
}
else
return false;
}
double b[5];
for(int i = 0; i < n-1; ++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] = a[k];
m++;
}
}
b[m] = a[i] + a[j];
if(count24(b,m+1)){
cout << a[i]<<" + "<<a[j];
return true;
}
b[m] = a[i] - a[j];
if(count24(b,m+1)){
cout << a[i]<<" - "<<a[j];
return true;
}
b[m] = a[j] - a[i];
if(count24(b,m+1)){
cout << a[j]<<" - "<<a[i];
return true;
}
b[m] = a[i] * a[j];
if(count24(b,m+1)){
cout << a[i]<<" * "<<a[j];
return true;
}
if(!isZero(a[j])){
b[m] = a[i] / a[j];
if(count24(b,m+1)){
cout << a[i]<<" / "<<a[j];
return true;
}
}
if(!isZero(a[i])){
b[m] = a[j] / a[i];
if(count24(b,m+1)){
cout << a[j]<<" / "<<a[i];
return true;
}
}
}
return false;
}
}
int main(){
while(true){
for(int i = 0;i<4;++i){
cin >> a[i];
}
if(isZero(a[0]))
break;
if(count24(a,4))
cout << "Yes"<<endl;
else
cout << "No"<<endl;
}
return 0;
}