import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.StringTokenizer;

public class ReadFile {
	public static void main(String[] args) throws Exception {
		String srcFile = "C:" + File.separator + "Documents and Settings"
				+ File.separator + "rohit" + File.separator + "My Documents"
				+ File.separator + "Downloads" + File.separator
				+ "C-small-attempt1.in.txt";
		String destFile = "C:" + File.separator + "Documents and Settings"
				+ File.separator + "rohit" + File.separator + "My Documents"
				+ File.separator + "Downloads" + File.separator
				+ "C-small-attempt0.out";
		File file = new File(srcFile);
		List<String> readData = new ArrayList<String>();
		FileReader fileInputStream = new FileReader(file);
		BufferedReader bufferedReader = new BufferedReader(fileInputStream);
		StringBuilder stringBuilder = new StringBuilder();
		String line = null;
		while ((line = bufferedReader.readLine()) != null) {
			readData.add(line);
		}
		stringBuilder.append(generateOutput(readData));
		File writeFile = new File(destFile);
		if (!writeFile.exists()) {
			writeFile.createNewFile();
		}
		FileWriter fileWriter = new FileWriter(writeFile);
		BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);
		bufferedWriter.write(stringBuilder.toString());
		bufferedWriter.close();
		System.out.println("output" + stringBuilder);
	}

	/**
	 * @param number
	 * @return
	 */
	private static String generateOutput(List<String> number) {
		StringBuilder stringBuilder = new StringBuilder();
		for (int i = 0; i < number.size(); i++) {
			if (i == 0) {
				continue;
			} else {
				String tempString = number.get(i);
				String[] temArr = tempString.split(" ");
				stringBuilder.append("Case #" + i + ": ");
				stringBuilder.append(getRecNumbers(temArr[0], temArr[1]));
				stringBuilder.append("\n");
			}
		}
		if (stringBuilder.length() > 0) {
			stringBuilder.deleteCharAt(stringBuilder.length() - 1);
		}
		return stringBuilder.toString();
	}

	// /* This method accepts method for google code jam */
	// private static String method(String value) {
	// int intValue = Integer.valueOf(value);
	// double givenExpr = 3 + Math.sqrt(5);
	// double num = Math.pow(givenExpr, intValue);
	// String valArr[] = (num + "").split("\\.");
	// int finalVal = Integer.valueOf(valArr[0]) % 1000;
	//
	// return String.format("%1$03d", finalVal);
	//
	// }
	//
	// /* This method accepts method for google code jam */
	// private static String method2(String value) {
	// StringTokenizer st = new StringTokenizer(value, " ");
	// String test[] = value.split(" ");
	// StringBuffer str = new StringBuffer();
	//
	// for (int i = 0; i < test.length; i++) {
	// // test[i]=test[test.length-i-1];
	// str.append(test[test.length - i - 1]);
	// str.append(" ");
	// }
	// str.deleteCharAt(str.length() - 1);
	// String strReversedLine = "";
	//
	// while (st.hasMoreTokens()) {
	// strReversedLine = st.nextToken() + " " + strReversedLine;
	// }
	//
	// return str.toString();
	// }

	private static int getRecNumbers(String no1, String no2) {

		int a = Integer.valueOf(no1);
		int b = Integer.valueOf(no2);
		Set<String> dupC = new HashSet<String>();
		for (int i = a; i <= b; i++) {
			int n = i;
			List<String> value = findPerm(n);
			for (String val : value) {
				if (Integer.valueOf(val) <= b && Integer.valueOf(val) >= a
						&& n < Integer.valueOf(val)) {
					dupC.add(n + "-" + val);
				}
			}
		}
		return dupC.size();
	}

	private static List<String> findPerm(int num) {
		String numString = String.valueOf(num);
		List<String> value = new ArrayList<String>();
		for (int i = 0; i < numString.length(); i++) {
			String temp = charIns(numString, i);
			if (!temp.equalsIgnoreCase(numString)) {
				value.add(charIns(numString, i));
			}
		}
		return value;

	}

	public static String charIns(String str, int j) {
		String begin = str.substring(0, j);
		String end = str.substring(j);
		return end + begin;
	}
}
package google.contest.B;

import google.loader.Challenge;
import google.problems.AbstractChallenge;

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

public class BChallenge extends AbstractChallenge implements Challenge {

	private int numberOfGooglers;
	private int numberOfSurprise;
	private int desiredScore;
	List<Integer> scores;
	private String resultNumber;
	private static  HashMap<Integer, ScoreInfo> map;

	public BChallenge(int number, String line) {
		super(number);

		String[] tokens = line.split(" ");

		numberOfGooglers = Integer.parseInt(tokens[0]);
		numberOfSurprise = Integer.parseInt(tokens[1]);

		desiredScore = Integer.parseInt(tokens[2]);

		scores = new ArrayList<Integer>();
		for(int i=0;i<numberOfGooglers;i++){
			scores.add(Integer.parseInt(tokens[3+i]));
		}
		calculate();

		setResult(resultNumber);
	}

	private void calculate() {
		if(map == null){
			init();
		}

		// teile in bigger und nicht bigger
		List<Integer> bigger = new ArrayList<Integer>();
		List<Integer> biggerAndSurprising = new ArrayList<Integer>();
		List<Integer> smaller = new ArrayList<Integer>();
		List<Integer> smallerAndSuprising = new ArrayList<Integer>();
		for(Integer score : scores ){
			ScoreInfo info = getScoreInfo(score);
			if(info.canBeBigger(desiredScore)){
				if(info.mustBeSuprisingBeingBigger(desiredScore)){
					biggerAndSurprising.add(score);	
				}else{
					bigger.add(score);
				}
			}else{
				if(info.canBeSuprising()){
					smallerAndSuprising.add(score);
				}else{
					smaller.add(score);
				}
			}
		}

		int biggerSize = bigger.size();
		int biggerAndSuprSize = biggerAndSurprising.size();
		int smallerSize = smaller.size();
		int smallerAndSupSize = smallerAndSuprising.size();
		
		if(biggerAndSuprSize>=numberOfSurprise){
			resultNumber = ""+ ( biggerSize + numberOfSurprise);
			return;
		}
			resultNumber = ""+ (biggerSize + biggerAndSuprSize);
		
	}

	private ScoreInfo getScoreInfo(Integer score) {
		return map.get(score);
	}

	private void init() {
		map = new HashMap<Integer, ScoreInfo>();
		for(int i=0;i<11;i++){
			for(int j=0;j<11;j++){
				for(int k=0;k<11;k++){
					addTripple(i,j,k);
				}
			}
		}

	}

	private void addTripple(int i, int j, int k) {

		int sum = i+j+k;
		if(! map.containsKey(sum)){
			map.put(sum, new ScoreInfo(sum));
		}
		map.get(sum).addTripple(i,j,k);

	}



	private static class ScoreInfo{

		private List<Tripple> tripples;

		public ScoreInfo(int sum) {
			tripples = new ArrayList<BChallenge.Tripple>();
		}

		public boolean mustBeSuprisingBeingBigger(int desiredScore) {
			
			for(Tripple tripple : tripples){
				if(tripple.isBigger(desiredScore)){
					if(!tripple.isSuprising()){
						return false;
					}
				}
			}
			return true;
		}

		public boolean canBeBiggerAndSuprising(int desiredScore) {
			for(Tripple tripple : tripples){
				if(tripple.isBigger(desiredScore)){
					if(tripple.isSuprising()){
						return true;
					}
				}
			}
			return false;
		}

		public boolean canBeBigger(int desiredScore) {
			for(Tripple tripple : tripples){
				if(tripple.isBigger(desiredScore)){
					return true;
				}
			}
			return false;
		}

		public boolean canBeSuprising() {
			for(Tripple tripple : tripples){
				if(tripple.isSuprising()){
					return true;
				}
			}
			return false;
		}

		public void addTripple(int i, int j, int k) {
			Tripple tripple = new Tripple(i,j,k);
			if(tripple.isValid()){
				tripples.add(tripple);
			}

		}

	}

	private static class Tripple{

		private final int i;
		private final int j;
		private final int k;

		public Tripple(int i, int j, int k) {
			this.i = i;
			this.j = j;
			this.k = k;
		}


		public boolean isBigger(int desiredScore) {
			return i>=desiredScore || j>=desiredScore || k>=desiredScore;
		}


		public boolean isSuprising() {
			return 2==getMaxDifference();
		}


		private boolean isValid() {
			int max = getMaxDifference();
			return max<3;
		}

		private int getMaxDifference() {
			int a1 = Math.abs(i-j);
			int a2 = Math.abs(i-k);
			int a3 = Math.abs(k-j);

			int max = Math.max(Math.max(a1,a2), a3);
			return max;
		}

	}



}
