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 codejam.morl99.b;

import java.io.BufferedReader;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

import codejam.morl99.a.ProblemA;

public class ProblemB {
    public void solveSet(PrintWriter pw, BufferedReader reader) throws IOException {

        String firstLine = reader.readLine();
        Scanner scanner = new Scanner(firstLine);
        scanner.useDelimiter(" ");
        int T = scanner.nextInt();
        
        for (int i = 1; i <= T; i++) {
            scanner = new Scanner(reader.readLine());
            scanner.useDelimiter(" ");
            int N = scanner.nextInt();
            int S = scanner.nextInt();
            int p = scanner.nextInt();
            int[] t = new int[N];
            for (int googler = 0; googler < N; googler++) {
                t[googler] = scanner.nextInt();
            }
            System.out.println("-- N: " + N + " S: " + S + " p>="+p +" t:"+ Arrays.toString(t)  ) ;
            int solution = solveLine(N,S,p,t);
            pw.printf("Case #%d: %d",i,solution);
            pw.println();
        }
        
    }
    
    public int solveLine(int N, int S, int p, int[] t) {
        int casesAbove = 0;
        for (int i = 0; i < N; i++) {
            if (isRegularScoreAbove(t[i], p)) {
                casesAbove++;
                continue;
            }
            
            //Whenever a regular score is not above the limit, but the best surprising distribution is
            //we take the greedy approach and assume this was a surprising score. What better than a score above 
            //could we hope for?
            if (S > 0 && isSurprisingScoreAbove(t[i], p)) {
                S--;
                casesAbove++;
            }
        }
        return casesAbove;
    }
    
    public boolean isRegularScoreAbove(int ti, int p) {
        //This is the formular for the best score that can be achieved, if no score can be
        //apart more than 1 from any other score
        int best = ti/3 + Math.min(ti%3,1);
        System.out.println("Best regular score for "  + ti + " is " + best);
        return best >= p;
    }
    
    public boolean isSurprisingScoreAbove(int ti, int p) {
        //integer division, which is exactly what we want!
        int b = ((ti-1) / 3);
        int best = b + 1 + (ti-b*3+1)/3;
        //Special case, that we are near zero...
        best = Math.min(ti,best);
        System.out.println("Best surprising score for "  + ti + " is " + best);
        return best >= p;
    }
    
    public static void main(String[] args) throws IOException {
        ProblemB p = new ProblemB();
        
        OutputStream output = new FileOutputStream("res/B.out", false);
        PrintWriter pw = new PrintWriter(output);
        BufferedReader reader = new BufferedReader(new FileReader("res/B-large.in"));
        p.solveSet(pw, reader);
        pw.close();
        reader.close();
        
        
    }
}
