UVa 10465 HomerSimpson

/*UVa 10465 HomerSimpson*/import java.util.Arrays;import java.util.Scanner;class HomerSimpson {static final int MAXN = 10005;static int[] d = new int[MAXN];static int t;static int[] w = new int[2];public static void main(String[] args) {Scanner scanner = new Scanner(System.in);while (scanner.hasNext()) {Arrays.fill(d, -1);d[0] = 0;w[0] = scanner.nextInt();w[1] = scanner.nextInt();t = scanner.nextInt();for (int i = 0; i < 2; i++) {for (int j = w[i]; j <= t; j++) {if (d[j - w[i]] != -1) {d[j] = Math.max(d[j], d[j - w[i]] + 1);}}}int cn = 0;for (int i = t; i >= 0; i--) {if (d[i] != -1)break;cn++;}System.out.printf("%d", d[t - cn]);if (cn > 0)System.out.printf(" %d\n", cn);elseSystem.out.println();}}}