-
Notifications
You must be signed in to change notification settings - Fork 8
/
131A.cpp
96 lines (80 loc) · 2.76 KB
/
131A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
/*
~ Author : @tridib_2003
*/
#pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
#define int long long
#define ull unsigned long long
#define PI 3.1415926535897932384626
#define MOD 998244353 // 1000000007
#define vi vector<int>
#define vb vector<bool>
#define vvi vector<vector<int> >
#define vll vector<long long>
#define pb push_back
#define eb emplace_back
#define mp(a, b) make_pair(a, b)
#define pii pair<int, int>
#define vpii vector<pair<int, int> >
#define mk(arr, n, type) type *arr = new type[n];
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define RFOR(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define FORALL(i, a) for (auto& (i) : (a))
#define printall(a) for (auto& (i) : (a)) cout << i << ' '
#define print(a) cout << a << '\n'
#define rsort(a) sort((a).rbegin(), (a).rend())
#define w(x) int x; cin >> x; while(x--)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define pqmx priority_queue<int>
#define pqmn priority_queue<int, vector<int>, greater<int> >
#define max3(a, b, c) max((a), max((b), (c)))
#define min3(a, b, c) min((a), min((b), (c)))
#define mx_all(c) *max_element((c).begin(), (c).end())
#define mn_all(c) *min_element((c).begin(), (c).end())
#define lwr_b(c, a) lower_bound((c).begin(), (c).end(), (a)) - ((c).begin())
#define upr_b(c, a) upper_bound((c).begin(), (c).end(), (a)) - ((c).begin())
#define FIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
void solve() {
string word;
cin >> word;
int n = sz(word), upperCaseCnt = 0;
FOR (i, 0, n) {
if (isupper(word[i]))
++upperCaseCnt;
}
if (n == 1) {
word[0] = (upperCaseCnt == 0 ? toupper(word[0]) : tolower(word[0]));
}
else {
if (upperCaseCnt == n) {
FOR (i, 0, n) {
word[i] = tolower(word[i]);
}
}
else if (islower(word[0]) && upperCaseCnt == n - 1) {
word[0] = toupper(word[0]);
FOR (i, 1, n) {
word[i] = tolower(word[i]);
}
}
}
cout << word;
}
int32_t main() {
FIO;
int tc = 1;
// cin >> tc;
while (tc--) {
solve();
cout << '\n';
}
return 0;
}