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 com.code.jam;

import java.io.File;
import java.io.PrintStream;
import java.util.Scanner;

public class BDancingWithGooglers {
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner (new File("C:/codeJam/ficheros2012/BDancingWithGooglers-practice.in"));
		PrintStream ps = new PrintStream("C:/codeJam/ficheros2012/BDancingWithGooglers-practice.out");
		int T = new Integer (in.nextLine());
		for (int nCase = 1; nCase < T + 1; nCase++) {
			Scanner inLine = new Scanner(in.nextLine());
			int numberGooglers = inLine.nextInt();
			int surprisingScore = inLine.nextInt();
			int p = inLine.nextInt();
			int maxGooglersWithScoreX = 0;
			for (int i = 0; i < numberGooglers; i++) {
				int scoreGoogler = inLine.nextInt();
				int desviationScore = scoreGoogler % 3;
				int maxScore = (scoreGoogler - desviationScore) / 3;
				
				if (desviationScore > 0){
					maxScore++;
				}
				
				if (maxScore >= p){
					maxGooglersWithScoreX++;
				}
				else{
					if (scoreGoogler >= p
							&& surprisingScore > 0
							&& maxScore + 1 >= p){
						maxGooglersWithScoreX++;
						surprisingScore--;
					}
				}
			}
			System.out.format("Case #%d: %d\n", nCase, maxGooglersWithScoreX);
			ps.format("Case #%d: %d\n", nCase, maxGooglersWithScoreX);
		}
		ps.flush();
		ps.close();
	}
}
