CodeForces 55B Smallest number(DFS)

题意:给你4个数,然后给你三个符号,问你怎么安排着4个数的顺序,可以使得最后的答案最小,4个数和三个符号,选两个数和第一个符号出来,得到一个数,3个数和2个符号,选两个数和第二个符号出来,得到一个数,2个数和1个符号,得到答案,要求使得答案最小

思路:直接爆搜就好了


#include<bits/stdc++.h>
using namespace std;
#define LL long long
char s[4];
LL ans = 1LL<<60;
void dfs3(LL a,LL b)
{
	LL temp=0;
    if (s[2]=='+')
	    temp = a+b;
    else
	    temp = a*b;
    ans = min(ans,temp);	
}
void dfs2(LL a,LL b,LL c)
{
	if (s[1]=='+')
	{
		dfs3(a+b,c);
		dfs3(a+c,b);
		dfs3(b+c,a);
	}

	else
	{
		dfs3(a*b,c);
		dfs3(a*c,b);
		dfs3(b*c,a);
	}
}
void dfs1(LL a,LL b,LL c,LL d)
{
	if (s[0]=='+')
	{
		dfs2(a+b,c,d);
        dfs2(a+c,b,d);
		dfs2(a+d,b,c);
		dfs2(b+d,a,c);
		dfs2(b+c,a,d);
		dfs2(c+d,a,b);
	}
	else
	{
		dfs2(a*b,c,d);
        dfs2(a*c,b,d);
		dfs2(a*d,b,c);
		dfs2(b*d,a,c);
		dfs2(b*c,a,d);
		dfs2(c*d,a,b);
	}
}
int main()
{
	LL a,b,c,d;
	cin >> a >> b >> c >> d;
    cin >> s[0] >> s[1]>>s[2];
	dfs1(a,b,c,d);
	cout <<ans << endl;
}

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 abcd 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


  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值