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 codejam;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class QualificationB extends CodeJam {

	public static final List<Integer> grades = Arrays.asList(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32);
	
	public QualificationB(String file) throws Exception {
		super(file);
		
	}
	
	class Grade {
		int pos;
		ArrayList<Integer> list;
		boolean surprising;
		
		boolean hasHighers(byte p) {
			for (Integer i : list) {
				if (i >= p) return true;
			}
			
			return false;
		}
		
	}

	@Override
	public Object processCase(int caseNumber) throws Exception {
		String readLine = readLine();
		String[] split = readLine.split(" ");
		int g = Integer.parseInt(split[0]);
		final int s = Integer.parseInt(split[1]);
		byte p = Byte.parseByte(split[2]); //0-10
		
		ArrayList<Grade> totalGrades = new ArrayList<Grade>(g);
		
		for (int i = 0; i < g; i++) {
			final int total = Integer.parseInt(split[i+3]);
			ArrayList<ArrayList<Integer>> compute = CombinationGenerator.compute(grades, 3, 3, new CombinationValidator<Integer>() {
				@Override
				public boolean isValid(List<Integer> comb) {
					int min = 11;
					int max = -1;
					
					byte ct = 0;
					for (Integer g : comb) {
						g = g%11;
						
						ct += g;
						if (g < min) min = g;
						if (g > max) max = g;
					}
					
					return ct == total && max - min < 3;
				}
				
			});
			
			ArrayList<Grade> grades = new ArrayList<QualificationB.Grade>(compute.size());
			
			for (ArrayList<Integer> arrayList : compute) {
				
				int min = 11;
				int max = -1;
				
				ArrayList<Integer> newList = new ArrayList<Integer>(3);
				for (Integer g1 : arrayList) {
					g1 = g1%11;
					
					if (g1 < min) min = g1;
					if (g1 > max) max = g1;
					
					newList.add(g1);
					
				}

				boolean alreadyExists = false;
				for (Grade grade : grades) {
					if (grade.list.containsAll(newList) && newList.containsAll(grade.list)) {
						alreadyExists = true;
						break;
					}
				}
				
				if (!alreadyExists) {
					Grade grade = new Grade();
					grade.pos = i;
					grade.list = newList;
					//surprising
					grade.surprising = max - min > 1;
					
					grades.add(grade);
				}
				
			}
			
			totalGrades.addAll(grades);
			
			
		}
		
		ArrayList<ArrayList<Grade>> compute = CombinationGenerator.compute(totalGrades, g, g, new CombinationValidator<Grade>() {

			@Override
			public boolean isValid(List<Grade> comb) {
				int tS = 0;
				
				List<Integer> indexes = new ArrayList<Integer>(3);
				
				for (Grade grade : comb) {
					if (grade.surprising) tS++;
					
					if (indexes.contains(grade.pos)) return false;
					
					indexes.add(grade.pos);
				}
				
				return tS == s;
			}

		});
		
		
		int maxH = 0;
		for (ArrayList<Grade> arrayList3 : compute) {
			int h = 0;
			for (Grade grade : arrayList3) {
				if (grade.hasHighers(p)) h++;
			}
			if (h > maxH) maxH = h;
		}
		return maxH;
	}

	public static void main(String[] args) throws IOException,
			InterruptedException, Exception {
		
		new QualificationB("B-small-attempt0.in").start();

	}
	
	
}
