text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[100];
int x;
cin >> a >> x;
int l = strlen(a);
int i;
for (i = 0; i < l; i++) {
if (a[i] < 97) a[i] += 32;
if (a[i] < 97 + x) a[i] -= 32;
}
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a;
int n;
int main() {
cin >> a;
cin >> n;
for (int i = 0; i < a.size(); i++) {
a[i] = tolower(a[i]);
if (a[i] < 97 + n) a[i] = toupper(a[i]);
}
cout << a << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, i, j, k, x, y, t;
string str;
cin >> str;
cin >> n;
for (i = 0; i < str.size(); i++)
if (isupper(str[i])) str[i] = str[i] - 'A' + 'a';
for (i = 0; i < str.size(); i++) {
x = str[i] - 'a';
if (x < n) str[i] = str[i] - 'a' + 'A';
}
cout << str << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
for (int i = 0; i < s.size(); ++i) {
if (s[i] >= 'a' && s[i] < 'a' + n) s[i] += 'A' - 'a';
if (s[i] >= 'A' + n && s[i] <= 'Z') s[i] -= 'A' - 'a';
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1005];
int n;
bool cont(char x) { return (x >= 'a' && x <= 'z'); }
int main() {
scanf("%s", s);
scanf("%d", &n);
for (int i = 0; i < strlen(s); i++) {
if (cont(s[i]) && s[i] < n + 97) {
if (cont(s[i])) s[i] -= 32;
}
if (cont(s[i]) == 0 && s[i] >= n + 65) s[i] += 32;
}
printf("%s\n", s);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int val;
int main() {
cin >> s >> val;
for (int i = 0; i < s.length(); i++) s[i] = tolower(s[i]);
for (int i = 0; i < s.length(); i++)
printf("%c", s[i] < val + 97 ? toupper(s[i]) : tolower(s[i]));
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, i;
string Str;
cin >> Str;
cin >> x;
for (i = 0; i < Str.size(); i++) Str[i] = tolower(Str[i]);
for (i = 0; i < Str.size(); i++)
if (Str[i] < x + 'a') Str[i] = toupper(Str[i]);
cout << Str << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main() {
cin >> s;
cin >> n;
for (int i = 0; i < s.size(); i++) {
if ((s[i] >= 'a') && (s[i] < 'a' + n)) s[i] -= 'a' - 'A';
if ((s[i] < 'a') && (s[i] >= 'A' + n)) s[i] += 'a' - 'A';
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a;
scanf("%d", &a);
for (int i = 0; i < s.size(); i++) {
if ('A' <= s[i] && s[i] <= 'Z') {
s[i] += 'a' - 'A';
}
if (s[i] < 'a' + a) {
s[i] += 'A' - 'a';
}
}
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
char c;
cin >> s >> a;
for (int i = 0; i < s.size(); i++) {
c = s[i];
if ('A' <= c && c <= 'Z') c += 'a' - 'A';
if (c < a + 97)
s[i] = c - 'a' + 'A';
else
s[i] = c;
}
cout << s;
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str, str1, str2;
int c, n, i;
cin >> str >> c;
n = str.size();
for (i = 0; i < n; i++) {
if (str[i] >= 'A' && str[i] <= 'Z')
str1.push_back(str[i] - 'A' + 'a');
else
str1.push_back(str[i]);
}
for (i = 0; i < n; i++)
if (str1[i] >= c + 97)
str2.push_back(str1[i]);
else
str2.push_back(str1[i] - 32);
cout << str2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
string ss;
int num;
cin >> s >> num;
for (int i = 0; i < s.size(); i++) {
if (s[i] >= 'A' && s[i] <= 'Z') s[i] = (char)((int)s[i] - 'A' + 'a');
}
for (int i = 0; i < s.size(); i++) {
char c = s[i];
if ((int)c < num + 97) {
ss += (char)((int)c - 'a' + 'A');
} else {
ss += c;
}
}
cout << ss << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:256000000")
using namespace std;
int main() {
string s;
cin >> s;
int n;
cin >> n;
for (int i = 0; i < (int)(s).size(); i++) {
int x;
if (islower(s[i]))
x = s[i] - 'a';
else
x = s[i] - 'A';
if (x < n) {
if (islower(s[i])) s[i] = toupper(s[i]);
} else {
if (isupper(s[i])) s[i] = tolower(s[i]);
}
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n;
cin >> str;
cin >> n;
int size;
size = str.size();
for (int i = 0; i < size; i++) {
str[i] = tolower(str[i]);
}
for (int i = 0; i < size; i++) {
char x;
x = str[i];
if (97 + n > x) {
x = toupper(x);
} else {
x = tolower(x);
}
cout << x;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s, ans;
int n;
int main() {
cin >> s;
scanf("%d", &n);
for (int i = 0; i < s.size(); i++) {
if (s[i] < 'a') s[i] = 'a' + (s[i] - 'A');
}
for (int i = 0; i < s.size(); i++) {
char c = s[i];
if (c < 97 + n)
ans.push_back('A' + (c - 'a'));
else
ans.push_back(c);
}
printf("%s", ans.c_str());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100];
int d;
int main() {
scanf("%s", s);
scanf("%d", &d);
for (int i = 0; s[i]; i++) {
int tmp = s[i];
if (tmp >= 'a') tmp = tmp - 'a' + 'A';
if (tmp - 'A' + 'a' < d + 97)
s[i] = tmp;
else
s[i] = tmp - 'A' + 'a';
}
puts(s);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, x;
string a;
cin >> a >> x;
for (i = 0; i < a.size(); i++)
if (a[i] <= 'Z') a[i] = a[i] - 'A' + 'a';
for (i = 0; i < a.size(); i++)
if (a[i] - 'a' < x)
cout << char(a[i] - 'a' + 'A');
else
cout << a[i];
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
char toLow(char c) {
if (c >= 'a' && c <= 'z') {
return c;
}
return c - 'A' + 'a';
}
char toUp(char c) {
c = toLow(c);
return c - 'a' + 'A';
}
int main() {
string s;
cin >> s;
int x;
cin >> x;
for (int i = 0; i < s.length(); i++) {
if (toLow(s[i]) - 'a' < x) {
s[i] = toUp(s[i]);
} else {
s[i] = toLow(s[i]);
}
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string st;
int num;
int main() {
cin >> st;
cin >> num;
for (int i = 0; i < st.size(); i++) {
int p = int(st[i]);
if (p < 97) p += 32;
if (p < num + 97) p -= 32;
cout << char(p);
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
for (int i = 0; i < s.size(); i++)
if (s[i] >= 'A' and s[i] < 'a') s[i] = 'a' + (s[i] - 'A');
for (int i = 0; i < (int)s.size(); i++) {
char tmp = s[i];
if (tmp < (n + 97)) {
s[i] = 'A' + s[i] - 'a';
} else {
}
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int x;
cin >> s >> x;
for (auto &x : s) x = tolower(x);
for (auto &X : s) {
int _19 = X;
if (_19 < x + 97) X = toupper(X);
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a;
cin >> s >> a;
string res = "";
for (int i = 0; i < s.size(); i++) {
s[i] = tolower(s[i]);
}
for (int i = 0; i < s.size(); i++) {
if (s[i] < (a + 97)) {
s[i] = toupper(s[i]);
}
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
for (int i = 0; i < s.length(); i++) {
if (s[i] >= 'a' && s[i] < 'a' + n)
s[i] = 'A' + s[i] - 'a';
else if (s[i] <= 'Z' && s[i] >= 'A' + n)
s[i] = 'a' + s[i] - 'A';
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
string a;
int n;
int main() {
cin >> a;
scanf("%d", &n);
int i;
for (i = 0; i < a.size(); i++)
if (a[i] >= 'A' && a[i] <= 'Z') a[i] = 'a' + a[i] - 'A';
for (i = 0; i < a.size(); i++)
if (a[i] - 'a' + 1 <= n) a[i] = 'A' + a[i] - 'a';
cout << a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int main() {
string s;
int n;
cin >> s >> n;
int i;
for (i = 0; i < s.length(); i++) {
if (s[i] >= 'A' && s[i] <= 'Z') {
s[i] += 'a' - 'A';
}
}
for (i = 0; i < s.length(); i++) {
if (s[i] < n + 97) {
s[i] = s[i] + 'A' - 'a';
}
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
char ans[100];
int n;
int main() {
scanf("%s%d", ans, &n);
for (int i = 0; i < strlen(ans); i++) {
if (ans[i] < 'a') ans[i] += 'a' - 'A';
if (ans[i] < 97 + n) ans[i] += 'A' - 'a';
}
printf("%s\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char uppercase(char x) {
if (x >= 'a' && x <= 'z')
return x + 'A' - 'a';
else
return x;
}
char lowercase(char x) {
if (x >= 'A' && x <= 'Z')
return x - 'A' + 'a';
else
return x;
}
int main() {
string s;
int a;
cin >> s >> a;
for (int i = 0; i < (int)s.size(); i++) s[i] = lowercase(s[i]);
for (int i = 0; i < (int)s.size(); i++) {
char temp = s[i];
if (temp < a + 97)
temp = uppercase(temp);
else
temp = lowercase(temp);
s[i] = temp;
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[55], put[55];
int num, len;
gets(s);
scanf("%d", &num);
len = strlen(s);
for (int i = 0; i < len; i++) {
if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
}
for (int tmp = 0; tmp < len; tmp++) {
int pp = s[tmp];
if (pp < num + 'a')
put[tmp] = s[tmp] - 'a' + 'A';
else
put[tmp] = s[tmp];
printf("%c", put[tmp]);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char ch[60];
int main() {
int a;
scanf("%s", &ch);
scanf("%d", &a);
int len = strlen(ch);
for (int i = 0; i < len; i++) {
if (ch[i] >= 'A' && ch[i] <= 'Z') ch[i] = ch[i] + 32;
if (ch[i] - 'a' < a) ch[i] = ch[i] - 32;
}
printf("%s\n", ch);
}
|
#include <bits/stdc++.h>
using namespace std;
char str[55];
int len, num;
int main() {
while (scanf("%s%d", str, &num) != EOF) {
len = strlen(str);
char ans[55];
for (int i = 0; i < len; i++) {
int x = str[i];
if (x >= 'a')
x -= 'a';
else
x -= 'A';
x += 'a';
if (x < 97 + num)
ans[i] = x - 'a' + 'A';
else
ans[i] = x - 'a' + 'a';
}
ans[len] = '\0';
printf("%s\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
transform(s.begin(), s.end(), s.begin(), ::tolower);
string l = "abcdefghijklmnopqrstuvwxyz";
string L = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
map<char, char> m;
for (int i = 0; i < l.size(); i++) m[l[i]] = L[i];
int n;
cin >> n;
n = n + 'a' - 1;
for (int i = 0; i < s.size(); i++) {
if (s[i] <= n) s[i] = m[s[i]];
}
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3F3F3F3F;
const int MAXN = 100001;
inline void input() {
int n;
char str[1001];
scanf("%s", str);
;
scanf("%d", &n);
;
int k = strlen(str);
for (int i = 0; i < k; ++i) {
str[i] = tolower(str[i]);
if (str[i] >= 'a' && str[i] < 'a' + n) {
str[i] = toupper(str[i]);
;
}
}
printf("%s\n", str);
}
int main() {
input();
return 0;
}
|
#include <bits/stdc++.h>
const long long N = 1e6 + 7;
using namespace std;
long long n, m, x, y, a[N], b[N];
string s;
int main() {
cin >> s;
for (int i = 0; i < s.length(); i++)
if (s[i] > 'z' || s[i] < 'a') s[i] = s[i] + 'e' - 'E';
cin >> n;
for (int i = 0; i < s.length(); i++)
if (s[i] < 'a' + n && s[i] >= 'a') s[i] = s[i] + 'E' - 'e';
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100];
int a;
int main(void) {
scanf("%s", &s);
scanf("%d", &a);
string b = (string)s;
string c = "";
string res = "";
for (int i = 0; i < b.length(); i++)
if ((b[i] >= 'A') && (b[i] <= 'Z'))
c += 'a' + (b[i] - 'A');
else
c += b[i];
for (int i = 0; i < c.length(); i++) {
if (c[i] < a + 97)
res += 'A' + (c[i] - 'a');
else
res += c[i];
}
printf("%s\n", res.c_str());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string ToLower(string sOrigin) {
string ans("");
long i;
for (i = 0; i <= sOrigin.length() - 1; ++i) {
if (sOrigin[i] >= 'A' && sOrigin[i] <= 'Z')
ans += char(sOrigin[i] + ('a' - 'A'));
else
ans += sOrigin[i];
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
string sOrig;
int iNum, iLength, i;
getline(cin, sOrig);
cin >> iNum;
iLength = sOrig.length() - 1;
sOrig = ToLower(sOrig);
for (i = 0; i <= iLength; ++i) {
if (sOrig[i] < 'a' + iNum) sOrig[i] = sOrig[i] + 'A' - 'a';
}
cout << sOrig;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[100];
int n, i, j, k;
while (~scanf("%s", a)) {
scanf("%d", &n);
char c = 'a' + n;
for (i = 0; i < strlen(a); i++) {
if (a[i] < c || a[i] < char(c - 'a' + 'A')) {
if (a[i] >= 'a' && a[i] <= 'z') a[i] = char(a[i] - 'a' + 'A');
}
if (a[i] >= c || a[i] >= char(c - 'a' + 'A')) {
if (a[i] >= 'A' && a[i] <= 'Z') {
a[i] = char(a[i] - 'A' + 'a');
}
}
}
printf("%s\n", a);
}
}
|
#include <bits/stdc++.h>
char str[11111];
int N;
int main() {
scanf("%s%d", str, &N);
for (char* p = str; *p; ++p) {
if (*p < 'a') *p += 'a' - 'A';
if (*p < 97 + N) *p += 'A' - 'a';
}
printf("%s\n", str);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
string o;
int n;
cin >> s >> n;
for (int i = 0; i < (int)s.size(); i++) {
if (isupper(s[i])) s[i] = tolower(s[i]);
}
for (int i = 0; i < (int)s.size(); i++) {
char d = s[i];
if (d < n + 97) {
o += toupper(d);
} else {
o += tolower(d);
}
}
cout << o << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long readInt() {
register int c = getchar();
long long x = 0, neg = 0;
for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
;
if (c == '-') {
neg = 1;
c = getchar();
}
for (; c > 47 && c < 58; c = getchar()) x = (x << 1) + (x << 3) + c - 48;
return (neg) ? -x : x;
}
inline void printInt(long long x) {
char pri[30];
int i = 0;
if (x < 0) {
putchar('-');
x = -x;
}
do {
pri[i++] = (x % 10) + 48;
x /= 10;
} while (x != 0);
for (int j = (i - 1); j > (0 - 1); j -= 1) putchar(pri[j]);
}
void solve() {
string s;
int n;
cin >> s >> n;
for (char *i = &s[0]; *i; i++) {
if (*i < 'a') *i += 'a' - 'A';
if (*i < n + 97) *i += 'A' - 'a';
}
cout << s << endl;
}
int main() {
if (0) {
double _time = clock();
freopen("input.txt", "r", stdin);
solve();
printf("%0.4f sec\n", (clock() - _time) / CLOCKS_PER_SEC);
return 0;
}
solve();
return 0;
}
|
#include <bits/stdc++.h>
char s[100];
int n;
int main() {
scanf(" %s %d", s, &n);
int x = strlen(s);
for (int i = 0; i < x; i++) s[i] = tolower(s[i]);
for (int i = 0; i < x; i++) {
if (s[i] < 97 + n)
s[i] = toupper(s[i]);
else
s[i] = tolower(s[i]);
}
printf("%s\n", s);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
int INF = 2000000000;
long long INFF = 8000000000000000000LL;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
inline string IntToString(int a) {
char x[100];
sprintf(x, "%d", a);
string s = x;
return s;
}
inline int StringToInt(string a) {
char x[100];
int res;
strcpy(x, a.c_str());
sscanf(x, "%d", &res);
return res;
}
inline string GetString(void) {
char x[1000005];
scanf("%s", x);
string s = x;
return s;
}
inline string uppercase(string s) {
int n = (int)s.size();
for (int(i) = (0); (i) < (n); ++(i))
if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
return s;
}
inline string lowercase(string s) {
int n = (int)s.size();
for (int(i) = (0); (i) < (n); ++(i))
if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
return s;
}
inline void OPEN(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
string s;
int n;
int main() {
s = GetString();
scanf("%d", &n);
s = lowercase(s);
int m = (int)s.size();
for (int(i) = (0); (i) < (m); ++(i)) {
if (s[i] < n + 97) s[i] = s[i] - 'a' + 'A';
}
printf("%s\n", s.c_str());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s, ans = "";
int x;
char small(char c) { return (c <= 'Z' ? c + 32 : c); }
int main() {
getline(cin, s);
scanf("%d", &x);
for (int i = 0; i < s.length(); i++)
if ((int)(small(s[i]) - 'a') < x)
ans += (char)(small(s[i]) - 32);
else
ans += small(s[i]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[55], str2[55];
int main() {
scanf("%s", str);
int n;
scanf("%d", &n);
int len = strlen(str);
for (int i = 0; i < len; ++i) {
int aux = tolower(str[i]);
if (aux < n + 97) {
str2[i] = toupper(aux);
} else {
str2[i] = tolower(aux);
}
}
printf("%s\n", str2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str, a;
int nr;
cin >> str >> nr;
transform(str.begin(), str.end(), str.begin(), ::tolower);
for (int i = 0; i < str.size(); ++i)
if ((int)str[i] < nr + 97)
a += str[i] - 'a' + 'A';
else
a += str[i];
cout << a;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char a[100];
int x;
scanf("%s", a);
scanf("%d", &x);
int i = 0;
int u;
u = strlen(a);
for (i = 0; i < u; i++) {
a[i] = tolower(a[i]);
}
for (i = 0; i < u; i++) {
if (a[i] < 'a' + x) {
a[i] = toupper(a[i]);
printf("%c", a[i]);
} else
printf("%c", a[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char x[1001];
int a;
while (scanf("%s%d", x, &a) == 2) {
int k = strlen(x);
for (int i = 0; i < k; i++)
if (x[i] < 'a') x[i] += ('a' - 'A');
for (int i = 0; i < k; i++) {
if (x[i] < a + 97) x[i] = x[i] += ('A' - 'a');
}
printf("%s\n", x);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int i = 0;
int j;
char c, a[100];
while (1) {
c = getchar();
if (c == '\n') break;
a[i++] = tolower(c);
}
a[i] = '\0';
cin >> n;
for (j = 0; j < i; j++) {
if ((int)(a[j]) < (n + 97))
a[j] = toupper(a[j]);
else
a[j] = tolower(a[j]);
cout << a[j];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char s[100];
int n;
gets(s);
scanf("%d", &n);
for (int i = 0; i < strlen(s); i++) {
if (s[i] >= 65 && s[i] <= 90) s[i] += 32;
}
for (int i = 0; i < strlen(s); i++) {
if (s[i] < n + 97) s[i] += -32;
}
puts(s);
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.1415926535;
int main() {
string s, ans = "";
int t;
cin >> s;
cin >> t;
for (int i = 0; i < s.size(); ++i) s[i] = tolower(s[i]);
for (int i = 0; i < s.size(); ++i) {
char c = s[i];
if ((int)c < t + 97)
ans += toupper(c);
else
ans += c;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, r;
cin >> s;
int a;
cin >> a;
for (long i = 0; i < s.size(); i++) s[i] = tolower(s[i]);
for (long i = 0; i < s.size(); i++) {
char c = s[i];
if (c < a + 97)
r += toupper(c);
else
r += tolower(c);
}
cout << r;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans;
int n;
cin >> s;
cin >> n;
for (int i = 0; i < s.size(); i++) {
char tp;
if (s[i] >= 'A' && s[i] <= 'Z')
tp = (s[i] + ('a' - 'A'));
else
tp = (s[i]);
if (tp < n + 97) {
cout << char((tp - ('a' - 'A')));
} else
cout << char(tp);
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
char a[60];
char upper[60];
char lower[60];
char ans[60];
using namespace std;
int main() {
memset(a, 0, sizeof(a));
memset(upper, 0, sizeof(upper));
memset(lower, 0, sizeof(lower));
memset(ans, 0, sizeof(ans));
int line, len;
scanf("%s", a);
scanf("%d", &line);
len = strlen(a);
for (int i = 0; i < len; i++) {
if (a[i] >= 65 && a[i] <= 90) {
upper[i] = a[i];
lower[i] = a[i] - 'A' + 'a';
} else {
upper[i] = a[i] - 'a' + 'A';
lower[i] = a[i];
}
}
for (int i = 0; i < len; i++) {
if (lower[i] < line + 97) {
ans[i] = upper[i];
} else {
ans[i] = lower[i];
}
printf("%c", ans[i]);
}
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100];
int main() {
int i, n;
cin >> s >> n;
for (i = 0; s[i]; i++) {
if (s[i] < 'a') s[i] += 'a' - 'A';
if (s[i] < 'a' + n) s[i] += 'A' - 'a';
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n, i;
int main() {
getline(cin, s);
cin >> n;
for (i = 0; i < s.length(); i++)
if (s[i] < 'a') s[i] = (char)((int)s[i] + 32);
for (i = 0; i < s.length(); i++) {
if ((int)s[i] < (char)(n + 97)) {
if (s[i] >= 'a') s[i] = (char)((int)s[i] - 32);
} else if (s[i] < 'a')
s[i] = (char)((int)s[i] + 32);
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.141592653589793238462643l;
int main() {
string s;
cin >> s;
int n;
cin >> n;
for (int i = 0; i < int(s.size()); i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
if (s[i] < 'a' + n) {
s[i] += 'A' - 'a';
}
} else {
if (s[i] >= 'A' + n) {
s[i] += 'a' - 'A';
}
}
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char l(char i) {
if (i >= 'a') return i;
return i + ('a' - 'A');
}
char u(char i) {
if (i >= 'a') return i - ('a' - 'A');
return i;
}
string lower(string in) {
string a;
for (int i = (0); i < (in.size()); ++i) {
a += l(in[i]);
}
return a;
}
string upper(string in) {
string a;
for (int i = (0); i < (in.size()); ++i) {
a += u(in[i]);
}
return a;
}
int main() {
string v27;
int v16;
cin >> v27;
cin >> v16;
string v4;
v27 = lower(v27);
for (int v26 = (0); v26 < (v27.length()); ++v26) {
char v19 = v27[v26];
if (v19 < 97 + v16)
v4 += u(v19);
else
v4 += l(v19);
}
cout << v4 << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
char a[55];
int main() {
int n, i, nLen;
gets(a);
scanf("%d", &n);
nLen = strlen(a);
for (i = 0; i < nLen; i++) {
if (a[i] >= 'A' && a[i] <= 'Z') {
a[i] += 32;
}
if (a[i] < n + 97)
printf("%c", a[i] - 32);
else
printf("%c", a[i]);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
inline int read() {
int res, ok = 1;
char ch;
for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())
if (ch == '-') ok = -1;
res = ch - '0';
for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())
res = res * 10 + ch - '0';
return res * ok;
}
int x, n;
char s[55];
int main() {
scanf("%s", s + 1);
x = read();
n = strlen(s + 1);
for (int i = 1; i <= n; i++)
if (s[i] < 'a') s[i] += 'a' - 'A';
for (int i = 1; i <= n; i++) {
int t = s[i];
if (t < x + 97) s[i] -= 'a' - 'A';
}
printf("%s", s + 1);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
std::string input("");
getline(std::cin, input);
int bound(0);
std::cin >> bound;
for (int k = 0; k < input.size(); k++) {
if ('a' <= tolower(input[k]) && tolower(input[k]) < 'a' + bound) {
printf("%c", toupper(input[k]));
} else if ('a' + bound <= tolower(input[k]) &&
tolower(input[k]) < 'z' + bound) {
printf("%c", tolower(input[k]));
} else {
printf("%c", input[k]);
}
}
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool comp(int a, int b) { return (a > b); }
int main() {
int n, x;
char data[100];
scanf("%s %d", &data, &n);
x = strlen(data);
for (int i = 0; i <= x - 1; i++) {
if (data[i] >= 'A' && data[i] <= 'Z') data[i] = data[i] - 'A' + 'a';
if (data[i] < n + 97) data[i] = data[i] - 'a' + 'A';
}
printf("%s", data);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
for (int i = 0; i < s.length(); i++) {
s[i] = tolower(s[i]);
}
for (int i = 0; i < s.length(); i++) {
if (s[i] < 97 + n) {
s[i] = toupper(s[i]);
} else {
s[i] = tolower(s[i]);
}
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n;
cin >> n;
string c;
for (int i = 0; i < s.size(); i++) {
if (s[i] < 'a') s[i] = s[i] + 32;
}
for (int i = 0; i < s.size(); i++) {
char e = s[i];
if (e < n + 97) {
if (e < 'a')
c = c + e;
else {
e = e - 32;
c = c + (e);
}
} else
c = c + e;
}
cout << c << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a;
cin >> s >> a;
for (int i = 0; i < s.size(); ++i) {
s[i] = tolower(s[i]);
if (s[i] < a + 97) {
s[i] = toupper(s[i]);
}
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char in[100];
int a;
scanf("%s", in);
int len = strlen(in);
scanf("%d", &a);
for (int i = 0; i < len; i++) {
if (in[i] >= 'A' && in[i] <= 'Z') in[i] = in[i] + 'a' - 'A';
if (in[i] < a + 97) {
in[i] = in[i] + 'A' - 'a';
}
}
puts(in);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char str[100];
int n, i, j, len;
while (scanf("%s", str) != EOF) {
scanf("%d", &n);
len = strlen(str);
for (i = 0; i < len; i++) {
if (str[i] < 'a') str[i] += 'a' - 'A';
if (str[i] < n + 97) str[i] += 'A' - 'a';
}
printf("%s\n", str);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, i, j, k;
string s;
string a[501];
int main() {
cin >> s;
cin >> m;
for (i = 0; i < s.size(); i++)
if (s[i] >= 'a' && s[i] - 'a' < m)
s[i] = s[i] - 'a' + 'A';
else if (s[i] <= 'Z' && s[i] - 'A' >= m)
s[i] = s[i] - 'A' + 'a';
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int num;
cin >> num;
for (int i = 0; i < str.size(); i++) {
if (str[i] >= 97 && str[i] <= 122)
str[i] = str[i];
else
str[i] = str[i] + 32;
}
for (int i = 0; i < str.size(); i++) {
if (str[i] >= 97 && str[i] <= 97 + num - 1)
str[i] = str[i] - 32;
else
str[i] = str[i];
}
cout << str << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 20;
int main() {
char a[100];
int b;
cin >> a >> b;
for (int i = 0; a[i]; i++) {
if (a[i] <= 'Z') a[i] = a[i] + 32;
if (a[i] < b + 97) a[i] = a[i] - 32;
}
puts(a);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int n;
cin >> a >> n;
int l = a.size();
for (int i = 0; i < l; ++i) a[i] = tolower(a[i]);
for (int i = 0; i < l; ++i) {
int buff = a[i];
if (buff < n + 97) a[i] = toupper(a[i]);
}
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char upper(char c) {
if ('A' <= c and c <= 'Z') return c;
return c - 'a' + 'A';
}
char lower(char c) {
if ('a' <= c and c <= 'z') return c;
return c - 'A' + 'a';
}
char str[64];
int aux;
int main() {
scanf("%s", str);
string s = str;
scanf("%d", &aux);
for (int i = 0; i < (int)s.size(); i++) s[i] = lower(s[i]);
for (int i = 0; i < (int)s.size(); i++) {
char p = s[i];
if ((int)p < aux + 97)
printf("%c", upper(p));
else
printf("%c", lower(p));
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[100];
int b[100];
char ans[100];
int k;
int main() {
while (scanf("%s %d", a, &k) != EOF) {
int len = strlen(a);
for (int i = 0; i < len; i++) {
if (a[i] <= 'z' && a[i] >= 'a')
b[i] = a[i] - 'a';
else
b[i] = a[i] - 'A';
}
for (int i = 0; i < len; i++) {
if (b[i] < k)
ans[i] = b[i] + 'A';
else
ans[i] = b[i] + 'a';
}
ans[len] = 0;
puts(ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
char down(char c) {
if (c >= 'A' && c <= 'Z') c += 32;
return c;
}
char up(char c) {
if (c >= 'a' && c <= 'z') c -= 32;
return c;
}
int main() {
char a[52], c, d[52];
int b, i, j, k;
while (cin >> a >> b) {
for (i = 0; i < strlen(a); i++) {
c = down(a[i]);
if (c <= 'a' - 1 + b) {
d[i] = up(c);
} else {
d[i] = down(c);
}
}
d[i] = '\0';
cout << d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char map[1005][1005];
char a[1004];
int n;
int main() {
cin >> a;
cin >> n;
for (int i = 0; i < strlen(a); i++) {
if (a[i] >= 'A' && a[i] <= 'Z') a[i] += 'a' - 'A';
}
for (int i = 0; i < strlen(a); i++) {
if (a[i] < n + 97) a[i] -= 'a' - 'A';
}
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int strToInt(string str) {
int ans;
stringstream s;
s << str;
s >> ans;
return ans;
}
string intToStr(int n) {
string str;
stringstream s;
s << n;
s >> str;
return str;
}
int MAX(int a, int b) {
if (a > b) return a;
return b;
}
int MIN(int a, int b) {
if (a < b) return a;
return b;
}
int ABS(int a, int b) {
if (a > 0) return a;
return -a;
}
int main() {
string str;
cin >> str;
int number, len, temp;
cin >> number;
len = str.size();
for (int i = 0; i < len; i++) {
if (str[i] >= 'a')
temp = str[i] - 'a';
else
temp = str[i] - 'A';
if (temp < number) {
str[i] = char('A' + temp);
} else
str[i] = char('a' + temp);
}
cout << str;
return 0;
}
|
#include <bits/stdc++.h>
char S[100];
int x;
int main() {
scanf("%s", S);
scanf("%d", &x);
int i;
for (i = 0; i < S[i]; i++)
if ('A' <= S[i] && S[i] <= 'Z') S[i] += 'a' - 'A';
for (i = 0; i < S[i]; i++) {
if (S[i] < x + 97) S[i] += 'A' - 'a';
}
printf("%s", S);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int M = 25;
const int mod = 1e9 + 7;
const double eps = 1e-8;
const double Pi = 2 * acos(0.0);
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a < b ? a : b; }
inline int bit(int x) { return 1 << x; }
inline int abs(int x) { return x > 0 ? x : (-x); }
int n;
char s[55];
int main() {
ios::sync_with_stdio(0);
cin >> s >> n;
for (int i = 0; s[i]; i++) {
if (s[i] >= 'a')
s[i] -= 'a';
else
s[i] -= 'A';
if (s[i] < n) {
s[i] += 'A';
} else
s[i] += 'a';
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
__inline bool nextInt(int &val) {
char ch;
int sgn = 1;
while ((ch = getchar()) != EOF) {
if (ch == '-') sgn = -1;
if (ch >= '0' && ch <= '9') break;
}
if (ch == EOF) return false;
val = (int)(ch - '0');
while (true) {
ch = getchar();
if (ch >= '0' && ch <= '9') {
val = 10 * val + (int)(ch - '0');
} else
break;
}
val *= sgn;
return true;
}
__inline bool nextString(string &s) {
char ch;
while ((ch = getchar()) != EOF) {
if (ch >= 33 && ch <= 126) break;
}
if (ch == EOF) return false;
s = string(1, ch);
while (true) {
ch = getchar();
if (ch >= 33 && ch <= 126) {
s = s + string(1, ch);
} else
break;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
string s, o;
int n;
cin >> s >> n;
o = "";
for (int i = 0; i < (s.size()); i++)
if ((int)((s[i]) >= 'a' && (s[i]) <= 'z'
? (s[i])
: (char)('a' + ((s[i]) - 'A'))) < n + 97)
o += string(
1, ((s[i]) >= 'A' && (s[i]) <= 'Z' ? (s[i])
: (char)('A' + ((s[i]) - 'a'))));
else
o += string(
1, ((s[i]) >= 'a' && (s[i]) <= 'z' ? (s[i])
: (char)('a' + ((s[i]) - 'A'))));
cout << o << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
for (int i = 0; i < s.length(); i++) {
if (s[i] <= 'Z') s[i] += 'a' - 'A';
if (s[i] < 'a' + n) s[i] += 'A' - 'a';
}
cout << s << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
string st;
int n;
int main() {
cin >> st;
cin >> n;
for (int i = 0; i < st.size(); i++) {
if (st[i] >= 'A' && st[i] <= 'Z') st[i] = char(int(st[i]) + 32);
}
for (int i = 0; i < st.size(); i++) {
if (int(st[i]) < n + 97) {
st[i] = char(int(st[i]) - 32);
}
}
cout << st;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, len;
char c[55];
scanf("%s", &c);
scanf("%d", &i);
len = strlen(c);
for (j = 0; j < len; j++) {
c[j] = tolower(c[j]);
}
for (j = 0; j < len; j++) {
if ((int)c[j] <= (int)'a' + i - 1) c[j] = toupper(c[j]);
}
printf("%s", c);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int knightx[] = {-2, -1, +1, +2, +2, +1, -1, -2},
knighty[] = {+1, +2, +2, +1, -1, -2, -2, -1};
int kingx[] = {-1, -1, 0, +1, +1, +1, 0, -1},
kingy[] = {0, +1, +1, +1, 0, -1, -1, -1};
int dx2D[] = {-1, 0, +1, 0}, dy2D[] = {0, +1, 0, -1};
int dx3D[] = {0, 0, 0, 0, +1, -1}, dy3D[] = {0, +1, 0, -1, 0, 0},
dz3D[] = {-1, 0, +1, 0, 0, 0};
int GCD(int a, int b) {
if (a == b) return a;
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * (b / GCD(a, b)); }
long long POWER(long long a, long long b) {
long long res = 1;
for (long long p = b; p; p >>= 1, a *= a) {
if (p & 1) res *= a;
}
return res;
}
long double Line(complex<long double> a) { return norm(a); }
long double DRG(long double d1, long double d2) {
return ((asin(d1 / d2) * 180) / 3.14159265359);
}
bool isDigit(char c) { return (c >= '0' && c <= '9'); }
bool isLowerCase(char c) { return (c >= 'a' && c <= 'z'); }
bool isUpperCase(char c) { return (c >= 'A' && c <= 'Z'); }
bool isLetter(char c) { return (isUpperCase(c) || isLowerCase(c)); }
char toLowerCase(char c) { return (isUpperCase(c) ? (c + 32) : c); }
char toUpperCase(char c) { return (isLowerCase(c) ? (c - 32) : c); }
vector<string> Parse(string temp) {
vector<string> ans;
ans.clear();
istringstream is(temp);
for (string s; is >> s; ans.push_back(s))
;
return ans;
}
long long toInt(string temp) {
long long num = 0;
for (int i = 0; i < temp.size(); i++) {
num *= 10;
num += (temp[i] - 48);
}
return num;
}
void Prim(bool a[]) {
for (int i = 3; i <= 100001; i += 2) {
bool k = true;
for (int j = 2; j < sqrt((double)i) + 1; j++) {
if (i % j == 0) {
k = false;
break;
}
}
if (k == true) a[i] = k;
}
}
int main() {
string s;
int n;
cin >> s >> n;
for (int i = 0; i < ((int)s.size()); i++) {
if (!islower(s[i])) s[i] = (s[i] + 32);
}
for (int i = 0; i < ((int)s.size()); i++) {
if ((int)s[i] < n + 97) {
s[i] = toUpperCase(s[i]);
}
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int t;
cin >> s;
cin >> t;
for (int i = 0; i < (int)s.length(); i++) {
int c = islower(s[i]) ? s[i] - 'a' : s[i] - 'A';
if (c < t)
s[i] = c + 'A';
else
s[i] = c + 'a';
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n, d;
int main() {
cin >> s >> n;
d = s.size();
for (int i = 0; i < d; i++) {
if (s[i] <= 'Z') s[i] += 32;
if (s[i] < 'a' + n) s[i] -= 32;
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s;
cin >> n;
for (int i = 0; i < s.size(); i++) s[i] = tolower(s[i]);
for (int i = 0; i < s.size(); i++) {
if (s[i] < 97 + n)
s[i] = toupper(s[i]);
else
s[i] = tolower(s[i]);
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int t;
getline(cin, s);
cin >> t;
for (int i = 0; i < s.length(); i++)
if (s[i] >= 'A' && s[i] <= 'Z') {
s[i] = s[i] - 'A' + 'a';
}
for (int i = 0; i < s.length(); i++) {
char c = s[i];
if (c < t + 97) {
s[i] = s[i] - 'a' + 'A';
}
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000009;
const int MAXN = 1010;
const int MAXM = 1010;
int main() {
string a;
cin >> a;
int b;
cin >> b;
for (int i = 0; i < a.size(); ++i) {
if (a[i] >= 'a') a[i] = a[i] - 32;
if ('A' <= a[i] && a[i] < 'A' + b) {
} else {
a[i] = a[i] + 32;
}
}
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:100000000")
int main() {
string s;
cin >> s;
int n;
scanf("%d", &n);
for (int i = 0, maxi = (int)(s).size(); i < maxi; i++) {
if (s[i] >= 'a' && s[i] <= 'z' && s[i] - 'a' < n) s[i] += 'A' - 'a';
if (s[i] >= 'A' && s[i] <= 'Z' && s[i] - 'A' >= n) s[i] -= 'A' - 'a';
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int b;
cin >> a;
cin >> b;
for (int(i) = (0); (i) < (int((a).size())); (i)++) a[i] = tolower(a[i]);
string ret = "";
for (int(i) = (0); (i) < (int((a).size())); (i)++) {
char c = a[i];
if ((int)c < b + 97)
ret += toupper(c);
else
ret += c;
}
cout << ret << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string line;
int a;
getline(cin, line);
scanf("%d", &a);
for (int i = 0; i < line.size(); i++) {
if (line[i] >= 'A' && line[i] <= 'Z') line[i] += 32;
}
for (int i = 0; i < line.size(); i++) {
if (line[i] < a + 97)
line[i] = line[i] - 32;
else
continue;
}
cout << line << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str_27;
getline(cin, str_27);
int i16;
cin >> i16;
string res = "";
for (int i26 = 0; i26 < str_27.size(); i26++) {
char c19 = tolower(str_27[i26]);
if (c19 < i16 + 97) {
res.push_back(toupper(c19));
} else {
res.push_back(tolower(c19));
}
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a;
cin >> a;
string ans;
for (int i = 0; i < s.size(); i++) {
if (s[i] < 'a') s[i] += ('a' - 'A');
}
for (int i = 0; i < s.size(); i++) {
if (s[i] < a + 97) {
ans += (s[i] - 'a' + 'A');
} else
ans += s[i];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s;
cin >> n;
for (int i = 0; i < s.length(); i++)
if (s[i] >= 'A' && s[i] <= 'Z') s[i] += 'a' - 'A';
for (int i = 0; i < s.length(); i++) {
char c = s[i];
if (c < (n + 97)) s[i] -= 'a' - 'A';
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
char ar[1000], er[1000];
void oku() {
int i, t, a;
scanf("%s", ar);
scanf("%d", &t);
a = strlen(ar);
for (int i = 0; i < a; i++)
if (ar[i] <= 'Z') ar[i] += 32;
for (int i = 0; i < a; i++) {
if (ar[i] < 97 + t) ar[i] = ar[i] - 32;
}
cout << ar << endl;
}
int main() {
oku();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int b;
cin >> a >> b;
for (int i = 0; i < a.length(); i++) {
a[i] = (a[i] >= 'a' && a[i] <= 'z') ? a[i] : a[i] - 'A' + 'a';
}
for (int i = 0; i < a.length(); i++) {
int t = a[i];
if (t < b + 97) {
a[i] = (a[i] >= 'A' && a[i] <= 'Z') ? a[i] : a[i] - 'a' + 'A';
} else {
a[i] = (a[i] >= 'a' && a[i] <= 'z') ? a[i] : a[i] - 'A' + 'a';
}
}
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char lower(char c) {
if (c < 97) c += 32;
return c;
}
char upper(char c) {
if (c >= 97) c -= 32;
return c;
}
int main() {
string in;
int n;
cin >> in;
cin >> n;
int len = in.length();
string out;
for (int i = 0; i < len; i++) {
char tmp = lower(in[i]);
if (tmp < n + 97)
out += upper(tmp);
else
out += tmp;
}
cout << out << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int d;
char s[55];
scanf("%s%d", s, &d);
for (int i = 0; s[i]; i++)
if (tolower(s[i]) < d + 97)
s[i] = toupper(s[i]);
else
s[i] = tolower(s[i]);
puts(s);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s;
for (int i = 0; i < s.length(); i++)
if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
cin >> n;
for (int i = 0; i < s.length(); i++)
if (s[i] < n + 97) s[i] = s[i] - 'a' + 'A';
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char str[100], ans[100];
int n;
scanf("%s%d", str, &n);
for (int i = 0; str[i]; i++) str[i] = tolower(str[i]);
for (int i = 0; str[i]; i++) {
char ch = str[i];
if (ch < n + 97)
ans[i] = toupper(ch);
else
ans[i] = tolower(ch);
}
for (int i = 0; str[i]; i++) putchar(ans[i]);
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n;
cin >> str >> n;
for (int i = 0; i < str.length(); i++) {
if (str[i] >= 'A' && str[i] <= 'Z') str[i] += 32;
if (str[i] < (n + 97)) {
str[i] -= 32;
}
}
cout << str << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int M;
cin >> M;
for (int i = 0; i < S.length(); i++) {
char ch = S[i];
if (ch - 'Z' <= 0) ch -= ('A' - 'a');
if (ch - 'a' < M)
S[i] = ch + ('A' - 'a');
else
S[i] = ch;
}
cout << S << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.