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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

public class Main {
	
	public static void main(String[] args) {
		ProblemB b = new ProblemB();
		List<String> lines = CodejamFile.readLines("c:\\tmp\\B-small-attempt0.in");
		for (int i = 0; i < lines.size(); i++) {
			System.out.printf("Case #%d: %d\n", i + 1, b.process(lines.get(i)));
		}
	}
}

class ProblemB {
	
	private int S;	// the number of surprising triplets of scores
	private int p;	// threashold score
	
	// 3 1 5 15 13 11 -> 3
	// 3 0 8 23 22 21 -> 2
	public int process(String line) {
		int possiblity = 0;
		//System.out.println(line);
		
		String[] elements = line.split(" ");
		int N = Integer.parseInt(elements[0]);	// the number of Googlers
		S = Integer.parseInt(elements[1]);
		p = Integer.parseInt(elements[2]);
		
		for (int i = 0; i < N; i++) {
			int score = Integer.parseInt(elements[i + 3]);
			//System.out.printf("%d, %d\n", score / 3, score % 3);
			possiblity += getPossiblity(score) > 0 ? 1 : 0;
		}
		return possiblity;
	}
	
	private int getPossiblity(int score) {
		int r = 0;
		int avg = score / 3;
		
		switch (score % 3) {
		case 0:
			if (avg > p) {
				r = 3;
			} else if (avg == p) {
				//if (S > 0) {
					r = 2;
					//S--;
				//}
			} else if (avg == (p - 1)){
				if (avg == 0) {
					break;
				}
				
				if (S > 0) {
					r = 1;
					S--;
				}
			}
			break;
		case 1:
			if (avg >= p) {
				r = 3;
			} else if (avg == (p -1)) {
				//if (S > 0) {
					//S--;
					r = 2;
				//} else {
					//r = 1;
				//}
			}
			break;
		case 2:
			if (avg >= p) {
				r = 3;
			}
			if (avg == (p - 1)) {
				r = 2;
			}
			if (avg == (p -2)) {
				if (S > 0) {
					S--;
					r = 1;
				}
			}
			break;
		}
		
		return r;
	}
}

class CodejamFile {

	public static List<String> readLines(String path) {
		List<String> lines = new ArrayList<String>();
		
		try {
			FileReader in = new FileReader(path);
			BufferedReader br = new BufferedReader(in);
			String line;
			//
			br.readLine();	// line count
			//
			while ((line = br.readLine()) != null) {
				lines.add(line);
			}
			br.close();
			in.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
		
		return lines;
	}
}
