#include<iostream>
#include<vector>
using namespace std;
void zichuan(char *str,vector<char>& result,int n)
{
int p = 0;
while(p < n-1)
{
for(int f = p+1;str[f] != '\0';f++)
{
if(str[p] == str[f])//找到第一个相同的字符
{
int fp = p;
int ff = f;
int num = 1;
while(str[p] == str[f])//找后续相同的字符
{
result.push_back(str[p]);
p++;
f++;
num++;
//cout << "B";
}
if((ff>(p-1) ) && ((num-1) > 1))//第二个子串的开头必须大于第一个的结尾,子串长度大于等于2
{
for(vector<char>::iterator om = result.begin();om != result.end();om++)
cout << *om << " ";
cout << endl;
result.clear();
num = 1;
break;
}
else//不满足相同子串条件,还回去
{
num = 1;
p = fp;
f = ff;
result.clear();
}
}
}
p++;
}
}
int main()
{
char a[10];
int i = 0;
while(cin.get(a[i]) && a[i] != '\n')
i++;
a[i] = '\0';
vector<char> b;
zichuan(a,b,i);
return 0;
}
#include<vector>
using namespace std;
void zichuan(char *str,vector<char>& result,int n)
{
int p = 0;
while(p < n-1)
{
for(int f = p+1;str[f] != '\0';f++)
{
if(str[p] == str[f])//找到第一个相同的字符
{
int fp = p;
int ff = f;
int num = 1;
while(str[p] == str[f])//找后续相同的字符
{
result.push_back(str[p]);
p++;
f++;
num++;
//cout << "B";
}
if((ff>(p-1) ) && ((num-1) > 1))//第二个子串的开头必须大于第一个的结尾,子串长度大于等于2
{
for(vector<char>::iterator om = result.begin();om != result.end();om++)
cout << *om << " ";
cout << endl;
result.clear();
num = 1;
break;
}
else//不满足相同子串条件,还回去
{
num = 1;
p = fp;
f = ff;
result.clear();
}
}
}
p++;
}
}
int main()
{
char a[10];
int i = 0;
while(cin.get(a[i]) && a[i] != '\n')
i++;
a[i] = '\0';
vector<char> b;
zichuan(a,b,i);
return 0;
}