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 <iostream>
#include <string>
using namespace std;

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

	return 0;
}