package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

package codeJam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

/**
 * http://code.google.com/codejam/contest/1460488/dashboard#s=p1
 * @author Weiwei Cheng
 */
public class DancingWithTheGooglers {

    public static void main(String[] args) throws Exception {
        
        BufferedReader br = new BufferedReader(new FileReader("_input.in"));
        BufferedWriter bw = new BufferedWriter(new FileWriter("_output.in"));
        
        br.readLine();
        
        String line = null;
        int count = 0;
        
        while((line=br.readLine())!=null){
           
            String[] input = line.split(" ");

            int numGooglers = Integer.parseInt(input[0]);
            int maxNumSuprises = Integer.parseInt(input[1]);
            int neededScore = Integer.parseInt(input[2]);
            
            int[] scores = new int[numGooglers]; 
            int ans = 0;
            int numSuprises = 0;
            
            for(int i=3; i<input.length; i++){
                scores[i-3] = Integer.parseInt(input[i]);
            }
            
            for(int score : scores){
                if(score % 3 == 0){
                    if(score != 0){
                        int highscoreWithSup = score / 3 + 1;
                        int highscoreNoSup = score / 3;
                        if(highscoreNoSup >= neededScore){
                            ans++;
                        }
                        else if(highscoreWithSup >= neededScore && numSuprises < maxNumSuprises){
                            ans++;
                            numSuprises++;
                        }
                    }
                    else{//score==0
                        if(0 >= neededScore){
                            ans++;
                        }
                    }
                }
                else if(score % 3 == 1){
                    int highscoreWithSup = score / 3 + 1;
                    int highscoreNoSup = highscoreWithSup;
                    if(highscoreNoSup >= neededScore){
                        ans++;
                    }
                }
                else{
                    int highscoreWithSup = score / 3 + 2;
                    int highscoreNoSup = score / 3 + 1;
                    if(highscoreNoSup >= neededScore){
                        ans++;
                    }
                    else if(highscoreWithSup >= neededScore && numSuprises < maxNumSuprises){
                        ans++;
                        numSuprises++;
                    }
                }
            }
                    
            bw.append("Case #" + ++count + ": " + ans);
            
            bw.newLine();
        }

        br.close();
        bw.close();
        
    }

}
