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 num[5];
  int a=0, b=0;
  int i=0, j=0, n=0, cnt=0;

  scanf("%d %d", &a, &b);

  for(i=a; i<=b; i++){
    n=i;
    for(j=0; j<5; j++){
      num[j]=n%10;
      // printf("num[%d]:%d", j, num[j]);
      n=n/10;
    }
    if(num[0]==num[1] && num[1]==num[3] && num[3]==num[4])
      cnt++;
    //printf("cnt:%d\n", cnt);
    //printf("\n");
  }

  printf("%d\n", cnt);

  return 0;
}