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 de.johanneslauber.codejam.model.impl;

import de.johanneslauber.codejam.model.BaseProblem;
import de.johanneslauber.codejam.model.ICase;
import de.johanneslauber.codejam.model.IProblem;

/**
 * 
 * @author Johannes Lauber - joh.lauber@googlemail.com
 * 
 */
public class DancingGooglersProblem extends BaseProblem implements IProblem {

	@Override
	public void solveCases() {
		for (ICase currentCase : super.listOfCases) {
			StringBuilder builder = new StringBuilder();
			DancingGooglersCase dancingGoogleCase = (DancingGooglersCase) currentCase;

			int[] maxPointsForGooglers = dancingGoogleCase
					.getMaxPointsOfGooglers();

			int minLimitOfPoints = dancingGoogleCase.getMinLimitOfPoints();
			int numberOfTriplets = dancingGoogleCase.getNumberOfTriplets();
			int numberOfGooglersHigherLimit = 0;

			for (int i = 0; i < maxPointsForGooglers.length; i++) {
				int maxPointsForGoogler = maxPointsForGooglers[i];
				double quotient = (double) maxPointsForGoogler / (double) 3;

				// zero is a special case
				if (maxPointsForGoogler != 0) {

					// test whether a triplet with 1 or 2 apart is possible with
					// the
					// current min level
					if ((Math.round(quotient) + 1) >= minLimitOfPoints) {

						// test whether apart is 1 or 2
						if ((minLimitOfPoints - 1) >= quotient) {

							// are ther more triplets left?
							if (numberOfTriplets > 0) {
								numberOfGooglersHigherLimit++;
								numberOfTriplets--;
							} else {
								// its possible to make a triplet with apart of
								// 2,
								// but no more left
								System.out.println("no more left");
							}
						} else {
							numberOfGooglersHigherLimit++;
						}
					}
				} else if (minLimitOfPoints == 0) {
					// if the limit and the max points are 0, it's possible
					numberOfGooglersHigherLimit++;
				}
			}

			// for (int i = 0; i < maxPointsForGooglers.length; i++) {
			// if (((maxPointsForGooglers[i] + 2) / 3) >= minLimitOfPoints) {
			// numberOfGooglersHigherLimit++;
			// } else if ((numberOfTriplets > 0)
			// && (((maxPointsForGooglers[i] + 4) / 3) >= minLimitOfPoints)) {
			// numberOfTriplets--;
			// numberOfGooglersHigherLimit++;
			// }
			// }

			this.writeToFile(String.valueOf(numberOfGooglersHigherLimit));
		}
		this.closeWriter();
	}

}
