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();
        }
    }
}

package dance;

import java.util.Scanner;

public class Dance {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();//the number of test cases
        int[] y = new int[t];

        for (int i = 0; i < t; i++) {
            int n, s, p;
            y[i] = 0;
            n = scanner.nextInt();//the number of Googlers
            int[] tp = new int[n];//the total points of the Googlers.
            s = scanner.nextInt();//the number of surprising triplets of scores
            p = scanner.nextInt();// a best result of at least p
            for (int j = 0; j < n; j++) {
                tp[j] = scanner.nextInt();
                if (((tp[j] + 2) / 3) >= p) {
                    y[i]++;
                } else if (((tp[j] + 4) / 3) >= p & s > 0&tp[j]>=2) {
                    y[i]++;
                    s--;
                }
            }

        }
        for (int i = 0; i < t; i++) {
            System.out.println("Case #"+(i+1)+": "+y[i]);
        }

    }
}
