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 codejam2012.r0;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author julian
 */
public class B {

	public static final void main(String[] args) throws IOException {
		(new B()).run();
	}

	private int getBestRes(int v) {
		return ((v % 3 == 0) ? 0 : 1) + ((int) v / 3);
	}

	private int getBestSurRes(int v) {
		return ((v % 3 == 2) ? 2 : Math.min(v, 1)) + ((int) (v / 3));
	}

	public void run() throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("B-small.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("B.out"));
		int t = Integer.parseInt(in.readLine());
		for (int i = 0; i < t; i++) {
			StringTokenizer stok = new StringTokenizer(in.readLine());
			int n = Integer.parseInt(stok.nextToken());
			int s = Integer.parseInt(stok.nextToken());
			int p = Integer.parseInt(stok.nextToken());
			int[] total = new int[n];
			for (int k = 0; k < n; k++) {
				total[k] = Integer.parseInt(stok.nextToken());
			}
			out.write("Case #" + (i + 1) + ": " + solve(n, s, p, total) + "\n");
		}
		in.close();
		out.flush();
		out.close();
	}

	public int solve(int n, int s, int p, int[] t) {
		int good = 0;
		int soso = 0;
		for (int i = 0; i < n; i++) {
			if (getBestRes(t[i]) >= p) {
				good++;
			} else if (getBestSurRes(t[i]) >= p) {
				soso++;
			}
		}

		return good + Math.min(s, soso);
	}

}
