HDU1020_Encoding
来源:互联网 发布:北京华信数据恢复中心 编辑:程序博客网 时间:2024/05/22 10:30
Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41886 Accepted Submission(s): 18523
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
2ABCABBCCC
Sample Output
ABCA2B3C
Author
ZHANG Zheng
Recommend
JGShining
http://acm.hdu.edu.cn/showproblem.php?pid=1020
#include<stdio.h>int main(){ char a[10010]; int i,t; int T; scanf("%d",&T); while(T--) { scanf("%s",&a); i=0; while(a[i]!='\0') { t=i; while(a[t+1]==a[i]) { t++; } if(t>i)printf("%d",t-i+1); printf("%c",a[i]); i=t; i++; } printf("\n"); } return 0; }
0 0
- HDU1020_Encoding
- 不使用乘除、if、else、while、for, 计算1+2+...+n
- 安卓百度地图开发Release版本地图无法显示,SHA1获取方法
- 【Oracle】程序包
- 类和对象(C++)
- Java中的多线程你只要看这一篇就够了
- HDU1020_Encoding
- 关联之组合聚合
- [JZOJ4884]图的半径/[JZOJ4572]Center
- 软件测试(第2版)_Paul学习02_01——Ch1测试概述_01
- SVM中的Karush-Kuhn-Tucker条件和对偶问题
- Effective C++ 学习笔记(六)
- POJ 3277 City Horizon【map模板】【stl练习】
- Java垃圾回收机制
- poj2237 Bad Cowtractors 最大生成树