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 com.google.codejam;

import java.io.File;
import java.io.IOException;
import java.util.List;

import com.google.common.base.CharMatcher;
import com.google.common.base.Function;
import com.google.common.base.Splitter;
import com.google.common.collect.Iterables;
import com.google.common.collect.Lists;
import com.google.common.io.Files;
import com.google.gdata.util.common.base.Charsets;

public class ProblemB {
	
	public static void main (String [] args) throws IOException {
		if (args.length != 1) {
			System.err.println("Usage: ProblemB inputfile");
			return;
		}
		String filename = args[0];
		List<String> inputLines = Files.readLines(new File(filename), Charsets.US_ASCII);
		int T = Integer.parseInt(inputLines.get(0));
		List<String> testCases = inputLines.subList(1, inputLines.size());
		assert(T == testCases.size());
		for (int i = 0; i < testCases.size(); i++) {
			processLine(testCases, i);
		}
	}

	private static void processLine(List<String> testCases, int i) {
		String line = testCases.get(i);
		List<Integer> lineContents = Lists.newArrayList(Iterables.transform(Splitter.on(CharMatcher.WHITESPACE).split(line), new Function<String, Integer>() {
			@Override
			public Integer apply(String input) {
				return Integer.parseInt(input);
			}
		}));
		
		int numGooglers = lineContents.get(0);
		int numSurprising = lineContents.get(1);
		int targetBestResult = lineContents.get(2);
		List<Integer> scores = lineContents.subList(3, lineContents.size());
		assert(numGooglers == scores.size());
		int maxNumGooglers = 0;
		int numGooglersWithSurprise = 0;
		for (int score : scores) {
			if (((score + 2) / 3) >= targetBestResult) {  // This is equivalent to ciel(score/3) >= targetBestResult
				maxNumGooglers++;
			} else if ((score + 4) / 3 >= targetBestResult && score > 0) {
				numGooglersWithSurprise++;
			}
		}
		
		maxNumGooglers += Math.min(numGooglersWithSurprise, numSurprising);
		System.out.println("Case #" + (i+1) + ": " + maxNumGooglers);
	}

}
