تمرين برمجة جافا بسيط | palindromic prime using java | مع شرح فيديو

(Palindromic prime) A palindromic prime is a prime number and also palindromic.

For example, 131 is a prime and also a palindromic prime, as are 313 and

757. Write a program that displays the first 100 palindromic prime numbers. Display

10 numbers per line, separated by exactly one space, as follows:

2 3 5 7 11 101 131 151 181 191

313 353 373 383 727 757 787 797 919 929

/*(Palindrome number) Write a program that prompts the user to enter a three-digit
integer and determines whether it is a palindrome number. A number is palindrome if it reads the same from right to left and from left to right.*/
		
Scanner input = new Scanner(System.in);
		 
System.out.print("Enter a three-digit integer:");
int number = input.nextInt();
		 
// Extracting digits
int first = number / 100;
int last = number % 10;
if (last == first) {
   System.out.print(number + " is a palindrome");
} 
else {
   System.out.print(number + " is not a palindrome");
}

وهنا شرح الكود كامل بالفيديو: