package com.gcj.parser;

public class MaxPoints {

	public static int normal(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 1 ; break;
		case 3 : toReturn = 1 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 2 ; break;
		case 6 : toReturn = 2 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 3 ; break;
		case 9 : toReturn = 3 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 4 ; break;
		case 12 : toReturn = 4 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 5 ; break;
		case 15 : toReturn = 5 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 6 ; break;
		case 18 : toReturn = 6 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 7 ; break;
		case 21 : toReturn = 7 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 8 ; break;
		case 24 : toReturn = 8 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 9 ; break;
		case 27 : toReturn = 9 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}

		return toReturn;
	}

	public static int surprising(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 2 ; break;
		case 3 : toReturn = 2 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 3 ; break;
		case 6 : toReturn = 3 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 4 ; break;
		case 9 : toReturn = 4 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 5 ; break;
		case 12 : toReturn = 5 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 6 ; break;
		case 15 : toReturn = 6 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 7 ; break;
		case 18 : toReturn = 7 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 8 ; break;
		case 21 : toReturn = 8 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 9 ; break;
		case 24 : toReturn = 9 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 10 ; break;
		case 27 : toReturn = 10 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}
		return toReturn;
	}

}

package dancingwiththegooglers;

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

public class TestCase {
	int numberOfGooglers;
	public int getNumberOfGooglers() {
		return numberOfGooglers;
	}
	public int getSurprisingScores() {
		return surprisingScores;
	}
	public int getBestResult() {
		return bestResult;
	}
	int surprisingScores;
	int bestResult;
	
	List<Integer> scores = null;
	
	public TestCase(int numberOfGooglers, int surprisingScores, int bestResult, List<Integer> scores){
		this.numberOfGooglers = numberOfGooglers;
		this.surprisingScores = surprisingScores;
		this.bestResult = bestResult;
		this.scores = new ArrayList<Integer>(scores);		
	}
	
	public int execute(){
		int bestScorers = 0;
		for(int score : this.scores){
			if(canItBeTheBestScorer(score, bestResult))
				bestScorers++;			
		}
		return bestScorers;
	}
	private boolean canItBeTheBestScorer(int score, int bestResult2) {
		if(score < bestResult2)
			return false;
		if(bestResult2 == 0)
			return true;
		if(bestResult2 == 1)
			if(score > 0)
				return true;
			else
				return false;
		if(score >= (bestResult2 * 3) - 2){
			return true;
		}else if(score >= (bestResult2 * 3) - 4){
			if(this.surprisingScores > 0){
				this.surprisingScores--;
				return true;
			}
			return false;
		}
		return false;
	}
	
}
