CodeForces-55B-Smallest number（暴力深搜）

B - Smallest number
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit

Status

Practice

CodeForces 55B
Description
Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers a, b, c, d on the blackboard. During each of the next three minutes he took two numbers from the blackboard (not necessarily adjacent) and replaced them with their sum or their product. In the end he got one number. Unfortunately, due to the awful memory he forgot that number, but he remembers four original numbers, sequence of the operations and his surprise because of the very small result. Help Vladimir remember the forgotten number: find the smallest number that can be obtained from the original numbers by the given sequence of operations.

Input
First line contains four integers separated by space: 0 ≤ a, b, c, d ≤ 1000 — the original numbers. Second line contains three signs (‘+’ or ‘’ each) separated by space — the sequence of the operations in the order of performing. (‘+’ stands for addition, ‘’ — multiplication)

Output
Output one integer number — the minimal result which can be obtained.

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cin (also you may use %I64d).

Sample Input
Input
1 1 1 1
+ + *
Output
3
Input
2 2 2 2
* * +
Output
8
Input
1 2 3 4
* + +
Output
9

题意：给出四个数字abcd，及三个运算符，运算符是乘或加，输出可能的运算结果中最小的那个。

直接暴力深搜，搜索真是万能的

代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#define LL long long
using namespace std;
long long int ans=1LL<<60;
char str[4];
void DFS_3(long long int a,long long int b)
{
    long long int temp=0;
    if(str[2]=='+')
        temp=a+b;
    else
        temp=a*b;
    ans=min(ans,temp);
}
void DFS_2(long long int a,long long int b,long long int c)
{
    if(str[1]=='+')
    {
        DFS_3(a+b,c);
        DFS_3(a+c,b);
        DFS_3(b+c,a);
    }
    else
    {
        DFS_3(a*b,c);
        DFS_3(a*c,b);
        DFS_3(b*c,a);
    }
}
void DFS_1(long long int a,long long int b,long long int c,long long int d)
{
    if(str[0]=='+')
    {
        DFS_2(a+b,c,d);
        DFS_2(a+c,b,d);
        DFS_2(a+d,b,c);
        DFS_2(b+c,a,d);
        DFS_2(b+d,a,c);
        DFS_2(c+d,a,b);
    }
    else
    {
        DFS_2(a*b,c,d);
        DFS_2(a*c,b,d);
        DFS_2(a*d,b,c);
        DFS_2(b*c,a,d);
        DFS_2(b*d,a,c);
        DFS_2(c*d,a,b);
    }
}
int main()
{
    long long int a,b,c,d;
    cin>>a>>b>>c>>d;
    cin>>str[0]>>str[1]>>str[2];
    DFS_1(a,b,c,d);
    cout<<ans<<endl;
}