String Task CodeForces - 118A

String Task 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 Task CodeForces - 118A
问题简述：输入字符串，删去其中的元音字母 “A”, “O”, “Y”, “E”, “U”, “I”，并在每个辅音字母前插入"."，辅音字母全转换为小写。
问题分析：（1）先将字符串中所有的字母转换为小写； （2）用另一个字符串存储（1）所获得的字符串所有辅音字母（非元音字母）；（3）输出字符串。

以下为Accepted的C++代码：

#include <iostream>
#include <cstring>
using namespace std;
int main()
{
	int i,j=0, len1,len2;
	char a[101]; char b[101];    //字符串的长度为[1,100]
	cin >> a;
	len1 = strlen(a);
	
	for (i = 0; i < len1; i++)//步骤（1）：转换为小写
	{
		if (a[i] >= 'A'&&a[i] <= 'Z')
		{
			a[i] += 32;
		}
	}
	
	for (i = 0; i < len1; i++)//步骤（2）：存储字符串中的非元音字母
	{
		if (a[i] != 'a' && a[i] != 'o' && a[i] != 'y' &&a[i]!='e'&& a[i] != 'u' && a[i] != 'i')//"A", "O", "Y", "E", "U", "I"为元音字母
			b[j++] = a[i];
	}
	b[j] = '';
	
	len2 = strlen(b);
	for (i = 0; i < len2; i++)//步骤（3）：输出字符串
	{
			cout << "." << b[i];
	}
}

最后

以上就是悦耳路人为你收集整理的String Task CodeForces - 118A的全部内容，希望文章能够帮你解决String Task CodeForces - 118A所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。