Gena's Code

题意翻译

#### 题目描述 给定 $n$ 个整数 $a_1, a_2, a_3,..., a_n$，求它们的乘积（保证有且仅有一个数 $a_i$ 满足 $\log_{10}a_i$ 不为整数）。 #### 输入格式 第一行输入一个整数 $n(1\le n\le 100000)$。第二行输入 $n$ 个非负整数 $a_1, a_2, a_3,..., a_n$（保证 $a_i$ 的位数不超过 $10^5$ 位）。 #### 输出格式 输出一个没有前导零的整数，表示 $a_1\times a_2\times a_3\times ...\times a_n$ 的结果。 #### 说明 第一个样例中，$5\times 10\times 1 = 50$。 第二个样例中，$1\times 1\times 10\times 11 = 110$。 第三个样例中，由于 $0$ 的出现，乘积为 $0$。

题目描述

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 $ 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. 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 $ a_{i} $ 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.

题意翻译

#### 题目描述 给定 $n$ 个整数 $a_1, a_2, a_3,..., a_n$，求它们的乘积（保证有且仅有一个数 $a_i$ 满足 $\log_{10}a_i$ 不为整数）。 #### 输入格式 第一行输入一个整数 $n(1\le n\le 100000)$。第二行输入 $n$ 个非负整数 $a_1, a_2, a_3,..., a_n$（保证 $a_i$ 的位数不超过 $10^5$ 位）。 #### 输出格式 输出一个没有前导零的整数，表示 $a_1\times a_2\times a_3\times ...\times a_n$ 的结果。 #### 说明 第一个样例中，$5\times 10\times 1 = 50$。 第二个样例中，$1\times 1\times 10\times 11 = 110$。 第三个样例中，由于 $0$ 的出现，乘积为 $0$。