Codeforces Round #339 Div.2 B - Gena's Code
2016-01-15 03:10
387 查看
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
output
input
output
input
output
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 水题啦不过要注意一些细节 比如对0的处理 比如...好像没什么了啊...
#include <iostream> #include <string> #include <cstdio> #include <cmath> #include <cstring> #include <queue> #include <map> #include <vector> #include <set> #include <algorithm> #define INF 0x3F3F3F3F using namespace std; bool isBeautiful(char data[]){ int len = strlen(data); if(data[0] != '1') return false; for(int i = 1; i < len; i++){ if(data[i] != '0') return false; } return true; } int main() { int n, digit = 0; char data[100010], nonb[100010] = "1"; bool zero = false; scanf("%d", &n); while(n--){ scanf("%s", data); if(data[0] == '0') zero = true; if(isBeautiful(data)) digit += strlen(data) - 1; else strcpy(nonb, data); } if(zero) puts("0"); else{ printf("%s", nonb); for(int i = 1; i <= digit; i++) printf("0"); putchar('\n'); } return 0; } close
相关文章推荐
- [LA] Centering a data set
- Codeforces Round #339 Div.2 A - Link/Cut Tree
- 项目适配iOS9遇到的一些问题及解决办法
- Genymotion 安装教程
- 认识函数式接口
- Docker实战(十二):Docker安装ElasticSearch集群环境
- 从大学开始,你的人生才真正属于你自己,这意味着,没有人再为你负责,你的未来蓝图,都要自己执笔
- [Javascript] How to use JavaScript's String.replace
- 为了可怜的成功率、缥缈的理想堵上这个人生,这对多数人来说都不值得(他以及他的家庭都会面临灾难)
- [Javascript] Regex: '$`', '$&', '$''
- Python 网络编程基础
- 很多人在大学期间开发软件,接国企的案子,彻夜写程序;或者做家教、攒书、卖商品,难道那不是一种创业?
- mysql-5.6.24主从复制
- 简单SQL优化小记
- 读《重新定义公司》谷歌是如何运营的 How Google Works
- UICollectionView(纯代码方式)实现带上下拉刷新的瀑布流式
- 为什么知乎上很多人都反对创业?(上战场的士兵如果先拿枪打打靶练练枪法,研究研究战术之后,战损比肯定要更好看一点)
- How to build a nice Hamburger Button transition in Swift
- 解决灰色shader与mask冲突的方案
- hadoop入门