package dancinggooglers;

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

public class DanceScoreCalculator {


    public static void main(String[] args) {
        if(args.length <= 0 || args[0] == null) {
            System.out.println("You must enter a file to read");
            System.out.println("Usage: blah <filename>");
            System.exit(0);
        }

        File argFile = new File(args[0]);
        try {
            Scanner googleSpeakScanner = new Scanner(argFile);
            String firstLine = googleSpeakScanner.nextLine();
            Integer linesToScan = new Integer(firstLine);
            for(int i = 1; i <= linesToScan; i++) {
                String googleDancerLine = googleSpeakScanner.nextLine();
                DanceScoreCase danceCase = new DanceScoreCase(googleDancerLine);
                System.out.println(String.format("Case #%d: %d", i, danceCase.maxDancersThatCouldPass()));
            }
        }
        catch (Exception e) {
            e.printStackTrace();
        }
    }
}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class Qual1b {
	static int[] norm = { 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6,
			6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10 };
	static int[] weird = { 0, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6,
			7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10 };

	public static void main(String args[]) {

		try {
			FileWriter fstream = new FileWriter("outBLarge.txt");
			BufferedWriter out = new BufferedWriter(fstream);
			Scanner scanner = new Scanner(new File("B-large.in"));

			int count = scanner.nextInt();

			for (int i = 1; i <= count; i++) {
				int n = scanner.nextInt();
				int s = scanner.nextInt();
				int p = scanner.nextInt();

				int resultMax = 0;
				for (int j = 0; j < n; j++) {
					int temp = scanner.nextInt();
					if (norm[temp] >= p) {
						resultMax++;
					} else if (weird[temp] >= p && s > 0) {
						resultMax++;
						s--;
					}
				}
				out.write("Case #" + i + ": " + resultMax + "\n");
			}
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
