大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M,101>S>0,N>0,M>0) 。聪明的ACMER你们说他们能平分吗?如果能请输出倒可乐的最少的次数,如果不能输出"NO"。
7 4 3 4 1 3 0 0 0
Sample Output
NO 3
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn = 100+10;
const int INF = 0x3f3f3f3f;
int s,a,b,ans,vist[maxn][maxn];
struct node{
int a,b,s,t;
}nxt[maxn],temp,u,v;
int BFS(){
queue<node>Q;
memset(vist,0,sizeof(vist));
temp.a = 0;
temp.b = 0;
temp.s = s;
temp.t = 0;
Q.push(temp);
vist[a][b] = 1;
while(!Q.empty()){
node u = Q.front();
Q.pop();
if(u.a == s/2 && u.s == s/2)
return u.t;
if(u.s && u.a!=a){
int c = a-u.a;
if(c>u.s){
v.a = u.a+u.s;
v.s = 0;
}
else{
v.a = a;
v.s = u.s-c;
}
v.b = u.b;
v.t = u.t+1;
if(!vist[v.a][v.b]){
vist[v.a][v.b] = 1;
Q.push(v);
}
}
if(u.s && u.b!=b){
int c = b-u.b;
if(c>u.s){
v.b = u.b+u.s;
v.s = 0;
}
else{
v.b = b;
v.s = u.s-c;
}
v.a = u.a;
v.t = u.t+1;
if(!vist[v.a][v.b]){
vist[v.a][v.b] = 1;
Q.push(v);
}
}
if(u.a && u.s!=s){
int c = s-u.s;
if(c>u.a){
v.s = u.s+u.a;
v.a = 0;
}
else{
v.s = s;
v.a = u.a-c;
}
v.b = u.b;
v.t = u.t+1;
if(!vist[v.a][v.b]){
vist[v.a][v.b] = 1;
Q.push(v);
}
}
if(u.a && u.b!=b){
int c = b-u.b;
if(c>u.a){
v.b = u.b+u.a;
v.a = 0;
}
else{
v.b = b;
v.a = u.a-c;
}
v.s = u.s;
v.t = u.t+1;
if(!vist[v.a][v.b]){
vist[v.a][v.b] = 1;
Q.push(v);
}
}
if(u.b && u.a!=a){
int c = a-u.a;
if(c>u.b){
v.a = u.a+u.b;
v.b = 0;
}
else{
v.a = a;
v.b = u.b-c;
}
v.s = u.s;
v.t = u.t+1;
if(!vist[v.a][v.b]){
vist[v.a][v.b] = 1;
Q.push(v);
}
}
if(u.b && u.s!=s){
int c = s-u.s;
if(c>u.b){
v.s = u.s+u.b;
v.b= 0;
}
else{
v.s = s;
v.b = u.b-c;
}
v.a = u.a;
v.t = u.t+1;
if(!vist[v.a][v.b]){
vist[v.a][v.b] = 1;
Q.push(v);
}
}
}
return 0;
}
int main(){
while(~scanf("%d %d %d",&s,&a,&b) && (a||b||s)){
if(s%2){
puts("NO");
continue;
}
if(a<b)
swap(a,b);
ans = BFS();
if(ans)
printf("%d\n",ans);
else
puts("NO");
}
return 0;
}