Codeforces Round #339 (Div. 2)-B. Gena's Code(字符串模拟)
2016-01-15 12:05
393 查看
B. Gena's Code
time limit per test
0.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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
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.
这次cf的题目意思有毒,看都看不懂他究竟说什么。最后看了别人代码才明白说什么。这题说要你找出一个不美丽的数,然后统计美丽的数有多少个0,然后加到不美丽数后面。还有就是如果全部都是美丽数的话要在前面加一然后输出美丽数的0.
AC代码:
time limit per test
0.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
这次cf的题目意思有毒,看都看不懂他究竟说什么。最后看了别人代码才明白说什么。这题说要你找出一个不美丽的数,然后统计美丽的数有多少个0,然后加到不美丽数后面。还有就是如果全部都是美丽数的话要在前面加一然后输出美丽数的0.
AC代码:
#include<iostream> #include<algorithm> #include<cstring> #include<string> #include<vector> #include<cstdio> #include<cmath> #include<set> using namespace std; #define CRL(a) memset(a,0,sizeof(a)) typedef unsigned __int64 LL; typedef __int64 ll; const int T = 100010; const int mod = 1000000007; int main() { #ifdef zsc freopen("input.txt","r",stdin); #endif int n,i,j,k; string str; bool zero,flag; while(~scanf("%d",&n)) { zero = flag = false; string s=""; k = 0; while(n--) { cin >> str; if(str[0]=='0'){ zero = true; } if(str[0]!='1'){ s = str; } else{ j = 0; for(i=1;str[i];++i){ if(str[i]!='0'){ s = str;j=0;break; } j++; } k += j; } } if(zero) cout << 0 << endl; else{ if(s=="")s+='1'; while(k) { s+='0'; k--; } cout << s << endl; } } return 0; }
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces Round332 部分题解
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)
- Codeforces #264(div 2)D.Gargari and Permutations
- Codeforces Round #236 (Div. 2)------A,B
- codeforces 257 div2 B
- Codeforces Gym100571A Cursed Query
- Codeforces Gym100342E Minima
- Codeforces Gym100342J Triatrip
- Codeforces Gym100286B Blind Walk (dfs)