@@ -0,0 +1,1137 @@
+package year2013;%0A%0Aimport java.util.Scanner;%0A%0A/**%0A * %3Ch3%3EPalindrome%3C/h3%3E%0A * %3Cp%3EA palindrome is a word that is the same forward as backward:%0A * %22mom%22 and %22bib%22 are examples. Positive integers can be palindromic.%0A * For example the numbers 3, 484, 12621, and 458854 are all palindromic.%0A * How many palindromic integers are there between x and y inclusive%0A * given that x will be %3E 0 and y will be %3C= 1,000,000?%3C/p%3E%0A *%0A * @author John Cameron%0A * @see %3Ca href=%22https://www.seminolestate.edu/computers/competition/samples/2013%22%3EProblem Descrption and Requirements%3C/a%3E%0A */%0Apublic class Palindrome %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A%0A        Scanner scanner = new Scanner(System.in);%0A%0A        int x = scanner.nextInt();%0A        int y = scanner.nextInt();%0A%0A        scanner.close();%0A%0A        int count = 0;%0A%0A        for (int i = x; i %3C= y; i++) %7B%0A%0A            if (isPalindrome(String.valueOf(i))) %7B%0A%0A                count++;%0A%0A            %7D%0A%0A        %7D%0A%0A        System.out.println(count);%0A%0A    %7D%0A%0A    private static boolean isPalindrome(String str) %7B%0A%0A        return new StringBuilder(str).reverse().toString().equals(str);%0A%0A    %7D%0A%0A%7D%0A

Add Palindrome (2013) solution