codeforces-scrape

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

614B.md (2189B)


      1 Source: https://codeforces.com/problemset/problem/614/B
      2 
      3 B. Gena's Code
      4 
      5 time limit per test
      6 
      7 0.5 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 It's the year 4527 and the tanks game that we all know and love still exists. There also exists Great Gena's code, written in 2016. The problem this code solves is: given the number of tanks that go into the battle from each country, find their product. If it is turns to be too large, then the servers might have not enough time to assign tanks into teams and the whole game will collapse!
     22 
     23 There are exactly *n* distinct countries in the world and the *i*-th country added *a**i* tanks to the game. As the developers of the game are perfectionists, the number of tanks from each country is beautiful. A beautiful number, according to the developers, is such number that its decimal representation consists only of digits '1' and '0', moreover it contains at most one digit '1'. However, due to complaints from players, some number of tanks of one country was removed from the game, hence the number of tanks of this country may not remain beautiful.
     24 
     25 Your task is to write the program that solves exactly the same problem in order to verify Gena's code correctness. Just in case.
     26 
     27 Input
     28 
     29 The first line of the input contains the number of countries *n* (1 ≤ *n* ≤ 100 000). The second line contains *n* non-negative integers *a**i* without leading zeroes — the number of tanks of the *i*-th country.
     30 
     31 It is guaranteed that the second line contains at least *n* - 1 beautiful numbers and the total length of all these number's representations doesn't exceed 100 000.
     32 
     33 Output
     34 
     35 Print a single number without leading zeroes — the product of the number of tanks presented by each country.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 3  
     43 5 10 1
     44 ```
     45 
     46 Output
     47 
     48 ```
     49 50
     50 ```
     51 
     52 Input
     53 
     54 ```
     55 4  
     56 1 1 10 11
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 110
     63 ```
     64 
     65 Input
     66 
     67 ```
     68 5  
     69 0 3 1 100 1
     70 ```
     71 
     72 Output
     73 
     74 ```
     75 0
     76 ```
     77 
     78 Note
     79 
     80 In sample 1 numbers 10 and 1 are beautiful, number 5 is not not.
     81 
     82 In sample 2 number 11 is not beautiful (contains two '1's), all others are beautiful.
     83 
     84 In sample 3 number 3 is not beautiful, all others are beautiful.