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);
	}

}

package de.hg.codejam.tasks.dance.controller;

import de.hg.codejam.tasks.dance.domain.Case;
import de.hg.codejam.tasks.dance.help.Converter;
import de.hg.codejam.tasks.dance.service.Calculator;
import de.hg.codejam.tasks.io.Reader;
import de.hg.codejam.tasks.io.Writer;

public class Test {

	public static void main(String[] args) {
		String inputPath = "file/B-large.in";
		String outputPath = Writer.generateOutputPath(inputPath);

		// System.out.println("=== READ FILE: " + inputPath + " ===");
		String[] input = Reader.readFile(inputPath);
		// Writer.print(input);

		// System.out.println("=== CASES ===");
		Case[] cases = new Case[input.length];
		for (int i = 0; i < input.length; i++) {
			cases[i] = Case.parse(input[i]);
			// System.out.println(cases[i]);
		}

		// System.out.println("=== CALCULATION: Start ===");
		int[] results = Calculator.calculate(cases);
		// System.out.println("=== CALCULATION: End ===");

		// System.out.println("=== RESULTS ===");
		String[] resultStrings = Converter.convert(results);
		// Writer.write(resultStrings);

		// System.out.println("=== WRITE TO FILE: " + outputPath + " ===");
		Writer.write(resultStrings, outputPath);
		System.out.println("=== FILE WRITTEN ===");
	}
}
