pat 1112. Stucked Keyboard

原题链接：https://www.patest.cn/contests/pat-a-practise/1112

1112. Stucked Keyboard (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 from {a-z}, {0-9} and "_". It is guaranteed that the string is non-empty.

Output Specification:

For each test case, print in one line the possible stucked keys, in the order of being detected. Make sure that each key is printed once only. Then in the next line print the original string. It is guaranteed that there is at least one stucked key.

Sample Input:

3
caseee1__thiiis_iiisss_a_teeeeeest

Sample Output:

ei
case1__this_isss_a_teest

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>

using namespace std;

char str[1005];
int vis[1000];
map<char,int> mp;
set<char> s;

int main()
{
    int k,i;
    scanf("%d%s",&k,str);
    int len=strlen(str);
    int cnt=1;
    for(i=1;i<len;i++)
    {
        if(str[i]==str[i-1])
            cnt++;
        else
        {
            if(cnt%k==0&&vis[str[i-1]]!=2)
            {
                vis[str[i-1]]=1;//坏了赋值为1
            }
            else
            {
                vis[str[i-1]]=2;//确定没坏的赋值为2
            }
            cnt=1;
        }
    }
    if(cnt%k==0&&vis[str[len-1]]==0)//特判一下最后一个cnt的值
    {
        vis[str[len-1]]=1;
    }
    for(i=0;i<len;i++)
    {
        if(vis[str[i]]==1)
        {
            if(s.find(str[i])==s.end()){
            printf("%c",str[i]);
            s.insert(str[i]);//用set判重，如果之前已经输出了这个坏键，就跳过
            }
            i+=k-1;
        }
    }
    printf("\n");
    for(i=0;i<len;i++)
    {
        if(vis[str[i]]==1){
            printf("%c",str[i]);
            i+=k-1;
        }
        else
            printf("%c",str[i]);
    }
    printf("\n");
    return 0;
}