hdu1020(Encoding)
来源:互联网 发布:厦门市大数据管理中心 编辑:程序博客网 时间:2024/06/03 02:37
水题,相同字母是挨着的,且不会出现空格。
Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19863 Accepted Submission(s): 8560
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#include<iostream>using namespace std;int main(){ char s[10000]; int t; while(cin>>t&&t) { while(t--) { cin>>s; int count=1; for(int i=0;i<strlen(s)-1;i++) { if(s[i+1]==s[i]) {count++; if(i==strlen(s)-2) cout<<count<<s[i]<<endl;} else { if(i==strlen(s)-2) {if(count>1) cout<<count<<s[i]<<s[i+1]<<endl; else cout<<s[i]<<s[i+1]<<endl;} else { if(count==1) cout<<s[i]; else cout<<count<<s[i]; count=1; continue; } } } } } return 0;}
- hdu1020(Encoding)
- hdu1020 Encoding(A2B3C)
- HDU1020 - Encoding (模拟)
- HDU1020 Encoding
- hdu1020 Encoding
- HDU1020:Encoding
- Encoding(HDU1020)
- HDU1020 Encoding
- HDU1020 Encoding
- hdu1020 - Encoding
- hdu1020 Encoding
- Encoding hdu1020 水题
- hdu1020--Encoding HDU(133)
- (解题报告)HDU1020---Encoding
- HDU1020 ZOJ2478 Encoding
- HDU1020——Encoding
- HDU1020(水题)
- hdu1020
- S3C2440中断
- Magento缓存讲解之自定义缓存
- hdu2144
- USACO:Humble Numbers
- LINUX系统调用的添加(2.6.36版本)
- hdu1020(Encoding)
- 功能强大的命令行工具Powershell
- Quick Benchmark: Gzip vs Bzip2 vs LZMA vs XZ vs LZ4 vs LZ
- poj1065(木棍加工贪心)
- URL编码问题汇总
- TinyOS LEEP详解
- PQ分区魔术师图解教程
- Java中char的字节数
- 黑马程序员——C#学习日记之字符串处理函数