package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}
package it.simone.google.code.jam2012;

public class Dancer implements GoogleCodeExercise {

	int surprise = 0;
	int googlers = 0;
	int p = 0;

	@Override
	public String execute(String line) {

		int result = 0;

		String[] data = line.split(" ");
		googlers = Integer.parseInt(data[0]);
		surprise = Integer.parseInt(data[1]);
		p = Integer.parseInt(data[2]);

		for (int i = 3; i < data.length; i++) {

			int total = Integer.parseInt(data[i]);
			result += analize(total);
		}
//		if (surprise >= 1)
//			System.out.println("WARNING");
		return "" + result;
	}

	@Override
	public void initialize() {

	}

	private int analize(int total) {
		int avg = total / 3;
		int rem = total % 3;
		int maxVote = avg;
		
		
		if (avg >= p) {
			maxVote = avg;
		} else if (rem == 1) {
			maxVote = avg + 1;
		} else if (rem == 2) {
			if ((avg + 1) >= p)
				maxVote = avg + 1;
			else if (surprise > 0) {
				if ((avg + 2) >= p) {
					maxVote = avg + 2;
					surprise--;
				} else
					maxVote = avg + 1;
			}
		} else if (rem == 0 && avg!=0) {
			if ((avg + 1) >= p && surprise > 0) {
				maxVote = avg + 1;
				surprise--;
			}
		}

		if (maxVote >= p)
			return 1;
		else
			return 0;
	}

}
