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 com.edwarddrapkin;

import java.io.File;
import java.io.IOException;
import java.util.Scanner;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.atomic.AtomicInteger;

public class Dancing {
	AtomicInteger possibleNoCheat = new AtomicInteger(0);
	AtomicInteger possibleWithCheatOnly = new AtomicInteger(0);
	AtomicInteger jobsWorking = new AtomicInteger(0);
	
	ExecutorService service = Executors.newFixedThreadPool(4);
	
	private void reset() {
		possibleNoCheat = new AtomicInteger(0);
		possibleWithCheatOnly = new AtomicInteger(0);
	}
	
	private boolean testArray(int[] arr, int input, int maxDist, int minimumPositive) {
		if(arr[0] + arr[1] + arr[2] != input) {
			return false;
		}
		
		int diff1 = Math.abs(arr[0] - arr[1]);
		int diff2 = Math.abs(arr[0] - arr[2]);
		int diff3 = Math.abs(arr[1] - arr[2]);
		
		if( (diff1 > maxDist || diff2 > maxDist || diff3 > maxDist) || (arr[0] < minimumPositive && arr[1] < minimumPositive && arr[2] < minimumPositive)) {
			return false;
		} else {
			return true;
		}
		
	}
	
	
	private void calculatePossibleScores(final int total, final int maxcheat, final int minimumPositive) {
		Runnable r = new Runnable() {
			public void run() {
				int[] working = new int[3];
				
				boolean withCheat = false;
				
				for(int i = 0; i <= 10; i++) {
					working[0] = i;
					
					for(int j = 0; j <= 10; j++) {
						working[1] = j;
						
						for(int k = 0; k <= 10; k++) {
							working[2] = k;
							
							if(working[0] + working[1] + working[2] != total) {
								continue;
							}
							
							if(testArray(working, total, 1, minimumPositive)) {
								//System.out.println(Arrays.toString(working) + " " + maxcheat + " " + total + " " + minimumPositive);
								possibleNoCheat.incrementAndGet();
								jobsWorking.decrementAndGet();
								return;
							} else if (!withCheat) {
								if(testArray(working, total, 2, minimumPositive)) {
									withCheat = true;
								}
							}
						}
					}
				}
			
				if(withCheat) {
					possibleWithCheatOnly.incrementAndGet();
				}
				
				jobsWorking.decrementAndGet();
			}
		};
		
		service.execute(r);
	}
	
	public void doEverything(String file) throws Exception {
		String[] lines = readFile(file);
		
		int casen = 1;
		
		for(String line : lines) {
			reset();
			//System.out.println("\n\n\n");
			String[] sints = line.split("\\s+");
			int[] ints = new int[sints.length];
			
			for(int i = 0; i < sints.length; i++) {
				ints[i] = Integer.parseInt(sints[i]);
			}
			
			int numGooglers = ints[0];
			int start = 3; 
			int maxcheat = ints[1];
			int minPositive = ints[2];
			
//			System.out.println(numGooglers + " " + maxcheat + " " + minPositive);
			
			for(int i = start; i < ints.length; i++) {
//				System.out.println("Testing: " + ints[i]);
				jobsWorking.incrementAndGet();
				
				calculatePossibleScores(ints[i], maxcheat, minPositive);
//				System.out.println();
			}
			
			while(jobsWorking.get() > 0) {
				Thread.sleep(100);
			}
			
			System.out.println("Case #" + casen + ": " + (possibleNoCheat.get() + (possibleWithCheatOnly.get() > maxcheat ? maxcheat : possibleWithCheatOnly.get())));
			casen++;
		}
		
		service.shutdown();
	}
	
	public static void main(String[] args) throws Throwable {
		new Dancing().doEverything("C:/Users/Eddie/Desktop/google_input.txt");
		
	}
	
	private static String[] readFile(String file) throws IOException {
		Scanner scanner = new Scanner(new File(file));
		
		String numLines = scanner.nextLine();
		
		int nl = Integer.parseInt(numLines);
		
		String[] lines = new String[nl];
		int i = 0;
		
		while(scanner.hasNextLine() && i < nl) {
			lines[i] = scanner.nextLine();
			++i;
		}
		
		return lines;
	}
}
