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 Dancing;

import java.io.FileWriter;
import java.io.FileReader;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.File;
import java.io.IOException;
import java.lang.Character;
import java.util.ArrayList;

public class DancingWithGooglers 
{
    static String path = "C:\\Users\\hao\\Documents\\NetBeansProjects\\CodeJam2012\\src\\Dancing\\Bs.in";
    static String out_path = "C:\\Users\\hao\\Documents\\NetBeansProjects\\CodeJam2012\\src\\Dancing\\Bs.txt";
    static BufferedReader inputStream;
    static PrintWriter outputStream;
    
    public static void main( String args[] )
    {
        try
        {
            inputStream = new BufferedReader( new FileReader(path));
            outputStream = new PrintWriter( new FileWriter(out_path));
            
            String num_tc = inputStream.readLine();
            int tc = Integer.parseInt(num_tc);
            
            for( int i = 0 ; i < tc ; i++ )
            {
                String get = inputStream.readLine();
                int info[] = ProcessInput(get);
                int fre = Process(info);
                String ot = "Case #"+(i+1)+": ";
                ot += fre;
                //System.out.println(ot);
                outputStream.write(ot+"\n");
            }
            
            if( outputStream != null )
                outputStream.close();
            if( inputStream != null )
                inputStream.close();
        }
        catch( IOException e )
        {
            ;
        }
    }
    
    private static int Process( int[] info )
    {
        int no_employee = info[0];
        int suprise = info[1];
        int points = info[2];
        
        for( int i = 3 ; i < info.length-1 ; i++ )
        {
            for( int j = i+1 ; j < info.length ; j++ )
            {
                if( info[i] < info[j] )
                {
                    int temp = info[i];
                    info[i] = info[j];
                    info[j] = temp;
                }
            }
        }
        
        int emp[][] = new int[no_employee][3];
        for( int i = 0 ; i < no_employee ; i++ )
        {
            for( int j = 0 ; j < 3 ; j++ )
            {
                emp[i][j] = 0;
            }
        }
        
        for( int i = 0 ; i < no_employee ; i++ )
        {
            int pts = info[3+i];
            for( int j = 0 ; j < pts ; j++ )
            {
                emp[i][j%3]++;
            }
        }
        
        for( int i = 0 ; i < no_employee ; i++ )
        {
            for( int j = 0 ; j < 3 ; j++ )
            {
                //System.out.print(emp[i][j]+" ");
            }
            //System.out.println();
        }
        
        //System.out.println("suprise");
        int count = 0;
        for( int i = 0 ; i < no_employee ; i++ )
        {
            if( count == suprise )
            {
                break;
            }
            
            if( !Check(emp[i],points))
            {
                int r[] = Suprise( emp[i]);

                if( r[0] != -1 && r[1] != -1 )
                {
                    if( r[0] == 0 && r[1] ==1 )
                    {
                        emp[i][0]++;
                        emp[i][1]--;
                    }
                    else if( r[0] == 0 && r[1] == 2)
                    {
                        emp[i][0]++;
                        emp[i][2]--;
                    }
                    else
                    {
                        emp[i][1]++;
                        emp[i][2]--;
                    }
                    count++;
                }
            }
        }
        
        /*
        for( int i = 0 ; i < no_employee ; i++ )
        {
            for( int j = 0 ; j < 3 ; j++ )
            {
                System.out.print(emp[i][j]+" ");
            }
            System.out.println();
        }
        * 
        */
        return CheckNum(emp,points);
        
    }
    
    private static int CheckNum( int[][] emp , int max )
    {
        //System.out.println("max: "+max);
        for( int i = 0 ; i < emp.length ; i++ )
        {
            for( int j = 0 ;j < emp[i].length ;j++)
            {
                //System.out.print(emp[i][j]+" ");
            }
            //System.out.println();
        }
        int fre = 0;
        for( int i = 0 ; i < emp.length ; i++ )
        {
            if( emp[i][0] >= max )
                {
                    fre++;
                }
        }
        //System.out.println(fre);
        return fre;
    }
    private static boolean Check( int[] pts, int max )
    {
        boolean valid = false;
        for( int i = 0 ; i < pts.length ; i++ )
        {
            if( pts[i] >= max )
            {
                valid = true;
                break;
            }
        }
        
        return valid;
    }
    
    private static int[] Suprise( int[] pts)
    {
        int r[] = new int[2];
        if( (Math.abs((pts[0]+1)-(pts[1]-1)) == 2) && (pts[1]>0) && (pts[0]>0))
        {
            r[0] = 0;
            r[1] = 1;
        }
        else if((Math.abs((pts[1]+1)-(pts[2]-1)) == 2)&& (pts[1]>0) && (pts[2]>0))
        {
            r[0] = 1;
            r[1] = 2;
        }
        else if((Math.abs((pts[0]+1)-(pts[2]-1)) == 2)&& (pts[0]>0) && (pts[2]>0))
        {
            r[0] = 0;
            r[1] = 2;
        }
        else
        {
            r[0] = -1;
            r[1] = -1;
        }
        
        return r;
    }
    private static int[] ProcessInput( String get )
    {
        String token = "";
        int N = 0;
        int S = 0;
        int P = 0;
        int i = 0;
        
        for( ; get.charAt(i) != ' '; i++)
        {
            token += get.charAt(i);
        }
        N = Integer.parseInt(token);
        token = "";
        i++;
        
        
        for( ; get.charAt(i) != ' '; i++ )
        {
            token += get.charAt(i);
        }
        S = Integer.parseInt(token);
        token = "";
        i++;
        
        for( ; get.charAt(i) != ' ';i++)
        {
            token += get.charAt(i);
        }
        P = Integer.parseInt(token);
        token = "";
        i++;
        
        int val[] = new int[N];
        int n = 0;
        for( ; i < get.length() ; i++ )
        {
            if( get.charAt(i) == ' ')
            {
                val[n] = Integer.parseInt(token);
                n++;
                token = "";
                i++;
            }
            token += get.charAt(i);
        }
        val[n] = Integer.parseInt(token);
        
        
        int r[] = new int[3+N];
        r[0] = N;
        r[1] = S;
        r[2] = P;
        
        /*
        System.out.println(N);
        System.out.println(S);
        System.out.println(P);
        
        * 
        */
        for(int z = 0,x=3 ; z < val.length ; z++,x++ )
        {
            //System.out.println(val[z]);
            r[x] = val[z];
        }
        
        return r;
    }
}
