package jp.funnything.competition.util;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.math.BigDecimal;
import java.math.BigInteger;

import org.apache.commons.io.IOUtils;

public class QuestionReader {
    private final BufferedReader _reader;

    public QuestionReader( final File input ) {
        try {
            _reader = new BufferedReader( new FileReader( input ) );
        } catch ( final FileNotFoundException e ) {
            throw new RuntimeException( e );
        }
    }

    public void close() {
        IOUtils.closeQuietly( _reader );
    }

    public String read() {
        try {
            return _reader.readLine();
        } catch ( final IOException e ) {
            throw new RuntimeException( e );
        }
    }

    public BigDecimal[] readBigDecimals() {
        return readBigDecimals( " " );
    }

    public BigDecimal[] readBigDecimals( final String separator ) {
        final String[] tokens = readTokens( separator );

        final BigDecimal[] values = new BigDecimal[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = new BigDecimal( tokens[ index ] );
        }

        return values;
    }

    public BigInteger[] readBigInts() {
        return readBigInts( " " );
    }

    public BigInteger[] readBigInts( final String separator ) {
        final String[] tokens = readTokens( separator );

        final BigInteger[] values = new BigInteger[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = new BigInteger( tokens[ index ] );
        }

        return values;
    }

    public int readInt() {
        final int[] values = readInts();

        if ( values.length != 1 ) {
            throw new IllegalStateException( "Try to read single interger, but the line contains zero or multiple values" );
        }

        return values[ 0 ];
    }

    public int[] readInts() {
        return readInts( " " );
    }

    public int[] readInts( final String separator ) {
        final String[] tokens = readTokens( separator );

        final int[] values = new int[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = Integer.parseInt( tokens[ index ] );
        }

        return values;
    }

    public long readLong() {
        final long[] values = readLongs();

        if ( values.length != 1 ) {
            throw new IllegalStateException( "Try to read single interger, but the line contains zero or multiple values" );
        }

        return values[ 0 ];
    }

    public long[] readLongs() {
        return readLongs( " " );
    }

    public long[] readLongs( final String separator ) {
        final String[] tokens = readTokens( separator );

        final long[] values = new long[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = Long.parseLong( tokens[ index ] );
        }

        return values;
    }

    public String[] readTokens() {
        return readTokens( " " );
    }

    public String[] readTokens( final String separator ) {
        return read().split( separator );
    }
}

package mgg.utils;

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

/**
 * @author manolo
 * @date 13/04/12
 */
public class CombinatoryUtils {

	public static List<Integer> findAddingCombination(int total, 
			List<Integer> listOfNumbers) {

		ArrayList<Integer> solution = new ArrayList<Integer>();

		for (int i = 0; i < listOfNumbers.size(); i++){
			for (int j = 0; j < listOfNumbers.size(); j++){

				if( (i != j) &&
						(listOfNumbers.get(i) + listOfNumbers.get(j) == total) ){
					solution.add(listOfNumbers.get(i));
					solution.add(listOfNumbers.get(j));
					return solution;
				}

			}
		}
		return null;
	}

	public static List<Integer> findAddingCombinationIndices(int total, 
			List<Integer> listOfNumbers) {

		ArrayList<Integer> solution = new ArrayList<Integer>();

		for (int i = 0; i < listOfNumbers.size(); i++){
			for (int j = 0; j < listOfNumbers.size(); j++){

				if( (i != j) &&
						(listOfNumbers.get(i) + listOfNumbers.get(j) == total) ){
					solution.add(i);
					solution.add(j);
					return solution;
				}

			}
		}
		return null;
	}

	public static List<Integer> findAddingCombinationIndicesBase1(int total, 
			List<Integer> listOfNumbers) {

		ArrayList<Integer> solution = new ArrayList<Integer>();

		for (int i = 0; i < listOfNumbers.size(); i++){
			for (int j = 0; j < listOfNumbers.size(); j++){

				if( (i != j) &&
						(listOfNumbers.get(i) + listOfNumbers.get(j) == total) ){
					solution.add(i+1);
					solution.add(j+1);
					return solution;
				}

			}
		}
		return null;
	}

	public static List<Triplet> possibleTriplets(int score) {
		List<Triplet> listOfTriplets = new ArrayList<Triplet>();
		
		for(Triplet t : allPossibleTriplets){
			if(t.sum() == score){
				listOfTriplets.add(t);
			}
		}
		
		return listOfTriplets;
	}
	
	private final static List<Triplet> allPossibleTriplets = allPossibleTriplets();
	
	private static List<Triplet> allPossibleTriplets() {

		HashSet<Triplet> set = new HashSet<Triplet>();
		
//		int cont = 0;
		for (int i = 0; i <= 10; i++) {
			for (int j = 0; j <= 10; j++) {
				if(Math.abs(i-j) <= 2){
					for (int k = 0; k <= 10; k++) {
						if((Math.abs(i-k) <= 2) && (Math.abs(j-k) <= 2)){
//							cont++;
//							System.out.println("(" + i + ", " + j + ", " + k + ")\t\tcont = " + cont);7
							set.add(new Triplet(i, j, k));
							
						}
					}
				}
			}	
		}
		
		return new ArrayList<Triplet>(set);

	}

}
