Problem:
Score : 200 points

Problem Statement

Find the number of palindromic numbers among the integers between A and B (inclusive).
Here, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.

Constraints

10000 \leq A \leq B \leq 99999

All input values are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the number of palindromic numbers among the integers between A and B (inclusive).

Sample Input 1

11009 11332

Sample Output 1

4

There are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.

Sample Input 2

31415 92653

Sample Output 2

612

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>

int main(void)
{
  int a,b;
  int a_345=0;
  int b_345=0;
  scanf("%d %d",&a,&b);

  a_345 = a/100;
  b_345 = b/100;

//  printf("%d %d %d %d ",a/1000,a-a_345*100,b/1000,b-b_345*100);

  if((a/1000 < a-a_345*100) && (b/1000 < b-b_345*100)){
    printf("%d",b_345-a_345);
  }else if((a/1000 > a-a_345*100) && (b/1000 < b-b_345*100)){
    printf("%d",b_345-a_345+1);
  }else if((a/1000 < a-a_345*100) && (b/1000 > b-b_345*100)){
    printf("%d",b_345-a_345-1);
  }else if((a/1000 > a-a_345*100) && (b/1000 > b-b_345*100)){
    printf("%d",b_345-a_345);
  }
    return 0;

}