CodeForces 614B Gena's Code

CodeForces 614B Gena’s Code

---

Time Limit:500MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

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

Input

3
5 10 1

Output

50

Input

4
1 1 10 11

Output

110

Input

5
0 3 1 100 1

Output

0

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.

---

题目在这题目链接

---

分类讨论下是否出现过非beautiful的数（如果出现最多一次），其他数为（0，1，10，100，1000，10000……），统计出现过的（10，100，1000……）的乘积有几位0，即统计1后面共出现了多少0

• 如果出现过0 输出0 ，
• 如果没出现过0，出现过非beautiful数，则输出非beautiful数，后面输出统计的0的个数。
• 如果没出现过0，也没现过非beautiful数，则输出1，后面输出统计的0的个数。

---

代码：

#include<stdio.h>
#include<string.h>
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        char temp[100005];
        long long ling=0;
        char nb[100005];
        int havenb=0;
        int hp=0;
        int is0=0;
        while(n--)
        {
            scanf("%s",temp);
            if(strlen(temp)==1)
            {
                if(temp[0]=='0')
                {
                    is0=1;
                    hp=1;
                }
                else if(temp[0]!='1')
                {
                    strcpy(nb,temp);
                    havenb=1;
                }
            }
            else
            {
                int yi=0;
                int isb=1;
                for(int i=0; i<strlen(temp); i++)
                {
                    if(temp[i]!='0'&&temp[i]!='1')
                    {
                        isb=0;
                    }
                    else if(temp[i]=='1')
                    {
                        yi++;
                    }
                }
                if(isb==0||yi>1)
                {
                    havenb=1;
                    strcpy(nb,temp);
                }
                else
                {
                    ling+=(strlen(temp)-1);
                }
            }
        }
        if(havenb==1&&hp==0)
        {
            printf("%s",nb);
            for(long long i=0; i<ling; i++)
            {
                printf("0");
            }
            hp=1;
            putchar('\n');
        }
        else if(hp==0)
        {
            printf("1");
            for(long long i=0; i<ling; i++)
            {
                printf("0");
            }
            putchar('\n');
        }
        if(is0==1)
            printf("0\n");
    }
    return 0;
}