非常可乐
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20211 Accepted Submission(s): 8199
Problem Description
大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M,101>S>0,N>0,M>0) 。聪明的ACMER你们说他们能平分吗?如果能请输出倒可乐的最少的次数,如果不能输出"NO"。
Input
三个整数 : S 可乐的体积 , N 和 M是两个杯子的容量,以"0 0 0"结束。
Output
如果能平分的话请输出最少要倒的次数,否则输出"NO"。
Sample Input
7 4 34 1 30 0 0
Sample Output
NO3
题解:
刚刚看到题目时可能会比较迷茫,但是,没有看错,这确实是一道简单的模拟搜索题。一共有六种情况,每次都模拟一下即可。对了,还发现了G++和C++的一些差距,G++的库更多,C++的速度更快。
//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <queue>
#include <iostream>
using namespace std;
int S,N,M;
int MA[4];
int No[4];
struct Node{
int A,B,C,step;
Node(int A = 0,int B = 0,int C = 0,int step = 0):A(A),B(B),C(C),step(step){}
};
queue<Node> qu;
int vis[105][105][105];
int main()
{
//ios::sync_with_stdio(false);
//cin >> S >> N >> M,S
while (scanf("%d %d %d",&S,&N,&M)){
if (S == 0 && N == 0 && M == 0)break;
memset(vis,0,sizeof(vis));
while (!qu.empty())qu.pop();
int E = (N+M)/2;
if ((N+M) == 2*E) qu.push(Node(S,0,0,0));
vis[0][N][M] = 1;
Node k;
int flag = 0;
while (!qu.empty()){
k = qu.front();
qu.pop();
if (k.A == E && k.B == E || k.B == E && k.C == E || k.C == E && k.A == E){
flag = 1;
break;
}
int A = k.A,B = k.B,C = k.C,step = k.step;
int need,la,lb,lc;
//A->B
need = N-B;
la = max(0,A-need);
lb = B + A - la;
if (A != 0 && B != N && vis[la][lb][C] == 0) {
qu.push(Node(la,lb,C,step+1));
vis[la][lb][C] = 1;
}
//A->C
need = M-C;
la = max(0,A-need);
lc = C + A - la;
if (A != 0 && C != M && vis[la][B][lc] == 0) {
qu.push(Node(la,B,lc,step+1));
vis[la][B][lc] = 1;
}
//B->A
need = S-A;
lb = max(0,B-need);
la = B + A - lb;
if (B != 0 && A != S && vis[la][lb][C] == 0) {
qu.push(Node(la,lb,C,step+1));
vis[la][lb][C] = 1;
}
//B->C
need = M-C;
lb = max(0,B-need);
lc = C + B - lb;
if (B != 0 && C != M && vis[A][lb][lc] == 0) {
qu.push(Node(A,lb,lc,step+1));
vis[A][lb][lc] = 1;
}
//C->A
need = S-A;
lc = max(0,C-need);
la = C + A - lc;
if (C != 0 && A != S && vis[la][B][lc] == 0) {
qu.push(Node(la,B,lc,step+1));
vis[la][B][lc] = 1;
}
//C->B
need = N-B;
lc = max(0,C-need);
lb = C + B - lc;
if (C != 0 && B != N && vis[A][lb][lc] == 0) {
qu.push(Node(A,lb,lc,step+1));
vis[A][lb][lc] = 1;
}
}
if (flag) printf("%d\n",k.step); //cout << k.step << endl;//
else printf("NO\n");//cout << "NO" << endl;//cout << "NO" << endl;
}
}
附上大神用gcd的做法
#include <iostream>
#include <algorithm>
using namespace std;
int gcd(int a, int b) {
return a%b ? gcd(b, a%b) : b;
}
void print(int a) {
if(a & 1) cout << "NO\n";
else cout << a-1 << endl;
}
int main()
{
int a, b, c;
while((cin>>a>>b>>c) && (a||b||c)) {
a /= gcd(b, c);
print(a);
}
}