hdu_1.2.2 _Vowel Counting

最新推荐文章于 2020-07-04 17:00:16 发布

xiaoleiacm

最新推荐文章于 2020-07-04 17:00:16 发布

阅读量526

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/xiaoleiacmer/article/details/8601836

版权

水题专栏收录该内容

25 篇文章 0 订阅

订阅专栏

Vowel Counting

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

Total Submission(s): 1495 Accepted Submission(s): 850

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

4XYzapplicationqwcvbaeioOa

Sample Output

xyzApplIcAtIOnqwcvbAEIOOA

Author

AppleMan

Source

HDU 2nd “Vegetable-Birds Cup” Programming Open Contest

Recommend

lcy

代码：

#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<stdio.h>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstring>
using namespace std;//头文件
int main()
{
	int n;
	cin>>n;
	char ch[10000];
	
	for(int j=0;j<n;j++)
	{
		cin>>ch;
		for(int i=0;i<strlen(ch);i++)
		{
			if(ch[i]<='Z'&&ch[i]>='A')
			ch[i]=char(ch[i]+32);						
		}
		for(int i=0;i<strlen(ch);i++)
		{
			if(ch[i]=='a')ch[i]=char(ch[i]-32);
			if(ch[i]=='e')ch[i]=char(ch[i]-32);
			if(ch[i]=='i')ch[i]=char(ch[i]-32);
			if(ch[i]=='o')ch[i]=char(ch[i]-32);
			if(ch[i]=='u')ch[i]=char(ch[i]-32);
		}
		for(int i=0;i<strlen(ch);i++)
		{
			cout<<ch[i];
		}
		cout<<endl;
		
	}
	return 0;
	
}