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);
        }
    }
}

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;

public class Googlers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scanner = null;
		int caseNumber = 0;
		Googlers a = new Googlers();

		try {
			scanner = new Scanner(new FileInputStream(args[0]));
			while (scanner.hasNextLine()) {

				if (caseNumber == 0) {
					scanner.nextLine();
				} else {
					String pairs = scanner.nextLine();
					String[] numbers = pairs.split(" ");

					System.out.println("Case #" + caseNumber + ": "
							+ a.resolve(numbers));
				}
				caseNumber++;
			}

		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} finally {
			scanner.close();
		}

	}

	private Integer resolve(String[] data) {

		int googlersNumber = Integer.parseInt(data[0]);
		int surprices = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int total = 0;

		ArrayList<Integer> googlers = new ArrayList<Integer>();
		for (int i = 0; i < googlersNumber; i++) {
			googlers.add(Integer.parseInt(data[3 + i]));
		}

		// create the triadas

		ArrayList<Integer[]> scores = createTriada(googlers);

		if (surprices > 0) {
			// Count number surpricing
			Integer totalSuprising = countNumberSurprising(scores);

			if (totalSuprising == surprices) {
				// Count p
				total = countP(p, scores);

			} else {
				// Create missing surprises
				scores = createMissingSurprices(surprices - totalSuprising, p,
						scores, false);

				Integer totalSuprisingB = countNumberSurprising(scores);

				if (totalSuprisingB != surprices) {
					scores = createMissingSurprices(surprices - totalSuprising,
							p, scores, true);
				}

				// check p
				total = countP(p, scores);
			}
		} else {
			total = countP(p, scores);
		}

		return total;
	}

	private ArrayList<Integer[]> createTriada(ArrayList<Integer> g) {

		ArrayList<Integer[]> scores = new ArrayList<Integer[]>();

		for (Integer number : g) {
			Integer[] score = new Integer[3];

			for (int i = 3; i > 0; i--) {

				float resultPrecise = number / i;
				int resultInteger = number / i;
				int calification = 0;
				if (resultPrecise > resultInteger) {
					calification = resultInteger + 1;
				} else {
					calification = resultInteger;
				}
				score[i - 1] = calification;
				number = number - calification;
			}
		
			scores.add(score);
		}

		return scores;
	}

	private Boolean checkSurprising(Integer[] scores) {

		Boolean found = false;

		int a = scores[0] - scores[1];
		int b = scores[0] - scores[2];
		int c = scores[1] - scores[2];

		if (a == 2 || b == 2 || c == 2) {
			found = true;
		}

		return found;
	}

	private int countNumberSurprising(ArrayList<Integer[]> c) {

		Boolean found = false;
		int surpriseN = 0;

		for (Integer[] integers : c) {

			if (checkSurprising(integers)) {
				surpriseN++;
			}
		}

		return surpriseN;

	}

	private ArrayList<Integer[]> createMissingSurprices(int missing, int p,
			ArrayList<Integer[]> s, Boolean forced) {

		for (int i = 0; i < s.size(); i++) {

			if (missing > 0) {

				if (!checkP(p, s.get(i)) || forced) {

					if (s.get(i)[1] > 0) {

						if ((s.get(i)[0] < p && s.get(i)[0] + 1 >= p) || forced) {
							
							Integer[] newTripleta = (Integer[])s.get(i).clone();
							newTripleta[0] = newTripleta[0]+1;
							newTripleta[1] = newTripleta[1]-1;

							if (validTripleta(newTripleta)) {
								s.set(i, newTripleta);
								missing--;
							}
						}
					}

				}
			}
		}
		return s;
	}

	private Boolean validTripleta(Integer[] scores) {
		Boolean found = true;

		int a = scores[0] - scores[1];
		int b = scores[0] - scores[2];
		int c = scores[1] - scores[2];

		if (a > 2 || b > 2 || c > 2) {
			found = false;
		}
		return found;
	}

	private Boolean checkP(int p, Integer[] scores) {

		Boolean found = false;

		for (Integer integer : scores) {
			if (integer >= p) {
				found = true;
				break;
			}
		}

		return found;
	}

	private Integer countP(int p, ArrayList<Integer[]> scores) {

		Integer total = 0;

		for (Integer[] integer : scores) {
			for (Integer integer2 : integer) {
				if (integer2 >= p) {
					total++;
					break;
				}
			}
		}

		return total;
	}

}
