Codeforces 825 A Binary Protocol

比赛地址：http://codeforces.com/contest/825/problem/A
题意：数字的每一位是通过多少个1来表明有该位为多少，通过0分隔，0通过0来表示。
思路：直接遍历一遍，如果不理解看代码，代码比较清晰

#include <iostream>#include <cstring>#include <string>#include <queue>#include <vector>#include <map>#include <set>#include <stack>#include <cmath>#include <cstdio>#include <algorithm>#define LL long long #define N 110#define M 50010#define inf 0x3f3f3f3f3f3f3f3fusing namespace std;const LL mod = 1e9 + 7;const double eps = 1e-9;int main() {    cin.sync_with_stdio(false);    string str;    int n;    int num;    while (cin >> n) {        cin >> str;        num = 0;        for (int i = 0; i < n; i++) {            if (str[i] == '1') {                num++;            }            else {                cout << num;                num = 0;            }        }        cout << num << endl;    }    return 0;}