Submission #345473

---

Source Code Expand

#include <sstream>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <climits>
using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RREP(i,n) for(int i=(int)n-1; i>=0; i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)
#define ALL(c) (c).begin(), (c).end()

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > pipii;
typedef vector<int> vi;

const int INF = 1e9;
const int MOD = 1e9+7;

int main(void){
	string s;
    cin >> s;
    string ans;
    for(int i = 0; i < s.size(); i++){
        ans += s[i];
        int con = i;
        while(con < s.size() && s[con] == s[i]) con++;
        stringstream ss; ss << con - i;
        ans += ss.str();
        if(con == s.size()) break;
        i = con - 1;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result