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 <stdbool.h>

#define ARRAY_MAX 5

void solve(int a, int b);
bool isPalindromicNumber(int n);


int main()
{
  int a, b;

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

  return 0;
}

void solve(int a, int b)
{
  int counter = 0;
  
  for (int i = a; i <= b; i++)
    {
      if (isPalindromicNumber(i))
	{
	  counter++;
	}
    }
  printf("%d\n", counter);
}


bool isPalindromicNumber(int n)
{
  int tempArray[ARRAY_MAX];
  int rest;
  int index = 0;

  bool flag;
  int len;

  rest = n;
  while (rest > 0)
    {
      tempArray[index] = rest % 10;
      rest = rest / 10;
      index++;
    }

  len = index;
  flag = true;
  for (int i = 0; i < len / 2; i++)
    {
      if (tempArray[i] != tempArray[len - i - 1])
	{
	  flag = false;
	  break;
	}
    }

  return flag;
}