package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing integers
 * separated by single spaces. The first integer will be N, the number of
 * Googlers, and the second integer will be S, the number of surprising triplets
 * of scores. The third integer will be p, as described above. Next will be N
 * integers ti: the total points of the Googlers.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

package qualifiers12.b;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Set;
import java.util.StringTokenizer;

public class Dancing {

    public static Set<Triple>[] combs;

    public static class Triple {
	protected final int total;
	protected final int v1;
	protected final int v2;
	protected final int v3;

	public Triple(int total, int v1, int v2, int v3) {
	    this.total = total;
	    this.v1 = v1;
	    this.v2 = v2;
	    this.v3 = v3;
	}

	public int getMax() {
	    return max2(max2(v1, v2), v3);
	}

	private int max2(int n1, int n2) {
	    return (n1 > n2) ? n1 : n2;
	}

	public int getTotal() {
	    return v1 + v2 + v3;
	}

	public boolean isTriplet() {
	    if (v1 < 0 || v2 < 0 || v3 < 0) {
		return false;
	    }
	    if (Math.abs(v1 - v2) > 2 || Math.abs(v1 - v3) > 2 || Math.abs(v2 - v3) > 2) {
		return false;
	    }
	    return v1 + v2 + v3 == total;
	}

	public boolean isSurprising() {
	    return Math.abs(v1 - v2) == 2 || Math.abs(v1 - v3) == 2 || Math.abs(v2 - v3) == 2;
	}

	@Override
	public String toString() {
	    return total + "(" + v1 + "," + v2 + "," + v3 + ")";
	}

	@Override
	public int hashCode() {
	    List<Integer> list = new ArrayList<Integer>();
	    list.add(v1);
	    list.add(v2);
	    list.add(v3);
	    Collections.sort(list);
	    return list.get(0) * 100 + list.get(1) * 10 + list.get(2);
	}

	@Override
	public boolean equals(Object obj) {
	    if (obj instanceof Triple) {
		Triple that = (Triple) obj;
		if ((this.v1 == that.v1 || this.v1 == that.v2 || this.v1 == that.v3)
			&& (this.v2 == that.v1 || this.v2 == that.v2 || this.v2 == that.v3)
			&& (this.v3 == that.v1 || this.v3 == that.v2 || this.v3 == that.v3)) {
		    return true;
		} else {
		    return false;
		}
	    } else {
		return false;
	    }
	}
    }

    public static void computeCombination(int k, int total) {
	int avgPart = Math.round((total + 0.0f) / 3.0f);
	for (int i = -1; i < 2; i++) {
	    computeCombinationGiven(k, total, avgPart + i);
	}
    }

    private static void computeCombinationGiven(int k, int total, int part) {
	int missing = total - part;
	int avgPart = Math.round((missing + 0.0f) / 2.0f);

	for (int i = -1; i < 2; i++) {
	    computeWithOne(k, total, part, avgPart + i, avgPart);
	}
    }

    private static void computeWithOne(int k, int total, int part1, int part2, int lastAvg) {
	for (int i = -1; i < 2; i++) {
	    Triple triple = new Triple(total, part1, part2, lastAvg + i);
	    if (triple.isTriplet()) {
		combs[k].add(triple);
	    }
	}
    }

    public static void main(String[] args) throws IOException {

	BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	String s = in.readLine();

	int cases = Integer.parseInt(s);

	for (int i = 0; i < cases; i++) {
	    s = in.readLine();
	    StringTokenizer tokenizer = new StringTokenizer(s, " ");

	    int[] totals = new int[Integer.parseInt(tokenizer.nextToken())];
	    combs = new Set[totals.length];
	    for (int k = 0; k < combs.length; k++) {
		combs[k] = new HashSet<Triple>();
	    }
	    int surprising = Integer.parseInt(tokenizer.nextToken());
	    int p = Integer.parseInt(tokenizer.nextToken());

	    int k = 0;
	    while (tokenizer.hasMoreTokens()) {
		totals[k] = Integer.parseInt(tokenizer.nextToken());
		computeCombination(k, totals[k]);
		k++;
	    }

	    // for (k = 0; k < combs.length; k++) {
	    //
	    // String tmp = "";
	    // for (Triple triple : combs[k]) {
	    // tmp += triple.toString() + " ";
	    // }
	    // System.out.println(tmp);
	    //
	    // }

	    int usedSurprising = 0;
	    for (k = 0; k < combs.length; k++) {

		if (containsSurprisingSequence(combs[k])) {
		    Triple triple = containsNonSurprisingAboveOrEqualP(combs[k], p);
		    if (triple != null) {
			combs[k].clear();
			combs[k].add(triple);
		    } else if (usedSurprising < surprising) {
			triple = containsSurprisingAboveOrEqualP(combs[k], p);
			if (triple != null) {
			    combs[k].clear();
			    combs[k].add(triple);
			    usedSurprising++;
			}
		    } else {
			Iterator<Triple> iter = combs[k].iterator();
			while (iter.hasNext()) {
			    triple = iter.next();
			    if (triple.isSurprising()) {
				continue;
			    }
			    combs[k].clear();
			    combs[k].add(triple);
			    break;
			}
		    }
		} else {
		    // choose one above P, otherwise random one
		    Triple triple = containsNonSurprisingAboveOrEqualP(combs[k], p);
		    if (triple != null) {
			combs[k].clear();
			combs[k].add(triple);
		    } else {
			Iterator<Triple> iter = combs[k].iterator();
			while (iter.hasNext()) {
			    triple = iter.next();
			    if (triple.isSurprising()) {
				continue;
			    }
			    combs[k].clear();
			    combs[k].add(triple);
			    break;
			}
		    }
		}
	    }

	    int res = 0;
	    for (k = 0; k < combs.length; k++) {
		for (Triple triple : combs[k]) {
		    if (triple.getMax() >= p) {
			res++;
		    }
		}
	    }

	    String result = "Case #" + (i + 1) + ": " + res;
	    System.out.println(result);
	}

    }

    private static boolean containsSurprisingSequence(Set<Triple> triples) {
	for (Triple triple : triples) {
	    if (triple.isSurprising()) {
		return true;
	    }
	}
	return false;
    }

    private static Triple containsSurprisingAboveOrEqualP(Set<Triple> triples, int p) {
	for (Triple triple : triples) {
	    if (triple.isSurprising()) {
		if (triple.getMax() >= p) {
		    return triple;
		}
	    }
	}
	return null;
    }

    private static Triple containsNonSurprisingAboveOrEqualP(Set<Triple> triples, int p) {
	for (Triple triple : triples) {
	    if (!triple.isSurprising()) {
		if (triple.getMax() >= p) {
		    return triple;
		}
	    }
	}
	return null;
    }
}
