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

package luis.miguel.serrano.utilities;

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

import luis.miguel.serrano.settings.GlobalSettings;

/**
 * Data class for processing input and generating output
 * @author Luis Miguel Serrano
 *
 */
public class DataB {

	private File inputFile;
	private File outputFile;

	public DataB(String inputFilePath, String outputFilePath) {
		this.inputFile = new File(inputFilePath);
		outputFile = new File(outputFilePath);
	}

	public DataB(File inputFile) {
		this.inputFile = inputFile;
		outputFile = new File(GlobalSettings.OUTPUT_FILE_PATH);
	}

	/**
	 * Processes the file passed as argument in the constructor
	 * @throws FileNotFoundException
	 */
	public void processFile() throws FileNotFoundException {
		if(outputFile.exists())
			outputFile.delete();

		Scanner scanner = new Scanner(inputFile);

		final int casesNumber = scanner.nextInt();
		scanner.nextLine();

		for(int i = 0; i!=casesNumber; ++i)
			processCase(scanner, i);

		System.out.println("Done processing file: "+inputFile);
	}

	//Format-specific
	private void processCase(Scanner scanner, int caseNumber) {
		//System.out.println("New Case");
		int numberGooglers = scanner.nextInt();
		int numberSurprisingTripletScores = scanner.nextInt();
		int p = scanner.nextInt();
		int[] totalScores = new int[numberGooglers];
		for(int i = 0; i!=numberGooglers; ++i)
			totalScores[i] = scanner.nextInt();


		int solution;
		solution = getSolution(numberGooglers, numberSurprisingTripletScores, p, totalScores);

		//Write solution to file
		try {
			FileWriter fw = new FileWriter(outputFile, true);
			fw.write("Case #"+(caseNumber+1)+": "+solution+"\r\n");	
			fw.flush();
			fw.close();
		} catch (IOException e) {
			e.printStackTrace();
		}	
	}

	//Problem-specific
	private int getSolution(int numberGooglers, int numberSurprisingTripletScores, int p, int[] totalScores){
		int solution = 0;

		int[][] triplets = new int[numberGooglers][3];

		//Generate Score Triplets
		int surprisingTripletsRemaining = numberSurprisingTripletScores;
		for(int i = 0; i!= triplets.length; ++i) {
			int baseValue = totalScores[i]/3;
			int rest = totalScores[i]%3;

			if(rest == 2)
			{
				int max = baseValue+2;

				//If it is "worth it" spending one surprising triplet to make this one count for "the most"
				if(p == max && surprisingTripletsRemaining != 0)
					--surprisingTripletsRemaining;
				else {
					++baseValue;
					rest -= 3;
				}
			}

			for(int j = 0; j!=triplets[i].length; ++j){
				if(j == 0) {
					triplets[i][j] = baseValue+rest;
				}				
				else {
					triplets[i][j] = baseValue;
				}					
			}

			//Integrity Check
			int total = 0;
			for(int j = 0; j!=triplets[i].length; ++j)
				total += triplets[i][j];
			if(total != totalScores[i])
				System.out.println("Total Scores Mismatch ERROR!");
		}


		//If there are remaining triplets to spend, try to spend them in cases in which rest was = 0
		for(int i = 0; i!=triplets.length; ++i)
			if(surprisingTripletsRemaining != 0){
				if(triplets[i][0] == triplets[i][1] && triplets[i][0] == triplets[i][2] && triplets[i][0] + 1 == p && triplets[i][0] != 0) {
					triplets[i][0] += 1;
					triplets[i][1] -= 1;
					--surprisingTripletsRemaining;
				}
			}
			else
				break;



//		//Print (DEBUG)
//		for(int i = 0; i!=triplets.length; ++i)
//			for(int j = 0; j!= triplets[i].length; ++j)
//				System.out.println("triplets["+i+"]["+j+"] = "+triplets[i][j]);

		//Find solution
		for(int i = 0; i!=triplets.length; ++i){
			for(int j = 0; j!= triplets[i].length; ++j)
			{
				if(triplets[i][j] >= p){
					++solution;
					break;
				}					
			}
		}

		return solution;
	}


	/**
	 * @param args
	 */
	public static void main(String[] args) {

		//DataB dataSample = new DataB(GlobalSettings.PROJECT_PATH+"\\input\\input_sample.in", GlobalSettings.PROJECT_PATH+"\\output\\input_sample.out");
		DataB dataSmall = new DataB(GlobalSettings.PROJECT_PATH+"\\input\\B-small-attempt0.in", GlobalSettings.PROJECT_PATH+"\\output\\B-small-attempt0.out");
		//Data dataLarge = new Data(GlobalSettings.PROJECT_PATH+"\\input\\A-large-practice.in", GlobalSettings.PROJECT_PATH+"\\output\\A-large-practice.out");

		try {
			//dataSample.processFile();
			dataSmall.processFile();
			//dataLarge.processFile();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		System.out.println("Finished processing all input!");
	}

}
