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 com.elbr.codejam2012.qualification.B;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.net.URL;

public class Dancing {
	private static boolean debug = false;

	private static String findP;

	private static int p = 0;

	private static int s = 0;

	private static boolean checkDiff(String prefix, boolean checkNoSurprise) {
		prefix = prefix.trim();

		if (prefix.length() == 0) {
			return true;
		}

		String[] params = prefix.split("\\s");
		int max = -1;
		int min = -1;

		for (String s : params) {
			int i = Integer.parseInt(s);
			if (min == -1) {
				min = i;
			}

			if (max == -1) {
				max = i;
			}

			max = Math.max(max, i);
			min = Math.min(min, i);
		}

		if ((max > 10) || (min > 10)) {
			return false;
		}

		if (((max - min) > 2) || (max < p)) {
			return false;
		}

		if ((max - min) < 2) {
			return true;
		}

		if (checkNoSurprise) {
			return false;
		}

		if (s == 0) {
			return false;
		}

		s--;

		return true;
	}

	public static int count(String input, String countString) {
		return input.trim().split("\\Q" + countString + "\\E", -1).length - 1;
	}

	public static void main(String[] in) throws IOException {
		// String fileName = "sample2.in";
		String fileName = "B-small-attempt3.in";
		URL file = Dancing.class.getResource(fileName);
		String path = file.getFile();
		BufferedReader reader = new BufferedReader(new FileReader(path));

		File fileOut = new File(fileName + ".out");
		fileOut.createNewFile();
		BufferedWriter writer = new BufferedWriter(new FileWriter(fileOut));

		int numOfCases = Integer.parseInt(reader.readLine());

		for (int t = 0; t < numOfCases; t++) {
			String line = reader.readLine();

			String outputLine = "Case #" + (t + 1) + ": " + result(line);
			if (true || debug) {
				System.out.println(outputLine);
			}
			writer.write(outputLine + System.getProperty("line.separator"));
		}

		reader.close();
		writer.close();
	}

	public static void partition(int n, boolean checkNoSurprise) {
		findP = null;

		partition(n, n, "", checkNoSurprise);
	}

	public static void partition(int n, int max, String prefix,
			boolean checkNoSurprise) {
		if (findP != null) {
			return;
		}

		if (n == 0) {
			if ((count(prefix, " ") == 2)) {
				if (debug) {
					System.out.println("Check votes: " + prefix);
				}

				if (checkDiff(prefix, checkNoSurprise)) {
					findP = prefix;
				}
			}
			return;
		}

		for (int i = Math.min(max, n); i >= 1; i--) {
			String np = prefix + " " + i;
			if (count(prefix, " ") <= 2) {
				partition(n - i, i, np, checkNoSurprise);
			}
		}
	}

	private static int result(String line) {
		String[] params = line.split("\\s");
		int n = Integer.parseInt(params[0]);
		s = Integer.parseInt(params[1]);
		p = Integer.parseInt(params[2]);

		System.out.println(line + ": " + s + ", " + p);

		int[] m = new int[n];

		int a = 0;
		for (int i = 0; i < n; i++) {
			m[i] = Integer.parseInt(params[3 + i]);

			if (debug) {
				System.out.println(m[i] + " => ");
			}

			if ((m[i] == 0) && (p == 0)) {
				findP = "0 0 0";
				if (debug) {
					System.out.println("not surprise => " + findP);
				}
				a++;
			} else {
				partition(m[i], true);

				if (findP != null) {
					a++;
					if (debug) {
						System.out.println("not surprise => " + findP);
					}
				} else {
					if (debug) {
						System.out.println("---");
					}
					partition(m[i], false);
					if (findP != null) {
						a++;
						if (debug) {
							System.out.println("surprise => " + findP);
						}
					}
				}
			}
		}

		return a;
	}
}
