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 | /*dismint|jjc*/
#include <bits/stdc++.h>
using namespace std;
#define forl(V, S, E) for (int V = S; V < E; V++)
#define ford(V, S, E) for (int V = S; V >= E; V--)
#define fore(E, X) for (auto &E : X)
#define println(X) cout << X << endl
#define printe(X) \
... | /*dismint|jjc*/
#include <bits/stdc++.h>
using namespace std;
#define forl(V, S, E) for (int V = S; V < E; V++)
#define ford(V, S, E) for (int V = S; V >= E; V--)
#define fore(E, X) for (auto &E : X)
#define println(X) cout << X << endl
#define printe(X) \
... | [
"expression.operation.binary.remove"
] | 855,344 | 855,345 | u602301110 | cpp |
p03041 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
if (s[k - 1] == 'A')
s[k - 1] = s[k - 1] - 'A' - 'a';
if (s[k - 1] == 'B')
s[k - 1] = s[k - 1] - 'B' - 'b';
if (s[k - 1] == 'C')
s[k - 1] = s[k - 1]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
if (s[k - 1] == 'A')
s[k - 1] = s[k - 1] - 'A' + 'a';
if (s[k - 1] == 'B')
s[k - 1] = s[k - 1] - 'B' + 'b';
if (s[k - 1] == 'C')
s[k - 1] = s[k - 1]... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 855,346 | 855,347 | u186506670 | cpp |
p03041 | #include <bits/stdc++.h>
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;
}
| #include <bits/stdc++.h>
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;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 855,351 | 855,352 | u736265891 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
string s;
cin >> n >> k >> s;
s[k] = tolower(s[k - 1]);
cout << s << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
string s;
cin >> n >> k >> s;
s[k - 1] = tolower(s[k - 1]);
cout << s << "\n";
return 0;
} | [
"assignment.change"
] | 855,353 | 855,354 | u510683799 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
string s;
cin >> n >> k >> s;
s[k] = tolower(s[k]);
cout << s << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
string s;
cin >> n >> k >> s;
s[k - 1] = tolower(s[k - 1]);
cout << s << "\n";
return 0;
} | [
"assignment.change"
] | 855,355 | 855,354 | u510683799 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
string s;
int k;
cin >> s >> k;
s[k - 1] = tolower(s[k - 1]);
cout << s << endl;
}
| #include <iostream>
using namespace std;
int main() {
string s;
int k, _;
cin >> _ >> k >> s;
s[k - 1] = tolower(s[k - 1]);
cout << s << endl;
}
| [
"variable_declaration.add",
"identifier.change",
"expression.operation.binary.change"
] | 855,362 | 855,363 | u125046593 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int, int>;
using psi = pair<string, int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int, int>;
using psi = pair<string, int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i... | [
"literal.number.change",
"assignment.value.change"
] | 855,364 | 855,365 | u655179794 | 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';
} else if (S.at(K - 1) == 'B') {
S.at(K - 1) == 'b';
} else {
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';
} else if (S.at(K - 1) == 'B') {
S.at(K - 1) = 'b';
} else {
S.at(K - 1) = 'c';
}
cout << S << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 855,372 | 855,373 | u374187034 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define dbg(a) cerr << __LINE__ << ": " << #a << " = " << a << '\n'
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = s[k - 1] - 32;
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define dbg(a) cerr << __LINE__ << ": " << #a << " = " << a << '\n'
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = s[k - 1] + 32;
cout << s << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 855,380 | 855,381 | u329902718 | cpp |
p03041 | #define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n;
cin >> n >> k;
char s[n];
cin >> s;
s[k - 1] += 26;
cout << s << endl;
return 0;
}
| #define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n;
cin >> n >> k;
char s[n];
cin >> s;
s[k - 1] += 32;
cout << s << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 855,388 | 855,389 | u847681378 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll LLINF{1001002003004005006}; // ll = 9*LLINF
constexpr int INTINF{1000000000}; // int = 2*INTINF
#define rep(i, n)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll LLINF{1001002003004005006}; // ll = 9*LLINF
constexpr int INTINF{1000000000}; // int = 2*INTINF
#define rep(i, n)... | [
"assignment.change"
] | 855,401 | 855,402 | u196786099 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k] = tolower(s[k]);
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
k--;
string s;
cin >> s;
s[k] = tolower(s[k]);
cout << s << endl;
}
| [
"expression.unary.arithmetic.add"
] | 855,409 | 855,410 | u508688268 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int k;
cin >> s >> k;
s[k - 1] -= 'A' - 'a';
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int k;
cin >> k >> k >> s;
s[k - 1] -= 'A' - 'a';
cout << s << endl;
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 855,411 | 855,412 | u608258653 | cpp |
p03041 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).end()
#define CERR ... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).end()
#define CERR ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 855,421 | 855,422 | u145078501 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
s.at(k) = tolower(s.at(k));
cout << s << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
s.at(k - 1) = tolower(s.at(k - 1));
cout << s << endl;
} | [
"assignment.change"
] | 855,445 | 855,446 | u480172743 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k] = char(s[k] + 'a' - '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(s[k - 1] + 'a' - 'A');
cout << s << endl;
} | [
"assignment.change"
] | 855,457 | 855,458 | u294721290 | 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) = 'a';
} else if (S.at(K - 1) == 'B') {
S.at(K) = 'b';
} else if (S.at(K - 1) == 'C') {
S.at(K) = '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';
} else if (S.at(K - 1) == 'B') {
S.at(K - 1) = 'b';
} else if (S.at(K - 1) == 'C') {
S.at(K - 1) = 'c';
}
cout << S << endl;
}
| [
"assignment.change"
] | 855,463 | 855,464 | u014568228 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, B;
cin >> N >> B;
string S;
B--;
if (S.at(B) == 'A') {
S.at(B) = 'a';
cout << S << endl;
} else if (S.at(B) == 'B') {
S.at(B) = 'b';
cout << S << endl;
} else if (S.at(B) == 'C') {
S.at(B) = 'c';
cout << S << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, B;
cin >> N >> B;
string S;
cin >> S;
B--;
if (S.at(B) == 'A') {
S.at(B) = 'a';
cout << S << endl;
} else if (S.at(B) == 'B') {
S.at(B) = 'b';
cout << S << endl;
} else if (S.at(B) == 'C') {
S.at(B) = 'c';
cout <<... | [] | 855,467 | 855,468 | u530865816 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> 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 <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> 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"
] | 855,469 | 855,470 | u303453927 | cpp |
p03041 | #include <bits/stdc++.h>
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
s[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[k - 1] == 'A')
s[k - 1] = 'a';
else if (s[k - 1] == 'B')
s[k - 1] = 'b';
else
s[k - 1] = 'c';
cout << s << endl;
} | [] | 855,479 | 855,480 | u459105164 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> a >> s;
s[a] += 32;
cout << s << endl;
} | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> a >> s;
s[a - 1] += 32;
cout << s << endl;
}
| [
"assignment.change"
] | 855,527 | 855,528 | u087801666 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
s[k - 1] = 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;
cin >> s;
s[k - 1] = s[k - 1] - 'A' + 'a';
cout << s << endl;
return 0;
}
| [
"assignment.change"
] | 855,529 | 855,530 | u748577909 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (s[k - 1] >= 'A' && s[k - 1] <= 'B')
s[k - 1] += 32;
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (s[k - 1] >= 'A' && s[k - 1] <= 'Z')
s[k - 1] += 32;
cout << s << endl;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 855,538 | 855,539 | u837843177 | cpp |
p03041 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
int sk = s[k] - 'A';
s[k] = 'a' + sk;
cout << s << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
k--;
int sk = s[k] - 'A';
s[k] = 'a' + sk;
cout << s << endl;
} | [
"expression.unary.arithmetic.add"
] | 855,544 | 855,545 | u853721692 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define FOR(i, x, n) for (int i = x; i < (int)n; i++)
#define REP(i, n) FOR(i, 0, n)
#define debug(x) #x << "=" << (x) << "(L" << __LINE__ << ")"
#define show(x) cout << #x << "=" << x << endl
#define show2(x, y) cout << #x << "=" << x... | #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define FOR(i, x, n) for (int i = x; i < (int)n; i++)
#define REP(i, n) FOR(i, 0, n)
#define debug(x) #x << "=" << (x) << "(L" << __LINE__ << ")"
#define show(x) cout << #x << "=" << x << endl
#define show2(x, y) cout << #x << "=" << x... | [
"assignment.change"
] | 855,550 | 855,551 | u693378622 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
S.at(K) += 'a' - 'A';
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
S.at(K - 1) += 'a' - 'A';
cout << S << endl;
} | [
"assignment.change"
] | 855,552 | 855,553 | u820224016 | cpp |
p03041 | #include <bits/stdc++.h>
class kin {
public:
inline void open(FILE *, int);
inline void close(void);
inline void scan(void);
inline kin &operator>>(char &);
inline kin &operator>>(int &);
inline kin &operator>>(long long &);
inline kin &operator>>(double &);
inline kin &operator>>(long double &);
inl... |
#include <bits/stdc++.h>
class kin {
public:
inline void open(FILE *, int);
inline void close(void);
inline void scan(void);
inline kin &operator>>(char &);
inline kin &operator>>(int &);
inline kin &operator>>(long long &);
inline kin &operator>>(double &);
inline kin &operator>>(long double &);
in... | [
"expression.operator.change"
] | 855,561 | 855,562 | u316440712 | cpp |
p03041 |
#include <bits/stdc++.h>
class kin {
public:
inline void open(FILE *, int);
inline void close(void);
inline void scan(void);
inline kin &operator>>(char &);
inline kin &operator>>(int &);
inline kin &operator>>(long long &);
inline kin &operator>>(double &);
inline kin &operator>>(long double &);
in... |
#include <bits/stdc++.h>
class kin {
public:
inline void open(FILE *, int);
inline void close(void);
inline void scan(void);
inline kin &operator>>(char &);
inline kin &operator>>(int &);
inline kin &operator>>(long long &);
inline kin &operator>>(double &);
inline kin &operator>>(long double &);
in... | [
"expression.operator.change"
] | 855,563 | 855,562 | u316440712 | cpp |
p03041 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < n + 1; ++i)
#include <string>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> n;
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';
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < n + 1; ++i)
#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';
... | [
"identifier.change",
"expression.operation.binary.change"
] | 855,565 | 855,566 | u631558039 | cpp |
p03041 | #include <stdio.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
char s[n + 1];
scanf("%s", s);
s[k - 1] -= 32;
printf("%s\n", s);
return 0;
}
| #include <stdio.h>
int main() {
int n;
int k;
scanf("%d %d", &n, &k);
char s[n + 2];
scanf("%s", s);
s[k - 1] += 32;
printf("%s\n", s);
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.change"
] | 855,573 | 855,574 | u863370423 | cpp |
p03041 | #include <stdio.h>
int main() {
int A;
int B;
char C[55];
scanf("%d %d", &A, &B);
scanf("%s", C);
C[B - 1] += 12;
printf("%s", C);
return 0;
}
| #include <stdio.h>
int main() {
int A;
int B;
char s[55];
scanf("%d %d", &A, &B);
scanf("%s", s);
s[B - 1] += 32;
printf("%s", s);
return 0;
} | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"assignment.variable.change",
"literal.number.change",
"assignment.value.change",
"io.output.change"
] | 855,575 | 855,576 | u863370423 | cpp |
p03041 | #include <stdio.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
char str[55];
scanf("%s", &str);
str[k] + 32;
printf("%s", str);
return 0;
} | #include <stdio.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
char str[55];
scanf("%s", &str);
str[k - 1] += 32;
printf("%s", str);
return 0;
} | [
"assignment.change",
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 855,577 | 855,578 | u863370423 | cpp |
p03041 | #include <stdio.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
char s[n + 1];
scanf("%s", s);
s[k - 1] -= 32;
printf("%s\n", s);
return 0;
}
| #include <stdio.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
char s[n + 1];
scanf("%s", s);
s[k - 1] += 32;
printf("%s\n", s);
return 0;
}
| [
"expression.operator.change"
] | 855,573 | 855,579 | u863370423 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k] = s[k] + 'a' - 'A';
cout << s;
} | #include <iostream>
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;
} | [
"assignment.change"
] | 855,580 | 855,581 | u863370423 | cpp |
p03041 | #include <stdio.h>
int main() {
char name[52];
int b;
int c;
scanf("%d %d", &c, &b);
scanf("%[^\n]", name);
name[b] += 32;
printf("%s", name);
return 0;
} | #include <stdio.h>
int main() {
char name[52];
int b;
int c;
scanf("%d %d", &c, &b);
getchar();
scanf("%[^\n]", name);
name[b - 1] += 32;
printf("%s", name);
return 0;
} | [
"call.add",
"assignment.change"
] | 855,603 | 855,604 | u089230684 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000 * 100 + 1
#define numberOfSetBits(S) \
__builtin_popcount(S) // __builtin_popcountl(S) __builtin_p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000 * 100 + 1
#define numberOfSetBits(S) \
__builtin_popcount(S) // __builtin_popcountl(S) __builtin_p... | [
"assignment.change"
] | 855,605 | 855,606 | u089230684 | cpp |
p03041 | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unorder... | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unorder... | [] | 855,618 | 855,619 | u539145601 | 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';
} else if (s.at(k) == 'B') {
s.at(k) = 'b';
} else 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;
k = k - 1;
string s;
cin >> s;
if (s.at(k) == 'A') {
s.at(k) = 'a';
} else if (s.at(k) == 'B') {
s.at(k) = 'b';
} else if (s.at(k) == 'C') {
s.at(k) = 'c';
}
cout << s << endl;
}
| [
"assignment.add"
] | 855,633 | 855,634 | u856957535 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string X, Atoa;
cin >> A >> B >> X;
Atoa = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < 26; i++) {
if (X.at(B) == Atoa.at(i)) {
X.at(B) = Atoa.at(i + 26);
break;
}
}
cout << X << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string X, Atoa;
cin >> A >> B >> X;
Atoa = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < 26; i++) {
if (X.at(B - 1) == Atoa.at(i)) {
X.at(B - 1) = Atoa.at(i + 26);
break;
}
}
cout << X <<... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 855,635 | 855,636 | u025773431 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string X, Atoa;
cin >> A >> B >> X;
Atoa = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < 26; i++) {
if (X.at(B) = Atoa.at(i)) {
X.at(B) = Atoa.at(i + 26);
break;
}
}
cout << X << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string X, Atoa;
cin >> A >> B >> X;
Atoa = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < 26; i++) {
if (X.at(B - 1) == Atoa.at(i)) {
X.at(B - 1) = Atoa.at(i + 26);
break;
}
}
cout << X <<... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"assignment.change"
] | 855,637 | 855,636 | u025773431 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
int 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;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
int 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;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 855,640 | 855,641 | u698598617 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
int 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;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
int 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;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"expression.operation.binary.remove"
] | 855,642 | 855,641 | u698598617 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | [
"assignment.change"
] | 855,648 | 855,649 | u272628953 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define sz(x) (int)(x).size()
#define f(n) for (int i = 0; i < n; ++i)
#define f2(n) for (int j = 0; j < n; ++j)
#define f3(n) for (int k = 0; k < n; ++k)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define sz(x) (int)(x).size()
#define f(n) for (int i = 0; i < n; ++i)
#define f2(n) for (int j = 0; j < n; ++j)
#define f3(n) for (int k = 0; k < n; ++k)
#defi... | [
"expression.operator.change"
] | 855,680 | 855,681 | u035324904 | cpp |
p03041 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
//宣言
int n, k;
string s;
string ans;
//入力
cin >> n >> k;
cin >> s;
//計算
s[k] = s[k] + 0x20;
//出力
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
//宣言
int n, k;
string s;
string ans;
//入力
cin >> n >> k;
cin >> s;
//計算
s[k - 1] = s[k - 1] + 0x20;
//出力
cout << s << endl;
return 0;
}
| [
"assignment.change"
] | 855,693 | 855,694 | u405620865 | 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';
} else if (s.at(k + 1) == 'B') {
s.at(k + 1) = 'b';
} else {
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';
} else if (s.at(k - 1) == 'B') {
s.at(k - 1) = 'b';
} else {
s.at(k - 1) = 'c';
}
cout << s << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 855,712 | 855,713 | u584169254 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int k;
cin >> k;
string S;
cin >> S;
S[k - 1] = S[k] + 31;
cout << S << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int k;
cin >> k;
string S;
cin >> S;
S[k - 1] = S[k - 1] + 32;
cout << S << endl;
return 0;
} | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 855,716 | 855,717 | u084101398 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
char ary[50];
cin >> n >> k;
cin >> ary;
if (ary[k - 1] == 'A')
ary[k - 1] == 'a';
if (ary[k - 1] == 'B')
ary[k - 1] == 'b';
if (ary[k - 1] == 'C')
ary[k - 1] == 'c';
cout << ary;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
char ary[50];
cin >> n >> k;
cin >> ary;
if (ary[k - 1] == 'A')
ary[k - 1] = 'a';
if (ary[k - 1] == 'B')
ary[k - 1] = 'b';
if (ary[k - 1] == 'C')
ary[k - 1] = 'c';
cout << ary;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 855,725 | 855,726 | u952130512 | cpp |
p03041 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int m... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int m... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 855,729 | 855,730 | u027424986 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K;
cin >> N >> K;
string S;
c... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K;
cin >> N >> K;
string S;
c... | [
"assignment.add"
] | 855,735 | 855,736 | u981304949 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string S;
cin >> n >> k >> S;
if (S[k] == 'A')
S[k - 1] = 'a';
if (S[k] == 'B')
S[k - 1] = 'b';
if (S[k] == 'C')
S[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[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;
} | [
"control_flow.branch.if.condition.change"
] | 855,740 | 855,741 | u663775885 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] -= 32;
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] += 32;
cout << s << endl;
}
| [
"expression.operator.change"
] | 855,753 | 855,754 | u420514616 | cpp |
p03041 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int b, c;
string a;
cin >> c >> b >> a;
b -= 1;
if (a[b] == 'A') {
a[b] = 'a';
} else if (a[b] == 'B') {
a[b] = 'b';
} else {
a[b] == 'c';
}
cout << a << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int b, c;
string a;
cin >> c >> b >> a;
b -= 1;
if (a[b] == 'A') {
a[b] = 'a';
} else if (a[b] == 'B') {
a[b] = 'b';
} else {
a[b] = 'c';
}
cout << a << endl;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 855,757 | 855,758 | u322171361 | cpp |
p03041 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 855,763 | 855,764 | u132033278 | cpp |
p03041 | //自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define MODA 1000000007
int main() {
int an... | //自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define MODA 1000000007
int main() {
int an... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"expression.operation.binary.change"
] | 855,771 | 855,772 | u450007962 | cpp |
p03041 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
if (s.... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
if (s.... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 855,778 | 855,779 | u999989620 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d %d", &x, &y)
#define rl(x) scanf("%lld", &x)
#define rl2(x, y) scanf("%ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d %d", &x, &y)
#define rl(x) scanf("%lld", &x)
#define rl2(x, y) scanf("%ll... | [
"call.remove"
] | 855,802 | 855,803 | u431615124 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
S.at(K) = tolower(S.at(K));
cout << S;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
S.at(K - 1) = tolower(S.at(K - 1));
cout << S;
} | [
"assignment.change"
] | 855,809 | 855,810 | u424374375 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define per(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define INF 2e9
#define LINF 1e18
template <class T> inline bool chmax(T &a, const T &b) {
if (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define per(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define INF 2e9
#define LINF 1e18
template <class T> inline bool chmax(T &a, const T &b) {
if (... | [
"literal.string.change",
"assignment.value.change"
] | 855,815 | 855,816 | u338791285 | cpp |
p03041 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
if (s.at(k - 1) == 'A')
s.at(k) = 'a';
else if (s.at(k - 1) == 'B')
s.at(k) = 'b';
else if (s.at(k - 1) == 'C')
s.at(k) = 'c';
cout << s;
}... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
if (s.at(k - 1) == 'A')
s.at(k - 1) = 'a';
else if (s.at(k - 1) == 'B')
s.at(k - 1) = 'b';
else if (s.at(k - 1) == 'C')
s.at(k - 1) = 'c';
... | [
"assignment.change"
] | 855,819 | 855,820 | u009870106 | cpp |
p03041 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 855,831 | 855,832 | u776056110 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string s;
cin >> s;
s[--b] -= 'a' - 'A';
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string s;
cin >> s;
s[b - 1] += 'a' - 'A';
cout << s << endl;
return 0;
} | [
"assignment.change",
"expression.operator.change"
] | 855,840 | 855,841 | u905715926 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
s[k] = s[k] + 32;
cout << s << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
s[k - 1] = s[k - 1] + 32;
cout << s << endl;
return 0;
}
| [
"assignment.change"
] | 855,842 | 855,843 | u222613738 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
char S[100];
cin >> N >> K >> S;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
S[K] += 32;
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
char S[100];
cin >> N >> K >> S;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
S[K - 1] += 32;
cout << S << endl;
}
| [
"assignment.change"
] | 855,844 | 855,845 | u937275419 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
char S[100];
cin >> N >> K >> S;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
S[K - 1] = -32;
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
char S[100];
cin >> N >> K >> S;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
S[K - 1] += 32;
cout << S << endl;
}
| [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove"
] | 855,846 | 855,845 | u937275419 | 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';
} else if (S.at(K - 1) = 'B') {
S.at(K - 1) = 'b';
} else 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';
} else if (S.at(K - 1) == 'B') {
S.at(K - 1) = 'b';
} else if (S.at(K - 1) == 'C') {
S.at(K - 1) = 'c';
}
cout << S << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 855,855 | 855,856 | u388787692 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
//#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uin... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
//#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uin... | [
"expression.unary.arithmetic.add"
] | 855,858 | 855,859 | u360980679 | cpp |
p03041 | #include <iostream>
using namespace std;
char change(char a) {
char ret;
if (a == 'A')
ret = 'a';
if (a == 'B')
ret = 'b';
if (a == 'C')
ret = 'c';
return ret;
}
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k] = change(s[k - 1]);
cout << s << endl;
}
| #include <iostream>
using namespace std;
char change(char a) {
char ret;
if (a == 'A')
ret = 'a';
if (a == 'B')
ret = 'b';
if (a == 'C')
ret = 'c';
return ret;
}
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = change(s[k - 1]);
cout << s << endl;
}
| [
"assignment.change"
] | 855,860 | 855,861 | u741134767 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int k;
string s;
cin >> n >> k >> s;
cout << k;
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;
int 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;
} | [] | 855,878 | 855,879 | u540724932 | cpp |
p03041 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k >> s;
s.at(k) += 'a' - 'A';
cout << s << endl;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k >> s;
s.at(k - 1) += 'a' - 'A';
cout << s << endl;
return 0;
}
| [
"assignment.change"
] | 855,880 | 855,881 | u962680761 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
K -= 1;
if (S.at(K) == 'A') {
S.at(K) = 'a';
} else if (S.at(K) == 'B') {
S.at(K) == 'b';
} else if (S.at(K) == 'C') {
S.at(K) == 'c';
}
cout << S;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
K -= 1;
if (S.at(K) == 'A') {
S.at(K) = 'a';
} else if (S.at(K) == 'B') {
S.at(K) = 'b';
} else if (S.at(K) == 'C') {
S.at(K) = 'c';
}
cout << S;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 855,912 | 855,913 | u383166010 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
int k;
cin >> s >> k;
s[k - 1] += 32;
cout << s;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
int n, k;
cin >> n >> k >> s;
s[k - 1] += 32;
cout << s;
return 0;
}
| [
"variable_declaration.add",
"identifier.change",
"expression.operation.binary.change"
] | 855,924 | 855,925 | u504553345 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | [
"assignment.change"
] | 855,929 | 855,930 | u155216115 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | [
"assignment.change",
"expression.operator.change"
] | 855,931 | 855,930 | u155216115 | cpp |
p03041 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"assignment.change"
] | 855,944 | 855,945 | u716566635 | cpp |
p03041 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
S[K - 1] = S[K - 1] - 32;
cout << S << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
S[K - 1] = S[K - 1] + 32;
cout << S << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 855,948 | 855,949 | u703503553 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> cb(m + n, {0, 1});
for (int i = 0; i < n; i++) {
cin >> cb.at(i + m).first;
}
for (int i = 0; i < m; i++) {
cin >> cb.at(i).second >> cb.at(i).first;
}
sort(cb.rbegi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<pair<ll, ll>> cb(m + n, {0, 1});
for (int i = 0; i < n; i++) {
cin >> cb.at(i + m).first;
}
for (int i = 0; i < m; i++) {
cin >> cb.at(i).second >> cb.at(i).first;
}
sort(cb.rbegin(... | [] | 855,979 | 855,980 | u168860135 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using st = string;
using db = double;
using vll = vector<long long>;
using vdb = vector<db>;
using vvll = vector<vll>;
using vst = vector<st>;
using vchar = vector<char>;
using pll = pair<ll, ll>;
using vpll = vector<pl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using st = string;
using db = double;
using vll = vector<long long>;
using vdb = vector<db>;
using vvll = vector<vll>;
using vst = vector<st>;
using vchar = vector<char>;
using pll = pair<ll, ll>;
using vpll = vector<pl... | [
"control_flow.branch.if.condition.change"
] | 855,983 | 855,984 | u729173935 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, ... | [
"type_conversion.add"
] | 856,000 | 856,001 | u853721692 | cpp |
p03038 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int, int> P;
template <class T> inlin... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int, int> P;
template <class T> inlin... | [
"control_flow.loop.condition.change"
] | 856,002 | 856,003 | u317754719 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
priority_queue<ll, vector<ll>, greater<ll>> q;
ll n, m;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
priority_queue<ll, vector<ll>, greater<ll>> q;
ll n, m;
... | [
"assignment.value.change"
] | 856,012 | 856,013 | u459930111 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
#define _GLIBCXX_DEBUG
const int INF = 1e15;
signed main() {
int N, M;
cin >> N >> M;
priority_queue<int> pq;
REP(i, N) {
int a;
cin >> a;
pq... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
#define _GLIBCXX_DEBUG
const int INF = 1e15;
signed main() {
int N, M;
cin >> N >> M;
priority_queue<int> pq;
REP(i, N) {
int a;
cin >> a;
pq... | [
"assignment.value.change"
] | 856,026 | 856,027 | u342075214 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int, vector<int>, g... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int, vector<int>, g... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 856,028 | 856,029 | u199184624 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | [
"control_flow.loop.for.condition.change"
] | 856,047 | 856,048 | u603234915 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
ret... | [
"expression.operation.binary.change",
"call.arguments.change"
] | 856,051 | 856,052 | u316322317 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define PI (acos(-1))
template <class T> inline ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define PI (acos(-1))
template <class T> inline ... | [] | 856,055 | 856,056 | u340010271 | cpp |
p03038 | #include <bits/stdc++.h>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> A(N);
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
std::vector<std::pair<int, int>> CB(M);
for (int i = 0; i < M; i++) {
std::cin >> CB[i].second >> CB[i].first;
}
std::sort(A.begin(), A.end());
std::... | #include <bits/stdc++.h>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> A(N);
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
std::vector<std::pair<int, int>> CB(M);
for (int i = 0; i < M; i++) {
std::cin >> CB[i].second >> CB[i].first;
}
std::sort(A.begin(), A.end());
std::... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 856,057 | 856,058 | u672160971 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d", &x)
int main() {
int n, m, na = 0, nb = 0, tmp = 0;
sc(n), sc(m);
vector<int> a(n);
vector<P> b(m);
for (int i = 0; i < n; i++)
sc(a[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%lld", &x)
int main() {
ll n, m, na = 0, nb = 0, tmp = 0;
sc(n), sc(m);
vector<ll> a(n);
vector<P> b(m);
for (int i = 0; i < n; i++)
sc(a[i]... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 856,062 | 856,063 | u920543723 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n... | [
"variable_declaration.type.change"
] | 856,071 | 856,072 | u001534842 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
ll ans = 0;
priority_queue<pair<int, int>> q;
rep(i, n) {
int a;
cin >> a;
q.push(make_pair(a, 1));
}
rep(i, m) {
int b, c;
cin >> b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
ll ans = 0;
priority_queue<pair<int, int>> q;
rep(i, n) {
int a;
cin >> a;
q.push(make_pair(a, 1));
}
rep(i, m) {
int b, c;
cin >> b... | [
"type_conversion.add"
] | 856,075 | 856,076 | u754114382 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | [] | 856,079 | 856,080 | u293523151 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;... | [] | 856,085 | 856,086 | u757584836 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
priority_queue<P> pq;
ll solve(int n) {
ll ans = 0;
int cnt = n;
while (cnt > 0) {
P pairs = pq.top()... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
priority_queue<P> pq;
ll solve(int n) {
ll ans = 0;
int cnt = n;
while (cnt > 0) {
P pairs = pq.top()... | [] | 856,087 | 856,088 | u766280310 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
bool cmp(pair<int, long long int> a, pair<int, long long int> b) {
if (a.second != b.second) {
return a.second > b.second;
} else {
return a.first > b.first;
}
}
int main() {
int N, M;
cin >> N >> M;
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
bool cmp(pair<int, long long int> a, pair<int, long long int> b) {
if (a.second != b.second) {
return a.second > b.second;
} else {
return a.first > b.first;
}
}
int main() {
int N, M;
cin >> N >> M;
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 856,091 | 856,092 | u806657856 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = int(1e8) + 7;
void init() {}
void solve() {
char c[60];
int a, b;
scanf("%d %d %s", &a, &b, c);
c[b] += 32;
printf("%s\n", c);
}
const bool mtc = false;
int main() {
int t;
if (mtc) {
scanf("%d", &t);
while (t-... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = int(1e8) + 7;
void init() {}
void solve() {
char c[60];
int a, b;
scanf("%d %d %s", &a, &b, c);
c[b - 1] += 32;
printf("%s\n", c);
}
const bool mtc = false;
int main() {
int t;
if (mtc) {
scanf("%d", &t);
while... | [
"assignment.change"
] | 856,112 | 856,113 | u800645121 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
S[K] += 32;
cout << S << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
S[K - 1] += 32;
cout << S << endl;
return 0;
} | [
"assignment.change"
] | 856,118 | 856,119 | u528523331 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
char s[] = {};
cin >> n >> k;
cin >> s;
s[k - 1] = s[k - 1] + 32;
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
char s[256];
cin >> n >> k;
cin >> s;
s[k - 1] = s[k - 1] + 32;
cout << s << endl;
return 0;
}
| [
"variable_declaration.array_dimensions.change"
] | 856,124 | 856,125 | u625176086 | cpp |
p03041 | #include <bits/stdc++.h>
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] = 'b';
cout << S;
}
| #include <bits/stdc++.h>
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;
}
| [
"literal.string.change",
"assignment.value.change"
] | 856,128 | 856,129 | u116136539 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int len, m;
cin >> len >> m;
getline(cin, s);
s[m - 1] += 32;
cout << s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int len, m;
cin >> len >> m >> s;
s[m - 1] += 32;
cout << s;
return 0;
} | [
"call.remove",
"call.arguments.change"
] | 856,139 | 856,140 | u879895449 | 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 - 1] += 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"
] | 856,141 | 856,142 | u469953228 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.