package com.gcj.parser;

public class MaxPoints {

	public static int normal(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 1 ; break;
		case 3 : toReturn = 1 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 2 ; break;
		case 6 : toReturn = 2 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 3 ; break;
		case 9 : toReturn = 3 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 4 ; break;
		case 12 : toReturn = 4 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 5 ; break;
		case 15 : toReturn = 5 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 6 ; break;
		case 18 : toReturn = 6 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 7 ; break;
		case 21 : toReturn = 7 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 8 ; break;
		case 24 : toReturn = 8 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 9 ; break;
		case 27 : toReturn = 9 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}

		return toReturn;
	}

	public static int surprising(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 2 ; break;
		case 3 : toReturn = 2 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 3 ; break;
		case 6 : toReturn = 3 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 4 ; break;
		case 9 : toReturn = 4 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 5 ; break;
		case 12 : toReturn = 5 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 6 ; break;
		case 15 : toReturn = 6 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 7 ; break;
		case 18 : toReturn = 7 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 8 ; break;
		case 21 : toReturn = 8 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 9 ; break;
		case 24 : toReturn = 9 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 10 ; break;
		case 27 : toReturn = 10 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}
		return toReturn;
	}

}

package dancingWithTheGooglers;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class DancingWithTheGooglers {
	public static void main(String[] args) {
		File inFile = new File(
				"C:\\Users\\Stef\\workspace\\Google Code Jam\\src\\dancingWithTheGooglers\\large.in");
		FileInputStream fis = null;
		Scanner in = null;

		FileWriter outFile;
		try {
			outFile = new FileWriter(
					"C:\\Users\\Stef\\workspace\\Google Code Jam\\src\\dancingWithTheGooglers\\large.out");
			BufferedWriter out = new BufferedWriter(outFile);

			try {
				fis = new FileInputStream(inFile);

				in = new Scanner(fis);
				int cases, googlers, surprises, result, no;
				cases = in.nextInt();

				for (int i = 0; i < cases; i++) {
					googlers = in.nextInt();
					surprises = in.nextInt();
					result = in.nextInt();
					no = 0;
					int[] totalScore = new int[googlers];
					for (int j = 0; j < googlers; j++)
						totalScore[j] = in.nextInt();
					for (int j = 0; j < googlers; j++)
						if (totalScore[j] % 3 == 0) {
							if (totalScore[j] / 3 >= result)
								no++;
							else if (totalScore[j] / 3 == result - 1 && totalScore[j]>0)
								if (surprises > 0) {
									no++;
									surprises--;
								}
						} else if (totalScore[j] % 3 == 1) {
							if (totalScore[j] / 3 >= result - 1)
								no++;
						} else {
							if (totalScore[j] / 3 >= result - 1)
								no++;
							else if (totalScore[j] / 3 == result - 2 && totalScore[j]<29)
								if (surprises > 0) {
									no++;
									surprises--;
								}
						}
					out.write("Case #" + (i + 1) + ": " + no + "\n");
				}

				fis.close();
				in.close();

			} catch (FileNotFoundException e) {
				e.printStackTrace();
			} catch (IOException e) {
				e.printStackTrace();
			}

			out.close();
		} catch (IOException e1) {
			e1.printStackTrace();
		}
	}
}
