Vowel Counting

Vowel Counting

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 3523 Accepted Submission(s): 1936

Problem Description The "Vowel-Counting-Word"(VCW), complies with the following conditions. Each vowel in the word must be uppercase.  Each consonant (the letters except the vowels) must be lowercase. For example, "ApplE" is the VCW of "aPPle", "jUhUA" is the VCW of "Juhua". Give you some words; your task is to get the "Vowel-Counting-Word" of each word.

Input The first line of the input contains an integer T (T<=20) which means the number of test cases. For each case, there is a line contains the word (only contains uppercase and lowercase). The length of the word is not greater than 50.

Output For each case, output its Vowel-Counting-Word.

Sample Input 4 XYz application qwcvb aeioOa

Sample Output xyz ApplIcAtIOn qwcvb AEIOOA

#include <iostream>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <iomanip>
#include <string>
#include <cstdio>
#include <string.h>
#include <set>
#include <cmath>
#include <stack>
using namespace std;
bool isVOW(char c)
{
    if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u'||c=='A'||c=='E'||c=='I'||c=='O'||c=='U'){
        return true;
    }else {
        return false;
    }
}
int main()
{
    int N;
    cin>>N;
    for(int j=0;j<N;j++){
        string str;
        cin>>str;
        for(int i=0;i<str.size();i++){
            if(isVOW(str[i])){
                if(str[i]>='a'&&str[i]<='z'){
                    str[i]=str[i]-32;
                }
            }else {
                if(str[i]>='A'&&str[i]<='Z'){
                    str[i]=str[i]+32;
                }
            }
        }
        cout<<str<<endl;
    }
    return 0;
}