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 com.jagsaund.codejam.qualifcation;

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

public class DancingWithGooglers {
  private List<List<Integer>> _sets;
  private int _numOfSurprisingTriplets;
  private int _minResult;
  
  public DancingWithGooglers() {
    _sets = new ArrayList<List<Integer>>();
  }
  
  public String run(String line) {
    int[] googlers = null;
    int numOfGooglers;
    
    int pos = 0;
    
    StringTokenizer tokenizer = new StringTokenizer(line);
    
    while (tokenizer.hasMoreElements()) {
      int v = Integer.parseInt(tokenizer.nextToken());
      if (pos == 0) {
        numOfGooglers = v;
        googlers = new int[numOfGooglers];
      } else if (pos == 1) {
        _numOfSurprisingTriplets = v;
      } else if (pos == 2) {
        _minResult = v;
      } else {
        googlers[pos-3] = v;
      }
      
      pos++;
    }
    
    int count = 0;
    
    for (int number : googlers) {
      getIntegerSet(number);
      
      if (_sets.size() > 0) {
        if (_sets.size() == 1) {
          List<Integer> set = _sets.get(0);
          
          int low = Integer.MAX_VALUE;
          int high = Integer.MIN_VALUE;
          
          for (int n : set) {
            if (n < low) low = n;
            if (n > high) high = n;
          }
          
          if ((high - low) == 2 && _numOfSurprisingTriplets > 0) {
            _numOfSurprisingTriplets--;
            count++;
          } else if ((high - low) < 2) {
            count++;
          }
        
        } else {
          count++;
        }
      }
      
      
//      if (number == 0 && _minResult == 0) count++;
      
      _sets.clear();
    }
    
    return count + "";
  }
  
  private void getIntegerSet(int x) {
    getIntegerSet(x, x, new ArrayList<Integer>());
  }
  
  private void getIntegerSet(int x, int max, List<Integer> prefix) {
    if (x == 0) {
      if (prefix.size() <= 3) {
        if (prefix.size() == 2) {
          prefix.add(0);
        }
        
        if (prefix.size() == 1) {
          prefix.add(0);
          prefix.add(0);
        }
        
        if (prefix.size() == 0) {
          prefix.add(0);
          prefix.add(0);
          prefix.add(0);
        }
        
        int low = Integer.MAX_VALUE;
        int high = Integer.MIN_VALUE;
        
        for (int n : prefix) {
          if (n < low) low = n;
          if (n > high) high = n;
        }
        
        if (high >= _minResult && (high - low) <= 2 && high <= 10) {
          _sets.add(prefix);  
        }
      }
      
      return;
    }
    
    for (int i=Math.min(x, max); i>=1; i--) {
      List<Integer> tmp = new ArrayList<Integer>(prefix);
      tmp.add(i);
      getIntegerSet(x-i, i, tmp);
    }
  }
}
