package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

package problemB;

import java.io.IOException;
import java.util.LinkedList;

import utils.InputReader;

public class SolverB {

	public static void main(String[] args) throws IOException {
		LinkedList<String> input = InputReader.read("C:/Users/Danielle/Desktop/test.txt");
		int num = Integer.parseInt(input.removeFirst());
		int i = 1;
		for (String string : input) {
			if (i > num) {
				System.err.println(i+">"+num);
				break;
			}
			if (i == 3){
				System.out.print("");
			}
			String[] split = string.split(" ");
			int dancers = Integer.parseInt(split[0]);
			int supplies = Integer.parseInt(split[1]);
			int targetScore = Integer.parseInt(split[2]);

			boolean hasSupplies = supplies>0;

			int couldBeAbove = 0;

			for (int k = 3; k < dancers+3; k++){
				int total = Integer.parseInt(split[k]);
				if (total == 0 && targetScore > 0) continue;
				if (total > 27){
					if (targetScore < 11) couldBeAbove++;
					continue;
				}
				int avg = total/3;
				int lacking = targetScore-avg;
				if (lacking < 1) couldBeAbove++;
				else if (lacking > 2) continue;
				else {
					int rest = total%3;
					if (rest == 1){
						if (lacking == 1) couldBeAbove++;
					} else if (hasSupplies){
						switch(rest){
						case 2:
							switch (lacking) {
							case 1:
								couldBeAbove++;
								break;
							case 2:
								couldBeAbove++;
								hasSupplies = (--supplies)>0;
								break;
							}
							break;
						case 0:
							if (lacking == 1){
								couldBeAbove++;
								hasSupplies = (--supplies)>0;
							}
							break;
						}
					} else {
						if (rest == 2 && lacking == 1) couldBeAbove++;
					}
				}
			}
			System.out.println("Case #"+(i++)+": "+couldBeAbove);
		}
	}
}
