CF976A.Minimum Binary Number

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".

You are given a correct string $s$ .

You can perform two different operations on this string:

swap any pair of adjacent characters (for example, "101" "110");
replace "11" with "1" (for example, "110" "10").

Let $val(s)$ be such a number that $s$ is its binary representation.

Correct string $a$ is less than some other correct string $b$ iff $val(a)<val(b)$ .

Your task is to find the minimum correct string that you can obtain from the given one using the operations described above. You can use these operations any number of times in any order (or even use no operations at all).

输入格式

The first line contains integer number $n$ ( $1<=n<=100$ ) — the length of string $s$ .

The second line contains the string $s$ consisting of characters "0" and "1". It is guaranteed that the string $s$ is correct.

输出格式

Print one string — the minimum correct string that you can obtain from the given one.

输入输出样例

输入#1
```
4
1001
```
输出#1
```
100
```
输入#2
```
1
1
```
输出#2
```
1
```

说明/提示

In the first example you can obtain the answer by the following sequence of operations: "1001" "1010" "1100" "100".

In the second example you can't obtain smaller answer no matter what operations you use.

首页