Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38398 Accepted Submission(s): 17008
Problem Description
Given a string containing only 'A' - 'Z', we could encode it using the following method:
1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.
2. If the length of the sub-string is 1, '1' should be ignored.
1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.
2. If the length of the sub-string is 1, '1' should be ignored.
Input
The first line contains an integer N (1 <= N <= 100) which indicates the number of test cases. The next N lines contain N strings. Each string consists of only 'A' - 'Z' and the length is less than 10000.
Output
For each test case, output the encoded string in a line.
Sample Input
2 ABC ABBCCC
Sample Output
ABC A2B3C
Author
ZHANG Zheng
水题,我就不说什么了.
#include <iostream>
#include <cstring>
#include <cmath>
#include <stdio.h>
using namespace std;
int main()
{
int t,flag=0;
cin>>t;
while(t--)
{
if(flag==0)
{
getchar();
}
char s[100000];
memset(s,0,sizeof(s));
gets(s);
int len=strlen(s),sum=1;
for(int i=0; i<len; i++)
{
while(s[i]==s[i+1])
{
i++;
sum++;
}
if(sum==1)
{
cout<<s[i];
}
else
{
cout<<sum<<s[i];
}
sum=1;
}
flag++;
cout<<endl;
}
return 0;
}