Binary representation of a number is palindrome or not?

Question

Write a full program to find whether the binary representation of a number is palindrome or not?

Sample Input
5

Sample Output
YES

Print YES if binary representation is palindrome and NO otherwise.

Answer 1

Python - 46 chars

n=bin(input())[2:]
print'YNEOS'[n!=n[::-1]::2]

Answer 2

Golfscript -- 22 chars

~2base.-1%="YES""NO"if

Answer 3

Vyxal, 85 bits^v1, 10.625 bytes

-6 bits thanks to @lyxal

-3 bits thanks to @the-thonnu

bḂ≠`∨ȯno`½iN

Try it Online!

b            # binary of input
 Ḃ≠          # is not equal to its reverse (essentially: is not a palindrome?)
   `∨ȯno`    # compressed string `yesno`
         ½   # split into two strings of equal length
          i  # index that inequality (0/1) into that
           N # case swapped to uppercase

Answer 4

Ruby, 41 39

$><<%w(YES NO)[(n="%b"%$*)<=>n.reverse]

Thanks to Michael Kohl's "%b"%gets trick.

Answer 5

C 84 81 74 Characters

r;main(v,x){for(scanf("%d",&v),x=v;v;v/=2)r=r*2|v&1;puts(r-x?"NO":"YES");}

It does not use any function like string reverse.

Answer 6

Javascript - 79 77 chars

alert((a=(prompt()*1).toString(2))-a.split("").reverse().join("")?"NO":"YES")

More information

prompt()*1 : Quick trick to convert string to number.

.toString(2) : That's how you convert to binary in javascript.

a.split("").reverse().join("") : There is no native support to reverse string, so you have to convert string to array and array to string.

("[part1]" - "[part 2]")?"YES":"NO" : - is a replacement for != to save 1 char.

Answer 7

PHP - 41

<?=strrev($n=decbin(`cat`))==$n?@YES:@NO;

Test:

php 713.php <<< 5
YES
php 713.php <<< 6
NO

Answer 8

Perl, 45 characters

$_=sprintf'%b',shift;
print reverse==$_?YES:NO

Answer 9

Ruby, 43 characters

puts((n="%b"%gets)==n.reverse ? "YES":"NO")

Answer 10

Windows PowerShell, 67

('NO','YES')[($a=[Convert]::ToString("$input",2))-eq-join$a[64..0]]

Answer 11

05AB1E, 17 12 bytes

‘NO…Ü‘#EbÂQè

-5 bytes thanks to Adnan.

Try it online!

Answer 12

JavaScript, 75 bytes 69 bytes

alert((a=[...(+prompt()).toString(2)]).some(x=>x-a.pop())?"NO":"YES")

Try it online!

A different approach from HoLyVieR's solution

Explanation

+prompt() : Converts string to number

[...s] : converts a string s to an array of chars

.some((x) => x - a.pop()) : checks whether there is one element in the array that does not equal the last element of the array

Edit

69 chars, thanks to the suggestions by Shaggy

Answer 13

Arturo, 47 bytes

print(=reverse<=as.binary do arg\0)?->'YES->'NO

Answer 14

Python (51)

n=bin(input())[2:]
print'YES'if n==n[::-1]else'NO'

Answer 15

Perl (73)

No string reverse:

print f(split//,sprintf'%b',shift);
sub f{@_<=1?YES:shift!=pop()?NO:f(@_)}

Answer 16

Perl (127)

This one constructs all palindromes up to 2^32.

sub f{
    my($x,$l)=@_;
    $l+=2,f(($x<<$_)+1+(1<<$l-1),$l)?return 1:0 for 1..15-$l/2;
    $x-$ARGV[0]?0:1
}
print f(0,1)+f(0,0)+f(1,1)?YES:NO

Answer 17

Bash, 55 chars

C=`dc<<<$1\ 2op`;[ $C = `rev<<<$C` ]&&echo YES||echo NO

Answer 18

J - 33 characters

13 : ';(]-:|.)#:y{''YES'';''NO'''

Answer 19

J: 24

((-:|.)#:x){2 3$'NO YES'

eg:

   ((-:|.)#:5){2 3$'NO YES'
YES
   ((-:|.)#:12){2 3$'NO YES'
NO
   ((-:|.)#:125){2 3$'NO YES'
NO
   ((-:|.)#:63){2 3$'NO YES'
YES

Answer 20

Haskell (79)

0?k=n;n?k=div n 2?(n`mod`2+k*2);f x|x==x?0="YES"|True="No";main=interact$f.read

Answer 21

C (77 bytes)

r,t;main(n){for(t=n=atoi(gets(&n));n;r*=2,r|=n%2,n/=2);puts(r-t?"NO":"YES");}

TEST

Answer 22

Pyth, 18 bytes

%2>"YNEOS"!qJ.BQ_J

Also 18 bytes:

@,"NO""YES"qJ.BQ_J

Answer 23

PHP, not competing

I wanted to do it without using strings at all.

iterative solution, 78 bytes

for($x=log($n=$argv[1],2);$i<$x&($n>>$i^$n>>$x-$i^1);$i++);echo$i<$x/2?NO:YES;

recursive solution, 113 bytes

function p($n,$x=0){return$n<2?$n:is_pal(($n&(1<<$x=log($n,2)/2)-1)^$n>>$x+!is_int($x));}echo p($argv[1])?YES:NO;

If n is a binary palindrome, the upper half xor the lower half is also a binary palindrome and vice versa.

---

a port of the excellent C answer from fR0DDY, 58 bytes

for($x=2*$v=$argv[1];$x/=2;$r=$r*2|$x&1);echo$r-$v?NO:YES;

a binary reverse. Columbus´ egg.

Answer 24

Jelly, 12 bytes (non-competing)

BṚ⁼Bị“YES“NO

Try it online!

Explanation:

BṚ⁼Bị“YES“NO Main link. Arguments: z.
B            Binary representation of z.
 Ṛ           Reversed.
   B         Binary representation of z.
  ⁼          Check if x is equal to y.
     “YES“NO [['Y', 'E', 'S'], ['N', 'O']]
    ị        xth element of y (1-indexed).

Before printing, Python's str function is mapped through a list, and then the elements are concatenated, so you see YES or NO.

Answer 25

Wolfram Language (Mathematica), 46 bytes

If[PalindromeQ@IntegerDigits[#,2],"YES","NO"]&

Try it online!

Answer 26

Arn, 16 bytes

±î«Áýãf©¯tvf–ɉ2

Try it!

Explained

Unpacked: "YES"^(=\|:;b)||"NO. Man that yes/no required output really killed my byte count

    "YES"         String
  ^               Repeated
    (             Begin expression
        \         Fold with...
      =           ...equality
          |:      Bifurcate
              _   Variable initialized to STDIN; implied
            ;b    Binary representation
    )             End expression
||                Boolean OR
  "NO             String, ending quote implied

This works because empty strings are falsey.

Answer 27

Pyth, 16 bytes

?q_K.BQK"YES""NO

Try it online!

?q_K.BQK"YES""NO
   K.BQ          // Assign binary input to K
?q_K   K         // Evaluate whether K and reversed K are equal
        "YES""NO // Ternary output.

Answer 28

APL (Dyalog Unicode), 23 bytes (SBCS)

'NO' 'YES'⊃⍨≡∘⌽⍨2⊥⍣¯1⊢⎕

-3 bytes from Bubbler, after fitting the question requirements.

Instead of performing an if-else like below, this program uses APL's representation of true as 1 and false as 0 to select from an array, where 'NO' is in the 0th index and 'YES' is in the first index.

Try it online!

APL (Dyalog Unicode), 26 bytes (SBCS)

{(⌽≡⊢)2(⊥⍣¯1)⍵:'YES'⋄'NO'}

Explanation

{(⌽≡⊢)2(⊥⍣¯1)⍵:'YES'⋄'NO'}
{                        } function wrapper
             ⍵             take the right argument
      2(⊥⍣¯1)              convert to base 2, and split into -1 groups(gets all digits)
 (⌽≡⊢)                     reverse equals right expression?
              :'YES'⋄'NO'} if the above is true, display 'YES', otherwise 'NO'

Try it online!

Answer 29

Retina, 80 78 bytes

Byte count assumes ISO 8859-1 encoding.

.+
$*
+`(1+)\1
${1}0
01
1
^((.)*?).??((?<-2>.)*$)
$1¶$3
O$^`.(?=.*¶)

^(.*)¶\1

Try it online

Convert to unary. Convert that to binary. Cut the number in half and remove a middle digit if there is one. Reverse the first half. Match if both halves are equal.

Answer 30

Japt, 13 bytes

¢è¬?`y`u:"NO

Try it