杭电acm1020
Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16302 Accepted Submission(s): 6948
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.
2ABCABBCCC
ABCA2B3C
代码如下:
#include <iostream>
#include <string>
using namespace std;
int main()
{
int inNum;
int szLength;
char p[10000];
if(cin>>inNum && 1 <= inNum <=100)
{
while(inNum--)
{
scanf("%s",&p);
szLength = strlen(p) <= 10000 ? strlen(p) : 0 ;
if(szLength==0)
break;
int i,k=0;
for(i=0;i<szLength;i++)
{
if(p[i]>='A' && p[i]<='Z')
{
if(p[i]!=p[i+1])//如果不同的话,直接输出
{
cout<<p[i];
}
else//如果相同,则计数
{
k = i;
while(p[i]==p[i+1])i++;
cout<<(i-k+1)<<p[k];//输出多少个相同,注意是连续相同的
}
}
}
cout<<endl;
}
}
return 0;
}