HOJ 2603 Look and Say
2012-11-27 23:19
169 查看
http://acm.hit.edu.cn/hoj/problem/view?id=2603
#include <stdio.h> #include <string.h> int main() { int cases, n, len, i; char number[1024]; scanf("%d", &cases); getchar(); while (cases--) { gets(number); len = strlen(number); for (i = 0; i < len; i++) { n = 1; while (number[i] == number[i+1] ) { n++; i++; } printf("%d%c", n, number[i]); } printf("\n"); } return 0; }
相关文章推荐
- hoj 2603 Look and Say
- POJ3438 ZOJ2886 UVALive3822 Look and Say【数列+水题】
- LOOK AND SAY
- Look and Say-3438
- POJ 3438 Look and Say(我的水题之路——N个M的队列)
- zoj 2886 Look and Say
- 1491. Look and Say
- Problem Y-25 look and say
- 3438 Look and Say
- poj3438_Look and Say_暴力水
- HDU 1020 Encoding POJ 3438 Look and Say
- 水水水 zoj 2886 Look and Say
- ZOJ 2886 — Look and Say(C++)
- POJ 3438 Look and Say(水~)
- PKU 3438 look and say
- Look-and-Say 数列
- poj--3438--LOOK and SAY
- POJ 3438 Look and Say G++
- Look and say numbers