首页 > 代码库 > 杭电1020Encoding
杭电1020Encoding
Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33249 Accepted Submission(s): 14785
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
如今这题不考英语，不考算法，改考语文了，附张图解释一下题意
附ac代码：
#include<string.h>
#include<stdio.h>
char c[10001];
int m,n,t,i,j;
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%s",c);
int l=strlen(c);
int flag;
int mark=0;
while(i<l)
{
flag=1;
for(i=mark;i<l;i++)
{
if(c[i+1]==c[i])
flag++;
else
{
if(flag!=1)
printf("%d%c",flag,c[i]);
else
printf("%c",c[i]);
break;
}
}
mark=i+1;
}
printf("\n");
}
return 0;
}杭电1020Encoding
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。