hdu 3079 Vowel Counting(模拟)

New! 关于举办校第十五届程序设计竞赛暨2015省赛集训队选拔赛的通知

Vowel Counting

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1636    Accepted Submission(s): 1202

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
  
  

 

Author

AppleMan
题意：简单模拟

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>

using namespace std;

int t;
bool mark[500];
char s[500];

void solve ( char ch )
{
    if ( mark[ch] )
       printf ( "%c" , isupper(ch)?ch:(char)(ch-32));
    else
       printf ( "%c" , islower(ch)?ch:(char)(ch+32));
}

int main ( )
{
    memset ( mark , 0 , sizeof ( mark ));
    mark['A'] =mark['a'] = mark['E'] = mark['e'] = mark['I']
    = mark['i'] = mark['O'] = mark['o'] = mark['U'] = mark['u']
    = true;
    scanf ( "%d" , &t );
    while ( t-- )
    {
        scanf ( "%s" , s );
        int i = 0;
        while ( s[i] )
            solve ( s[i++] );
        puts ( "" );
    }
}