import java.io.IOException;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.Set;
import java.util.Iterator;
class Main
{
public static final boolean DEBUG = false;
public static void main(String[] args) throws IOException
{
Scanner cin;
int ca, cb, n;
if (DEBUG) {
cin = new Scanner(new FileReader("d:\\OJ\\uva_in.txt"));
} else {
cin = new Scanner(new InputStreamReader(System.in));
}
while (cin.hasNext()) {
ca = cin.nextInt();
cb = cin.nextInt();
n = cin.nextInt();
int a = 0, b = 0;
if (n < Math.min(ca, cb) || n >= cb) {
while (true) {
if (a == n) {
System.out.println("success");
break;
}
if (a == 0) {
System.out.println("fill A");
a = ca;
}
if (b != cb) {
System.out.println("pour A B");
if (a + b > cb) {
a -= cb - b;
b = cb;
} else {
b += a;
a = 0;
}
}
if (b == cb) {
System.out.println("empty B");
b = 0;
}
}
} else {
while (true) {
if (b == n) {
System.out.println("success");
break;
}
if (b == 0) {
System.out.println("fill B");
b = cb;
}
if (a != ca) {
System.out.println("pour B A");
if (a + b > ca) {
b -= ca - a;
a = ca;
} else {
a += b;
b = 0;
}
}
if (a == ca) {
System.out.println("empty A");
a = 0;
}
}
}
}
}
}
题目1147:Jugs
最新推荐文章于 2020-08-05 08:50:39 发布