HDU 3079：Vowel Counting

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 <bits/stdc++.h>

using namespace std;

int main()
{
	int n;
	cin>>n;
	while(n--)
  {
    string s;
    cin>>s;
    for(int i=0;i<s.length();i++)
    {
      if(s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='o'||s[i]=='u')
        s[i]-=32;
      if(s[i] >= 'A'  && s[i] <= 'Z' && s[i] != 'A' && s[i] != 'E' && s[i] != 'I' && s[i] != 'O' && s[i] != 'U')
        s[i]+=32;
    }
    cout<<s<<endl;
  }
	return 0;
}