## OR-deal

View as PDF

Points: 5 (partial)
Time limit: 0.5s
Memory limit: 64M

Authors:
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

One of ButaneBot's intended functions is to perform an OR-sum on a large range of numbers. More specifically, ButaneBot should be able to read in a number , compute , and output that number in base 2. However, whenever ButaneBot tries to execute his OR-sum function, he malfunctions and explodes. Can you help ButaneBot by recoding this function?

Reminder: A bitwise OR takes two bit patterns of equal length and performs the logical inclusive OR operation on each pair of corresponding bits. The result in each position is if both bits are , while otherwise the result is .

For example

0101 (decimal 5)
OR 0011 (decimal 3)
= 0111 (decimal 7)

#### Input Specification

The only line of input will contain a single integer .

#### Output Specification

Output the OR-sum from to as a binary number.

1

1

#### Explanation for Sample Output

The OR-sum from to is simply . in binary is once again .

Note: The input will overflow an integer in some languages.