#include <string.h>
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <string>
#include <iostream>
#include <math.h>
using namespace std;
bool harsh[130];
bool vis[130];
int main()
{
int K;
scanf("%d",&K);
memset(harsh,false,sizeof(harsh));
memset(vis,false,sizeof(vis));
string str;
getchar();
getline(cin,str);
int step=1,index=1;
while(index<str.length())
{
if(str[index]==str[index-1])
{
step++;
}
else
{
if(step%K!=0)
{
harsh[str[index-1]]=true;
}
step=1;
}
if(index==str.length()-1)
{
if(step%K!=0)
{
harsh[str[index]]=true;
}
}
index++;
}
index=0;
for(int i=0;i<str.length();i++)
{
if(harsh[str[i]]==false&&vis[str[i]]==false)
{
printf("%c",str[i]);
vis[str[i]]=true;
}
}
printf("\n");
while(index<str.length())
{
if(harsh[str[index]])
{
printf("%c",str[index]);
index++;
}
else
{
char c=str[index];
int step=0;
while(index<str.length()&&str[index]==c)
{
index++;
step++;
if(step%K==0)
{
printf("%c",c);
}
}
}
}
printf("\n");
return 0;
}
PAT甲1112 Stucked Keyboard(20 分)
最新推荐文章于 2021-02-25 22:23:29 发布