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 dg.gcj.bdancing;

import java.util.ArrayList;
import java.util.List;

/**
 * Created by IntelliJ IDEA.
 * User: Dmitry
 * Date: 14.04.12
 * Time: 23:30
 * To change this template use File | Settings | File Templates.
 */
public class Solver {

    private PossibleCombinations possibleCombinations = new PossibleCombinations();

    public int solve(World world) {
        // DEBUG
//        System.out.println("---------------------------");
//        System.out.println("Googlers number: " + world.getGooglersNumbers());
//        System.out.println("Surprising number: " + world.getSurprising());
//        System.out.println("Boundary score: " + world.getBoundaryScore());
//        System.out.println("Scores: " + world.getScores());
//        System.out.println("---------------------------");

        final List<Integer> scores = world.getScores();
        final int[] selectedTripletsSizes = new int[scores.size()];
        for(int i = 0; i < scores.size(); ++ i)
        {
            int score = scores.get(i);
            selectedTripletsSizes[i] = this.possibleCombinations.findTripletsByTotalScore(score).size();
        }

        int[] selectedTripletsIndexes = new int[scores.size()];
        int maximumMatchedGooglers = 0;

        do
        {
            int actualSurprisingCount = 0;
            int actualMatchedGooglers = 0;
            List<Triplet> selectedTriplets = new ArrayList<Triplet>();

            for(int i = 0; i < scores.size(); ++ i)
            {
                int score = scores.get(i);
                final List<Triplet> tripletsByTotalScore = this.possibleCombinations.findTripletsByTotalScore(score);
                final int selectedTripletIndex = selectedTripletsIndexes[i];
                final Triplet triplet = tripletsByTotalScore.get(selectedTripletIndex);

                selectedTriplets.add(triplet);

                if (triplet.isSurprising())
                {
                    actualSurprisingCount ++;
                }

                if (triplet.getMaximumScore() >= world.getBoundaryScore())
                {
                    actualMatchedGooglers ++;
                }
            }

            // DEBUG
//            System.out.println("**************************************");
//            System.out.println("Triplets " + selectedTriplets);
//            System.out.println("Surprising Count " + actualSurprisingCount);
//            System.out.println("Matched Googlers Count " + actualMatchedGooglers);

            if (world.getSurprising() == actualSurprisingCount && maximumMatchedGooglers < actualMatchedGooglers)
            {
                maximumMatchedGooglers = actualMatchedGooglers;
            }
        }
        while (this.nextCombination(selectedTripletsIndexes, selectedTripletsSizes));

        return maximumMatchedGooglers;
    }

    private boolean nextCombination(int[] selectedTripletsIndexes, int[] selectedTripletsSizes) {
        for(int i = 0; i < selectedTripletsIndexes.length; ++ i)
        {
            selectedTripletsIndexes[i] ++;
            if (selectedTripletsIndexes[i] >= selectedTripletsSizes[i])
            {
                selectedTripletsIndexes[i] = 0;
            }
            else
            {
                return true;
            }
        }

        return false;
    }
}
