CodeForces 825A(脑洞)

最新推荐文章于 2020-05-21 22:53:27 发布

wust_cyl

最新推荐文章于 2020-05-21 22:53:27 发布

阅读量388

点赞数

分类专栏：脑洞文章标签： CodeForces 825A

本文链接：https://blog.csdn.net/wust_cyl/article/details/78485670

版权

脑洞专栏收录该内容

14 篇文章 0 订阅

订阅专栏

问题描述:

Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:

Each digit is represented with number of '1' characters equal to the value of that digit (for 0 it is zero ones).
Digits are written one by one in order corresponding to number and separated by single '0' character.

Though Polycarp learnt how to encode the numbers, he has no idea how to decode them back. Help him calculate the decoded number.

Input

The first line contains one integer number n (1 ≤ n ≤ 89) — length of the string s.

The second line contains string s — sequence of '0' and '1' characters, number in its encoded format. It is guaranteed that the number corresponding to the string is positive and doesn't exceed 109. The string always starts with '1'.

Output

Print the decoded number.

Example

Input

3
111

Output

Input

9
110011101

Output

题目题意:把一个十进制的数每一位拆开，其中每一位数就1的个数，每一位用0隔开，如果位数是0，那么就只有一个0.

代码如下:

#include<iostream>
#include<cstdio>
#include<cmath>
#include<stack>
#include<string>
using namespace std;

string str;
stack<int> s;
int main()
{
    int n;
    while (cin>>n>>str) {
        int num=0;
        for (int i=str.size()-1;i>=0;i--) {
            if (str[i]=='0') {
                if (num==0) {//表示就是0
                    s.push(0);
                    num=0;
                }
                else {
                s.push(num);
                num=0;
                }
            }
            else if (str[i]=='1'){
                num++;
            }

        }
        if (num!=0)
            s.push(num);
        while (s.size()) {//倒着输出
            cout<<s.top();
            s.pop();
        }
        cout<<endl;
    }
    return 0;
}