poj017

详细的注释可以参考之前的那一版

package com.njupt.acm;

import java.util.Scanner;


public class TestPOJ1017 {


public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int packages = 0;
int t = 0;


while (true) {
int a = scanner.nextInt();
int b = scanner.nextInt();
int c = scanner.nextInt();
int d = scanner.nextInt();
int e = scanner.nextInt();
int f = scanner.nextInt();


if (a == 0 && b == 0 && c == 0 && d == 0 && e == 0 && f == 0) {
break;
}


packages = f;


packages += e;
a -= 11 * e;


packages += d;


if (b >= 5 * d) {
b -= 5 * d;
} else {
t = 5 * d - b;
a -= 4 * t;
b = 0;
}


packages += c / 4;


t = c % 4;


if (t != 0) {
packages += 1;


if (t == 1) {


if (b >= 5) {
b -= 5;
a -= 7;
} else if (b >= 0) {
a -= (36 - 9 - 4 * b);
b = 0;
}
} else if (t == 2) {
if (b >= 3) {
b -= 3;
a -= 6;
} else if (b >= 0) {
a -= (36 - 4 * b - 18);
b = 0;
}
} else if (t == 3) {
if (b >= 1) {
b -= 1;
a -= 5;
} else if (b >= 0) {
a -= (36 - 27 - 4 * b);
b = 0;
}
}


}


if (b > 0) {
packages += b / 9;


t = b % 9;


if (t != 0) {
++packages;


a -= (36 - 4 * t);



}


}


if (a > 0) {
packages += a / 36;


t = a % 36;


if (t != 0) {
++packages;
}





}


System.out.println(packages);
}
}
}