程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> CSU1600:Twenty-four point(DFS)

CSU1600:Twenty-four point(DFS)

編輯:C++入門知識

CSU1600:Twenty-four point(DFS)


Description

Given four numbers, can you get twenty-four through the addition, subtraction, multiplication, and division? Each number can be used only once.

 

Input

The input consists of multiple test cases. Each test case contains 4 integers A, B, C, D in a single line (1 <= A, B, C, D <= 13).

 

Output

For each case, print the “Yes” or “No”. If twenty-four point can be get, print “Yes”, otherwise, print “No”.

 

Sample Input

2 2 3 9
1 1 1 1 
5 5 5 1

Sample Output

Yes
No
Yes

HINT

 

For the first sample, (2/3+2)*9=24.

 

Source


題意:四個數字,通過四則運算看能不能得到24點
思路:對於如此小量的數,直接暴搜,你不需要懷疑人生
#include  
#include  
#include  
#include  
#include  
#include 
#include  
#include  
#include  
#include  
using namespace std; 
#define ls 2*i 
#define rs 2*i+1 
#define up(i,x,y) for(i=x;i<=y;i++) 
#define down(i,x,y) for(i=x;i>=y;i--) 
#define mem(a,x) memset(a,x,sizeof(a)) 
#define w(a) while(a) 
#define LL long long 
const double pi = acos(-1.0); 
#define Len 200005 
#define mod 19999997 
const int INF = 0x3f3f3f3f; 
#define exp 1e-8 
  
double a[5]; 
  
bool dfs(double *a,int n) 
{ 
    if(n==1) return fabs(a[0]-24)


  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved