Question

Algoritm de stergere a ultimei consoane dintr-un sir de caractere

Answer 1

#include <iostream>

#include <cstring>

using namespace std;

char v[]="aeiou", s[256];

int main()

{int n,cop,i;

cin.get(s, 256); n=strlen(s);

for(i=n-1;i>0;i--)

    if(!strchr(v,s[i])){cop=i;

    while(cop<n){s[cop]=s[cop+1]; cop++;

    i=0;}

    }

   cout<<s;

   return 0;

}