uite o solutie care iese din timp pe anumite teste dar are potential
#include <iostream>
#include <cstring>
using namespace std;
char a[6]="aeiou",s1[21];
int i,j,k,l;
int main()
{
cin.get(s1,21,'\n');
k=strlen(s1);
for(i=0;i<k;i++)
{
for (j=0;j<=5;j++)
if (s1[i]==a[j]){
for (l=i;l<k;l++)
s1[l]=s1[l+1];
k--;
j=0;}
}
cout<<s1;
return 0;
}
