PAT甲级——A1112 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

注意点

1. 是坏键的条件比较苛刻，只要某字符有一次重复出现的个数不是K的整数倍，那么此键就不是坏键。
2. 输出坏键时同一个坏键只能输出1次，且需按在字符串input中出现的顺序进行输出。

 #include <iostream>
 #include <string>
 using namespace std;
 int main()
 {
     int n;
     string str, res = "", bad = "", temp = "";
     int key[] = {  };
     cin >> n;
     getchar();
     getline(cin, str);
     for (int i = ; i < str.length();)
     {
         int j = i + ;
         while (j < str.length() && str[j] == str[i])//重复字符
             ++j;
         if (key[str[i]] >= )//不是坏键
             key[str[i]] = (j - i) % n ==  ?  : -;//重复n次是坏键
         i = j;
     }
     bool out[] = { false };//表示是否输出过
     for (int i = ; i < str.length();)
     {
         res += str[i];
         if (key[str[i]] == )//为坏键
         {
             if (out[str[i]] == false)//还为输出过
                 bad += str[i];
             out[str[i]] = true;//输出过
             i += n;//跳过重复键
         }
         else
             ++i;//继续遍历
     }
     cout << bad << endl << res << endl;
     return ;
 }