Preparando MOJI

Binary Notation

2000ms 262144K

Description:

You are given a positive integer n. Output its binary notation.

Input:

The only line of input data contains an integer n (1 ≤ n ≤ 106).

Output:

Output the binary notation of n (without any leading zeros).

Sample Input:

5

Sample Output:

101

Sample Input:

101

Sample Output:

1100101

Note:

In the first example 5 = 1 * 22 + 0 * 21 + 1 * 20.

Informação

Codeforces

Provedor Codeforces

Código CF188F

Tags

*specialimplementation

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:37:14

Relacionados

Nada ainda