DEV SKILL DCP-584: G-String

Problem link



A solution in c++

#define ONLINE_JUDGE 1
#include<bits/stdc++.h>

using namespace std;

/// Typedef
typedef long long ll;

#define sc1(a) scanf("%lld",&a)
#define sc2(a,b) scanf("%lld %lld",&a,&b)

#define pf1(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)

#define mx 1000010
#define mod 10000007
#define PI acos(-1.0)

int main() {

    ll tc, num, t = 1;

    //freopen("C:\\Users\\morol\\Desktop\\Clion\\input.txt", "r", stdin);


    cin >> tc;
    cin.ignore();
    while (tc--){
        string arr;

        getline(cin, arr);

        ll ln = arr.size();

        ll ck = 0, voule = 0;
        for(ll i = 0; i < ln; i++){
            if(arr[i] == 'a' || arr[i] == 'e' || arr[i] == 'i' || arr[i] == 'o' || arr[i] == 'u') voule++;
            else if(arr[i] >= 'a' && arr[i] <= 'z'){
                if(arr[i] != 'a' || arr[i] != 'e' || arr[i] != 'i' || arr[i] != 'o' || arr[i] != 'u')
                    ck++;
            }
        }
        voule = ln - voule;
        ck = ln - ck;

        cout << min(ck, voule) << endl;
        ln = 0, ck = 0, voule = 0;
    }

    return 0;
}