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 blacky.codejam.qualifications;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class DancingGoogler {

	public static void main(String args[]) throws NumberFormatException, IOException {
		File file = new File(args[0]);
		BufferedReader reader = new BufferedReader(new FileReader(file));
		int numberOfTestCases = Integer.parseInt(reader.readLine());
		for(int i = 0; i < numberOfTestCases; i++) {
			StringTokenizer tokenizer = new StringTokenizer(reader.readLine());
			int minimumerGooglers = 0;
			int usedSurprisingTriplets = 0;
			final int numberOfGooglers = Integer.parseInt(tokenizer.nextToken());
			final int surprisingTriplets = Integer.parseInt(tokenizer.nextToken());
			final int bestResultMinimum = Integer.parseInt(tokenizer.nextToken());
			int results[] = new int[numberOfGooglers];
			for(int j = 0; j < numberOfGooglers; j++) {
				results[j] = Integer.parseInt(tokenizer.nextToken()); 
			}
			for(int j = 0; j < numberOfGooglers; j++) {
				boolean possibleSurprising = false;
				boolean possibleNonSurprising = false;
				enumarate:
				for(int judge1 = 0; judge1 <= 10; judge1++) {
					for(int judge2 = judge1 - 2; judge2 <= judge1 + 2; judge2++) {
						for(int judge3 = judge1 - 2; judge3 <= judge1 + 2; judge3++) {
							if(judge1 + judge2 + judge3 == results[j]) {
								if(judge1 < 0 || judge2 < 0 || judge3 < 0) {
									continue; // Illegal case
								} else if(2 < Math.abs(judge1 - judge2) || 2 < Math.abs(judge1 - judge3)|| 2 < Math.abs(judge2 - judge3)) {
									continue; // Illegal case
								} else if (bestResultMinimum <= judge1 || bestResultMinimum <= judge2 || bestResultMinimum <= judge3) {
									if(Math.abs(judge1 - judge2) == 2 || Math.abs(judge1 - judge3) == 2 || Math.abs(judge2 - judge3) == 2) {
										possibleSurprising = true;
									} else {
										possibleNonSurprising = true;
										break enumarate;
									}
								}
							}
						}
					}
				}
				if(possibleNonSurprising) {
					minimumerGooglers++;
				} else if (possibleSurprising && usedSurprisingTriplets < surprisingTriplets) {
					minimumerGooglers++;
					usedSurprisingTriplets++;
				}
			}
			System.out.println(String.format("Case #%d: %d", i + 1, minimumerGooglers));
		}
	}
	
}
