It's the year 4527 and the tanks game that we all know and love still exists. There also exists Grea

最新推荐文章于 2019-05-30 09:08:00 发布

PIANKEzzc

最新推荐文章于 2019-05-30 09:08:00 发布

阅读量8.6k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/PIANKEzzc/article/details/51981795

在4527年，经典的坦克大战游戏依然盛行。本篇介绍了一款由Great Gena于2016年编写的代码，该代码旨在解决一个有趣的问题：计算来自不同国家参赛坦克数量的乘积，确保服务器能够快速分配队伍，避免游戏崩溃。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Input

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_iwithout 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 100 000.

Output

Print a single number without leading zeroes — the product of the number of tanks presented by each country.

Sample Input

Input

3
5 10 1

Output

Input

4
1 1 10 11

Output

Input

5
0 3 1 100 1

Output

Hint

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.

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;

int pow(string fu);
int main()
{
int n, i, num;
int flag=1 ,fuk=1;
string fu, zi;
int sum=0;
cin>>n;
for(i=0; i<n; i++)
{
cin>>fu;
if(fu == "0")
fuk = 0;
num = pow(fu);
if(num == -1) { zi = fu; flag=0;}
if(num >=0) sum += num;
}
if(flag) zi = "1"; ///考虑全是1的情况;
if(fuk == 0) cout<<0<<endl;
else
{
cout<<zi;
for(i=0; i<sum; i++) cout<<0;
cout<<endl;
}

}
int pow(string fu)
{
int one=0, zero=0;
int i;
for(i=0; i<fu.size(); i++)
{
if(fu[i] != '0' && fu[i] != '1') return -1;
if(fu[i] == '1') one++;
if(one>1) return -1;
if(fu[i] == '0') zero++;
}
return zero;
}