/*
 * 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 com.google.codejam.qualification.recycled;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;

public class RecycledNumbers {
   private static final List<Case> cases = new ArrayList<Case>();

   public static void main(String[] args) throws NumberFormatException, IOException {
      // String file = "src/resources/C-example";
      String file = "src/resources/C-small-attempt0";
      // String file = "src/resources/C-large";
      readInFile(file + ".in");
      FileWriter fstream = new FileWriter(file + ".out");
      BufferedWriter out = new BufferedWriter(fstream);

      for (int i = 0; i < cases.size(); i++) {
         String msg = "Case #" + (i + 1) + ": " + cases.get(i).getResult() + "\n";
         out.write(msg);
         System.out.print(msg);
      }
      out.close();

   }

   protected static void readInFile(String path) throws NumberFormatException, IOException {
      DataInputStream in = new DataInputStream(new FileInputStream(path));
      BufferedReader br = new BufferedReader(new InputStreamReader(in));
      int lines = Integer.parseInt(br.readLine());
      for (int i = 0; i < lines; i++) {
         cases.add(new Case(br.readLine()));
      }
      in.close();
   }
}

class Case {
   int A, B;

   public Case(String line) {
      StringTokenizer tokenizer = new StringTokenizer(line);
      A = Integer.parseInt(tokenizer.nextToken());
      B = Integer.parseInt(tokenizer.nextToken());
   }

   protected int getResult() {
      int ctr = 0;
      System.out.print("\\b[--");
      for (int i = A; i < B; i++) {
         for (int j = i + 1; j <= B; j++) {
            if (isRecycledPair(String.valueOf(i), String.valueOf(j))) {
               ctr += 1;
            }
         }

      }
      return ctr;
   }

   boolean isRecycledPair(String n, String m) {
      if (n.length() != m.length()) {
         return false;
      }

      char[] narr = n.toCharArray();
      Arrays.sort(narr);
      char[] marr = m.toCharArray();
      Arrays.sort(marr);
      if (!new String(narr).equals(new String(marr))) {
         return false;
      }

      for (int displacement = 1; displacement < n.length(); displacement++) {
         boolean recycled = true;
         for (int i = 0; i < n.length(); i++) {
            if (n.charAt(i) != m.charAt(mod(i + displacement, n.length()))) {
               recycled = false;
               break;
            }
         }
         if (recycled) {
            // System.out.println("   " + n + " -> " + m + " : " + displacement);
            return true;
         }
      }

      return false;
   }

   protected static int mod(int a, int b) {
      int r = a % b;
      if (r < 0) {
         r += b;
      }
      return r;
   }
}
