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

import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;

public class Dancing {

	private int noCases;
	private ArrayList<Case> cases = new ArrayList<Case>();

	private void readFile(String filepath) {
		try {
			Scanner sc = new Scanner(new FileInputStream(new File(filepath)));
			noCases = Integer.parseInt(sc.nextLine());
			for (int i = 1; i <= noCases; i++) {
				String[] line = sc.nextLine().split(" ");
				int N = Integer.parseInt(line[0]);
				int S = Integer.parseInt(line[1]);
				int p = Integer.parseInt(line[2]);
				int[] t = new int[N];
				for (int n = 3; n < line.length; n++) {
					t[n - 3] = Integer.parseInt(line[n]);
				}
				cases.add(new Case(i, S, p, t));
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}

	public static void main(String args[]) {

		Dancing d = new Dancing();
		d.readFile(args[0]);
		for (Case c : d.cases) {
			System.out.println(c);
		}
	}

	private class Case {
		private int caseID;
		private int noSurprising;
		private int minScore;
		private ArrayList<Score> scores = new ArrayList<Dancing.Case.Score>();

		public Case(int caseID, int noSurprising, int minScore,
				int[] scores) {
			this.caseID = caseID;
			this.noSurprising = noSurprising;
			this.minScore = minScore;

			for (int sc : scores) {
				this.scores.add(new Score(sc));
			}
		}

		private int answer() {
			int ans = 0;
			for (Score sc : scores) {
				if (sc.unsurprising >= minScore) {
					ans++;
					sc.visited = true;
				}
			}
			for (Score sc : scores) {
				if (noSurprising == 0) {
					break;
				}
				if (!sc.visited) {
					if (sc.surprising >= minScore) {
						ans++;
						sc.visited = true;
						noSurprising--;
					}
				}
			}
			return ans;
		}

		@Override
		public String toString() {
			return "Case #" + this.caseID + ": " + this.answer();
		}
		
		private class Score {
			int surprising;
			int unsurprising;
			boolean visited = false;
			
			public Score(int sc) {
				switch(sc % 3) {
				case 0:
					unsurprising = sc / 3;
					surprising = sc / 3 + 1;
					break;
				case 1:
					unsurprising = sc / 3 + 1;
					surprising = sc / 3 + 1;
					break;
				case 2:
					unsurprising = sc / 3 + 1;
					surprising = sc / 3 + 2;
					break;
				}
				if (sc < 2 || sc > 28) {
					surprising = -1;
				}
			}
		}
	}
}