import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * 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. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

package com.mademoisellegeek.googlecodejam.y2012.qualround;

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

public class DancingWithTheGooglers implements Runnable {

    BufferedReader in;
    BufferedWriter out;
    static String inputFile = "2012-qualround-B-large.in";
    static String outputFile = "2012-qualround-B-large.out";

    public void run() {

        try {
            in = new BufferedReader(new FileReader(inputFile));
            out = new BufferedWriter(new FileWriter(outputFile));
            try {
                String line = in.readLine();
                int nbCases = Integer.parseInt(line);
                for (int i=1; i<=nbCases; i++) {
                    line = in.readLine();
                    String [] lineArray = line.split(" ");
                    int nbDancers = Integer.parseInt(lineArray[0]);
                    int nbSurprises = Integer.parseInt(lineArray[1]);
                    int bestResultAtLeast = Integer.parseInt(lineArray[2]);
                    int[] dancerScores = new int[nbDancers];
                    for (int j=0; j<nbDancers; j++) {
                        dancerScores[j] = Integer.parseInt(lineArray[3+j]);
                    }
                    out.write("Case #" + i + ": " + solve(nbSurprises, bestResultAtLeast, dancerScores) + "\n");
                }
            } finally {
                in.close();
            }
            out.flush();
        } catch (Exception ex) {
            ex.printStackTrace();
        }
    }

    //maximum number of Googlers who could have had a best result of greater than or equal to
    //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. 
    private int solve(int nbSurprises, int atLeast, int[] dancerScores) {
        int resultat = 0;
        int potSurpr = 0;
        for (int score:dancerScores) {
            int quotient = score/3;
            int reste = score%3;
            if (reste == 0) {
                //t-1 t   t+1 (*)     t+1 *
                //t   t   t           t
                if (quotient >= atLeast) {
                    resultat++;
                }
                else if (quotient == atLeast-1 && quotient >0) {
                    potSurpr++;
                }
            }
            else if (reste == 1) {
                //t-1 t+1 t+1 (*)     t+1 *
                //t   t   t+1         t+1
                if (quotient >= atLeast - 1) {
                    resultat++;
                }
            }
            else {
                //t   t   t+2 (*)     t+2 *
                //t   t+1 t+1         t+1
                if (quotient >= atLeast-1) {
                    resultat++;
                }
                else if (quotient == atLeast-2) {
                    potSurpr++;
                }
            }
        }
        resultat+=Math.min(nbSurprises,potSurpr);
        return resultat;
    }
}
