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 wwu.quals2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;

import lib.tuple.Pair;
import lib.tuple.Tuple;
import lib.util.StringUtil;

public class Bdancing {

	static final String fileIn = "/home/wwu/Desktop/B-small-attempt0.in";
//	static final String fileIn = "data/A-large-practice.in";
	static final String fileOut = "/home/wwu/Desktop/out.txt";
	
	public static Map<String, String> charMap;

	public static void main(String[] args) throws Exception {
		BufferedReader r = new BufferedReader(new FileReader(fileIn));
		BufferedWriter w = new BufferedWriter(new FileWriter(fileOut));
		String line = r.readLine();
		int T = Integer.parseInt(line);
		for (int caseNum = 0; caseNum < T; caseNum++) {
			int[] testCase = StringUtil.getIntArray(r.readLine());
			int nGooglers = testCase[0];
			int surprises = testCase[1];
			int pBestResultScore = testCase[2];
			List<Integer> totalScores = new ArrayList<Integer>();
			for (int i=0; i<nGooglers; i++) {
				totalScores.add(testCase[i+3]);
			}
			String str = "Case #" + (caseNum + 1) + ": " + solve(nGooglers, surprises, pBestResultScore, totalScores);
			w.write(str + "\n");
			System.out.println(str);
		}
		r.close();
		w.close();
	}

	private static String solve(int nGooglers, int surprises,
			int pBestResultScore, List<Integer> totalScores) {
		int maxPossibleGooglers = 0;
		Collections.sort(totalScores);
		Collections.reverse(totalScores);
		//int highestNoSurprise = Math.min(3*pBestResultScore+2, 30);
		//int highestWithSurprise = Math.min(3*pBestResultScore+4, 30);
		int lowestNoSurprise = Math.max(3*pBestResultScore-2, pBestResultScore);
		int lowestWithSurprise = Math.max(3*pBestResultScore-4, pBestResultScore);
		for (Integer score : totalScores) {
			if (score >= lowestNoSurprise /*&& score <= highestNoSurprise*/) {
				maxPossibleGooglers++;
			} else if (score >= lowestWithSurprise /*&& score <= highestWithSurprise*/ && surprises > 0) {
				maxPossibleGooglers++;
				surprises--;
			}
		}
		return String.valueOf(maxPossibleGooglers);
	}

}
