codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

188F.md (580B)


      1 Source: https://codeforces.com/problemset/problem/188/F
      2 
      3 F. Binary Notation
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 You are given a positive integer *n*. Output its binary notation.
     22 
     23 Input
     24 
     25 The only line of input data contains an integer *n* (1 ≤ *n* ≤ 106).
     26 
     27 Output
     28 
     29 Output the binary notation of *n* (without any leading zeros).
     30 
     31 Examples
     32 
     33 Input
     34 
     35 ```
     36 5
     37 ```
     38 
     39 Output
     40 
     41 ```
     42 101
     43 ```
     44 
     45 Input
     46 
     47 ```
     48 101
     49 ```
     50 
     51 Output
     52 
     53 ```
     54 1100101
     55 ```
     56 
     57 Note
     58 
     59 In the first example 5 = 1 * 22 + 0 * 21 + 1 * 20.