codeforces 614 B Gena's Code

最新推荐文章于 2021-06-26 15:19:56 发布

阑珊灬回忆

最新推荐文章于 2021-06-26 15:19:56 发布

阅读量444

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/haoliang94/article/details/50635928

ACM 专栏收录该内容

51 篇文章

订阅专栏

本文解决了一个关于美丽数乘法的问题。美丽数是指仅由'1'和'0'组成，最多包含一个'1'的数字。文章通过实例解释了如何找出并处理唯一不符合此条件的美丽数，最终计算所有国家提供的坦克数量的乘积。重点在于优化算法以避免超时，提供了解决类似问题的策略。

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

因为工作太忙，好久没刷题了。今天刷题错成狗。。。无奈。。真的手生了

这道题就是让你把所有的数乘起来。美丽数的定义是像0,1,10,100,1000这样的数

且这道题只有一个不是美丽数

所有只需要把这道题后缀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 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.

#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#define esp 1e-6
#define inf 0x0f0f0f0f
#define LL long long  
using namespace std;

/************************************************ 
 
Desiner:hl 
time:2016/02/04 
Exe.Time:30 ms
Exe.Memory:1900 KB 

题目链接：http://codeforces.com/contest/614/problem/B 

题意：这道题就是让你把所有的数乘起来。美丽数的定义是像0,1,10,100,1000这样的数


题解：且这道题只有一个不是美丽数
所有只需要把这道题后缀0统计出来输出就好了
但是这道题非常容易超时。加了一个优化以后过的 
************************************************/  


int main(){
	int i,j,k,l,m,n,zero;
	bool iszero = false ,iscopy = false;
	char start[1000005];
	char a[1000005];
	memset(start,'\0',sizeof(start));
	scanf("%d",&n);
	zero=0;
	for(i=0;i<n;i++){
		scanf("%s",a);
		if(a[0]=='0'){
			iszero = true;
			break;
		}
		int len = strlen(a);
		for(j=len-1;j>=0;j--){
			//开始这里没加。超时了 
			if(iscopy){
				zero += (len-1);
				break;
			}
			if(a[j]=='0') zero++;
			else if(a[j]=='1'&&j==0) break;
			else{
				iscopy =true;
				strncpy(start,a,j+1);
				break;
			} 
		}
	}
	if(iszero){
		printf("0\n");
		return 0;
	}
	else{
		if(iscopy){
			printf("%s",start);
		}else{
			printf("1");
		}
		
		for(i=0;i<zero;i++){
			printf("0");
		}
		printf("\n");
	}
	return 0;
	
	
}