PAT-A1112 Stucked Keyboard 题目内容及题解

最新推荐文章于 2021-02-25 22:23:29 发布

Bourbon_Whiskey_

最新推荐文章于 2021-02-25 22:23:29 发布

阅读量638

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT甲级文章标签： PAT 甲级 OJ 编程学习

本文链接：https://blog.youkuaiyun.com/Bourbon_Whiskey_/article/details/86772568

该博客详细介绍了PAT(A1112)编程题目的内容，包括输入输出规范、样例输入输出。博主分析了题目大意，提出了解题思路，即通过循环遍历来找出键盘上可能出现问题的键，并确定原始字符串。最后，博主给出了代码实现及运行结果。

On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appear repeatedly on screen for k times.

Now given a resulting string on screen, you are supposed to list all the possible stucked keys, and the original string.

Notice that there might be some characters that are typed repeatedly. The stucked key will always repeat output for a fixed k times whenever it is pressed. For example, when k=3, from the string thiiis iiisss a teeeeeest we know that the keys i and e might be stucked, but s is not even though it appears repeatedly sometimes. The original string could be this isss a teest.

Input Specification:

Each input file contains one test case. For each case, the 1st line gives a positive integer k (1<k≤100) which is the output repeating times of a stucked key. The 2nd line contains the resulting string on screen, which consists of no more than 1000 characters fr