/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam.common;

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

/**
 *
 * @author Lance Chen
 */
public class CodeHelper {

    private static String FILE_ROOT = "D:/workspace/googlecodejam/meta";

    public static List<List<String>> loadInputsExcludes(String fileName) {
        List<List<String>> result = new ArrayList<List<String>>();
        List<String> lines = FileUtil.readLines(FILE_ROOT + fileName);
        int index = 0;
        for (String line : lines) {
            if (index == 0) {
                index++;
                continue;
            }
            if (index % 2 == 1) {
                index++;
                continue;
            }
            List<String> dataList = new ArrayList<String>();
            String[] dataArray = line.split("\\s+");
            for (String data : dataArray) {
                if (data.trim().length() > 0) {
                    dataList.add(data);
                }
            }
            result.add(dataList);
            index++;
        }
        return result;
    }

    public static List<List<String>> loadInputs(String fileName) {
        List<List<String>> result = new ArrayList<List<String>>();
        List<String> lines = FileUtil.readLines(FILE_ROOT + fileName);
        for (String line : lines) {
            List<String> dataList = new ArrayList<String>();
            String[] dataArray = line.split("\\s+");
            for (String data : dataArray) {
                if (data.trim().length() > 0) {
                    dataList.add(data);
                }
            }
            result.add(dataList);
        }
        return result;
    }

    public static List<String> loadInputLines(String fileName) {
        return FileUtil.readLines(FILE_ROOT + fileName);
    }

    public static void writeOutputs(String fileName, List<String> lines) {
        FileUtil.writeLines(FILE_ROOT + fileName, lines);
    }
}

package qualificationRound;

public class Dancing {

	/**
	 * 
	 * @param N
	 *            Number of Googlers
	 * @param S
	 *            number of surprising triplets of scores
	 * @param P
	 * 
	 * @param Ti
	 *            the total points of the Googlers
	 * 
	 * @return what is the maximum number of Googlers that could have had a best
	 *         result of at least p
	 */
	public static int howMany(int N, int S, int P, int[] Ti) {

		if (0 == P)
			return N;

		int count = 0;
		int specials = 0;

		for (int t : Ti) {

			if (0 == t)
				continue;
			
			int mod = t % 3;
			int div = t / 3;

			int max = -1;
			int maxSpecial = -1;

			switch (mod) {

			case 0:
				max = div;
				maxSpecial = div + 1;
				break;

			case 1:
				max = div + 1; // same as 'maxSpecial'
				break;

			case 2:
				max = div + 1;
				maxSpecial = div + 2;
				break;
			}

			if (max >= P)
				count++;

			else if (maxSpecial >= P)
				specials++;
		}

		if (specials > S)
			count += S;

		else
			count += specials;

		return count;
	}
}
