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.clausewitz.codejam.qr2012;

import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

import com.clausewitz.codejam.Solver;

public class Dancing extends Solver {

	private int N = -1;
	private int S = -1;
	private int p = -1;
	private int totalPoints[] = null;
	
	@Override
	public void readProblem() throws IOException {
		String line = fileIn.readLine();
		StringTokenizer st = new StringTokenizer(line);
		
		N = Integer.parseInt(st.nextToken());
		S = Integer.parseInt(st.nextToken());
		p = Integer.parseInt(st.nextToken());

		totalPoints = new int[N];
		for(int i=0;i<N;++i) totalPoints[i] = Integer.parseInt(st.nextToken());
	}
	
	private List<Object> comb = null;
	
	public void Combination(int[] list, int startIdx, int[] selected, int numOfRemain) {
		if(numOfRemain==0) {
			ArrayList<Integer> l = new ArrayList<Integer>();
			for(int i=0;i<selected.length;++i) l.add(new Integer(selected[i]));
			comb.add(l);
		} else if(list.length==startIdx) {
			
		} else {
			selected[selected.length-numOfRemain] = startIdx;
			Combination(list, startIdx+1, selected, numOfRemain-1);
			selected[selected.length-numOfRemain] = -1;
			Combination(list, startIdx+1, selected, numOfRemain);
		}
	}

	@Override
	public void algorithm(int idx) {
		int maximum = 0;
		int[] list = new int[N];
		for(int i=0;i<N;++i) list[i] = i;
		
		if(idx==46) {
			System.out.print("");
		}
		
		if(S>0) {
			int[] selected = new int[S];
			comb = new ArrayList<Object>();
			Combination(list, 0, selected, S);
			
			for(int i=0;i<comb.size();++i) {
				int countOfThisCombination = 0;

				ArrayList<Integer> listOfSurprising = (ArrayList<Integer>) comb.get(i);				
				boolean isValidCombination = true;
				
				for(int j=0;j<N;++j) {
					boolean isSurprising = checkSurprisingNumber(listOfSurprising, j);

					int maxPoints = getMaxPoints(j, isSurprising);
					if(maxPoints>=p) ++countOfThisCombination;
					
					if(isSurprising && totalPoints[j]<2) {
						isValidCombination=false;
					}
				}

				if(isValidCombination && countOfThisCombination>maximum) maximum = countOfThisCombination;
			}
		} else {
			for(int j=0;j<N;++j) {
				int maxPoints = getMaxPoints(j, false);
				if(maxPoints>=p) ++maximum;
			}
		}
		
		answer[idx] = "" + maximum;
		if(idx==46) {
			System.out.println(maximum);
		}
	}

	private int getMaxPoints(int j, boolean isSurprising) {
		int maxPoints = 0;
		
		if(totalPoints[j]%3==0) {
			if(isSurprising) maxPoints = totalPoints[j]/3+1;
			else maxPoints = totalPoints[j]/3;
		} else if(totalPoints[j]%3==1) {
			maxPoints = totalPoints[j]/3+1;
		} else {
			if(isSurprising) maxPoints = totalPoints[j]/3+2;
			else maxPoints = totalPoints[j]/3+1;
		}
		return maxPoints;
	}

	private boolean checkSurprisingNumber(ArrayList<Integer> listOfSurprising, int j) {
		boolean isSurprising = false;
		for(int k=0;k<listOfSurprising.size();++k) {
			if(listOfSurprising.get(k).intValue()==j) {
				isSurprising = true;
				break;
			}
		}
		return isSurprising;
	}

}
