VJ第一题题解

CodeForces - 118A

原题：Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:

deletes all the vowels,
inserts a character “.” before each consonant,
replaces all uppercase consonants with corresponding lowercase ones.
Vowels are letters “A”, “O”, “Y”, “E”, “U”, “I”, and the rest are consonants. The program’s input is exactly one string, it should return the output as a single string, resulting after the program’s processing the initial string.

Help Petya cope with this easy task.

Input

The first line represents input string of Petya’s program. This string only consists of uppercase and lowercase Latin letters and its length is from 1 to 100, inclusive.

Output

Print the resulting string. It is guaranteed that this string is not empty.

通过这道题我学会了string类型的相关运用以及了解一些其在增添或删除了字符串后字符串长度变化的问题。
为以后运用这类类型增加了经验。
运用：
1. string s[1]就是创造一个储存字符串的空间，其中s[0][0]就是这个字符串的第一个字符。
2. s[0].erase(i,n)则是删除s[0]数组的第i+1个字符即s[0][i]为起始的n个字符（包括s[0][i]）。

# include <iostream>
#include<string>
using namespace std;


int main()
{
	string s[1];
	cin >> s[0];
	int a = s[0].size();
	for (int i = 0; i <= a; ++i)
	{
		if (s[0][i] >= 'A'&&s[0][i] <= 'Z') { s[0][i] += 32; }
		if (s[0][i] == 'a' || s[0][i] == 'A' || s[0][i] == 'O' || s[0][i] == 'o' || s[0][i] == 'Y' || s[0][i] == 'y' || s[0][i] == 'e' || s[0][i] == 'E' || s[0][i] == 'U' || s[0][i] == 'u' || s[0][i] == 'i' || s[0][i] == 'I')
		{
			s[0].erase(i, 1); i -= 1; --a;
		}
		
	}
	for (int i = 0; i < a; ++i)
	{
		s[0].insert(i, "."); ++i; ++a;
	}
	cout << s[0];
	return 0;

}