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

import java.io.*;
import java.util.*;

public class test {

	public static void main(String[] args) {

        try{
        	
	        int googlers=0;
	        int surprises=0;
	        double bestResult=0;
	        double score=0;
	        int possible=0;
	        
	
	
	        BufferedReader f = new BufferedReader(new FileReader("X:/programacion/codejam/2012/1B/B-small-attempt0.in"));
	        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("X:/programacion/codejam/2012/1B/B-small-attempt0.out")));

	        StringTokenizer st1 = new StringTokenizer(f.readLine());
	
	        long numCasosDePrueba=Integer.parseInt(st1.nextToken());
	
	        for (int i=1;i<=numCasosDePrueba;i++){
	            st1 = new StringTokenizer(f.readLine());
	            googlers = Integer.parseInt(st1.nextToken());
	            surprises = Integer.parseInt(st1.nextToken());
	            bestResult = Double.parseDouble(st1.nextToken());
	            possible=0;
	
	            for(int j=1;j<=googlers;j++){
	            	score=Double.parseDouble(st1.nextToken());
	            	score=score-bestResult;
	            	if(score>=0){
	                	if(bestResult-(score/2)<=1) possible++;
	                	else{
	                		if (surprises>0){
	                			if(bestResult-(score/2)<=2){
	                				possible++;
	                				surprises--;
	                			}
	                		}
	                	}
	            	}
	            }
	
	            out.print("Case #"+i+": "+possible);
	            if (i!=numCasosDePrueba) out.println();
	            
	        }
        out.close();
        System.exit(0);
    }
    catch(Exception e){
        System.out.println(e.getMessage());
    }

    }

}
