Codeforces Round #339 (Div. 2) B. Gena's Code

最新推荐文章于 2018-08-11 09:46:55 发布

qq1319479809

最新推荐文章于 2018-08-11 09:46:55 发布

阅读量329

点赞数

CC 4.0 BY-SA版权

分类专栏： Codeforces ACM 文章标签： ACM codeforces

本文链接：https://blog.youkuaiyun.com/qq1319479809/article/details/50526250

ACM 同时被 2 个专栏收录

121 篇文章

订阅专栏

Codeforces

44 篇文章

订阅专栏

本文介绍了一道编程题目，要求验证一个名为Great Gena's Code的程序，该程序用于计算不同国家贡献到游戏中的坦克数量的产品值。文章中包含了问题描述、输入输出示例及代码实现。

摘要生成于 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 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 aiwithout 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 test(s)
 
     input
   
3
5 10 1

     output
   
50

     input
   
4
1 1 10 11

     output
   
110

     input
   
5
0 3 1 100 1

     output
   
0

Note

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 或者1后面为全为0

至少有n-1个beautiful数

输出所数的乘积

题解

只要找到有没有不是美丽数

其它记录1后面一共有多少个0

输出 不是美丽数（没有输出1）

输出0的个数

#include
   
    
#include
    
     
#include
     
      
#include
      
       
#include
       
        
using namespace std;
const int N=200005;
char a[N];
char b[N];
int main()
{
    int n,i,j,flag=0,k=0,temp=1,kk=1,ans=0;
    scanf("%d",&n);
    for(i=0; i