codeforce round A. Binary Protocol
2017-07-17 13:06
330 查看
A. Binary Protocol
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
Examples
input
3
111
output
3
input
9
110011101
output
2031
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
Examples
input
3
111
output
3
input
9
110011101
output
2031
模拟就好,可以再简洁一点,你们自己去改吧
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
Examples
input
3
111
output
3
input
9
110011101
output
2031
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
Examples
input
3
111
output
3
input
9
110011101
output
2031
模拟就好,可以再简洁一点,你们自己去改吧
#include <stdio.h> #include <stdlib.h> #include <string> #include <iostream> #include <algorithm> using namespace std; long long a[100005], l[100005], r[100005]; int main() { int n; string s,s2; while (cin >> n) { getchar(); cin >> s; s2.clear(); int n0 = 0; int f = 1; if (s[s.size() - 1] != 0) { f = 0; s += '0'; } // cout << s << endl; if (f) { int n1 = 0, n0 = 0; for (int i = 0; i < s.size(); i++) { //cout << s[i] << endl; if (s[i] == '1') { n1++; n0 = 0; } if (s[i] == '0') { n0++; if(n1!=0) cout << n1; n1 = 0; //cout << "n0= " << n0 << endl; if (n0 >1) cout << "0"; } } } else { int n1 = 0, n0 = 0; for (int i = 0; i < s.size(); i++) { //cout << s[i] << endl; if (s[i] == '1') { n1++; n0 = 0; } if (s[i] == '0') { n0++; //puts("shuzi") if(n1!=0) cout << n1; if (i == s.size()) break; n1 = 0; //puts(""); // cout << "n0= " << n0 << endl; if (n0 > 1) cout << "0"; } } } puts(""); } return 0; }
相关文章推荐
- Educational Codeforces Round 25 A Binary Protocol 基础题
- Educational Codeforces Round 25 A. Binary Protocol
- CodeForce Round 219 Div2 E Watching Fireworks is Fun 单调队列DP
- Educational Codeforces Round 31 E. Binary Matrix 并查集
- codeforce round 399# C
- Codeforce Round #228 Div2
- coderforce Educational Codeforces Round 6 E.New Year Tree
- Educational Codeforces Round 31 E. Binary Matrix 并查集
- codeforce round 247 div.2 B
- Codeforce Round 363(Div2)A(Java)
- Hash练习题:【Codeforce round #166 】 D. Good Substrings
- Educational Codeforces Round 20 A - Maximal Binary Matrix
- Educational Codeforces Round 31 E. Binary Matrix 并查集
- codeforce round 399# E
- Codeforce Round #400 C 签到题
- Codeforce Round #438 C.Bus(贪心)
- Educational Codeforces Round 31 E. Binary Matrix 并查集
- Codeforces #Round 447Div2 D - Ralph And His Tour in Binary Country
- codeforce Mystical Mosaic(VK Cup 2018 - Round 2)
- Codeforces Round #307 (Div. 2) D. GukiZ and Binary Operations (矩阵高速幂)