HDU 1020 - Encoding
2020-07-11 |Isaac Chen | Algorithms

Encoding

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

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.

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

AC:

``````#include<bits/stdc++.h>
using namespace std;
int main() {
string str;
int cnt,n;
cin>>cnt;
while(cnt--) {
cin>>str;
for(int i=0;i<str.length();) {
n=1;
while(str[i]==str[i+1]) {
n++;i++;
}
if(n==1)
cout<<str[i];
else
cout<<n<<str[i];
i++;
}
cout<<endl;
}
return 0;
}``````
respond-post-21 July 20th, 2020 at 11:43 pm

CTY Commit Test

## 添加新评论 