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 qualification;

import java.io.*;
import java.util.Arrays;
import java.util.Scanner;

/**
 * @author Roman Elizarov
 */
public class B {
	public static void main(String[] args) throws IOException {
		new B().go();
	}

	Scanner in;
	PrintWriter out;

	int[] maxS = new int[31];
	int[] maxNS = new int[31];

	private void go() throws IOException  {
		buildMax();
		in = new Scanner(new File("src\\qualification\\b.in"));
		out = new PrintWriter(new File("src\\qualification\\b.out"));
		int t = in.nextInt();
		for (int tn = 1; tn <= t; tn++) {
			out.println("Case #" + tn + ": " + solveCase());
		}
		in.close();
		out.close();
	}

	private void buildMax() {
		Arrays.fill(maxS, -1);
		Arrays.fill(maxNS, -1);
		for (int a = 0; a <= 10; a++)
			for (int b = Math.max(0, a - 2); b <= Math.min(10, a + 2); b++)
				for (int c = Math.max(0, Math.max(a - 2, b - 2)); c <= Math.min(10, Math.min(a + 2, b + 2)); c++) {
					int t = a + b + c;
					int max = Math.max(a, Math.max(b, c));
					if (Math.abs(a - b) == 2 || Math.abs(a - c) == 2 || Math.abs(b - c) == 2)
						maxS[t] = Math.max(maxS[t], max);
					else
						maxNS[t] = Math.max(maxNS[t], max);
				}
	}

	private int solveCase() {
		int n = in.nextInt();
		int s = in.nextInt();
		int p = in.nextInt();
		int[] t = new int[n];
		for (int i = 0; i < n; i++)
			t[i] = in.nextInt();
		int[][] r = new int[n + 1][s + 1];
		Arrays.fill(r[0], -1);
		r[0][0] = 0;
		for (int i = 0; i < n; i++) {
			Arrays.fill(r[i + 1], -1);
			for (int j = 0; j <= s; j++) {
				if (r[i][j] >= 0 && maxNS[t[i]] >= 0)
					r[i + 1][j] = r[i][j] + (maxNS[t[i]] >= p ? 1 : 0);
				if (j > 0 && r[i][j - 1] >= 0 && maxS[t[i]] >= 0)
					r[i + 1][j] = Math.max(r[i + 1][j], r[i][j - 1] + (maxS[t[i]] >= p ? 1 : 0));
			}
		}
		return r[n][s];
	}
}
