-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1112.cpp
51 lines (51 loc) · 1.11 KB
/
1112.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <iostream>
#include <string>
using namespace std;
const int maxn=205;
int k;
bool vis[maxn];//认为是重复的字符
bool vivis[maxn];//被确认过了
bool output[maxn];
string s;
int len;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>k;
cin>>s;
len=s.length();
for(int i=0;i<len;){
if(vivis[s[i]]){
if(vis[s[i]]){//如果之前认为是,进行检查
for(int j=0;j<k;j++){
if(s[i]!=s[i+j]){
vis[s[i]]=0;break;
}
}
i+=k;
}else i++;
}else{
int j;
for(j=0;j<k;j++){
if(s[i]!=s[i+j]) break;
}
if(j>=k){vivis[s[i]]=vis[s[i]]=1;}
else vivis[s[i]]=1;
}
}
for(int i=0;i<len;i++){
if(vis[s[i]]&&!output[s[i]]){
cout<<s[i];output[s[i]]=1;
}
}
cout<<'\n';
for(int i=0;i<len;){
if(!vis[s[i]]) cout<<s[i++];
else{
cout<<s[i];
i+=k;
}
}
cout<<'\n';
return 0;
}