题目描述:
大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M,101>S>0,N>0,M>0) 。聪明的ACMER你们说他们能平分吗?如果能请输出倒可乐的最少的次数,如果不能输出"NO"。
输入描述:
三个整数 : S 可乐的体积 , N 和 M是两个杯子的容量,以"0 0 0"结束。
输出描述:
如果能平分的话请输出最少要倒的次数,否则输出"NO"。
输入:
7 4 3
4 1 3
0 0 0
输出:
NO
3
题意:
字面意思
题解:
写的时候写得脑壳疼
分情况讨论一下搜索
a->b,a->c
b->c,b->a
c->b,c->a
代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
using namespace std;
const int maxn = 100 + 5;
int a,b,c;
bool flag;
int vis[maxn][maxn][maxn];
struct point{
int a,b,c;
int step;
};
void bfs(){
queue<point> q;
point st;
st.a = a;
st.b = 0;
st.c = 0;
st.step = 0;
vis[st.a][0][0] = 1;
q.push(st);
while(!q.empty()){
//cout<<1<<endl;
point p = q.front();
q.pop();
//cout<<p.a<<" "<<p.b<<" "<<p.c<<endl;
if((p.a == a / 2 && p.b == a / 2) || (p.a == a / 2 && p.c == a / 2) || (p.b == a/ 2 && p.c == a / 2)){
printf("%d\n",p.step);
return ;
}
point now;
//a->b
if(p.a != 0){
if(p.a > b - p.b){
now.a = p.a -(b - p.b);
now.b = b;
now.c = p.c;
now.step = p.step + 1;
}
else{
now.a = 0;
now.b = p.b + p.a;
now.c = p.c;
now.step = p.step + 1;
}
if(!vis[now.a][now.b][now.c]){
vis[now.a][now.b][now.c] = 1;
q.push(now);
}
}
//a->c
if(p.a != 0){
if(p.a > c - p.c){
now.a = p.a - (c - p.c);
now.b = p.b;
now.c = c;
now.step = p.step + 1;
}
else{
now.a = 0;
now.b = p.b;
now.c = p.c + p.a;
now.step = p.step + 1;
}
if(!vis[now.a][now.b][now.c]){
vis[now.a][now.b][now.c] = 1;
q.push(now);
}
}
//b->c
if(p.b != 0){
if(p.b > c - p.c){
now.a = p.a;
now.b = p.b - (c - p.c);
now.c = c;
now.step = p.step + 1;
}
else{
now.a = p.a;
now.b = 0;
now.c = p.c + p.b;
now.step = p.step + 1;
}
if(!vis[now.a][now.b][now.c]){
vis[now.a][now.b][now.c] = 1;
q.push(now);
}
}
//b->a
if(p.b != 0){
if(p.b > a - p.a){
now.a = a;
now.b = p.b - (a - p.a);
now.c = p.c;
now.step = p.step + 1;
}
else{
now.a = p.a + p.b;
now.b = 0;
now.c = p.c;
now.step = p.step + 1;
}
if(!vis[now.a][now.b][now.c]){
vis[now.a][now.b][now.c] = 1;
q.push(now);
}
}
//c->a
if(p.c != 0){
if(p.c > a - p.a){
now.a = a;
now.b = p.b;
now.c = p.c - (a - p.a);
now.step = p.step + 1;
}
else{
now.a = p.a + p.c;
now.b = p.b;
now.c = 0;
now.step = p.step + 1;
}
if(!vis[now.a][now.b][now.c]){
vis[now.a][now.b][now.c] = 1;
q.push(now);
}
}
//c->b
if(p.c != 0){
if(p.c > b - p.b){
now.a = p.a;
now.b = b;
now.c = p.c - (b - p.b);
now.step = p.step + 1;
}
else{
now.a = p.a;
now.b = p.b + p.c;
now.c = 0;
now.step = p.step + 1;
}
if(!vis[now.a][now.b][now.c]){
vis[now.a][now.b][now.c] = 1;
q.push(now);
}
}
}
printf("NO\n");
return ;
}
int main(){
while(scanf("%d%d%d",&a,&b,&c)!=EOF){
if(a == 0 && b == 0 && c == 0) break;
if(a % 2 != 0){
printf("NO\n");
}
else{
memset(vis,0,sizeof(vis));
bfs();
}
}
return 0;
}