HDU 3079 Vowel Counting (water)

HDU 3079 Vowel Counting (water)

Vowel Counting
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission (s): 1413 Accepted Submission (s): 1043


Problem DescriptionThe "Vowel-Counting-Word" (VCW), complies with the following conditions.
Each vowel in the word must be uppercase.
Each consonant (the letters should t 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.

InputThe 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.

OutputFor each case, output its Vowel-Counting-Word.
Sample Input

4XYzapplicationqwcvbaeioOa 

Sample Output

xyzApplIcAtIOnqwcvbAEIOOA

Solution: A case-insensitive conversion problem.

AC code:

#include 
 
  #include 
  
   #include 
   
    using namespace std;int main(){//    freopen("in.txt", "r", stdin);    int t;    string s;    while(scanf("%d", &t)!=EOF){        cin>>s;        for(int i=0; i
    
     ='a' && s[i]<='z')  s[i] -= 32;                printf("%c", s[i]);                }            else{                if(s[i]>='A' && s[i]<='Z')  s[i] += 32;                printf("%c", s[i]);                }        }        printf("\n");        }    return 0;}