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 jam2;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Test2 {
	public static void main(String argv[]){
		Test2 tb = new Test2();
		ArrayList<String> strin = tb.readFile("B-small-attempt0.in");
		ArrayList<ArrayList<Integer>> intin = tb.getInt(strin);
		
		tb.printInt(intin);
		
		ArrayList<String> strout = new ArrayList<String>();
		
		tb.computeDancer(intin, strout);
		
		tb.writeResult(strout, "outtest2_mall.txt");
	}
	
	public void computeDancer(ArrayList<ArrayList<Integer>> intin, 
			ArrayList<String> strout){
		if(intin==null || strout==null || intin.size()==0) return;
		int nTest = intin.get(0).get(0);
		for(int i=1; i<=nTest; ++i){
			
			int ndancer = intin.get(i).get(0);
			if(ndancer!=(intin.get(i).size()-3)){
				System.out.println("dancer do not match!");
				return;
			}
			
			int nsurprise = intin.get(i).get(1);
			int thresh = intin.get(i).get(2);
			final int tri =3;
			
			int ng = 0; //the googlers have score above threshold
			for(int j=3; j<intin.get(i).size(); ++j){
				int score = intin.get(i).get(j);
				if(score > (tri*(thresh-1))){
					ng++;
				}else if(score>(tri*(thresh-2)+1)){
					int div = score/tri;
					int residule = score%tri;
					if(nsurprise > 0){
						if(residule <=1 && div==0) continue; //
						ng++;
						nsurprise --;
					}
				}
			}
			
			//write out the results
			String line = "Case #"+i+": "+ng;
			System.out.println(line);
			strout.add(line);
		}
		
		
	}
	
	public void printInt(ArrayList<ArrayList<Integer>> intin){
		if(intin==null ) return;
		for(ArrayList<Integer> arr:intin){
			for(Integer i: arr){
				System.out.print(i+",");
			}
			System.out.println();
		}
	}
	
	public ArrayList<ArrayList<Integer>> getInt(ArrayList<String> strlist){
		if(strlist == null) return null;
		ArrayList<ArrayList<Integer>> intlist = new ArrayList<ArrayList<Integer>>();
		for(String s:strlist){
			ArrayList<Integer> tarr = new ArrayList<Integer>();
			String astr[] = s.split(" ");
			for(int i=0; i<astr.length; ++i){
				int itemp = Integer.parseInt(astr[i]);
				tarr.add(itemp);
			}
			intlist.add(tarr);
		}
		return intlist;
	}
	
	public ArrayList<String> readFile(String inname){
		if(inname == null) return null;
		
		ArrayList<String> arr = new ArrayList<String>();
		 try{
			 FileInputStream fstream = new FileInputStream(inname);
			 // Get the object of DataInputStream
			 DataInputStream in = new DataInputStream(fstream);
			 BufferedReader br = new BufferedReader(new InputStreamReader(in));
			 String strLine;
			 //Read File Line By Line
			 while ((strLine = br.readLine()) != null)   {
				 arr.add(strLine);
			 	}
			 //Close the input stream
			 in.close();
		 }catch (Exception e){//Catch exception if any
			 System.err.println("Error: " + e.getMessage());
		 }
		 
		 return arr;
	}
	
	public void writeResult(ArrayList<String> res, String fname){
		if(res == null || res.size()==0) return;
		try{
			FileWriter fstream = new FileWriter(fname);
			BufferedWriter out = new BufferedWriter(fstream);

			for(int i=0; i<res.size()-1;++i){
				out.write(res.get(i));
				out.newLine();
			}
			out.write(res.get(res.size()-1));
			out.close();
		}catch (Exception e){//Catch exception if any
			  System.err.println("Error: " + e.getMessage());
		  }
	}

}
