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 cg.y2012.QualQ2;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class Q2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		int[] s = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }; 
		Map<Integer, List<int[]>> G = new HashMap<Integer, List<int[]>>();
		for(int i:s){
			for(int j:s){
				for(int k:s){
					if(Math.abs(i-j)< 2 && Math.abs(k-j)< 2 && Math.abs(i-k)< 2){
						int sum = i+j+k;
						List<int[]> trips = G.get(sum);
						if(trips == null){
						 trips = new ArrayList<int[]>();
						}
						trips.add(new int[]{i,j,k});
						G.put(sum, trips);
					}
				}
			}
		}
		Map<Integer, List<int[]>> ST = new HashMap<Integer, List<int[]>>();
		for(int i:s){
			for(int j:s){
				for(int k:s){
					if((Math.abs(i-j)== 2 && Math.abs(k-j) < 2 && Math.abs(i-k) < 2) ||
							(Math.abs(i-j)< 2 && Math.abs(k-j)== 2 && Math.abs(i-k)<2) ||
							(Math.abs(i-j) < 2 && Math.abs(k-j) < 2 && Math.abs(i-k)== 2)){
						int sum = i+j+k;
						List<int[]> trips = ST.get(sum);
						if(trips == null){
						 trips = new ArrayList<int[]>();
						}
						trips.add(new int[]{i,j,k});
						ST.put(sum, trips);
					}
					if((Math.abs(i-j)== 2 && (Math.abs(k-j) == 0 || Math.abs(i-k) == 0)) ||
							(Math.abs(k-j)== 2 && (Math.abs(k-i) == 0 || Math.abs(i-j) == 0)) ||
							(Math.abs(k-i)== 2 && (Math.abs(k-j) == 0 || Math.abs(i-j) == 0))){
						int sum = i+j+k;
						List<int[]> trips = ST.get(sum);
						if(trips == null){
						 trips = new ArrayList<int[]>();
						}
						trips.add(new int[]{i,j,k});
						ST.put(sum, trips);
					}
				}
			}
		}
		for(Map.Entry<Integer, List<int[]>> k : G.entrySet()){
			System.out.print(k.getKey()+" -- ");
			List<int[]> l = k.getValue();
			for(int[] a : l){
				System.out.print("{");
				for(int x : a){
					System.out.print(" "+x+", ");
				}
				System.out.print("}");
			}
			System.out.println("");
		}
		
		for(Map.Entry<Integer, List<int[]>> k : ST.entrySet()){
			System.out.print(k.getKey()+" -- ");
			List<int[]> l = k.getValue();
			for(int[] a : l){
				System.out.print("{");
				for(int x : a){
					System.out.print(" "+x+", ");
				}
				System.out.print("}");
			}
			System.out.println("");
		}
		BufferedWriter out = null;
		try {
			String newLine = System.getProperty("line.separator");
		    out = new BufferedWriter(new FileWriter(args[0]+".output"));
		    BufferedReader b = new BufferedReader(new FileReader(args[0]));
		    int number_of_test_cases = Integer.parseInt(b.readLine().split(" ")[0]);
		    for( int tc = 0; tc < number_of_test_cases; tc++) {
		    	int[] data = convertToInt(b.readLine());
		    	int N = data[0];
		    	int S = data[1];
		    	int p = data[2];
		    	
		    	int rScores[] = new int[N];
		    	int j=0;
		    	for(int i=0;i < rScores.length;i++){
					rScores[i] = -1;
		    	}
		    	
		    	int count = 0;
		    	for(int i=0;i<N;i++){
			    	List<int[]> scores = G.get(data[3+i]);
			    	boolean found = false;
			    	if(scores != null){
				    	for(int[] score : scores){
			    			if(score[0] >=p ||score[1] >=p  || score[2] >=p  ){
				    			count ++;
				    			found = true;
				    			break;
				    		}
				    	}
				    	if(!found){
				    		rScores[j] =data[3+i];
				    		j++;
				    	}
			    	}
				}
	    		for(int i=0;i < rScores.length && S > 0;i++){
		    		if(rScores[i] == -1)
		    			break;
			    	List<int[]> scores = ST.get(rScores[i]);
			    	if(scores != null){
				    	for(int[] score : scores){
			    			if(score[0] >=p ||score[1] >=p  || score[2] >=p  ){
				    			count ++;
				    			S--;
				    			break;
				    		}
				    	}
			    	}
				}
			    out.write("Case #"+(tc+1)+": "+count+newLine);
				
			}
		} catch (IOException e) {
			System.out.println("Exception : "+e);
		}
		finally {
			if(out != null){
				try {
					out.close();
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
		}
	}
	
	private static int[] convertToInt(String line){
		String data[] = line.split(" ");
		int[] rtn = new int[data.length];
		for(int i=0;i< data.length ;i++){
			rtn[i]=Integer.parseInt(data[i].trim());
		}
		return rtn;
	}
	
}
