博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
POJ3438 ZOJ2886 UVALive3822 Look and Say【数列】
阅读量:5859 次
发布时间:2019-06-19

本文共 3054 字,大约阅读时间需要 10 分钟。

Time Limit: 5000MS   Memory Limit: 65536K
Total Submissions: 9475   Accepted: 5773

Description

The look and say sequence is defined as follows. Start with any string of digits as the first element in the sequence. Each subsequent element is defined from the previous one by "verbally" describing the previous element. For example, the string 122344111 can be described as "one 1, two 2's, one 3, two 4's, three 1's". Therefore, the element that comes after 122344111 in the sequence is 1122132431. Similarly, the string 101 comes after 1111111111. Notice that it is generally not possible to uniquely identify the previous element of a particular element. For example, a string of 112213243 1's also yields 1122132431 as the next element.

Input

The input consists of a number of cases. The first line gives the number of cases to follow. Each case consists of a line of up to 1000 digits.

Output

For each test case, print the string that follows the given string.

Sample Input

3122344111111111111112345

Sample Output

11221324311011112131415

Source

 >> 

问题链接:。

问题简述:(略)

问题分析:这个问题是首先输入测试例子数量t,然后输入t行数字串,将每一行的数字串转换为Look and Say数字串输出。

程序说明

这里给出两个程序,一个是将字符串读入到字符数组中,然后进行将数字串转换为Look and Say数字串的处理;另外一个程序是一边读入字符串,一边处理,省去缓冲存储。

使用getchar()函数直接处理输入流的话,不使用多余的缓存,是一个好主意。

参考链接:。

AC通过的C语言程序(正解)如下:

/* POJ3438 ZOJ2886 Look and Say */#include 
#define MAXN 1024char r[MAXN * 2];int main(void){ int t, say; char look, c, *pt, temp[10], *pt2; scanf("%d", &t); getchar(); while(t--) { // Look and Say转换:一边读入一边转换 pt = r; look = getchar(); // 读入首字符 say = 1; while((c = getchar()) != '\n') { if(c == look) say++; else { sprintf(temp, "%d", say); pt2 = temp; while(*pt2) *pt++ = *pt2++; *pt++ = look; look = c; say = 1; } } sprintf(temp, "%d", say); pt2 = temp; while(*pt2) *pt++ = *pt2++; *pt++ = look; *pt = '\0'; // 输出结果 printf("%s\n", r); } return 0;}

另外一个AC通过的C语言程序如下:

/* POJ3438 ZOJ2886 Look and Say */#include 
#define MAXN 1024char s[MAXN];char r[MAXN * 2];int main(void){ int t, say; char look, *ps, *pt, temp[10], *pt2; scanf("%d", &t); while(t--) { // 读入字符串 scanf("%s", s); // Look and Say转换 ps = s; pt = r; look = *ps; say = 1; while(*(++ps)) { if(*ps == look) say++; else { sprintf(temp, "%d", say); pt2 = temp; while(*pt2) *pt++ = *pt2++; *pt++ = look; look = *ps; say = 1; } } sprintf(temp, "%d", say); pt2 = temp; while(*pt2) *pt++ = *pt2++; *pt++ = look; *pt = '\0'; // 输出结果 printf("%s\n", r); } return 0;}

转载于:https://www.cnblogs.com/tigerisland/p/7564581.html

你可能感兴趣的文章
目标与绩效管理实战专家胡立
查看>>
2014手机分析图
查看>>
一元多项式相加
查看>>
commandLink/commandButton/ajax backing bean action/listener method not invoked (转)
查看>>
(一) pyhon 基础语法(数值 字符串 元组 列表 字典)
查看>>
HDOJ 1003:求一串数字中和最大的连续子串
查看>>
RedHat 5.6_x86_64 + ASM + RAW+ Oracle 10g RAC (二)
查看>>
win7不能全屏
查看>>
MySQL/InnoDB的并发插入Concurrent Insert
查看>>
转两好文防丢:Debian 版本升级/降级 & Linux 应用程序失去输入焦点问题的解决...
查看>>
HDU - Pseudoforest
查看>>
Nexus杂
查看>>
Linux平台Java调用so库-JNI使用例子
查看>>
Spring Data JPA
查看>>
Web服务器压力测试工具http_load、webbench、ab、Siege使用教程
查看>>
Mac软件下载备忘
查看>>
java 泛型初探
查看>>
在Linux中执行.sh脚本,异常/bin/sh^M: bad interpreter: No such file or directory
查看>>
就是一个表格
查看>>
CakePHP 2.x CookBook 中文版 第三章 入门 之 CakePHP 的结构
查看>>