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 cj2012.qual;

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;

public class B {
	static boolean[][] NW = new boolean[11][31];
	static boolean[][] SW = new boolean[11][31];
	
	static {
		for (int a = 0; a < 11; a++) {
			for (int b = 0; b < 11; b++) {
				for (int c = 0; c < 11; c++) {
					int max = Math.max(Math.max(a, b), c);
					int min = Math.min(Math.min(a, b), c);
					if (max - min <= 1) NW[max][a+b+c] = true;
					if (max - min == 2) SW[max][a+b+c] = true;
				}
			}
		}
	}
	
	public static void main(String[] args) throws Exception {
		Scanner scan = new Scanner(new File("in/B-small-attempt0.in"));
		int T = scan.nextInt();
		PrintWriter out = new PrintWriter(new File("out/B-small-attempt0.txt"));
		for (int z = 1; z <= T; z++) {
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			int[] a = new int[N];
			for (int i = 0; i < N; i++)
				a[i] = scan.nextInt();
			boolean[][] m = new boolean[N][2];
			// False/True: no-win/win
			// 0/1: not-surprising/surprising
			int[] cc = new int[4];
			int alwaysLose = 0;
			int surpriseLose = 1;
			int surpriseWin = 2;
			int alwaysWin = 3;
			for (int i = 0; i < N; i++) {
				for (int j = p; j <= 10; j++) {
					m[i][0] = m[i][0] || NW[j][a[i]];
					m[i][1] = m[i][1] || SW[j][a[i]];
				}
				int k = 0;
				if (m[i][0]) k += 1;
				if (m[i][1]) k += 2;
				cc[k]++;
			}
			int ret = 0;
			while (S > 0 && cc[surpriseWin] > 0) {S--; cc[surpriseWin]--; ret++;}
			while (S > 0 && cc[alwaysLose] > 0) {S--; cc[alwaysLose]--;}
			while (S > 0 && cc[alwaysWin] > 0) {S--; cc[alwaysWin]--; ret++;}
			while (S > 0 && cc[surpriseLose] > 0) {S--; cc[surpriseLose]--;}
			ret += cc[alwaysWin] + cc[surpriseLose];
			out.println("Case #" + z + ": " + ret);
		}
		out.close();
	}
}
