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

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
package quiz2012.quiz2;

import java.util.ArrayList;
import java.util.List;

import domain.QuizSolver;
import domain.QuizTestCaseInput;
import domain.QuizTestCaseOutput;

public class Quiz2Solver implements QuizSolver {
	private static final int NUMBER_OF_JUDGES = 3;

	@Override
	public QuizTestCaseOutput solve(QuizTestCaseInput testCaseInput) {
		Quiz2TestCaseInput input = (Quiz2TestCaseInput) testCaseInput;
		System.out.println(input);
		int numberOfGooglers = input.getNumberOfGooglers();
		int numberOfSurprising = input.getNumberOfSurprising();
		int minBestResult = input.getMinBestResult();
		int[] totalPoints = input.getTotalPoints();
		List<Googler> surprisePossibleGooglers = new ArrayList<Googler>();
		int numberOfGooglersHavingMinBestResultWithoutSurprising = 0;
		for (int i = 0; i < numberOfGooglers; i++) {
			int q = totalPoints[i] / NUMBER_OF_JUDGES;
			int r = totalPoints[i] % NUMBER_OF_JUDGES;
			Googler googler = new Googler(q, r);
			if (googler.getBestResult() >= minBestResult) {
				numberOfGooglersHavingMinBestResultWithoutSurprising++;
			} else {
				if (totalPoints[i] >= 2 && totalPoints[i] <= 28) {
					googler.setSurprising(true);
					surprisePossibleGooglers.add(googler);
				}
			}
		}

		int numberOfPossibleGooglersHavingMinBestResultWithSurprise = 0;
		for (Googler googler : surprisePossibleGooglers) {
			if (googler.getBestResult() >= minBestResult) {
				numberOfPossibleGooglersHavingMinBestResultWithSurprise++;
			}
		}

		int numberOfGooglersHavingMinBestResultWithSurprise = Math.min(
				numberOfSurprising,
				numberOfPossibleGooglersHavingMinBestResultWithSurprise);

		int numberOfGooglersHavingMinBestResult = numberOfGooglersHavingMinBestResultWithoutSurprising
				+ numberOfGooglersHavingMinBestResultWithSurprise;

		System.out.println(numberOfSurprising + ", "
				+ numberOfPossibleGooglersHavingMinBestResultWithSurprise
				+ ", " + numberOfGooglersHavingMinBestResultWithSurprise + ", "
				+ numberOfGooglersHavingMinBestResultWithoutSurprising + ", "
				+ numberOfGooglersHavingMinBestResult);
		return new Quiz2TestCaseOutput(numberOfGooglersHavingMinBestResult);
	}
}

class Googler {
	private final int q;
	private final int r;
	private boolean surprising;

	public Googler(int q, int r) {
		this.q = q;
		this.r = r;
	}

	public void setSurprising(boolean surprising) {
		this.surprising = surprising;
	}

	public Integer getBestResult() {
		switch (r) {
		case 0:
			return q + (surprising ? 1 : 0);

		case 1:
			return q + 1;

		case 2:
			return q + 1 + (surprising ? 1 : 0);
		}
		throw new IllegalStateException("r must be 0, 1, or 2: " + r);
	}

	@Override
	public String toString() {
		return "Googler [q=" + q + ", r=" + r + ", surprising=" + surprising
				+ "]";
	}
}