problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
char dif = 'A' - 'a';
S[K] += dif;
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
char dif = 'a' - 'A';
S[K - 1] += dif;
cout << S << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change",
"assignment.change"
] | 856,143 | 856,142 | u469953228 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
char dif = 'a' - 'A';
S[K] += dif;
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
char dif = 'a' - 'A';
S[K - 1] += dif;
cout << S << endl;
}
| [
"assignment.change"
] | 856,144 | 856,142 | u469953228 | cpp |
p03041 | #include <bits/stdc++.h>
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define Rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define int long long
using namespace std;
signed main() {
string x;
i... | #include <bits/stdc++.h>
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define Rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define int long long
using namespace std;
signed main() {
string x;
i... | [
"expression.unary.arithmetic.add"
] | 856,153 | 856,154 | u893330446 | cpp |
p03041 | #include <cstdio>
int main() {
int n, k;
char s[101];
scanf("%d%d", &n, &k);
scanf("%s", s);
s[k - 1] = +32;
printf("%s", s);
return 0;
} | #include <cstdio>
int main() {
int n, k;
char s[101];
scanf("%d%d", &n, &k);
scanf("%s", s);
s[k - 1] = s[k - 1] + 32;
printf("%s", s);
return 0;
}
| [] | 856,155 | 856,156 | u318350382 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string c;
cin >> a >> b >> c;
c[b] = c[b] + 32;
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string c;
cin >> a >> b >> c;
c[b - 1] = c[b - 1] + 32;
cout << c;
} | [
"assignment.change"
] | 856,163 | 856,164 | u950901760 | cpp |
p03041 | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
s[k] += 32;
cout << s << endl;
} | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
s[k - 1] += 32;
cout << s << endl;
} | [
"assignment.change"
] | 856,178 | 856,179 | u317177661 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int main(void) {
int N, K;
string S;
cin >> N >> K >> S;
if (S[K - 1] == 'A')
S[K] = 'a';
if (S... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int main(void) {
int N, K;
string S;
cin >> N >> K >> S;
if (S[K - 1] == 'A')
S[K - 1] = 'a';
i... | [
"assignment.change"
] | 856,191 | 856,192 | u582848517 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string s;
cin >> N >> K >> s;
if (s.at(K - 1) = 'A') {
s.at(K - 1) = 'a';
}
if (s.at(K - 1) = 'B') {
s.at(K - 1) = 'b';
}
if (s.at(K - 1) = 'C') {
s.at(K - 1) = 'c';
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string s;
cin >> N >> K >> s;
if (s.at(K - 1) == 'A') {
s.at(K - 1) = 'a';
}
if (s.at(K - 1) == 'B') {
s.at(K - 1) = 'b';
}
if (s.at(K - 1) == 'C') {
s.at(K - 1) = 'c';
}
cout << s << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 856,193 | 856,194 | u702457163 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int N, K;
cin >> N >> K;
cin >> S;
K = K - 1;
if (S[K] == 'A') {
S[K] = 'a';
} else if (S[K] == 'B') {
S[K] = 'b';
} else if (S[K] == 'C')
;
{ S[K] = 'c'; }
cout << S << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int N, K;
cin >> N >> K;
cin >> S;
K = K - 1;
if (S[K] == 'A') {
S[K] = 'a';
} else if (S[K] == 'B') {
S[K] = 'b';
} else if (S[K] == 'C') {
S[K] = 'c';
}
cout << S << endl;
}
| [] | 856,210 | 856,211 | u077051605 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, n, k;
string s;
cin >> n >> k;
k--;
cin >> s;
if (s[k] == 'A')
s[k] = 'a';
else if (s[k] == 'B')
s[k] = 'b';
else if (s[k] == 'c')
s[k] = 'c';
cout << s;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, n, k;
string s;
cin >> n >> k;
k--;
cin >> s;
if (s[k] == 'A')
s[k] = 'a';
else if (s[k] == 'B')
s[k] = 'b';
else if (s[k] == 'C')
s[k] = 'c';
cout << s;
return 0;
}
| [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 856,216 | 856,217 | u737609426 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int c, n;
cin >> n >> c;
string s;
cin >> s;
for (int i = 0; s[i]; i++) {
if (i == c - 1)
cout << s[i] + 32;
else
cout << s[i];
}
}
| #include <iostream>
using namespace std;
int main() {
int c, n;
cin >> n >> c;
string s;
cin >> s;
for (int i = 0; s[i]; i++) {
if (i == c - 1)
cout << (char)(s[i] + 32);
else
cout << s[i];
}
}
| [
"type_conversion.add"
] | 856,224 | 856,225 | u312943292 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
if (S.at(K) == 'A') {
S.at(K) = 'a';
} else if (S.at(K) == 'B') {
S.at(K) = 'b';
} else {
S.at(K) = 'c';
}
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
K -= 1;
cin >> S;
if (S.at(K) == 'A') {
S.at(K) = 'a';
} else if (S.at(K) == 'B') {
S.at(K) = 'b';
} else {
S.at(K) = 'c';
}
cout << S << endl;
}
| [
"assignment.add"
] | 856,239 | 856,240 | u838419592 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S[K - 1] == 'A') {
S[K - 1] = 'a';
} else if (S[K - 1] = 'B') {
S[K - 1] = 'b';
} else if (S[K - 1] = 'C') {
S[K - 1] = 'c';
}
cout << S << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S[K - 1] == 'A') {
S[K - 1] = 'a';
} else if (S[K - 1] == 'B') {
S[K - 1] = 'b';
} else if (S[K - 1] == 'C') {
S[K - 1] = 'c';
}
cout << S << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 856,245 | 856,246 | u813559924 | cpp |
p03041 | #include <cctype>
#include <iostream>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
int c = S[K];
S[K] = tolower(c);
cout << S << endl;
return 0;
} | #include <cctype>
#include <iostream>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
int c = S[K - 1];
S[K - 1] = tolower(c);
cout << S << endl;
return 0;
} | [
"assignment.change"
] | 856,248 | 856,249 | u023461939 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
S[K] -= 'A';
S[K] += 'a';
cout << S;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
S[K - 1] -= 'A';
S[K - 1] += 'a';
cout << S;
} | [
"assignment.change"
] | 856,250 | 856,251 | u416526752 | cpp |
p03041 | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k] = s[k] + 32;
cout << s << endl;
}
| #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = s[k - 1] + 32;
cout << s << endl;
}
| [
"assignment.change"
] | 856,256 | 856,257 | u118875091 | cpp |
p03041 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
int n, k;
std::string st;
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
std::cin >> n >> k;
--n, --k;
std::cin >> st;
if (st[k] ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
int n, k;
std::string st;
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
std::cin >> n >> k;
--n, --k;
std::cin >> st;
if (st[k] ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 856,258 | 856,259 | u240904580 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
if (S[K - 1] = 'A') {
S[K - 1] = 'a';
} else if (S[K - 1] = 'B') {
S[K - 1] = 'b';
} else if (S[K - 1] = 'C') {
S[K - 1] = 'c';
}
cout << S << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (S[K - 1] == 'A') {
S[K - 1] = 'a';
} else if (S[K - 1] == 'B') {
S[K - 1] = 'b';
} else if (S[K - 1] == 'C') {
S[K - 1] = 'c';
}
cout << S << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 856,264 | 856,265 | u705644950 | cpp |
p03041 | #include <cctype>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
string s;
cin >> n >> m;
cin >> s;
s[m] = tolower(s[m - 1]);
cout << s;
return 0;
}
| #include <cctype>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
string s;
cin >> n >> m;
cin >> s;
s[m - 1] = tolower(s[m - 1]);
cout << s;
return 0;
}
| [
"assignment.change"
] | 856,269 | 856,270 | u870592517 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string str;
cin >> n >> k >> str;
str[k] += 'a' - 'A';
cout << str << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string str;
cin >> n >> k >> str;
str[k - 1] += 'a' - 'A';
cout << str << endl;
return 0;
} | [
"assignment.change"
] | 856,271 | 856,272 | u426837411 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S = "ABC";
int N, K;
cin >> N >> K;
cin >> S;
S[K] = S[K] + 32;
cout << S << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S = "ABC";
int N, K;
cin >> N >> K;
cin >> S;
S[K - 1] = S[K - 1] + 32;
cout << S << '\n';
return 0;
}
| [
"assignment.change"
] | 856,287 | 856,288 | u624596042 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string str;
cin >> str;
for (int i = 0; i < (int)str.size(); ++i) {
if (K == i) {
cout << (char)tolower(str[i]);
} else {
cout << str[i];
}
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string str;
cin >> str;
for (int i = 0; i < (int)str.size(); ++i) {
if (K - 1 == i) {
cout << (char)tolower(str[i]);
} else {
cout << str[i];
}
}
cout << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 856,291 | 856,292 | u444318984 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int a, b;
string s;
cin >> a >> b >> s;
b = b - 1;
if (s[b] == 'A') {
s[b] = 'a';
} else if (s[b] == 'B') {
s[b] == 'b';
} else if (s[b] == 'C') {
s[b] == 'c';
}
cout << s << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int a, b;
string s;
cin >> a >> b >> s;
b = b - 1;
if (s[b] == 'A') {
s[b] = 'a';
} else if (s[b] == 'B') {
s[b] = 'b';
} else if (s[b] == 'C') {
s[b] = 'c';
}
cout << s << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 856,295 | 856,296 | u840731541 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int N, K;
char S[50];
cin >> N >> K >> S;
S[K] = S[K] + 32;
cout << S << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, K;
char S[50];
cin >> N >> K >> S;
S[K - 1] = S[K - 1] + 32;
cout << S << endl;
return 0;
}
| [
"assignment.change"
] | 856,297 | 856,298 | u147571984 | cpp |
p03041 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define off \
ios_base::sync_with_stdio(0); \
ci... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define off \
ios_base::sync_with_stdio(0); \
ci... | [
"expression.operator.change"
] | 856,310 | 856,311 | u221519228 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string str;
cin >> N >> K;
cin >> str;
str[K] += 32;
cout << str;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string str;
cin >> N >> K;
cin >> str;
str[K - 1] += 32;
cout << str;
} | [
"assignment.change"
] | 856,343 | 856,344 | u914384129 | cpp |
p03041 | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
auto main() -> int {
size_t N, K;
cin >> N >> K;
string str;
cin >> str;
for (size_t i = 0; i < str.length(); i++) {
if (i == K)
cout << char(::tolower(str[i]));
else
cout... | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
auto main() -> int {
size_t N, K;
cin >> N >> K;
string str;
cin >> str;
for (size_t i = 0; i < str.length(); i++) {
if (i == (K - 1))
cout << char(::tolower(str[i]));
else
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 856,351 | 856,352 | u678449958 | cpp |
p03041 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define l... | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define l... | [
"assignment.add"
] | 856,358 | 856,359 | u662918817 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
if (s[k] == 'A') {
s[k] = 'a';
} else if (s[k] == 'B') {
s[k] = 'b';
} else if (s[k] == 'C') {
s[k] = 'c';
}
cout << s << endl;
system("pause");
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
k--;
if (s[k] == 'A') {
s[k] = 'a';
} else if (s[k] == 'B') {
s[k] = 'b';
} else if (s[k] == 'C') {
s[k] = 'c';
}
cout << s << endl;
system("pause");
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 856,367 | 856,368 | u515468466 | cpp |
p03041 | #include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
int main()
{
FILE *in = stdin;
int n, k;
fscanf(in, "%d %d\n", &n, &k);
// printf("%d,%d\n", n, k);
char tmp[51];
fscanf(in, "%s", tmp);
tmp[k - 1] = tolower(tmp[k - 1]);
return 0;
} | #include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
int main()
{
FILE *in = stdin;
int n, k;
fscanf(in, "%d %d\n", &n, &k);
// printf("%d,%d\n", n, k);
char tmp[51];
fscanf(in, "%s", tmp);
tmp[k - 1] = tolower(tmp[k - 1]);
puts(tmp);
return 0;
} | [
"call.add"
] | 856,373 | 856,374 | u502614855 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int n, m;
char s[200];
cin >> n >> m >> s;
s[m] += 32;
cout << s;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, m;
char s[200];
cin >> n >> m >> s;
s[m - 1] += 32;
cout << s;
return 0;
} | [
"assignment.change"
] | 856,381 | 856,382 | u634135595 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | [
"assignment.change"
] | 856,387 | 856,388 | u160321725 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
char S[N + 1];
cin >> S;
if (S[K - 1] = 'A')
S[K - 1] = 'a';
if (S[K - 1] = 'B')
S[K - 1] = 'b';
if (S[K - 1] = 'C')
S[K - 1] = 'c';
cout << S << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
char S[N + 1];
cin >> S;
if (S[K - 1] == 'A')
S[K - 1] = 'a';
if (S[K - 1] == 'B')
S[K - 1] = 'b';
if (S[K - 1] == 'C')
S[K - 1] = 'c';
cout << S << endl;
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 856,395 | 856,396 | u727733977 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
string s;
cin >> s;
s[k] = tolower(s[k]);
cout << s << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
string s;
cin >> s;
s[k - 1] = tolower(s[k - 1]);
cout << s << endl;
return 0;
} | [
"assignment.change"
] | 856,403 | 856,404 | u672197988 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string s;
cin >> N >> K;
cin >> s;
s[K] += 32;
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string s;
cin >> N >> K;
cin >> s;
s[K - 1] += 32;
cout << s << endl;
return 0;
}
| [
"assignment.change"
] | 856,426 | 856,427 | u839938263 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string s;
cin >> N >> K;
cin >> s;
s[K] += 32;
cout << s;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string s;
cin >> N >> K;
cin >> s;
s[K - 1] += 32;
cout << s << endl;
return 0;
}
| [
"assignment.change",
"io.output.newline.add"
] | 856,428 | 856,427 | u839938263 | cpp |
p03041 | #include <cstdint>
#include <cstdio>
int main(void) {
int n, k;
std::scanf("%d %d\n", &n, &k);
char *str = new char[static_cast<std::size_t>(n + 2)];
std::scanf("%s", str);
str[k] = static_cast<char>(static_cast<uint8_t>(str[k]) + 0x20);
std::printf("%s", str);
}
| #include <cstdint>
#include <cstdio>
int main(void) {
int n, k;
std::scanf("%d %d\n", &n, &k);
char *str = new char[static_cast<std::size_t>(n + 2)];
std::scanf("%s", str);
str[k - 1] = static_cast<char>(static_cast<uint8_t>(str[k - 1]) + 0x20);
std::printf("%s", str);
}
| [
"assignment.change"
] | 856,429 | 856,430 | u012646025 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string S;
cin >> n >> k;
cin >> S;
if (S[k - 1] == 'A')
S[k - 1] = 'a';
if (S[k - 1] == 'B')
S[k - 1] = 'b';
if (S[k - 1] == 'B')
S[k - 1] = 'c';
cout << S;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string S;
cin >> n >> k;
cin >> S;
if (S[k - 1] == 'A')
S[k - 1] = 'a';
if (S[k - 1] == 'B')
S[k - 1] = 'b';
if (S[k - 1] == 'C')
S[k - 1] = 'c';
cout << S;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 856,433 | 856,434 | u784706568 | cpp |
p03041 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | [
"assignment.change"
] | 856,437 | 856,438 | u846813901 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int K;
string s;
cin >> n >> K;
int k = K - 1;
cin >> s;
if (s[k] == 'A') {
s.replace(k, 1, "a");
}
if (s[k] == 'B') {
s.replace(k, 1, "b");
}
if (s[k] == 'C') {
s.replace(k + 1, 1, "c");
}
cout << s <<... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int K;
string s;
cin >> n >> K;
int k = K - 1;
cin >> s;
if (s[k] == 'A') {
s.replace(k, 1, "a");
}
if (s[k] == 'B') {
s.replace(k, 1, "b");
}
if (s[k] == 'C') {
s.replace(k, 1, "c");
}
cout << s << end... | [
"expression.operation.binary.remove"
] | 856,439 | 856,440 | u523788288 | cpp |
p03041 | // TOPSIC001_0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_l... | // TOPSIC001_0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_l... | [
"expression.unary.arithmetic.add"
] | 856,449 | 856,450 | u245710867 | cpp |
p03041 | #include <iostream>
int main() {
int N, K;
std::string str;
std::cin >> N >> K;
std::cin >> str;
// std::cout << N << std::endl;
// std::cout << K << std::endl;
// std::cout << str << std::endl;
str[K] = str[K + 1] + 32;
std::cout << str << std::endl;
return 0;
} | #include <iostream>
int main() {
int N, K;
std::string str;
std::cin >> N >> K;
std::cin >> str;
str[K - 1] = str[K - 1] + 32;
std::cout << str << std::endl;
return 0;
} | [
"assignment.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 856,466 | 856,467 | u085987081 | cpp |
p03041 | #include <iostream>
int main() {
int N, K;
std::string str;
std::cin >> N >> K;
std::cin >> str;
// std::cout << N << std::endl;
// std::cout << K << std::endl;
// std::cout << str << std::endl;
str[K] = str[K] + 32;
std::cout << str << std::endl;
return 0;
} | #include <iostream>
int main() {
int N, K;
std::string str;
std::cin >> N >> K;
std::cin >> str;
str[K - 1] = str[K - 1] + 32;
std::cout << str << std::endl;
return 0;
} | [
"assignment.change"
] | 856,468 | 856,467 | u085987081 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
string s;
int K, N;
int main() {
cin >> K >> N;
cin >> s;
s[K - 1] = s[K - 1] + 32; // K[0]カラ始まってるからK-1にしている。
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int K, N;
int main() {
cin >> N >> K;
cin >> s;
s[K - 1] = s[K - 1] + 32; // K[0]カラ始まってるからK-1にしている。
cout << s << endl;
} | [
"expression.operation.binary.remove"
] | 856,471 | 856,472 | u327265852 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = char(65 + (s[k - 1] - 'A'));
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = char(97 + (s[k - 1] - 'A'));
cout << s << endl;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 856,473 | 856,474 | u435225553 | cpp |
p03041 | #include <algorithm>
#include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
K -= K;
if (S[K] == 'A') {
S[K] = 'a';
} else if (S[K] == 'B') {
S[K] = 'b';
} else {
S[K] = 'c';
}
cout << S << endl;
... | #include <algorithm>
#include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
--K;
if (S[K] == 'A') {
S[K] = 'a';
} else if (S[K] == 'B') {
S[K] = 'b';
} else {
S[K] = 'c';
}
cout << S << endl;
re... | [] | 856,477 | 856,478 | u908393090 | cpp |
p03041 |
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 9999999999;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define pb push_back... |
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 9999999999;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define pb push_back... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 856,479 | 856,480 | u435416250 | cpp |
p03041 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define sz(a) a.size()
#define all(a) a.begi... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define sz(a) a.size()
#define all(a) a.begi... | [] | 856,483 | 856,484 | u840813237 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S.at(K - 1) = 'A') {
S.at(K - 1) = 'a';
}
if (S.at(K - 1) = 'B') {
S.at(K - 1) = 'b';
}
if (S.at(K - 1) = 'C') {
S.at(K - 1) = 'c';
}
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S.at(K - 1) == 'A') {
S.at(K - 1) = 'a';
}
if (S.at(K - 1) == 'B') {
S.at(K - 1) = 'b';
}
if (S.at(K - 1) == 'C') {
S.at(K - 1) = 'c';
}
cout << S << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 856,485 | 856,486 | u096717230 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
if (s.at(K) == 'A')
s.at(K) = 'a';
if (s.at(K) == 'B')
s.at(K) = 'b';
if (s.at(K) == 'C')
s.at(K) = 'c';
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
K--;
if (s.at(K) == 'A')
s.at(K) = 'a';
if (s.at(K) == 'B')
s.at(K) = 'b';
if (s.at(K) == 'C')
s.at(K) = 'c';
cout << s << endl;
}
| [
"expression.unary.arithmetic.add"
] | 856,487 | 856,488 | u895564652 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long i, j, k, l, n, m;
cin >> n >> k >> s;
s[k - 1] = s[k - 1] - 32;
cout << s;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long i, j, k, l, n, m;
cin >> n >> k >> s;
s[k - 1] = s[k - 1] + 32;
cout << s;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 856,493 | 856,494 | u900937596 | cpp |
p03041 | #include <stdio.h>
#define STR_SIZE 51U
#define OFFSET 32U
int main(void) {
int k, n;
int r;
int i;
char s[STR_SIZE], s_out[STR_SIZE];
char c_tmp;
r = scanf("%d %d", &n, &k);
r = scanf("%s", s);
for (i = 0; i <= STR_SIZE; i++) {
if (i == k) {
if (s[i] >= 'A' && s[i] <= 'C') {
c_tmp... | #include <stdio.h>
#define STR_SIZE 51U
#define OFFSET 32U
int main(void) {
int k, n;
int r;
int i;
char s[STR_SIZE], s_out[STR_SIZE];
char c_tmp;
r = scanf("%d %d", &n, &k);
r = scanf("%s", s);
for (i = 0; i <= STR_SIZE; i++) {
if (i == k - 1) {
if (s[i] >= 'A' && s[i] <= 'C') {
c... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 856,503 | 856,504 | u458813463 | cpp |
p03041 | #include <stdio.h>
#define STR_SIZE 51U
#define OFFSET 32U
int main(void) {
int k, n;
int r;
int i;
char s[STR_SIZE], s_out[STR_SIZE];
char c_tmp;
r = scanf("%d %d", &n, &k);
r = scanf("%s", s);
for (i = 0; i <= n; i++) {
if (i == k) {
if (s[i] >= 'A' && s[i] <= 'C') {
c_tmp = s[i]... | #include <stdio.h>
#define STR_SIZE 51U
#define OFFSET 32U
int main(void) {
int k, n;
int r;
int i;
char s[STR_SIZE], s_out[STR_SIZE];
char c_tmp;
r = scanf("%d %d", &n, &k);
r = scanf("%s", s);
for (i = 0; i <= STR_SIZE; i++) {
if (i == k - 1) {
if (s[i] >= 'A' && s[i] <= 'C') {
c... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 856,505 | 856,504 | u458813463 | cpp |
p03041 | #include <stdio.h>
#define STR_SIZE 51U
#define OFFSET 32U
int main(void) {
int k, n;
int r;
int i;
char s[STR_SIZE], s_out[STR_SIZE];
char c_tmp;
r = scanf("%d %d", &n, &k);
r = scanf("%s", s);
for (i = 0; i <= n; i++) {
if (i == k) {
if (s[i] >= 'A' && s[i] <= 'C') {
c_tmp = s[i]... | #include <stdio.h>
#define STR_SIZE 51U
#define OFFSET 32U
int main(void) {
int k, n;
int r;
int i;
char s[STR_SIZE], s_out[STR_SIZE];
char c_tmp;
r = scanf("%d %d", &n, &k);
r = scanf("%s", s);
for (i = 0; i <= STR_SIZE; i++) {
if (i == k - 1) {
if (s[i] >= 'A' && s[i] <= 'C') {
c... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change"
] | 856,506 | 856,504 | u458813463 | cpp |
p03041 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n, k;
string s;
cin >> s;
s[k - 1] = s[k - 1] + 32;
cout << s;
return 0;... | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = s[k - 1] + 32;
cout << s;
return ... | [] | 856,519 | 856,520 | u709879360 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int i = 1;
for (char c : s) {
if (i == k) {
if (c == 'A')
cout << 'a';
if (c == 'B')
cout << 'b';
if (c == 'C')
cout << 'b';
} else {
cout << c;
}
... | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int i = 1;
for (char c : s) {
if (i == k) {
if (c == 'A')
cout << 'a';
if (c == 'B')
cout << 'b';
if (c == 'C')
cout << 'c';
} else {
cout << c;
}
... | [
"literal.string.change",
"io.output.change"
] | 856,521 | 856,522 | u207460172 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S[K - 1] == 'A') {
S[K - 1] = 'a';
} else... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S[K - 1] == 'A') {
S[K - 1] = 'a';
} else... | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 856,523 | 856,524 | u955534952 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S[K - 1] == 'A') {
S[K - 1] = 'a';
} else... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S[K - 1] == 'A') {
S[K - 1] = 'a';
} else... | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change",
"control_flow.branch.else.add"
] | 856,525 | 856,524 | u955534952 | cpp |
p03041 | #include "string.h"
#include <iostream>
#include <sstream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
s[K] = s[K] - 'A' + 'a';
cout << s << endl;
return 0;
} | #include "string.h"
#include <iostream>
#include <sstream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
s[K - 1] = s[K - 1] - 'A' + 'a';
cout << s << endl;
return 0;
} | [
"assignment.change"
] | 856,546 | 856,547 | u008729541 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, S;
string s;
cin >> N >> S >> s;
if (s[S - 1] == 'A') {
s[S - 1] = 'a';
} else if (s[S - 1] == 'B') {
s[S - 1] = 'b';
} else {
s[S - 1] == 'c';
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, S;
string s;
cin >> N >> S >> s;
if (s[S - 1] == 'A') {
s[S - 1] = 'a';
} else if (s[S - 1] == 'B') {
s[S - 1] = 'b';
} else {
s[S - 1] = 'c';
}
cout << s << endl;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 856,555 | 856,556 | u245970710 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define str string
#define vint vector<int>
#define vvint vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vool vector<bool... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define str string
#define vint vector<int>
#define vvint vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vool vector<bool... | [
"assignment.change"
] | 856,557 | 856,558 | u347579224 | cpp |
p03041 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | [
"assignment.change"
] | 856,559 | 856,560 | u096453658 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define ash \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
#define ash \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long lo... | [
"expression.operator.change"
] | 856,561 | 856,562 | u802094864 | cpp |
p03041 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [] | 856,567 | 856,568 | u468700753 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define INF 2000000000000000000LL
#define EPS 1e-9
#define debug(a) cerr << #a << "=" << (a) << "\n"
#define FastSlowInput \
ios_base::s... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define INF 2000000000000000000LL
#define EPS 1e-9
#define debug(a) cerr << #a << "=" << (a) << "\n"
#define FastSlowInput \
ios_base::s... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 856,569 | 856,570 | u069951049 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
string a;
int n, k;
cin >> n >> k;
cin >> a;
a[k - 1] -= 32;
cout << a << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string a;
int n, k;
cin >> n >> k;
cin >> a;
a[k - 1] += 32;
cout << a << endl;
return 0;
} | [
"expression.operator.change"
] | 856,573 | 856,574 | u176603602 | cpp |
p03041 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n))
#define Vec(a, n) vector<string>(a)((n))
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0))
#define Twovec(a, n, m) v... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n))
#define Vec(a, n) vector<string>(a)((n))
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0))
#define Twovec(a, n, m) v... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 856,575 | 856,576 | u607741489 | cpp |
p03041 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n))
#define Vec(a, n) vector<string>(a)((n))
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0))
#define Twovec(a, n, m) v... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n))
#define Vec(a, n) vector<string>(a)((n))
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0))
#define Twovec(a, n, m) v... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 856,575 | 856,577 | u607741489 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S.at(K - 1) = 'A') {
S.at(K - 1) = 'a';
}
if (S.at(K - 1) = 'B') {
S.at(K - 1) = 'b';
}
if (S.at(K - 1) = 'C') {
S.at(K - 1) = 'c';
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S.at(K - 1) == 'A') {
S.at(K - 1) = 'a';
}
if (S.at(K - 1) == 'B') {
S.at(K - 1) = 'b';
}
if (S.at(K - 1) == 'C') {
S.at(K - 1) = 'c';
}
cout << S << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 856,585 | 856,586 | u607465351 | cpp |
p03041 | #include <iostream>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k >> s;
s[k] += 'a' - 'A';
cout << s;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k >> s;
s[k - 1] += 'a' - 'A';
cout << s;
}
| [
"assignment.change"
] | 856,593 | 856,594 | u530606147 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
S[K] = tolower(static_cast<unsigned char>(S[K - 1]));
cout << S << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
S[K - 1] = tolower(static_cast<unsigned char>(S[K - 1]));
cout << S << endl;
return 0;
} | [
"assignment.change"
] | 856,599 | 856,600 | u224348558 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
S[K] = tolower(static_cast<unsigned char>(S[K]));
cout << S << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
S[K - 1] = tolower(static_cast<unsigned char>(S[K - 1]));
cout << S << endl;
return 0;
} | [
"assignment.change"
] | 856,601 | 856,600 | u224348558 | cpp |
p03041 | #include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <vector>
#define BIG 1000000007
#define LLMAX 9223372036854775807
#define LLMIN (-9223372036854775808)
#define long long long
using namespace std;
int main() {
... | #include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <vector>
#define BIG 1000000007
#define LLMAX 9223372036854775807
#define LLMIN (-9223372036854775808)
#define long long long
using namespace std;
int main() {
... | [
"assignment.change"
] | 856,609 | 856,610 | u530935768 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
s[k] = s[k] - 'A' + 'a';
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
k--;
s[k] = s[k] - 'A' + 'a';
cout << s << endl;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 856,611 | 856,612 | u389009751 | cpp |
p03041 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (S.at(K - 1) == 'A')
S.at(K - 1) = 'a';
if (S.at(K - 1) == 'A')
S.at(K - 1) = 'b';
if (S.at(K - 1) == 'A')
S.at(K - 1) = 'c';
cout << S << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (S.at(K - 1) == 'A')
S.at(K - 1) = 'a';
if (S.at(K - 1) == 'B')
S.at(K - 1) = 'b';
if (S.at(K - 1) == 'C')
S.at(K - 1) = 'c';
cout << S << endl;
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 856,613 | 856,614 | u436976004 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int n, k;
string s;
int main() {
cin >> n >> k >> s;
char s1 = s[k];
s[k] = tolower(s[k]);
cout << s;
} | #include <bits/stdc++.h>
using namespace std;
int n, k;
string s;
int main() {
cin >> n >> k >> s;
char s1 = s[k - 1];
s[k - 1] = tolower(s[k - 1]);
cout << s;
} | [
"assignment.change"
] | 856,630 | 856,631 | u727745260 | cpp |
p03041 | #include <stdio.h>
int main(void) {
int n, k;
char s[50];
scanf("%d", &n);
scanf("%d", &k);
scanf("%s", s);
s[k] += 0x20;
printf(s);
} | #include <stdio.h>
int main(void) {
int n, k;
char s[50];
scanf("%d", &n);
scanf("%d", &k);
scanf("%s", s);
s[k - 1] += 0x20;
printf(s);
} | [
"assignment.change"
] | 856,654 | 856,655 | u872031579 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (S[K - 1] = 'A')
S[K - 1] = 'a';
else if (S[K - 1] = 'B')
S[K - 1] = 'b';
else if (S[K - 1] = 'C')
S[K - 1] = 'c';
cout << S << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (S[K - 1] == 'A')
S[K - 1] = 'a';
else if (S[K - 1] == 'B')
S[K - 1] = 'b';
else if (S[K - 1] == 'C')
S[K - 1] = 'c';
cout << S << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 856,658 | 856,659 | u821732221 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (S[K - 1] = 'A')
S[K - 1] = 'a';
if (S[K - 1] = 'B')
S[K - 1] = 'b';
if (S[K - 1] = 'C')
S[K - 1] = 'c';
cout << S << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (S[K - 1] == 'A')
S[K - 1] = 'a';
else if (S[K - 1] == 'B')
S[K - 1] = 'b';
else if (S[K - 1] == 'C')
S[K - 1] = 'c';
cout << S << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 856,660 | 856,659 | u821732221 | cpp |
p03041 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> Q;
ll mod = 1000000007;
int n, k;
string s;
int main() {
cin >> n >> k >> s;
for (int i = 0; i < s.length(); i++) {
if (i == k... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> Q;
ll mod = 1000000007;
int n, k;
string s;
int main() {
cin >> n >> k >> s;
for (int i = 0; i < s.length(); i++) {
if (i == k... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 856,668 | 856,669 | u475007080 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int m, n;
string s;
cin >> m >> n;
cin >> s;
s[n] = s[n] + 0x20;
cout << s << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int m, n;
string s;
cin >> m >> n;
cin >> s;
s[n - 1] = s[n - 1] + 0x20;
cout << s << endl;
return 0;
}
| [
"assignment.change"
] | 856,676 | 856,677 | u712658424 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
const int mod = 1e9 + 7;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
s[k] = tolower(s[k]);
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
const int mod = 1e9 + 7;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
s[k - 1] = tolower(s[k - 1]);
cout << s << endl;... | [
"assignment.change"
] | 856,684 | 856,685 | u876386943 | cpp |
p03041 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#pragma GCC target("avx2")
#pragma ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#pragma GCC target("avx2")
#pragma ... | [
"assignment.change"
] | 856,686 | 856,687 | u992394626 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define gcd __gcd
#define in(a) scanf("%d", &a)
#define in2(a, b) scanf("%d%d", &a, &b)
#define in3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define read(v, n) ... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define gcd __gcd
#define in(a) scanf("%d", &a)
#define in2(a, b) scanf("%d%d", &a, &b)
#define in3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define read(v, n) ... | [] | 856,690 | 856,691 | u365730500 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
int n, k;
cin >> n >> k;
cin >> s;
s[k] -= 'A' - 'a';
cout << s;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
int n, k;
cin >> n >> k;
cin >> s;
s[k - 1] -= 'A' - 'a';
cout << s;
return 0;
}
| [
"assignment.change"
] | 856,692 | 856,693 | u773531304 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
ll mod = 1000000007;
ll INF = 1000000099;
signed main() {
int n, k;
string s;
cin >> n >> k >> s;
if (s.at(k - 1) = 'A') {
s.at(k - 1) = 'a';
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
ll mod = 1000000007;
ll INF = 1000000099;
signed main() {
int n, k;
string s;
cin >> n >> k >> s;
if (s.at(k - 1) == 'A') {
s.at(k - 1) = 'a';
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 856,694 | 856,695 | u317711717 | cpp |
p03041 | /*
*/
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#in... | /*
*/
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#in... | [
"call.add",
"call.arguments.change"
] | 856,698 | 856,699 | u806695213 | cpp |
p03041 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long l... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long l... | [] | 856,700 | 856,701 | u179643082 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef pair<LL, LL> PII;
typedef vector<string> VS;
inline LL toInt(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream s... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef pair<LL, LL> PII;
typedef vector<string> VS;
inline LL toInt(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream s... | [
"assignment.change"
] | 856,702 | 856,703 | u816800341 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
string S;
cin >> S;
S[K + 1] -= ('A' - 'a');
cout << S;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
string S;
cin >> S;
S[K - 1] -= ('A' - 'a');
cout << S;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 856,704 | 856,705 | u441118578 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
string S;
cin >> S;
S[K] -= ('A' - 'a');
cout << S;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
string S;
cin >> S;
S[K - 1] -= ('A' - 'a');
cout << S;
return 0;
} | [
"assignment.change"
] | 856,706 | 856,705 | u441118578 | cpp |
p03041 | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
char s[50];
int n, k;
scanf("%d %d", &n, &k);
cin >> s;
s[k - 1] += 34;
printf("%s\n", s);
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
char s[50];
int n, k;
scanf("%d %d", &n, &k);
cin >> s;
s[k - 1] += 32;
printf("%s\n", s);
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 856,711 | 856,712 | u650918644 | cpp |
p03041 | #include "bits/stdc++.h"
using namespace std;
namespace ORIGIN {
#define LL long long
#define VLL vector<long long>
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << x << endl
#define WHOLE(x) x.begin(), x.end()
dou... | #include "bits/stdc++.h"
using namespace std;
namespace ORIGIN {
#define LL long long
#define VLL vector<long long>
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << x << endl
#define WHOLE(x) x.begin(), x.end()
dou... | [
"expression.unary.arithmetic.add"
] | 856,715 | 856,716 | u196798307 | cpp |
p03041 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main(void) {
int n, k;
string s;
scanf("%d %d", &n, &k);
cin >> s;
s[k] += 32;
cout << s << endl;
} | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main(void) {
int n, k;
string s;
scanf("%d %d", &n, &k);
cin >> s;
s[k - 1] += 32;
cout << s << endl;
} | [
"assignment.change"
] | 856,720 | 856,721 | u085466282 | cpp |
p03041 | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::string;
int main() {
int n;
string s;
int k;
cin >> n >> k;
cin >> s;
std::map<char, char> map;
map['A'] = 'a';
... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::string;
int main() {
int n;
string s;
int k;
cin >> n >> k;
cin >> s;
std::map<char, char> map;
map['A'] = 'a';
... | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 856,724 | 856,725 | u272166576 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k;
cin >> s;
if (s[k + 1] == 'A') {
s[k + 1] = 'a';
} else if (s[k + 1] == 'B') {
s[k + 1] = 'b';
} else if (s[k + 1] == 'C') {
s[k + 1] = 'c';
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k;
cin >> s;
if (s[k - 1] == 'A') {
s[k - 1] = 'a';
} else if (s[k - 1] == 'B') {
s[k - 1] = 'b';
} else if (s[k - 1] == 'C') {
s[k - 1] = 'c';
}
cout << s << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"expression.operation.binary.change"
] | 856,728 | 856,729 | u688509741 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main(void) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (s[k - 1] == 'A')
s[k - 1] = 'a';
if (s[k - 1] == 'B')
s[k - 1] = 'b';
if (s[k - 1] == 'C')
s[k - 1] = 'b';
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main(void) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (s[k - 1] == 'A')
s[k - 1] = 'a';
if (s[k - 1] == 'B')
s[k - 1] = 'b';
if (s[k - 1] == 'C')
s[k - 1] = 'c';
cout <... | [
"literal.string.change",
"assignment.value.change"
] | 856,732 | 856,733 | u503870829 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
s[k] = s[k] + 0x20;
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
s[k - 1] = s[k - 1] + 0x20;
cout << s << endl;
return 0;
} | [
"assignment.change"
] | 856,736 | 856,737 | u124601011 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S[K] == 'A')
S[K] = 'a';
if (S[K] == 'B')
S[K] = 'b';
if (S[K] == 'C')
S[K] = 'c';
cout << S << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
K--;
if (S[K] == 'A')
S[K] = 'a';
if (S[K] == 'B')
S[K] = 'b';
if (S[K] == 'C')
S[K] = 'c';
cout << S << endl;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 856,738 | 856,739 | u886074758 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string str;
cin >> str;
str[k] = str[k] + 32;
cout << str << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string str;
cin >> str;
str[k - 1] = str[k - 1] + 32;
cout << str << endl;
return 0;
} | [
"assignment.change"
] | 856,742 | 856,743 | u732664135 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.