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 edu.gcj.solutions;

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

public class DancingGooglers {
	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner inf = new Scanner(new File("C:\\Users\\Coltin\\Downloads\\B-small-attempt0.in"));
		
		int T = inf.nextInt();
		System.out.println(T);
		
		for (int t = 0; t < T; t++) {
			int N = inf.nextInt(); // Number of googlers
			int S = inf.nextInt(); // Number of surprisingly triplets
			int p = inf.nextInt(); // Max score we want to find in a triplet

			int results = 0;
			for (int n = 0; n < N; n++) { // We can calculate googlers scores independently, so 1 at a time
				int googlerScore = inf.nextInt();
				//System.out.print("Googler Score: " + googlerScore + "   p=" + p);
				if (p == 0) {
					results++;
					continue;
				} else if (googlerScore == 0) {
					continue;
				} else if (Maximize(googlerScore) >= p) {
					//System.out.println("   Maximized");
					results++;
				} else if ((S > 0) && (MaximizeSurprising(googlerScore) >= p)) {
					//System.out.println("   MaximizedSURPRISE");
					S -= 1;
					results++;
				} else {
					//System.out.println("   NONE");
				}
			}
			System.out.println("Case #" + (t+1) + ": " + results);
		}
	}

	private static int MaximizeSurprising(int googlerScore) {
		int perJudge = googlerScore/3;
		int pointsRemaining = googlerScore - (perJudge*3);
		if (pointsRemaining == 2) {
			return perJudge+2;
		}
		return perJudge+1;
	}

	private static int Maximize(int googlerScore) {
		int perJudge = googlerScore/3;
		int pointsRemaining = googlerScore - (perJudge*3);
		if (pointsRemaining == 0) {
			return perJudge;
		}
		return perJudge+1;
	}
}
