ACM第一题

Text Reverse

Time limit2000 msMemory limit262144 kBSourceCodeforces Beta Round #89 (Div. 2)Tagsimplementation strings *1100EditorialAnnouncement Tutorial #1 Tutorial #2

String Task
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.

Sample Input
tour

Sample Output
.t.r

问题链接:https://vjudge.net/problem/CodeForces-118A

问题简述:输入一串字符,去掉规定的元音字符,输出剩下的辅音字符大写的要变成小写并在每个字符前加个 . 输出。

问题分析:用循环来解决大写变小写,并用双循环去掉元音,在用两个数组赋值来解决加点问题

程序说明:建立三个数组,两个用来储存,一个用来除掉元音。大写字符比相应的小写字符小32,利用此来大写变小写。把元音字符赋成不在小写字符内的其它字符,再用小写字符的大小范围除掉。最后用%来在另一个数组进行单双号赋值,双号赋点,单号赋辅音。

AC通过的C语言程序如下:

#include<iostream>
#include<string>
using namespace std;
int main()
{
	char A[120];
	char B[120];
	char C[] = { 'a','e','i','o','u','y','A','E','I','O','U','Y' };
	gets_s(A, 120);
	int len;
	len = strlen(A);
	for (int i = 0; i < len; i++)
	{
		if (A[i] >= 'A' && A[i] <= 'Z')
			A[i] += 32;
	}
	for (int i = 0; i < len; i++)
		for (int j = 0; j < 11; j++)
		{
			if (A[i] == C[j])
			{
				A[i] = '0';
			}
		}
	int t = 0;
	for (int i = 0; i < len; i++)
	{
		if (A[i] >= 'a' && A[i] <= 'z' )
		{
			B[t] = A[i];
			t++;
		}
	}
	int sum = 0;
	for (int i = 0; i < 2 * t; i++)
	{
		if (i % 2 == 0)
			A[i] = '.';
		else
		{
			A[i] = B[sum];
			sum++;
		}
	}
	for (int i = 0; i < 2 * sum; i++)
		cout << A[i];
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值