CT536

Gardener Counts the tokens

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The dispatch writer Gardener has been asked to reorganize the archive shelves. On the desk lies a long table of tokens readings. Task: Print n in binary (no leading zeros; for n=0 print 0). Input format: One line with a single integer n. Output format: Print the binary representation. Constraints: 0 <= n <= 1000000.

Example 1:

Input: 228058
Output: 110111101011011010

Example 2:

Input: 502283
Output: 1111010101000001011

Example 3:

Input: 74041
Output: 10010000100111001

Constraints:

0 <= n <= 1000000.

Loading...
Test Cases:No test cases
No test cases available.