package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

public class Googler {
	int total;
	boolean prizeSurprise = false;
	boolean prizeNoSurprise = false;
	boolean failSurprise = false;
	boolean failNoSurprise = false;
	boolean used = false;
	int trueCounter = 0;

	public Googler poss(int total, int prize){
		this.used = false;
		this.total = total;
		for (int i=10; i>-1; i--){
			if (total>=i){
				int twoA = total - (2*i);
				if (twoA >=0 && twoA<= i){
					if (twoA == i || twoA == i-1){
						if (i>=prize){
							if (prizeNoSurprise == false){trueCounter++;}
							prizeNoSurprise = true;
						} else {
							if (failNoSurprise == false){trueCounter++;}
							failNoSurprise = true;
						}
					}
					if (twoA == i-2){
						if (i>=prize){
							if (prizeSurprise == false){trueCounter++;}
							prizeSurprise = true;
						} else {
							if (failSurprise == false){trueCounter++;}
							failSurprise = true;
						}
					}
				}
				int oneA = total - i - (i-1);
				if (oneA >=0 && oneA<= i){
					if (oneA == i ||oneA == i-1){
						if (i>=prize){
							if (prizeNoSurprise == false){trueCounter++;}
							prizeNoSurprise = true;
						} else {
							if (failNoSurprise == false){trueCounter++;}
							failNoSurprise = true;
						}
					}
					if (oneA == i-2){
						if (i>=prize){
							if (prizeSurprise == false){trueCounter++;}
							prizeSurprise = true;
						} else {
							if (failSurprise == false){trueCounter++;}
							failSurprise = true;
						}
					}
				}
				int splitA = total - i - (i-2);
				if (splitA >=0 && oneA<= i){
					if (splitA == i ||oneA == i-1 || splitA== i-2){
						if (i>=prize){
							if (prizeSurprise == false){trueCounter++;}
							prizeSurprise = true;
						} else {
							if (failSurprise == false){trueCounter++;}
							failSurprise = true;
						}
					}
				}
			}
		}
		return this;
	}
	
}
