PTIT135I SPOJ

PTIT135I.cpp

// contest: http://www.spoj.com/PTIT/problems/PTIT135I/
// author : Nguyen Minh Tuan(ititorit)
// lang   : C/C++

#include <bits/stdc++.h>

#define _for(i,a,b) for(int i=(a),_b_=(b),_d_=(a<b?1:-1);i!=_b_;i+=_d_)
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define FORD(i,a,b) for(int i = a; i >= b; i--)
#define _it(i,v) for (typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define _all(v) v.begin(), v.end()

#define DEBUG(x) { cout << #x << " = " << x << endl; }
#define sqr(x) ((x)*(x))
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	#ifndef ONLINE_JUDGE
    freopen("INPUT.inp", "r", stdin);
    #endif

    // solution starts...
    int test; cin >> test;
    int leng,cnt;
    string s;
    while(test--) {
    	cin >> s;
    	leng = s.length();
    	cnt = 1;
    	FOR(i,1,leng) {
    		if(s[i] == s[i-1]) {
    			cnt++;
    		} else {
    			cout << cnt << s[i-1];
    			cnt = 1;
    		}
    	}
    	cout << '\n';
    } 
    // solution ends...
    return 0;
}