zoukankan      html  css  js  c++  java
  • 1112 Stucked Keyboard (20 分)

    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) 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<cstdio>
    #include<cstring>
    const int maxn = 1010;
    const int maxm = 130;
    int k,len,isStuck[maxn] = {0};
    char str[maxn];
    
    void judgeStuck(){
        int i = 0, j = 0;
        while(i < len){
            while(j < len && str[j] == str[i]){
                j++;
            }
            if((j - i) % k != 0){
                isStuck[str[i]] = 1;
            }
            i = j;
        }
    }
    
    int main(){
        scanf("%d%s",&k,str);
        len = strlen(str);
        judgeStuck();
        for(int i = 0; i < len; i++){
            if(isStuck[str[i]] == 0){
                printf("%c",str[i]);
                isStuck[str[i]] = -1;
            }
        }
        printf("
    ");
        for(int i = 0; i < len;){
            printf("%c",str[i]);
            if(isStuck[str[i]] == -1){
                i += k;
            }else{
                i++;
            }
        }
        return 0;
    }
  • 相关阅读:
    可运行的Java RMI示例和踩坑总结
    JS异步与同步
    Github作为Maven仓库
    Jmeter笔记
    nodeJS生成xlsx以及设置样式
    double运算的坑
    mysql零散操作
    go包的理解
    nodeJS 服务端文件上传
    webpack+thymeleaf实现数据直出
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/10447517.html
Copyright © 2011-2022 走看看