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 br.ufmg.dcc.codejam.problemas;

import java.io.FileNotFoundException;
import java.io.IOException;

import br.ufmg.dcc.codejam.util.ArquivoEscrita;
import br.ufmg.dcc.codejam.util.ArquivoLeitura;

/**
 * Solution for Problem B (Dancing With the Googlers) of Google Code Jam 2012
 * @author Marcio
 *
 */
public class ProblemB
{
	/**
	 * Number of test cases
	 */
	private int m_numTestCases;
	
	/**
	 * Input file
	 */
	private ArquivoLeitura m_inputFile;
	
	/**
	 * Output file
	 */
	private ArquivoEscrita m_outputFile;
	
	/**
	 * Constructor
	 * @param p_inputFile The input file for the problem
	 * @param p_outputFile The output file for the problem
	 */
	public ProblemB(ArquivoLeitura p_inputFile, ArquivoEscrita p_outputFile)
	{
		m_inputFile = p_inputFile;
		m_outputFile = p_outputFile;
		m_numTestCases = Integer.parseInt(p_inputFile.lerLinha());
	}
	
	/**
	 * Main method
	 * @param p_args Program arguments. Argument 0 is the input file name and argument 1 is the output file name
	 */
	public static void main(String[] p_args)
	{
		ArquivoLeitura v_inputFile = null;
		ArquivoEscrita v_outputFile = null;
		
		try
		{
			v_inputFile = new ArquivoLeitura(p_args[0]);
			v_outputFile = new ArquivoEscrita(p_args[1]);
			
			ProblemB v_problemB = new ProblemB(v_inputFile, v_outputFile);
			v_problemB.solve();
		}
		catch (FileNotFoundException v_exception)
		{
			System.out.println("File not found!");
			v_exception.printStackTrace();
		}
		catch (IOException v_exception)
		{
			System.out.println("IO error!");
			v_exception.printStackTrace();
		}
		finally
		{
			if(v_inputFile != null)
			{
				v_inputFile.fechar();
			}
			if(v_outputFile != null)
			{
				v_outputFile.fechar();
			}
		}
	}

	/**
	 * Solves the problem
	 */
	private void solve()
	{
		for(int v_numTestCase = 1; v_numTestCase <= m_numTestCases; v_numTestCase++)
		{
			solveTestCase(v_numTestCase, m_inputFile.lerLinha());
		}
	}

	/**
	 * Solves a test case
	 * @param p_numTestCase Number of the test case
	 * @param p_inputLine Input line of the test case
	 */
	private void solveTestCase(int p_numTestCase, String p_inputLine)
	{
		m_outputFile.escrever("Case #" + p_numTestCase + ": ");
		
		String[] v_data = p_inputLine.split(" ");
		
		@SuppressWarnings("unused")
		int v_numGooglers = Integer.parseInt(v_data[0]);
		int v_numSurprises = Integer.parseInt(v_data[1]);
		int v_bestResult = Integer.parseInt(v_data[2]);
		int v_answer = 0;
		
		int v_minScoreWithoutSurprises = 0; 
		int v_minScoreWithSurprises = 0; 	
		
		if(v_bestResult == 0)
		{
			v_minScoreWithoutSurprises = 0;
			v_minScoreWithSurprises = 0;
		}
		else if(v_bestResult == 1)
		{
			v_minScoreWithoutSurprises = 1;
			v_minScoreWithSurprises = 1;
		}
		else
		{
			v_minScoreWithoutSurprises = (3*v_bestResult) - 2;
			v_minScoreWithSurprises = v_minScoreWithoutSurprises - 2;
		}
		
		for(int i = 3; i < v_data.length; i++)
		{
			int v_totalPoints = Integer.parseInt(v_data[i]);
			
			if(v_totalPoints >= v_minScoreWithoutSurprises)
			{
				v_answer++;
			}
			else if(v_numSurprises > 0 && v_totalPoints >= v_minScoreWithSurprises)
			{
				v_answer++;
				v_numSurprises--;
			}
		}
		m_outputFile.escrever(String.valueOf(v_answer));
		
		if(p_numTestCase != m_numTestCases)
		{
			m_outputFile.escreverLinha("");
		}
	}
}
