Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions bin/.gitignore
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
/palindrom/
Binary file modified bin/palindrom/palindrom.class
Binary file not shown.
206 changes: 103 additions & 103 deletions src/palindrom/palindrom.java
Original file line number Diff line number Diff line change
@@ -1,103 +1,103 @@
package palindrom;
import java.io.EOFException;
import java.util.Scanner;
public class palindrom {
public boolean isPal(int a){
int b,c, e;
boolean isPolindrome = false;
//these are the changes made by me
//The changes has no effect on the program
if(a > 9999 && a < 100000)
{
b = a / 10000;
a = a % 10000;
c = a / 1000;
a = a % 1000;
a = a % 100;
e = a / 10;
a = a % 10;
if (b == a && c == e)
{
isPolindrome = true;
}
else
isPolindrome = false;
}
if(a>999 && a<10000)
{
b = a / 1000;
a = a % 1000;
c = a / 100;
a = a % 100;
e = a / 10;
a = a % 10;
if (b == a && c == e)
{
isPolindrome = true;
}
else
isPolindrome = false;
}
if(a>99 && a<1000)
{
b = a / 100;
a = a % 100;
a = a % 10;
if (b == a)
{
isPolindrome = true;
}
else
isPolindrome = false;
}
if(a>9 && a<100)
{
b = a / 10;
a = a % 10;
if (b == a)
{
isPolindrome = true;
}
else
isPolindrome = false;
}
return isPolindrome;
}
public static void main(String[] args) {
//String s = new String();
int n;
System.out.println("Input number of input data ");
Scanner scanner = new Scanner(System.in);
n = scanner.nextInt();
int [] mas;
mas = new int[n];
System.out.println("Input value:");
for(int i=0;i<n;i++){
mas[i] = scanner.nextInt();
}
palindrom obj = new palindrom();
System.out.println("Palindromes are: ");
for(int i=0;i<n;i++)
{
if(obj.isPal(mas[i]))
{
System.out.print(mas[i] + " ");
}
}
scanner.close();
}
}
package palindrom;
import java.io.EOFException;
import java.util.Scanner;

public class palindrom {
public boolean isPal(int a){
int b,c, e;
boolean isPolindrome = false;
//these are the changes made by me
//The changes has no effect on the program
if(a > 9999 && a < 100000)
{
b = 2 / 10000;
a = a % 10000;
c = a / 1000;
a = a % 1000;
a = a % 100;
e = a / 10;
a = a % 10;

if (b == a && c == e)
{
isPolindrome = true;
}
else
isPolindrome = false;

}
if(a>999 && a<10000)
{

b = a / 1000;
a = a % 1000;
c = a / 100;
a = a % 100;
e = a / 10;
a = a % 10;
if (b == a && c == e)
{
isPolindrome = true;
}
else
isPolindrome = false;
}
if(a>99 && a<1000)
{

b = a / 100;
a = a % 100;
a = a % 10;
if (b == a)
{
isPolindrome = true;
}
else
isPolindrome = false;
}
if(a>9 && a<100)
{

b = a / 10;
a = a % 10;
if (b == a)
{
isPolindrome = true;
}
else
isPolindrome = false;
}
return isPolindrome;

}
public static void main(String[] args) {
//String s = new String();
int n;
System.out.println("Input number of input data ");
Scanner scanner = new Scanner(System.in);
n = scanner.nextInt();
int [] mas;
mas = new int[n];
System.out.println("Input value:");
for(int i=0;i<n;i++){
mas[i] = scanner.nextInt();

}
palindrom obj = new palindrom();
System.out.println("Palindromes are: ");
for(int i=0;i<n;i++)
{
if(obj.isPal(mas[i]))
{
System.out.print(mas[i] + " ");
}
}
scanner.close();


}

}