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.my;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Main {

	public static void main(String[] args) {

		Dancing d = new Dancing();

		d.danc();

	}
}

class Dancing {

	public void danc()	{

		try {

			String fileLocation = "C://Training//Google//DancingWiththeGooglers//src//com//my//smallInput.txt";

			BufferedReader reader = getInputFile(fileLocation);

			String line = reader.readLine();

			int count=1;
			while ( ( line = reader.readLine()) != null	 ) {

				String inputs[] = line.split(" " );
				
				int totalParticipant = Integer.parseInt(inputs[0]);
				int surprising = Integer.parseInt(inputs[1]);
				int inResult = Integer.parseInt(inputs[2]);
				List list = new ArrayList();

				for( int i=0;i<totalParticipant;++i)	{

					int score = Integer.parseInt(inputs[3+i]);
					list.add(triplet(score,inResult));
				}

				int totalCount = 0 ;

				for( int i=0; i<list.size();++i	)	{
					if( totalCount == surprising)
						break;
					List l = (List )list.get(i);
					if( !((Boolean)l.get(0)) &&  (Boolean)l.get(1))	{
						l.set(1, false);
						l.set(0, false);
						++totalCount;

					}
				}

				if( totalCount < surprising)	{
					for( int i=0; i<list.size();++i	)	{
						List l = (List )list.get(i);
						if( (Boolean)l.get(1))	{
							l.set(1, false);
							l.set(0, false);
							++totalCount;
							if( totalCount == surprising)
								break;
						}
					}
				}
				for( int i=0; i<list.size();++i	)	{
					List l = (List )list.get(i);

					if( ((Boolean)l.get(0)) )	{
						++totalCount;
					}
				}
				System.out.print("Case #" + count + ": ");
				++count;
				System.out.println(totalCount);
			}



		}
		catch (Exception e) {
			// TODO: handle exception
		}
	}


	public BufferedReader getInputFile(String fileLocation)	throws Exception{

		BufferedReader reader = new BufferedReader(new FileReader(new File(fileLocation)));

		return reader;
	}

	public List triplet(int score, int inResult)	{

		List<String> surpriseList = new ArrayList<String>();
		java.util.List<String> list = new ArrayList<String>();

		try {

			int mid = score/3;

			for( int i=0; i<3;++i)	{
				for( int j=0; j<3; ++j)	{
					for( int k=0; k<3; ++k)	{
						int total = (mid+i) + (mid+j) + (mid+k);
						if( total == score){
							if( (mid+i) >= inResult ||  (mid+j) >= inResult ||  (mid+k) >= inResult )	{
								String str = sort((mid+i),(mid+j),(mid+k));
								if( isSurprise((mid+i),(mid+j),(mid+k)))	{
									if( !surpriseList.contains(str))
										surpriseList.add(str);
								}
								else
									if( !list.contains(str))
										list.add(str);
							}
						}		
					}
				}
			}
			if( mid >= 1)	{
				mid--;
				for( int i=0; i<3;++i)	{
					for( int j=0; j<3; ++j)	{
						for( int k=0; k<3; ++k)	{
							int total = (mid+i) + (mid+j) + (mid+k);
							if( total == score){
								if( (mid+i) >= inResult ||  (mid+j) >= inResult ||  (mid+k) >= inResult )	{
									String str = sort((mid+i),(mid+j),(mid+k));
									if( isSurprise((mid+i),(mid+j),(mid+k)))	{
										if( !surpriseList.contains(str))
											surpriseList.add(str);
									}
									else
										if( !list.contains(str))
											list.add(str);
								}
							}
						}
					}
				}
			}

		} catch (Exception e) {
			// TODO: handle exception
		}

		List  returnList = new ArrayList ();

		if( list.size() > 0)
			returnList.add(true);
		else
			returnList.add(false);
		if(surpriseList.size() >0 )
			returnList.add(true);
		else
			returnList.add(false);

		return returnList;
	}


	public String sort(int num1, int num2, int num3)	throws Exception{

		List<Integer> list = new ArrayList<Integer>();
		list.add(num1);
		list.add(num2);
		list.add(num3);
		Collections.sort(list);

		String s = "";

		for( int i =0; i<list.size();++i)	{
			s = s + list.get(i) + " ";
		}

		return s;
	}

	public boolean isSurprise(int num1, int num2, int num3)	{

		if( num1-num2 == 2 || num1-num3 == 2 || num2-num1 == 2 || num2-num3 == 2 || num3-num1 == 2 || num3-num2 == 2 )
			return true;

		return false;
	}
}
