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 codejam.world2012.qualification.b;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;


public class B {
    
    private static class Triplet {
        public boolean surprising = false;
        public boolean unsurprising = false;
        
        public Triplet() {}
        
        public Triplet(boolean surprising, boolean unsurprising) {
            this.surprising = surprising;
            this.unsurprising = unsurprising;
        }
        
        @Override
        public String toString() {
            return "[ " + (surprising?"surprising":"") + " " + (unsurprising?"unsurprising":"") +  " ]";
        }
    }

    
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new FileReader("src/codejam/world2012/qualification/b/small.in"));
        BufferedWriter out = new BufferedWriter(new FileWriter("src/codejam/world2012/qualification/b/small.out"));
        
        HashMap<Integer, HashMap<Integer, Triplet>> matrix = new HashMap<Integer, HashMap<Integer, Triplet>>();
        
        for (int q = 0; q<=10; q++) {
            HashMap<Integer, Triplet> row = new HashMap<Integer, Triplet>();
            for (int r=0; r<31; r++) row.put(r, new Triplet(false, false));
            matrix.put(q, row);
        }
        
        for (int i = 10; i>= 0; i--) {
            for (int j=i; j >= i-2; j--) {
                if (j < 0) continue;
                
                for (int k = i; k >= i-2; k--) {
                    if (k < 0) continue;
                    
                    int ti = i+j+k;
                    
                    Triplet triplet = matrix.get(i).get(ti);
                    if (triplet == null) triplet = new Triplet();
                    
                    if ((i-j == 2) || (i-k == 2) || (j-k == 2)) {
                        // surprising
                        triplet.surprising = true;
                    } else {
                        // unsurprising
                        triplet.unsurprising = true;
                    }
                    matrix.get(i).put(ti, triplet);
                }
                
            }
        }
        
        for (int ti=0; ti<31; ti++) {
            Triplet triplet = new Triplet(false, false);
            for (int p = 10; p>= 0; p--) {
                if (matrix.get(p).get(ti).surprising) triplet.surprising = true;
                if (matrix.get(p).get(ti).unsurprising) triplet.unsurprising = true;
                matrix.get(p).put(ti, new Triplet(triplet.surprising, triplet.unsurprising));
            }
        }
        
        int T = 0;
        T = Integer.parseInt(in.readLine());
        
        for (int t = 0; t < T; t++) {
            String[] line = in.readLine().split(" ");
            
            Long N = Long.parseLong(line[0]);
            Long S = Long.parseLong(line[1]);
            Integer p = Integer.parseInt(line[2]);
            List<Integer> scoresList = new ArrayList<Integer>();
            
            Long answer = 0L;
            
            for (int i = 3; i< line.length; i++) {
                scoresList.add(Integer.parseInt(line[i]));
            }
            
            for (Integer ti : scoresList) {
                
                Triplet triplet = matrix.get(p).get(ti);
                
                if (triplet.surprising && !triplet.unsurprising) {
                    if (S > 0) {
                        answer++;
                        S--;
                    }
                } else if (triplet.unsurprising) {
                    answer++;
                }
            }
            
            out.write("Case #"+String.valueOf(t+1) +": "+answer.toString());
            if (t < T-1) out.write(System.getProperty("line.separator"));
            
            /*
            for (Long totalScore : scoresList) {
                Long diff = totalScore - p;
                Long first = Math.round((double) diff/2);
                
                if (p - first > 2) {
                    // impossible
                    continue;
                }
                
                Long second = diff - first;
                if (p - second > 2) {
                    // impossible
                    continue;
                }
                
                
            }
            
            
            for (Long totalScore : scoresList) {
                
                // ceiling
                Long ceil = Math.round(Math.ceil(totalScore/3));
                Long floor = Math.round(Math.floor(totalScore/3));
                
                if (ceil == floor) {
                    // nice
                    
                } else {
                    
                    if (ceil*3 - totalScore < 3) {
                        
                    }
                    
                    if (totalScore - floor*3 < 3) {
                        
                    }
                    
                }
                
                //System.err.println("total: " + totalScore + ", average: " + average);
                Long diff = average*3 - totalScore; // diff > 0 
                
                Long max =  0L;
                if (diff > 0) max = average + diff;
                else max = average;
                if (max >= p) answer++;
                if ((Math.abs(diff) > 1) && (S > 0)) S--;
            }
            
            if (S == 0) {
                System.err.println("Case #"+String.valueOf(t+1) +": "+answer.toString());
                continue;
            }
            
            // S > 0
            
            for (Long totalScore : scoresList) {
                Long average = Math.round((double) totalScore/3);
                Long diff = totalScore - average*3;
                
                Long max =  0L;
                if (diff > 0) max = average + diff;
                else max = average;
                
                if (Math.abs(diff) > 0) continue;
                if (max >= p) continue;
                if (S == 0) break;
                max = average + 1;
                S--;
                if (max >= p) answer++;
            }
            System.err.println("Case #"+String.valueOf(t+1) +": "+answer.toString());
             */
        }
        
        out.close();
    }
    
}
