cAPS lOCK CodeForces - 131A

cAPS lOCK CodeForces - 131A
wHAT DO WE NEED cAPS LOCK FOR?

Caps lock is a computer keyboard key. Pressing it sets an input mode in which typed letters are capital by default. If it is pressed by accident, it leads to accidents like the one we had in the first passage.

Let’s consider that a word has been typed with the Caps lock key accidentally switched on, if:

either it only contains uppercase letters;
or all letters except for the first one are uppercase.
In this case we should automatically change the case of all letters. For example, the case of the letters that form words “hELLO”, “HTTP”, “z” should be changed.

Write a program that applies the rule mentioned above. If the rule cannot be applied, the program should leave the word unchanged.

Input
The first line of the input data contains a word consisting of uppercase and lowercase Latin letters. The word’s length is from 1 to 100 characters, inclusive.

Output
Print the result of the given word’s processing.

Examples
Input
cAPS
Output
Caps
Input
Lock
Output
Lock
问题链接:https://vjudge.net/contest/160731#problem/O
问题简述:

应该更改构成单词“Hello”、“HTTP”、“z”的字母的情况。编写一个应用上述规则的程序,把大写改成小写,其他情况不改, 输入数据的第一行包含一个由大写和小写拉丁字母组成的单词。这个单词的长度为1到100个字符,包括在内

问题分析
要定义一个足够长的字符数组,并计算字符串的长度,判断是否要改变。

程序说明:
首先定义了一个字符数组,然后计算字符串的长度,然后再判断是否要改,然后进行更改;
AC通过的C++语言程序如下:
#include
using namespace std;
bool A(char* p1, int n)
{
int x =0,i= 1;
for(;i<n;i++)
{
if (p1[i]>=‘A’&&p1[i]<=‘Z’)
x++;
}
if((n-1)x)
return true;
else
return false;
}
int main()
{
char ch[105];
cin >> ch;
int length = 0,i=0;
while (ch[i] != ‘\0’)
{
i++;
length++;
}
if (A(ch, length)||length
1)
{
for (int i = 0; i < length; i++)
{
if (ch[i] >= ‘A’&&ch[i] <= ‘Z’)
ch[i] += 32;
else
ch[i] -= 32;
}
}
cout << ch;
return 0;

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值