package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing integers
 * separated by single spaces. The first integer will be N, the number of
 * Googlers, and the second integer will be S, the number of surprising triplets
 * of scores. The third integer will be p, as described above. Next will be N
 * integers ti: the total points of the Googlers.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

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

/*
 * Author: Lloyd Mckenzie
 * Google code jam
 * 04/13/12
 * dancing problem: take in input of a series of numbers, find set of 
 * a series of 3 numbers that one series of numbers adds up to a given number
 * and the set contains the greatest number of series of numbers 
 * where a single number of a series is >= a specified number
 */
public class ProblemB {
	//possibly over a billion different permutations! whoopie!
	static int maximum;
	public static void main(String[] args)
	{
		if(args.length < 1)
		{
			System.out.println("Usage: filename");
			return;
		}
		
		Scanner scan;
		File filename;
		if(args.length == 2)
		{
			filename = new File(args[1]);
			try {
				scan = new Scanner(filename);
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
				return;
			}
		}
		else
		{
			filename = new File(args[0]);
			try {
				scan = new Scanner(filename);
			} catch (FileNotFoundException e) {
				e.printStackTrace();
				return;
			}
		}
		int lines=0, caseNum=1;
		int amount, surprise, highmark, current;
		maximum=0;
//		do
	//	{
			lines = scan.nextInt();
			scan.nextLine();
			
			caseNum = 1;
			while(lines > 0)
			{
				System.out.print("Case #" + caseNum + ": ");
				maximum = 0;
				amount = scan.nextInt();
				Node [] list = new Node[amount];
				surprise = scan.nextInt();
				highmark = scan.nextInt();
//				if(highmark == 0)
//					System.out.print(amount);
//				else
//				{
					for(int i = 0; i < amount; i++)
					{
						current = scan.nextInt();
						list[i] = new Node(current);
					}
					recurse(list, 0, surprise, highmark, 0);
					System.out.print(maximum);
				//}
				System.out.println();
				lines--;
				caseNum++;
				scan.nextLine();
			}//if(true)return;
	//	}while(scan.hasNext());
		
	}
	
	public static void recurse(Node[] list, int count, int surprise, int highmark, int index)
	{
		//recursion loop through array, on each new element call recursive function
		if(index == list.length)
		{
			
			if(surprise == 0 && count > maximum)//System.out.println("here");
				maximum = count;
			return;
		}
		
		if(list[index].hasNext && surprise > 0)
		{
			if(list[index].great[1] >= highmark)
			{
				count++;
				surprise--;
				index++;
				recurse(list, count, surprise, highmark, index);
				count--;
				surprise++;
				index--;
			}
			else
			{
				index++;
				surprise--;
				recurse(list, count, surprise, highmark, index);
				index--;
				surprise++;
			}
		}
		
		if(list[index].great[0] >= highmark)
		{
			count++;
			index++;
			recurse(list, count, surprise, highmark, index);
			count--;
			index--;
		}
		else
		{
			index++;
			recurse(list, count, surprise, highmark, index);
			index--;
		}
		
	}
	
	public static class Node
	{
		int [] normal = new int[3];
		int [] spec = new int[3];
		int total;
		boolean hasNext = false;
		int [] great = new int[2];
		
		public Node(int total)
		{
			this.total = total;
			findNormal();
			great[0] = normal[0];
			if(normal[0] > 0)
			{
				hasNext = true;
				findSpec();
			}
		//	System.out.println("norm: " +normal[0]+" "+normal[1]+" "+normal[2]+"\nspec: " +spec[0] + " "+spec[1]+" "+spec[2]+"\ngreat: "+great[0]+" "+great[1]);
			else
			{
				spec[0] = normal[0];
				spec[1] = normal[1];
				spec[2] = normal[2];
				great[1] = great[0];
			}
		}
		
		private void findSpec() {
			if(normal[0]>normal[1])
			{
				spec[0]=normal[0]-2;
				spec[1]=normal[1]+1;
				spec[2]=normal[1]+1;
				great[1] = spec[1];
			}
			else if(normal[0] != 10)
			{
				spec[0]=normal[0]+1;
				spec[1]=normal[1]-1;
				spec[2]=normal[2];
				great[1] = spec[0];
			}
		}
		private void findNormal() {
			int val = (total/3);
			if(val*3 == total)
			{
				normal[0] = val;
				normal[1] = val;
				normal[2] = val;
		//		System.out.println("total "+total+"val "+val+"\n");
			}
			else if(val*3 == total-2)
			{
				normal[0] = (val+1);
				normal[1] =  (val+1);
				normal[2] =  val;
			}
			else
			{
				normal[0] = (val+1);
				normal[1] = val;
				normal[2] = val;
			}
		}		
	}
}



