CodeForces 131A cAPS lOCK

最新推荐文章于 2021-05-12 18:20:07 发布

原创最新推荐文章于 2021-05-12 18:20:07 发布 · 457 阅读

0 ·

CC 4.0 BY-SA版权

CodeForces 专栏收录该内容

50 篇文章

订阅专栏

本文介绍了一种用于处理字符串中字母大小写的算法实现。该算法能够根据特定规则将输入的字符串进行大小写转换，适用于如hELLO、HTTP等样例的处理。通过对字符逐一检查并应用转换规则，确保了转换后的字符串符合预期的目标格式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

For example, the case of the letters that form words "hELLO", "HTTP", "z" should be changed.

它这句题意很关键，是解决问题关键

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
const int maxn=1250;
char s[maxn];
char rev (char ch) {
    return (islower (ch) ) ?toupper (ch) :tolower (ch);
}
int main() {
    scanf ("%s",s);
    int len=strlen (s),sum=0;
    //‘z’
    if (len==1) {printf ("%c",rev (s[0]) ); return 0;}
    for (int i=0; i<len; i++) {
        if (isupper (s[i]) ) { ++sum; }
    }
    //HTTP,cAPS
    if (sum==len|| (sum==len-1&&islower (s[0]) ) ) {
        for (int i=0; i<len; ++i) {
            printf ("%c",rev (s[i]) );
        }
        return 0;
    }
    puts (s);
    return 0;
}