CF614B.Gena's Code
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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!
There are exactly n distinct countries in the world and the i -th country added ai 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.
Your task is to write the program that solves exactly the same problem in order to verify Gena's code correctness. Just in case.
输入格式
The first line of the input contains the number of countries n ( 1<=n<=100000 ). The second line contains n non-negative integers ai without leading zeroes — the number of tanks of the i -th country.
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 100000 .
输出格式
Print a single number without leading zeroes — the product of the number of tanks presented by each country.
输入输出样例
输入#1
3 5 10 1
输出#1
50
输入#2
4 1 1 10 11
输出#2
110
输入#3
5 0 3 1 100 1
输出#3
0
说明/提示
In sample 1 numbers 10 and 1 are beautiful, number 5 is not not.
In sample 2 number 11 is not beautiful (contains two '1's), all others are beautiful.
In sample 3 number 3 is not beautiful, all others are beautiful.