858C - Did you mean - CodeForces Solution


dp greedy implementation *1500

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
int main()
{
    std::string s, ss = "aeiou";
    std::cin >> s;
    for (int i = 0; i < s.size(); i++)
        if ((s[i] != s[i + 1] || s[i + 1] != s[i + 2]) && ss.find(s[i]) == -1 && ss.find(s[i + 1]) == -1 && ss.find(s[i + 2]) == -1 && s[i] != '\0' && s[i + 1] != '\0')
            std::cout << s[i] << s[i + 1] << " ", i++;
        else if (s[i] != '\0')
            std::cout << s[i];
}


Comments

Submit
0 Comments
More Questions

811A - Vladik and Courtesy
1006B - Polycarp's Practice
1422A - Fence
21D - Traveling Graph
1559B - Mocha and Red and Blue
1579C - Ticks
268B - Buttons
898A - Rounding
1372B - Omkar and Last Class of Math
1025D - Recovering BST
439A - Devu the Singer and Churu the Joker
1323A - Even Subset Sum Problem
1095A - Repeating Cipher
630F - Selection of Personnel
630K - Indivisibility
20B - Equation
600B - Queries about less or equal elements
1015A - Points in Segments
1593B - Make it Divisible by 25
680C - Bear and Prime 100
1300A - Non-zero
1475E - Advertising Agency
1345B - Card Constructions
1077B - Disturbed People
653A - Bear and Three Balls
794A - Bank Robbery
157A - Game Outcome
3B - Lorry
1392A - Omkar and Password
489A - SwapSort