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: Accepted)

#include<stdio.h>
#include<string.h>
int main(void)
{
  int a,b;
  int cnt=0;
  char suji[6];
  char tmp[4];
  int len,center,flg;
  
  scanf("%d %d",&a,&b);
  for(int i=a;i<=b;i++){
    flg=0;
    sprintf(suji,"%d",i);
    len=strlen(suji);
    if(len%2==0){
      center=len/2;
    }else{
      center=len/2+1;
    }
    for(int j=0;j<center;j++){
      if(suji[j]!=suji[len-j-1]){
        flg=1;
        break;
      }
    }
    if(flg==0){
      cnt++;
    }
  }
  printf("%d\n",cnt);
  return 0;
}