/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.File;
import java.io.FileInputStream;
import java.util.Scanner;

/**
 *
 * @author imgps
 */
public class C {
    public static void main(String args[]) throws Exception{
        int A,B;
        int ctr = 0;
        int testCases;
        
        Scanner sc = new Scanner(new FileInputStream("C-small-attempt0.in "));
        testCases = sc.nextInt();
        int input[][] = new int[testCases][2];
        for(int i=0;i<testCases;i++)
        {
          //  System.out.print("Enter input A B: ");
            input[i][0] = sc.nextInt();
            input[i][1] = sc.nextInt();
            
        }
  

for(int k=0;k<testCases;k++){
      ctr = 0;
      A = input[k][0];
      B = input[k][1];
        for(int i = A;i<=B;i++){
            int num = i;
            int nMul = 1;
            int mul = 1; 
            int tnum = num/10;
            while(tnum > 0){
                mul = mul *10;
                tnum= tnum/10;
            }
            tnum = num;
            int n = 0;
            while(tnum > 0 && mul >= 10){
                nMul = nMul * 10;
                n = (num % nMul) * mul + (num / nMul);
                mul = mul / 10;
                tnum = tnum / 10;
                for(int m=num;m<=B;m++){
                    
                    if(n == m && m > num){
                        ctr++;
                    }
                }
                
                
                
         
            }
        }
        System.out.println("Case #"+(k+1)+": "+ctr);
        
    }
    }
}

package fr.lcwi.googlecodejam;

import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * For Google Code Jam 2012
 */
public class ProblemC {

    private static Scanner scanner;
    private static int nbCases;

    public static void main(String[] args) throws IOException {
        String filename = args[0];
        scanner = new Scanner(ProblemC.class.getClassLoader().getResourceAsStream(filename + ".in"));

        nbCases = Integer.valueOf(scanner.nextLine());

        BufferedWriter bWriter = null;
        try {
            bWriter = new BufferedWriter(new FileWriter(filename + ".out"));
            for (int i = 1; i <= nbCases; i++) {
                resolveCase(i, bWriter);
            }
        } finally {
            if (bWriter != null) {
                bWriter.close();
            }
        }
    }

    private static void resolveCase(int caseNb, BufferedWriter bWriter) throws IOException {
        int A = scanner.nextInt();
        int B = scanner.nextInt();

        int result = 0;

        for (int n = A; n < B; n++) {
            Set<Integer> ms = new HashSet<Integer>();
            int length = (int) Math.floor(Math.log10(n)) + 1;

            if (length > 1) {
                for (int i = 0; i < length - 1; i++) {
                    int puissanceA = (int) Math.pow(10, length - i - 1);
                    int puissanceB = (int) Math.pow(10, i + 1);
                    int digitsToMove = n % puissanceB;
                    int ma = digitsToMove * puissanceA;
                    if (ma >= puissanceB) {
                        int mb = n / puissanceB;
                        int m = ma + mb;
                        if (n < m && m < B+1 && !ms.contains(m)) {
                            result++;
                            ms.add(m);
                        }
                    }
                }
            }
        }

        bWriter.write("Case #" + caseNb + ": " + result);
        if (caseNb < nbCases) {
            bWriter.newLine();
        }
    }
}
