package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

package com.g0414.c;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;

public class Problem {
	public final String FILE_PATH = "C:/data/workspace/googleCodeJam/src/" + "com/g0414/c/";
	// public final String FILE_BASE = "B-large";
	public final String INPUT_FILE = FILE_PATH + "C-large.in";
	public final String OUTPUT_FILE = 
			INPUT_FILE.substring(0, INPUT_FILE.lastIndexOf('.')) + ".txt";
	
	long testN = -1;
	ArrayList<Test> testList = new ArrayList<Test>();
	
	public static void main(String[] args) {
		try {
			Problem p = new Problem();
			p.init();
			p.printResult();
			p.end();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	public void printResult() throws ProblemException {
		long i = 1;
		for (Test p : testList) {
			print("Case #" + i + ": " + p.check());
			i++;
		}
	}
	
	public static boolean flag = true;
	FileWriter outputFile = null;
	public void print(String str) throws ProblemException {
		try {
			// t@CÌíAt@CÌVKI[v
			if (flag) {
				flag = false;
				File fw01 = new File(OUTPUT_FILE);
				fw01.delete();
				outputFile = new FileWriter(OUTPUT_FILE, true);
			}
			outputFile.write(str + "\r\n");
			System.out.println(str);
		} catch (IOException e) {
				throw new ProblemException(e.getMessage(),e);
		}
	}
	
	public void end() throws ProblemException {
		try {
			outputFile.close();
		} catch (IOException e) {
			throw new ProblemException(e.getMessage(),e);
		}
	}
	
	public void init() throws ProblemException {
		try {
			FileReader in = new FileReader(INPUT_FILE);
			BufferedReader br = new BufferedReader(in);
			String line;
			testN = Long.parseLong(br.readLine());
			while ((line = br.readLine()) != null) {
				String[] ch = line.split(" ");
				System.out.println(line);
				ch = line.split(" ");
				long a = Long.parseLong(ch[0]);
				long b = Long.parseLong(ch[1]);
				Test test = new Test(a,b);
				testList.add(test);
			}
			br.close();
			in.close();
		} catch (IOException e) {
			System.out.println(e);
			throw new ProblemException(e.getMessage(),e);
		}
	}
	
	public class ProblemException extends Exception {
		private static final long serialVersionUID = 2080823058826051635L;
		public ProblemException(String message) {
			super(message);
		}
		public ProblemException(String message, Throwable e) {
			super (message, e);
		}
	}

	// ±±æèãÍú»Æ©t@CB
	// ±±æèºÍASY
	
	public class Test {
		long a = -1;
		long b = -1;
		
		public Test (long a, long b) {
			this.a = a;
			this.b = b;
		}
		
		public String check () {
			HashMap<Long, AB> map = new HashMap<Long, AB> ();
			for (long i = a; i <= b; i++) {
				long small = getSmall(i);
				AB newAB = new AB(small);
				AB ab = map.get(small);
				if (ab == null){
					map.put(small, newAB);
				} else {
					ab.plus();
				}
			}
			long result = 0;
			for (long small : map.keySet()) {
				AB ab = map.get(small);
				if (ab.getN() == 1) {
					continue;
				}
				long kumi = ab.getN() * (ab.getN() - 1) / 2;
				result += kumi;
				/*
				System.out.println("ab=" + ab.getN() + ", " + ab.getSmall() +
						", kumi=" + kumi);
				*/
			}
			return "" + result;
		}

		private long getSmall (long hoge) {
			long ret = 0;
			long keta = getKeta(hoge);
			ret = hoge;
			for (int i = 0; i < keta; i++) {
				hoge = hoge % 10 * kaijo10(keta-1) + hoge / 10;
				if (hoge < ret) {
					ret = hoge;
				}
			}
			
			return ret;
		}
		
		/**
		 * @param keta
		 * @return output = 10 ^ input
		 */
		private long kaijo10 (long keta) {
			long ret = 1;
			for (int i = 0; i < keta; i ++) {
				ret *= 10;
			}
			return ret;
		}
		
		/**
		 * @param hoge
		 * @return ^¦çê½ÌðÔ·B
		 */
		private long getKeta (long hoge) {
			if (hoge == 0){
				return 0;
			} else {
				return getKeta(hoge / 10) + 1;
			}
		}
		
		@Override
		public String toString() {
			// String list = " ";
			return "(" + a + "," + b + ")";
		}
	}
	
	public class AB {
		long small;
		long n = 1;
		public AB (long small) {
			this.small = small;
		}
		public long getSmall() {
			return small;
		}
		public long getN() {
			return n;
		}
		public void plus() {
			n ++;
		}
		
		@Override
		public boolean equals(Object o) {
			AB ab = (AB) o;
			return (small == ab.getSmall());
		}
		
		@Override
		public int hashCode () {
			return (int)small;
		}
	}
	/*
	 * 
Case #1: 1
Case #2: 256
Case #3: 4
Case #4: 674
Case #5: 461
	 * 
	 */
}
