Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- string s;
- string mas[1000000];
- int main() {
- cin >> s;
- long long k = 0;
- for(int i = 0; i < 1000000; i++){
- mas[i] = "";
- }
- int d;
- for(int i = 5; i < s.size(); i++){
- for(int j = i; j < s.size(); j += 2){
- string e = "";
- if(e + s[j+5] + s[j+4] == e + s[j+2] + s[j+3] && ((int)s[j+5]) >= 97 && ((int)s[j+5]) <= 122){
- }
- else if(j == ((int)s.size()) - 1){
- }
- else{
- if(j + 2 == ((int)s.size()-1)){
- }
- else{
- mas[k] += s[j];
- mas[k] += s[j+1];
- k++;
- }
- }
- }
- for(int i = 5; i < s.size(); i++){
- for(int j = i; j < s.size(); j += 3){
- string e = "";
- if(e + s[j+6] + s[j+7] + s[j+8] == e + s[j+3] + s[j+4] + s[j+5] && ((int)s[j+8]) >= 97 && ((int)s[j+8]) <= 122){
- }
- else if(j == ((int)s.size()) - 2){
- }
- else{
- if(j + 3 == ((int)s.size()-1)){
- }
- else{
- mas[k] += s[j];
- mas[k] += s[j+1];
- mas[k] += s[j+2];
- k++;
- }
- }
- }
- }
- sort(mas, mas+k);
- long long u = k;
- for(long long i = 0; i < k; i++){
- if(mas[i] == mas[i+1]){
- u--;
- }
- else{
- if(((int)(mas[i])[1]) >= 97 &&((int)(mas[i])[1]) <= 122){}
- else{
- u--;
- }
- }
- }
- cout << u << "\n";
- for(long long i = 0; i < k; i++){
- if(mas[i] == mas[i+1]){
- }
- else{
- if(((int)(mas[i])[1]) >= 97 &&((int)(mas[i])[1]) <= 122)
- cout << mas[i] << endl;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement