package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

package B;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;

public class DancingWithTheGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		
		/* Input File */
		BufferedReader reader = new BufferedReader(new FileReader("G:/projects/CodeJam12/src/B/in.txt"));
		
		/* Output File */
		PrintWriter writer = new PrintWriter(new FileWriter("G:/projects/CodeJam12/src/B/out.txt"));
		
		/* Getting number of test cases */
		int noOfTestCases = Integer.parseInt(reader.readLine());
		System.out.println("No of Test Cases : "+noOfTestCases);
		
		/* Iterating for every test case */
		for ( int i=1; i <= noOfTestCases;i++){

			/* Getting input test case line */
			String ipline = reader.readLine();
			System.out.println("\n\nTest Case "+i+" : "+ipline);
			
			/* Split the test case string */
			String elements []= ipline.split(" ");
			int iElements [] = new int[elements.length];
			
			/* Parsing elements to integer */
			for ( int j=0; j<elements.length; j++ ){
				iElements[j] = Integer.parseInt(elements[j]);
			}
			
			/* Assigning Values */
			int noOfGooglers = iElements[0];
			int noOfSuprisingTriplets = iElements[1];
			int bestResultP = iElements[2];
			
			System.out.println("No of Googlers : "+noOfGooglers);
			System.out.println("No of Surprising Triplets : "+noOfSuprisingTriplets);
			System.out.println("Best Result P : "+bestResultP);

			/* from 3 to < iElements.length is total scores elements of googlers */
			int maxGooglersWithBestResultP = 0;
			
			for ( int j=3; j<elements.length; j++ ){
				
				System.out.println("Total Marks of Googler "+(j-2)+" : "+iElements[j]);
				int avgCeilMarks = ( int ) Math.ceil( (double) iElements[j] / 3 );
				
				System.out.println("Avg Ceil Marks of Googler "+(j-2)+" : "+avgCeilMarks);
				
				// If equal or more than best result increment counter
				if ( avgCeilMarks >= bestResultP ) {
					maxGooglersWithBestResultP++;
				
				// Check for surprising triplet 
				}else if ( noOfSuprisingTriplets > 0
						&& (iElements[j] % 3 ) != 1
						&& (avgCeilMarks + 1) <= iElements[j] 
				        && (avgCeilMarks + 1) >= bestResultP ){
					
					maxGooglersWithBestResultP++;
					noOfSuprisingTriplets --;
				}
			}
			
			System.out.println("No of Surprising Triplets Left ( In-effective Surprising Triplets ) : "+noOfSuprisingTriplets);

			/* print output */
			System.out.println("Case #"+i+": "+maxGooglersWithBestResultP);
			writer.println("Case #"+i+": "+maxGooglersWithBestResultP);
		}

		/* closing streams */
		System.out.println("\n\nClosing streams...");
		writer.close();
		reader.close();
		System.out.println("Streams closed.");
	}
}
