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 Triplet {
	private int total;
	public Triplet(int totalScore){
		total = totalScore;
	}
	
	int getTotal() {
		return total;
	}
	
	boolean isSuprisable() {
		if (total < 2 || total > 28) {
			return false;
		} else {
			return true;
		}
	}
	int getBest(boolean suprising) {
		int extra = total%3;
		int mean = total/3;
		int result = -1;
		
		switch (extra) {
		case 0:
			if (suprising) {
				if (mean >= 1 && mean <= 9) {
					result = (mean+1); // m-1, m, m+1
				} else {
					result = -1;
				}
			} else {
				result = mean; // m, m, m
			}
			break;
		case 1:
			if (suprising) {
				if (mean >= 1 && mean <= 9) {
					result = mean+1; // m-1, m+1, m+1 
				} else {
					result = -1;
				}
			} else {
				result = mean+1; // m, m, m+1
			}
			break;
		case 2:
			if (suprising) {
				if (mean >= 0 && mean <= 8) {
					result = mean + 2; // m, m, m+2
				} else {
					result = -1;
				}
			} else {
				result = mean + 1; // m, m+1, m+1
			}
		default:
			break;
		}
		
		return result;
	}

	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + total;
		return result;
	}
}
