codeforce round A. Binary Protocol
来源:互联网 发布:iphone6sp设置铃声软件 编辑:程序博客网 时间:2024/06/16 12:25
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
模拟就好,可以再简洁一点,你们自己去改吧
#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;}
- codeforce round A. Binary Protocol
- Educational Codeforces Round 25 A. Binary Protocol
- Educational Codeforces Round 25 A. Binary Protocol
- Educational Codeforces Round 25 A Binary Protocol 基础题
- Codeforce round #315 A music
- Codeforces 825 A Binary Protocol
- codeforce round 170 A. Learning Languages
- CodeForce 659A - Round House(水题)
- CodeForce Round #479 A. Karen and Morning
- Codeforce Round #422(Div 2) A
- Codeforce Round #382 (div 1) A
- Codeforce Round #383(Div 1) A
- Codeforce Round #384(Div 2)A
- Codeforce Round #439 A B C 题解
- 【CodeForce】Codeforces Round #140 (Div. 2) A B C
- 【CodeForce】Codeforces Round #142 (Div. 2) A B C
- Codeforce Round#274 :Riding in a Lift解题报告
- Codeforce Round 363(Div2)A(Java)
- 数据分析2-1
- OSI七层模型与TCP/IP五层模型
- 多线程中ReentrantLock的使用
- GROUP BY的使用方法
- 博客已经搬迁至oschina
- codeforce round A. Binary Protocol
- C++课堂笔记0716
- 设计模式——工厂,单例,策略
- Node.js安装及环境配置(windows)
- dos命令之 attrib 用法详解 (dos修改文件属性)
- 查询数据库下有哪些schema
- 两个整型数 的 二进制的差异位数
- leetcode 401. Binary Watch
- [USACO2.3]最长前缀 Longest Prefix