hiho week 98 register

Ended

Participants:433

Verdict:Accepted
Score:100 / 100
Submitted:2016-05-14 22:24:29

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<bits/stdc++.h>
using namespace std;
double arr[4];  //double....
bool dfs(int left)
{
    if(left == 1)
    {
        if(fabs(arr[0] - 24.0)<1e-6) return true; return false;
    }
    for(int i = 0; i < left; ++i)
        for(int j = i+1; j < left; ++j)
        {
            double a = arr[i]; double b = arr[j];
            arr[i] = a + b; arr[j] = arr[left-1];
            if(dfs(left-1)) return true;
            arr[i] = a - b; arr[j] = arr[left-1];
            if(dfs(left-1)) return true;
            arr[i] = b- a;  arr[j] = arr[left-1];
            if(dfs(left-1)) return true;
            arr[i] = a * b; arr[j] = arr[left-1];
            if(dfs(left-1)) return true;
            if(b)
            {
                arr[i] = a / b; arr[j] = arr[left-1];
                if(dfs(left-1)) return true;
            }
            if(a)
            {
                arr[i] = b / a; arr[j] = arr[left-1];
                if(dfs(left-1)) return true;
            }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX