cf339div2B

最新推荐文章于 2023-12-18 22:46:22 发布

xgogoforit

最新推荐文章于 2023-12-18 22:46:22 发布

阅读量422

点赞数

分类专栏： codeforces

本文链接：https://blog.csdn.net/xgogoforit/article/details/50537196

版权

codeforces 专栏收录该内容

24 篇文章 0 订阅

订阅专栏

题目连接：

http://codeforces.com/contest/614/problem/B

Description

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.

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

Output

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

Sample Input

3
5 10 1

Sample Output

Hint

In sample 1 numbers 10 and 1 are beautiful, number 5 is not not.

题意

只有一个不美丽数，找打这个数，并输出，然后接上10^n,n为其他数中的0的个数。
若其中出现0，则整个乘积为0.

代码

#include<bits/stdc++.h> 
using namespace std;
string tr;
string zan;
int num=0;
int main(int argc, char const *argv[])
{
    int n;
    cin>>n;
    for (int i = 0; i < n; ++i)
    {   int ans=0,flag=0;
        cin>>zan;
        if (zan=="0")
        {   
            printf("0\n");
            return 0;
        }
        for (int j = 0; j < zan.size(); ++j)
        {
            if (zan[j]!='0'&&zan[j]!='1')
            {
                flag=1;
            }
            if (zan[j]=='1')
            {
                ans++;
            }
        }
        if (ans>1||flag==1)
        {
            tr=zan;
        }
        else{ 
        num=num+zan.size()-1;
        } 
    }
    if(tr.size()){
    cout<<tr;}
    else
    {printf("1");}
        for (int i = 0; i < num; ++i)
    {
        printf("0");
    }
    return 0;
}