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 9 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) \
for (auto &E : X) \
cout << E << " "; \
cout << endl
typedef unordered_map<int, unordered_set<int>> graph;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
string s;
cin >> n >> s >> k;
s[k - 1] = tolower(s[k - 1]);
println(s);
}
| /*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) \
for (auto &E : X) \
cout << E << " "; \
cout << endl
typedef unordered_map<int, unordered_set<int>> graph;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
string s;
cin >> n >> k >> s;
s[k - 1] = tolower(s[k - 1]);
println(s);
}
| [
"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] - 'C' - 'c';
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() {
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] - 'C' + 'c';
cout << s << endl;
return 0;
} | [
"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++)
#define repa(i, a, n) for (in6 i = a; i < (in6)(n); i++)
#define repdown(i, n) for (in6 i = n; i > 0; i--)
#define kyun ios::sync_with_stdio(false)
#define hinata cout << "\n"
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define inf 2147483647
#define dset(n) cout << fixed << setprecision(n)
void yes() { cout << "Yes"; }
void no() { cout << "No"; }
int main() {
kyun;
string s;
int n, k;
cin >> n >> k >> s;
s[k - 1] += 26;
cout << s;
hinata;
} | #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++)
#define repa(i, a, n) for (in6 i = a; i < (in6)(n); i++)
#define repdown(i, n) for (in6 i = n; i > 0; i--)
#define kyun ios::sync_with_stdio(false)
#define hinata cout << "\n"
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define inf 2147483647
#define dset(n) cout << fixed << setprecision(n)
void yes() { cout << "Yes"; }
void no() { cout << "No"; }
int main() {
kyun;
string s;
int n, k;
cin >> n >> k >> s;
s[k - 1] += 32;
cout << s;
hinata;
}
| [
"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) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
template <typename T> void maxs(T &x, T &&y) { x = std::max(x, y); }
template <typename T> void maxs(T &x, T &y) { x = std::max(x, y); }
template <typename T> void mins(T &x, T &&y) { x = std::min(x, y); }
template <typename T> void mins(T &x, T &y) { x = std::min(x, y); }
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, K;
std::string S;
cin >> N >> K >> S;
S[K] -= 'A';
S[K] += 'a';
cout << S << '\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) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
template <typename T> void maxs(T &x, T &&y) { x = std::max(x, y); }
template <typename T> void maxs(T &x, T &y) { x = std::max(x, y); }
template <typename T> void mins(T &x, T &&y) { x = std::min(x, y); }
template <typename T> void mins(T &x, T &y) { x = std::min(x, y); }
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, K;
std::string S;
cin >> N >> K >> S;
S[K - 1] -= 'A';
S[K - 1] += 'a';
cout << S << '\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 \
if (false) \
cerr
typedef long long ll;
using namespace std;
// using namespace boost::multiprecision;
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 {
s[k - 1] == 'c';
}
cout << s << endl;
return 0;
} | #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 \
if (false) \
cerr
typedef long long ll;
using namespace std;
// using namespace boost::multiprecision;
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 {
s[k - 1] = 'c';
}
cout << s << endl;
return 0;
} | [
"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 << S << endl;
}
}
| [] | 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 << "," << #y << "=" << y << endl
#define show3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
const ld eps = 1e-9, pi = acos(-1.0);
const ld EPS = 1e-8;
const int INF = INT_MAX / 2;
const ll LINF = LONG_MAX / 2;
const int MOD = 1000000007;
template <class T> inline void amin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> inline void amax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll n, k;
string s;
cin >> n >> k;
cin >> s;
s[k] += 32;
cout << s << endl;
return 0;
}
| #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 << "," << #y << "=" << y << endl
#define show3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
const ld eps = 1e-9, pi = acos(-1.0);
const ld EPS = 1e-8;
const int INF = INT_MAX / 2;
const ll LINF = LONG_MAX / 2;
const int MOD = 1000000007;
template <class T> inline void amin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> inline void amax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll n, k;
string s;
cin >> n >> k;
cin >> s;
s[k - 1] += 32;
cout << s << endl;
return 0;
}
| [
"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 &);
inline kin &operator>>(char *);
template <class T> inline void get(T *, int);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} in;
class kout {
public:
inline void open(FILE *, int);
inline void close(void);
inline void print(void);
inline kout &operator<<(char);
inline kout &operator<<(int);
inline kout &operator<<(long long);
inline kout &operator<<(double);
inline kout &operator<<(long double);
inline kout &operator<<(const char *);
template <class T> inline void put(T *, int, char, char);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} out;
int main(int argc, char **argv) {
in.open(stdin, 512);
out.open(stdout, 512);
in.scan();
int n, k;
char s[51];
in >> n >> k >> s;
s[k - 1] -= 32;
out << s << '\n';
out.print();
in.close();
out.close();
return 0;
}
inline void kin::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kin::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kin::scan(void) {
int readsiz =
(int)std::fread((void *)buf, (std::size_t)1, (std::size_t)siz, fp);
if (readsiz != siz)
buf[readsiz] = '\x00';
idx = 0;
return;
}
inline kin &kin::operator>>(char &var) {
if (!buf[idx]) {
var = '\x00';
return *this;
}
var = buf[idx];
if (++idx == siz)
scan();
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(int &var) {
if (!buf[idx]) {
var = 0;
return *this;
}
int sign = -1;
if (buf[idx] == '-') {
sign = 1;
if (++idx == siz)
scan();
}
var = 0;
while (buf[idx] >= '0') {
var = var * 10 - (int)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long long &var) {
if (!buf[idx]) {
var = 0LL;
return *this;
}
long long sign = -1LL;
if (buf[idx] == '-') {
sign = 1LL;
if (++idx == siz)
scan();
}
var = 0LL;
while (buf[idx] >= '0') {
var = var * 10LL - (long long)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(double &var) {
if (!buf[idx]) {
var = 0.0;
return *this;
}
double sign = -1.0;
if (buf[idx] == '-') {
sign = 1.0;
if (++idx == siz)
scan();
}
var = 0.0;
while (buf[idx] >= '0') {
var = var * 10.0 - (double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
double dig = 1.0;
while (buf[idx] >= '0') {
var -= (double)(buf[idx] - '0') * (dig /= 10.0);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long double &var) {
if (!buf[idx]) {
var = 0.0L;
return *this;
}
long double sign = -1.0L;
if (buf[idx] == '-') {
sign = 1.0L;
if (++idx == siz)
scan();
}
var = 0.0L;
while (buf[idx] >= '0') {
var = var * 10.0L - (long double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
long double dig = 1.0L;
while (buf[idx] >= '0') {
var -= (long double)(buf[idx] - '0') * (dig /= 10.0L);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(char *var) {
if (!buf[idx]) {
var[0] = '\x00';
return *this;
}
int ptr = 0;
while (buf[idx] >= '!') {
var[ptr++] = buf[idx];
if (++idx == siz)
scan();
}
var[ptr] = '\x00';
if (++idx == siz)
scan();
return *this;
}
template <class T> inline void kin::get(T *var, int num) {
for (int i = 0; i < num; ++i)
(*this) >> var[i];
return;
}
inline void kout::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kout::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kout::print(void) {
std::fwrite((void *)buf, (std::size_t)1, (std::size_t)idx, fp);
idx = 0;
return;
}
inline kout &kout::operator<<(char val) {
buf[idx] = val;
if (++idx == siz)
print();
return *this;
}
inline kout &kout::operator<<(int val) {
if (val < 0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1;
char dig[10];
int ptr = 0;
do {
int tmp = val / 10;
dig[ptr++] = (char)-(val - tmp * 10) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(long long val) {
if (val < 0LL) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1LL;
char dig[19];
int ptr = 0;
do {
long long tmp = val / 10LL;
dig[ptr++] = (char)-(val - tmp * 10LL) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(double val) {
if (val < 0.0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0;
double dig = 1.0;
while (val / dig <= -10.0)
dig *= 10.0;
int tmp;
while (dig >= 1.0) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 12; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
return *this;
}
inline kout &kout::operator<<(long double val) {
if (val < 0.0L) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0L;
long double dig = 1.0L;
while (val / dig <= -10.0L)
dig *= 10.0L;
int tmp;
while (dig >= 1.0L) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 16; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
return *this;
}
inline kout &kout::operator<<(const char *val) {
for (int i = 0; val[i]; ++i) {
buf[idx] = val[i];
if (++idx == siz)
print();
}
return *this;
}
template <class T> inline void kout::put(T *val, int num, char spc, char end) {
--num;
for (int i = 0; i < num; ++i)
(*this) << val[i] << spc;
(*this) << val[num] << end;
return;
}
|
#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 &);
inline kin &operator>>(char *);
template <class T> inline void get(T *, int);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} in;
class kout {
public:
inline void open(FILE *, int);
inline void close(void);
inline void print(void);
inline kout &operator<<(char);
inline kout &operator<<(int);
inline kout &operator<<(long long);
inline kout &operator<<(double);
inline kout &operator<<(long double);
inline kout &operator<<(const char *);
template <class T> inline void put(T *, int, char, char);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} out;
int main(int argc, char **argv) {
in.open(stdin, 512);
out.open(stdout, 512);
in.scan();
int n, k;
char s[51];
in >> n >> k >> s;
s[k - 1] += 32;
out << s << '\n';
out.print();
in.close();
out.close();
return 0;
}
inline void kin::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kin::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kin::scan(void) {
int readsiz =
(int)std::fread((void *)buf, (std::size_t)1, (std::size_t)siz, fp);
if (readsiz != siz)
buf[readsiz] = '\x00';
idx = 0;
return;
}
inline kin &kin::operator>>(char &var) {
if (!buf[idx]) {
var = '\x00';
return *this;
}
var = buf[idx];
if (++idx == siz)
scan();
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(int &var) {
if (!buf[idx]) {
var = 0;
return *this;
}
int sign = -1;
if (buf[idx] == '-') {
sign = 1;
if (++idx == siz)
scan();
}
var = 0;
while (buf[idx] >= '0') {
var = var * 10 - (int)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long long &var) {
if (!buf[idx]) {
var = 0LL;
return *this;
}
long long sign = -1LL;
if (buf[idx] == '-') {
sign = 1LL;
if (++idx == siz)
scan();
}
var = 0LL;
while (buf[idx] >= '0') {
var = var * 10LL - (long long)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(double &var) {
if (!buf[idx]) {
var = 0.0;
return *this;
}
double sign = -1.0;
if (buf[idx] == '-') {
sign = 1.0;
if (++idx == siz)
scan();
}
var = 0.0;
while (buf[idx] >= '0') {
var = var * 10.0 - (double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
double dig = 1.0;
while (buf[idx] >= '0') {
var -= (double)(buf[idx] - '0') * (dig /= 10.0);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long double &var) {
if (!buf[idx]) {
var = 0.0L;
return *this;
}
long double sign = -1.0L;
if (buf[idx] == '-') {
sign = 1.0L;
if (++idx == siz)
scan();
}
var = 0.0L;
while (buf[idx] >= '0') {
var = var * 10.0L - (long double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
long double dig = 1.0L;
while (buf[idx] >= '0') {
var -= (long double)(buf[idx] - '0') * (dig /= 10.0L);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(char *var) {
if (!buf[idx]) {
var[0] = '\x00';
return *this;
}
int ptr = 0;
while (buf[idx] >= '!') {
var[ptr++] = buf[idx];
if (++idx == siz)
scan();
}
var[ptr] = '\x00';
if (++idx == siz)
scan();
return *this;
}
template <class T> inline void kin::get(T *var, int num) {
for (int i = 0; i < num; ++i)
(*this) >> var[i];
return;
}
inline void kout::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kout::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kout::print(void) {
std::fwrite((void *)buf, (std::size_t)1, (std::size_t)idx, fp);
idx = 0;
return;
}
inline kout &kout::operator<<(char val) {
buf[idx] = val;
if (++idx == siz)
print();
return *this;
}
inline kout &kout::operator<<(int val) {
if (val < 0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1;
char dig[10];
int ptr = 0;
do {
int tmp = val / 10;
dig[ptr++] = (char)-(val - tmp * 10) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(long long val) {
if (val < 0LL) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1LL;
char dig[19];
int ptr = 0;
do {
long long tmp = val / 10LL;
dig[ptr++] = (char)-(val - tmp * 10LL) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(double val) {
if (val < 0.0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0;
double dig = 1.0;
while (val / dig <= -10.0)
dig *= 10.0;
int tmp;
while (dig >= 1.0) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 12; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
return *this;
}
inline kout &kout::operator<<(long double val) {
if (val < 0.0L) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0L;
long double dig = 1.0L;
while (val / dig <= -10.0L)
dig *= 10.0L;
int tmp;
while (dig >= 1.0L) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 16; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
return *this;
}
inline kout &kout::operator<<(const char *val) {
for (int i = 0; val[i]; ++i) {
buf[idx] = val[i];
if (++idx == siz)
print();
}
return *this;
}
template <class T> inline void kout::put(T *val, int num, char spc, char end) {
--num;
for (int i = 0; i < num; ++i)
(*this) << val[i] << spc;
(*this) << val[num] << end;
return;
}
| [
"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 &);
inline kin &operator>>(char *);
template <class T> inline void get(T *, int);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} in;
class kout {
public:
inline void open(FILE *, int);
inline void close(void);
inline void print(void);
inline kout &operator<<(char);
inline kout &operator<<(int);
inline kout &operator<<(long long);
inline kout &operator<<(double);
inline kout &operator<<(long double);
inline kout &operator<<(const char *);
template <class T> inline void put(T *, int, char, char);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} out;
int main(int argc, char **argv) {
in.open(stdin, 512);
out.open(stdout, 512);
in.scan();
int n, k;
char s[51];
in >> n >> k >> s;
s[k - 1] -= 32;
out << s;
out.print();
in.close();
out.close();
return 0;
}
inline void kin::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kin::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kin::scan(void) {
int readsiz =
(int)std::fread((void *)buf, (std::size_t)1, (std::size_t)siz, fp);
if (readsiz != siz)
buf[readsiz] = '\x00';
idx = 0;
return;
}
inline kin &kin::operator>>(char &var) {
if (!buf[idx]) {
var = '\x00';
return *this;
}
var = buf[idx];
if (++idx == siz)
scan();
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(int &var) {
if (!buf[idx]) {
var = 0;
return *this;
}
int sign = -1;
if (buf[idx] == '-') {
sign = 1;
if (++idx == siz)
scan();
}
var = 0;
while (buf[idx] >= '0') {
var = var * 10 - (int)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long long &var) {
if (!buf[idx]) {
var = 0LL;
return *this;
}
long long sign = -1LL;
if (buf[idx] == '-') {
sign = 1LL;
if (++idx == siz)
scan();
}
var = 0LL;
while (buf[idx] >= '0') {
var = var * 10LL - (long long)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(double &var) {
if (!buf[idx]) {
var = 0.0;
return *this;
}
double sign = -1.0;
if (buf[idx] == '-') {
sign = 1.0;
if (++idx == siz)
scan();
}
var = 0.0;
while (buf[idx] >= '0') {
var = var * 10.0 - (double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
double dig = 1.0;
while (buf[idx] >= '0') {
var -= (double)(buf[idx] - '0') * (dig /= 10.0);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long double &var) {
if (!buf[idx]) {
var = 0.0L;
return *this;
}
long double sign = -1.0L;
if (buf[idx] == '-') {
sign = 1.0L;
if (++idx == siz)
scan();
}
var = 0.0L;
while (buf[idx] >= '0') {
var = var * 10.0L - (long double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
long double dig = 1.0L;
while (buf[idx] >= '0') {
var -= (long double)(buf[idx] - '0') * (dig /= 10.0L);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(char *var) {
if (!buf[idx]) {
var[0] = '\x00';
return *this;
}
int ptr = 0;
while (buf[idx] >= '!') {
var[ptr++] = buf[idx];
if (++idx == siz)
scan();
}
var[ptr] = '\x00';
if (++idx == siz)
scan();
return *this;
}
template <class T> inline void kin::get(T *var, int num) {
for (int i = 0; i < num; ++i)
(*this) >> var[i];
return;
}
inline void kout::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kout::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kout::print(void) {
std::fwrite((void *)buf, (std::size_t)1, (std::size_t)idx, fp);
idx = 0;
return;
}
inline kout &kout::operator<<(char val) {
buf[idx] = val;
if (++idx == siz)
print();
return *this;
}
inline kout &kout::operator<<(int val) {
if (val < 0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1;
char dig[10];
int ptr = 0;
do {
int tmp = val / 10;
dig[ptr++] = (char)-(val - tmp * 10) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(long long val) {
if (val < 0LL) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1LL;
char dig[19];
int ptr = 0;
do {
long long tmp = val / 10LL;
dig[ptr++] = (char)-(val - tmp * 10LL) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(double val) {
if (val < 0.0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0;
double dig = 1.0;
while (val / dig <= -10.0)
dig *= 10.0;
int tmp;
while (dig >= 1.0) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 12; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
return *this;
}
inline kout &kout::operator<<(long double val) {
if (val < 0.0L) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0L;
long double dig = 1.0L;
while (val / dig <= -10.0L)
dig *= 10.0L;
int tmp;
while (dig >= 1.0L) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 16; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
return *this;
}
inline kout &kout::operator<<(const char *val) {
for (int i = 0; val[i]; ++i) {
buf[idx] = val[i];
if (++idx == siz)
print();
}
return *this;
}
template <class T> inline void kout::put(T *val, int num, char spc, char end) {
--num;
for (int i = 0; i < num; ++i)
(*this) << val[i] << spc;
(*this) << val[num] << end;
return;
}
|
#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 &);
inline kin &operator>>(char *);
template <class T> inline void get(T *, int);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} in;
class kout {
public:
inline void open(FILE *, int);
inline void close(void);
inline void print(void);
inline kout &operator<<(char);
inline kout &operator<<(int);
inline kout &operator<<(long long);
inline kout &operator<<(double);
inline kout &operator<<(long double);
inline kout &operator<<(const char *);
template <class T> inline void put(T *, int, char, char);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} out;
int main(int argc, char **argv) {
in.open(stdin, 512);
out.open(stdout, 512);
in.scan();
int n, k;
char s[51];
in >> n >> k >> s;
s[k - 1] += 32;
out << s << '\n';
out.print();
in.close();
out.close();
return 0;
}
inline void kin::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kin::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kin::scan(void) {
int readsiz =
(int)std::fread((void *)buf, (std::size_t)1, (std::size_t)siz, fp);
if (readsiz != siz)
buf[readsiz] = '\x00';
idx = 0;
return;
}
inline kin &kin::operator>>(char &var) {
if (!buf[idx]) {
var = '\x00';
return *this;
}
var = buf[idx];
if (++idx == siz)
scan();
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(int &var) {
if (!buf[idx]) {
var = 0;
return *this;
}
int sign = -1;
if (buf[idx] == '-') {
sign = 1;
if (++idx == siz)
scan();
}
var = 0;
while (buf[idx] >= '0') {
var = var * 10 - (int)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long long &var) {
if (!buf[idx]) {
var = 0LL;
return *this;
}
long long sign = -1LL;
if (buf[idx] == '-') {
sign = 1LL;
if (++idx == siz)
scan();
}
var = 0LL;
while (buf[idx] >= '0') {
var = var * 10LL - (long long)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(double &var) {
if (!buf[idx]) {
var = 0.0;
return *this;
}
double sign = -1.0;
if (buf[idx] == '-') {
sign = 1.0;
if (++idx == siz)
scan();
}
var = 0.0;
while (buf[idx] >= '0') {
var = var * 10.0 - (double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
double dig = 1.0;
while (buf[idx] >= '0') {
var -= (double)(buf[idx] - '0') * (dig /= 10.0);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long double &var) {
if (!buf[idx]) {
var = 0.0L;
return *this;
}
long double sign = -1.0L;
if (buf[idx] == '-') {
sign = 1.0L;
if (++idx == siz)
scan();
}
var = 0.0L;
while (buf[idx] >= '0') {
var = var * 10.0L - (long double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
long double dig = 1.0L;
while (buf[idx] >= '0') {
var -= (long double)(buf[idx] - '0') * (dig /= 10.0L);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(char *var) {
if (!buf[idx]) {
var[0] = '\x00';
return *this;
}
int ptr = 0;
while (buf[idx] >= '!') {
var[ptr++] = buf[idx];
if (++idx == siz)
scan();
}
var[ptr] = '\x00';
if (++idx == siz)
scan();
return *this;
}
template <class T> inline void kin::get(T *var, int num) {
for (int i = 0; i < num; ++i)
(*this) >> var[i];
return;
}
inline void kout::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kout::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kout::print(void) {
std::fwrite((void *)buf, (std::size_t)1, (std::size_t)idx, fp);
idx = 0;
return;
}
inline kout &kout::operator<<(char val) {
buf[idx] = val;
if (++idx == siz)
print();
return *this;
}
inline kout &kout::operator<<(int val) {
if (val < 0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1;
char dig[10];
int ptr = 0;
do {
int tmp = val / 10;
dig[ptr++] = (char)-(val - tmp * 10) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(long long val) {
if (val < 0LL) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1LL;
char dig[19];
int ptr = 0;
do {
long long tmp = val / 10LL;
dig[ptr++] = (char)-(val - tmp * 10LL) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(double val) {
if (val < 0.0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0;
double dig = 1.0;
while (val / dig <= -10.0)
dig *= 10.0;
int tmp;
while (dig >= 1.0) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 12; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
return *this;
}
inline kout &kout::operator<<(long double val) {
if (val < 0.0L) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0L;
long double dig = 1.0L;
while (val / dig <= -10.0L)
dig *= 10.0L;
int tmp;
while (dig >= 1.0L) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 16; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
return *this;
}
inline kout &kout::operator<<(const char *val) {
for (int i = 0; val[i]; ++i) {
buf[idx] = val[i];
if (++idx == siz)
print();
}
return *this;
}
template <class T> inline void kout::put(T *val, int num, char spc, char end) {
--num;
for (int i = 0; i < num; ++i)
(*this) << val[i] << spc;
(*this) << val[num] << end;
return;
}
| [
"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';
cout << s << endl;
return 0;
} | #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';
cout << s << endl;
return 0;
} | [
"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_popcountll(S)
#define MSET(x, y) memset(x, y, sizeof(x))
#define gcd(a, b) __gcd(a, b)
#define all(x) x.begin(), x.end()
#define isOn(S, j) (S & (1 << j))
#define endl '\n'
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 << j))
#define toggleBit(S, j) (S ^= (1 << j))
#define print(x) \
for (auto it : x) \
cout << it << ' '; \
cout << endl;
#define printii(x) \
for (auto it : x) \
cout << it.F << ' ' << it.S << '\t'; \
cout << endl;
#define in(x, n) \
for (int e = 0; e < n; e++) { \
ll y; \
cin >> y; \
x.pb(y); \
}
#define vi vector<ll>
#define vvi vector<vi>
#define ii pair<ll, ll>
#define pll pair<ll, ll>
#define vii vector<ii>
#define vvii vector<vii>
#define viii vector<pair<ii, ll>>
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define mc(a, b, c) mp(mp(a, b), c)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, x, t, m, y, z;
cin >> n >> x;
string s;
cin >> s;
s[x] = tolower(s[x]);
cout << s;
return 0;
} | #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_popcountll(S)
#define MSET(x, y) memset(x, y, sizeof(x))
#define gcd(a, b) __gcd(a, b)
#define all(x) x.begin(), x.end()
#define isOn(S, j) (S & (1 << j))
#define endl '\n'
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 << j))
#define toggleBit(S, j) (S ^= (1 << j))
#define print(x) \
for (auto it : x) \
cout << it << ' '; \
cout << endl;
#define printii(x) \
for (auto it : x) \
cout << it.F << ' ' << it.S << '\t'; \
cout << endl;
#define in(x, n) \
for (int e = 0; e < n; e++) { \
ll y; \
cin >> y; \
x.pb(y); \
}
#define vi vector<ll>
#define vvi vector<vi>
#define ii pair<ll, ll>
#define pll pair<ll, ll>
#define vii vector<ii>
#define vvii vector<vii>
#define viii vector<pair<ii, ll>>
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define mc(a, b, c) mp(mp(a, b), c)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, x, t, m, y, z;
cin >> n >> x;
string s;
cin >> s;
s[x - 1] = tolower(s[x - 1]);
cout << s;
return 0;
} | [
"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 <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
// BDD,ZDD,kdtree, bdtree,bicalc, bolonoy,
// doloney,chinesemod,segmenttree,daikusutora, saidairyuu, 2bugurahu,
// heirokenshutu, topologicalsort, kyourenketuseibun
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
cout << "ERR_ctoi" << endl;
return -1;
}
}
int main() {
string s;
int k, n;
cin >> n;
cin >> s;
cin >> k;
--k;
if (s[k] == 'A')
s[k] = 'a';
if (s[k] == 'B')
s[k] = 'b';
if (s[k] == 'C')
s[k] = 'c';
PRI(s);
return 0;
} | #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 <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
// BDD,ZDD,kdtree, bdtree,bicalc, bolonoy,
// doloney,chinesemod,segmenttree,daikusutora, saidairyuu, 2bugurahu,
// heirokenshutu, topologicalsort, kyourenketuseibun
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
cout << "ERR_ctoi" << endl;
return -1;
}
}
int main() {
string s;
int k, n;
cin >> n;
cin >> k;
cin >> s;
--k;
if (s[k] == 'A')
s[k] = 'a';
if (s[k] == 'B')
s[k] = 'b';
if (s[k] == 'C')
s[k] = 'c';
PRI(s);
return 0;
} | [] | 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 << endl;
}
| [
"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 << endl;
}
| [
"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++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
// fixed << setprecision(2)
void func(vector<vector<int>> a, int x, int y, int h, int w,
vector<vector<char>> c, int *ans) {
if (x + 1 < w && a[y][x + 1] == 0 && c[y][x + 1] == 'g') {
*ans = 1;
}
if (x > 0 && a[y][x - 1] == 0 && c[y][x - 1] == 'g') {
*ans = 1;
}
if (y + 1 < h && a[y + 1][x] == 0 && c[y + 1][x] == 'g') {
*ans = 1;
}
if (y > 0 && a[y - 1][x] == 0 && c[y - 1][x] == 'g') {
*ans = 1;
}
if (x + 1 < w && a[y][x + 1] == 0 && c[y][x + 1] == '.') {
a[y][x + 1] = 1;
func(a, x + 1, y, h, w, c, ans);
}
if (x > 0 && a[y][x - 1] == 0 && c[y][x - 1] == '.') {
a[y][x - 1] = 1;
func(a, x - 1, y, h, w, c, ans);
}
if (y + 1 < h && a[y + 1][x] == 0 && c[y + 1][x] == '.') {
a[y + 1][x] = 1;
func(a, x, y + 1, h, w, c, ans);
}
if (y > 0 && a[y - 1][x] == 0 && c[y - 1][x] == '.') {
a[y - 1][x] = 1;
func(a, x, y - 1, h, w, c, ans);
}
a[x][y] = 2;
if (x + 1 < w && a[y][x + 1] == 1 && c[y][x + 1] == '.') {
a[y][x + 1] = 2;
func(a, x + 1, y, h, w, c, ans);
}
if (x > 0 && a[y][x - 1] == 1 && c[y][x - 1] == '.') {
a[y][x - 1] = 2;
func(a, x - 1, y, h, w, c, ans);
}
if (y + 1 < h && a[y + 1][x] == 1 && c[y + 1][x] == '.') {
a[y + 1][x] = 2;
func(a, x, y + 1, h, w, c, ans);
}
if (y > 0 && a[y - 1][x] == 1 && c[y - 1][x] == '.') {
a[y - 1][x] = 2;
func(a, x, y - 1, h, w, c, ans);
}
}
ll d(ll a) {
ll ans = 1;
a /= 10;
while (a != 0) {
ans++;
a /= 10;
}
return ans;
}
bool f(ll tmp, ll a, ll b, ll x) {
if (a * tmp + b * d(tmp) <= x) {
return true;
} else {
return false;
}
}
//小文字=大文字+32
int main() {
int n, k;
string s;
cin >> n >> k >> s;
s[k] += 32;
cout << s;
/*int h, w;
cin >> h >> w;
int v0x, v0y;
int ans = 0;
vector<vector<int>>a(h, vector<int>(w));
vector<vector<char>>c(h, vector<char>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
a[i][j] = 0;
cin >> c[i][j];
if (c[i][j] == 's') {
v0y = i;
v0x = j;
}
}
}
func(a, v0x, v0y, h, w, c, &ans);
if (ans == 1) {
cout << "yes";
}
else {
cout << "no";
}*/
}
| #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++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
// fixed << setprecision(2)
void func(vector<vector<int>> a, int x, int y, int h, int w,
vector<vector<char>> c, int *ans) {
if (x + 1 < w && a[y][x + 1] == 0 && c[y][x + 1] == 'g') {
*ans = 1;
}
if (x > 0 && a[y][x - 1] == 0 && c[y][x - 1] == 'g') {
*ans = 1;
}
if (y + 1 < h && a[y + 1][x] == 0 && c[y + 1][x] == 'g') {
*ans = 1;
}
if (y > 0 && a[y - 1][x] == 0 && c[y - 1][x] == 'g') {
*ans = 1;
}
if (x + 1 < w && a[y][x + 1] == 0 && c[y][x + 1] == '.') {
a[y][x + 1] = 1;
func(a, x + 1, y, h, w, c, ans);
}
if (x > 0 && a[y][x - 1] == 0 && c[y][x - 1] == '.') {
a[y][x - 1] = 1;
func(a, x - 1, y, h, w, c, ans);
}
if (y + 1 < h && a[y + 1][x] == 0 && c[y + 1][x] == '.') {
a[y + 1][x] = 1;
func(a, x, y + 1, h, w, c, ans);
}
if (y > 0 && a[y - 1][x] == 0 && c[y - 1][x] == '.') {
a[y - 1][x] = 1;
func(a, x, y - 1, h, w, c, ans);
}
a[x][y] = 2;
if (x + 1 < w && a[y][x + 1] == 1 && c[y][x + 1] == '.') {
a[y][x + 1] = 2;
func(a, x + 1, y, h, w, c, ans);
}
if (x > 0 && a[y][x - 1] == 1 && c[y][x - 1] == '.') {
a[y][x - 1] = 2;
func(a, x - 1, y, h, w, c, ans);
}
if (y + 1 < h && a[y + 1][x] == 1 && c[y + 1][x] == '.') {
a[y + 1][x] = 2;
func(a, x, y + 1, h, w, c, ans);
}
if (y > 0 && a[y - 1][x] == 1 && c[y - 1][x] == '.') {
a[y - 1][x] = 2;
func(a, x, y - 1, h, w, c, ans);
}
}
ll d(ll a) {
ll ans = 1;
a /= 10;
while (a != 0) {
ans++;
a /= 10;
}
return ans;
}
bool f(ll tmp, ll a, ll b, ll x) {
if (a * tmp + b * d(tmp) <= x) {
return true;
} else {
return false;
}
}
//小文字=大文字+32
int main() {
int n, k;
string s;
cin >> n >> k >> s;
s[k - 1] += 32;
cout << s;
/*int h, w;
cin >> h >> w;
int v0x, v0y;
int ans = 0;
vector<vector<int>>a(h, vector<int>(w));
vector<vector<char>>c(h, vector<char>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
a[i][j] = 0;
cin >> c[i][j];
if (c[i][j] == 's') {
v0y = i;
v0x = j;
}
}
}
func(a, v0x, v0y, h, w, c, &ans);
if (ans == 1) {
cout << "yes";
}
else {
cout << "no";
}*/
}
| [
"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)
#define F(i, x, n, y) for (int i = x; i < n; i += y)
#define fa(x, y) for (auto x : y)
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
// Warsaw debug template
#define LOCAL
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << "," << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << "," + (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) "[" << #__VA_ARGS__ ":" << (__VA_ARGS__) << "]"
// End of debug template
#define isOn(S, j) (S & (1 << j))
#define setBit(S, j) (S | (1 << j))
#define clearBit(S, j) (S & ~(1 << j))
#define toggleBit(S, j) (S ^ (1 << j))
#define lowBit(S) (S & (-S))
typedef vector<ll> vll;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n, k;
cin >> n >> k;
string s;
cin >> s;
--k;
s[k] -= 32;
cout << s << endl;
return 0;
}
| #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)
#define F(i, x, n, y) for (int i = x; i < n; i += y)
#define fa(x, y) for (auto x : y)
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
// Warsaw debug template
#define LOCAL
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << "," << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << "," + (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) "[" << #__VA_ARGS__ ":" << (__VA_ARGS__) << "]"
// End of debug template
#define isOn(S, j) (S & (1 << j))
#define setBit(S, j) (S | (1 << j))
#define clearBit(S, j) (S & ~(1 << j))
#define toggleBit(S, j) (S ^ (1 << j))
#define lowBit(S) (S & (-S))
typedef vector<ll> vll;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n, k;
cin >> n >> k;
string s;
cin >> s;
--k;
s[k] += 32;
cout << s << endl;
return 0;
}
| [
"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 main() {
int N, K;
string S;
cin >> N >> K >> S;
S[K + 1] = S[K + 1] + 32;
cout << S << endl;
return 0;
}
| #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 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.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;
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 << endl;
} | #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;
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;
} | [
"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>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define vpush(v, x) v.push_back(x);
#define REP(i, x, n) for (int i = x; i < n; i++)
#define INF 2e9
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, w, h;
string s;
cin >> a >> b;
cin >> s;
if (s[b - 1] == 'A') {
s[b - 1] == 'a';
} else if (s[b - 1] == 'B') {
s[b - 1] == 'b';
} else {
s[b - 1] == 'c';
}
cout << s;
return (0);
} | #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>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define vpush(v, x) v.push_back(x);
#define REP(i, x, n) for (int i = x; i < n; i++)
#define INF 2e9
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, w, h;
string s;
cin >> a >> b;
cin >> s;
if (s[b - 1] == 'A') {
s[b - 1] = 'a';
} else if (s[b - 1] == 'B') {
s[b - 1] = 'b';
} else {
s[b - 1] = 'c';
}
cout << s;
return (0);
} | [
"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 ans = 0;
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;
} | //自称高知能系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 ans = 0;
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;
} | [
"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.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 <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.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.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("%lld %lld", &x, &y)
#define wd(x) printf("%d", x)
#define wd2(x, y) printf("%d %d", x, y)
#define wl(x) printf("%lld", x)
#define wl2(x, y) printf("%lld %lld", x, y)
#define PC(x) putchar(x)
#define GC() getchar()
#define NL printf("\n")
#define SP printf(" ")
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define fr(i, s, e) for (int i = s; i < e; i++)
#define frl(i, s, e) for (ll i = s; i < e; i++)
#define frr(i, s, e) for (int i = s - 1; i >= e; i--)
#define frv(i, a) for (int i = 0; i < (int)a.size(); i++)
#define frvr(i, a) for (int i = a.size() - 1; i >= 0; i--)
#define tr(i, a) for (typeof(a.begin()) i = a.begin(); i != a.end(); i++)
#define mod 1000000007
#define maxn 100009
#define maxr 100009
int main() {
fast_cin();
int n, k;
rd2(n, k);
string str;
cin >> str;
str[k - 1] += 32;
cout << str << endl;
return 0;
} | #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("%lld %lld", &x, &y)
#define wd(x) printf("%d", x)
#define wd2(x, y) printf("%d %d", x, y)
#define wl(x) printf("%lld", x)
#define wl2(x, y) printf("%lld %lld", x, y)
#define PC(x) putchar(x)
#define GC() getchar()
#define NL printf("\n")
#define SP printf(" ")
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define fr(i, s, e) for (int i = s; i < e; i++)
#define frl(i, s, e) for (ll i = s; i < e; i++)
#define frr(i, s, e) for (int i = s - 1; i >= e; i--)
#define frv(i, a) for (int i = 0; i < (int)a.size(); i++)
#define frvr(i, a) for (int i = a.size() - 1; i >= 0; i--)
#define tr(i, a) for (typeof(a.begin()) i = a.begin(); i != a.end(); i++)
#define mod 1000000007
#define maxn 100009
#define maxr 100009
int main() {
// fast_cin();
int n, k;
rd2(n, k);
string str;
cin >> str;
str[k - 1] += 32;
cout << str << endl;
return 0;
} | [
"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 (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> P;
int main() {
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] = 'd';
cout << s << endl;
}
| #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 (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> P;
int main() {
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 << s << endl;
}
| [
"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';
cout << s;
}
| [
"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), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int ab(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
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;
} | #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), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int ab(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
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;
} | [
"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 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
class UnionFind {
private:
::std::vector<int_fast32_t> par, edge;
size_t n;
public:
UnionFind() {}
UnionFind(size_t n) : n(n) {
par.resize(n, -1);
edge.resize(n, 0);
}
uint_fast32_t find(uint_fast32_t x) {
return par[x] < 0 ? x : par[x] = find(par[x]);
}
size_t size(uint_fast32_t x) { return -par[find(x)]; }
bool unite(uint_fast32_t x, uint_fast32_t y) {
x = find(x);
y = find(y);
edge[x] += 1;
if (x == y)
return false;
if (size(x) < size(y))
std::swap(x, y);
par[x] += par[y];
edge[x] += edge[y];
par[y] = x;
return true;
}
bool same(uint_fast32_t x, uint_fast32_t y) { return find(x) == find(y); }
size_t esize(uint_fast32_t x) { return edge[find(x)]; }
};
int main(void) {
int64 N, K;
string S;
cin >> N >> K;
cin >> S;
S[K] = tolower(S[K]);
cout << S << endl;
}
| #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 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
class UnionFind {
private:
::std::vector<int_fast32_t> par, edge;
size_t n;
public:
UnionFind() {}
UnionFind(size_t n) : n(n) {
par.resize(n, -1);
edge.resize(n, 0);
}
uint_fast32_t find(uint_fast32_t x) {
return par[x] < 0 ? x : par[x] = find(par[x]);
}
size_t size(uint_fast32_t x) { return -par[find(x)]; }
bool unite(uint_fast32_t x, uint_fast32_t y) {
x = find(x);
y = find(y);
edge[x] += 1;
if (x == y)
return false;
if (size(x) < size(y))
std::swap(x, y);
par[x] += par[y];
edge[x] += edge[y];
par[y] = x;
return true;
}
bool same(uint_fast32_t x, uint_fast32_t y) { return find(x) == find(y); }
size_t esize(uint_fast32_t x) { return edge[find(x)]; }
};
int main(void) {
int64 N, K;
string S;
cin >> N >> K;
K--;
cin >> S;
S[K] = tolower(S[K]);
cout << S << endl;
}
| [
"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::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli N, A;
string s;
cin >> N >> A >> s;
s[A] += abs('A' - 'a');
COUT(s);
return 0;
}
| #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::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli N, A;
string s;
cin >> N >> A >> s;
s[A - 1] += abs('A' - 'a');
COUT(s);
return 0;
}
| [
"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::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli N, A;
string s;
cin >> N >> A >> s;
s[A] -= abs('A' - 'a');
COUT(s);
return 0;
} | #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::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli N, A;
string s;
cin >> N >> A >> s;
s[A - 1] += abs('A' - 'a');
COUT(s);
return 0;
}
| [
"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 long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
s[K] += 32;
cout << s << endl;
return 0;
}
| #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 long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
s[K - 1] += 32;
cout << s << endl;
return 0;
}
| [
"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.rbegin(), cb.rend());
int i{}, used{};
ll sum{};
while (1) {
if (used + cb.at(i).second >= n) {
sum += cb.at(i).first * (n - used);
break;
} else {
sum += cb.at(i).second * cb.at(i).first;
used += cb.at(i).second;
i++;
}
}
cout << sum << endl;
} | #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(), cb.rend());
int i{}, used{};
ll sum{};
while (1) {
if (used + cb.at(i).second >= n) {
sum += cb.at(i).first * (n - used);
break;
} else {
sum += cb.at(i).second * cb.at(i).first;
used += cb.at(i).second;
i++;
}
}
cout << sum << endl;
} | [] | 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<pll>;
using vvpll = vector<vpll>;
#define rep(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define vrep(i, vec) for (auto &i : vec)
#define vin(vec) \
for (auto &i : vec) \
cin >> i
#define all(v) v.begin(), v.end()
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;
return true;
}
return false;
}
const ll mod = 1000000007;
const ll inf = 1LL << 60;
int main() {
ll n, m;
cin >> n >> m;
vll a(n);
vin(a);
vpll chn(m);
rep(i, 0, m) {
ll b, c;
cin >> c >> b;
chn.at(i) = make_pair(b, c);
}
sort(all(a));
sort(all(chn), greater<pll>());
ll now = 0;
vrep(i, chn) {
ll value = i.first, j = i.second;
while (j > 0) {
if (a.at(now) < value) {
a.at(now) = value;
j--;
now++;
} else
goto out;
}
}
out:
cout << accumulate(all(a), 0ll) << endl;
} | #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<pll>;
using vvpll = vector<vpll>;
#define rep(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define vrep(i, vec) for (auto &i : vec)
#define vin(vec) \
for (auto &i : vec) \
cin >> i
#define all(v) v.begin(), v.end()
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;
return true;
}
return false;
}
const ll mod = 1000000007;
const ll inf = 1LL << 60;
int main() {
ll n, m;
cin >> n >> m;
vll a(n);
vin(a);
vpll chn(m);
rep(i, 0, m) {
ll b, c;
cin >> c >> b;
chn.at(i) = make_pair(b, c);
}
sort(all(a));
sort(all(chn), greater<pll>());
ll now = 0;
vrep(i, chn) {
ll value = i.first, j = i.second;
while (j > 0) {
if (now < n && a.at(now) < value) {
a.at(now) = value;
j--;
now++;
} else
goto out;
}
}
out:
cout << accumulate(all(a), 0ll) << endl;
} | [
"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, c))
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &t : v) {
is >> t;
}
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T t : v) {
os << t << " ";
}
os << "\n";
return os;
}
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
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;
return true;
}
return false;
}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m;
cin >> n >> m;
vi a(n);
cin >> a;
vi b(m), c(m);
rep(i, m) cin >> b[i] >> c[i];
map<int, int> ma;
for (int i : a)
ma[i]++;
rep(i, m) ma[c[i]] += b[i];
ll ans = 0;
auto it = ma.end();
it--;
while (n > 0) {
ans += it->first * min(it->second, n);
n -= it->second;
it--;
}
cout << ans << endl;
}
| #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, c))
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &t : v) {
is >> t;
}
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T t : v) {
os << t << " ";
}
os << "\n";
return os;
}
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
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;
return true;
}
return false;
}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m;
cin >> n >> m;
vi a(n);
cin >> a;
vi b(m), c(m);
rep(i, m) cin >> b[i] >> c[i];
map<int, int> ma;
for (int i : a)
ma[i]++;
rep(i, m) ma[c[i]] += b[i];
ll ans = 0;
auto it = ma.end();
it--;
while (n > 0) {
ans += (ll)it->first * min(it->second, n);
n -= it->second;
it--;
}
cout << ans << endl;
}
| [
"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> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
const int MOD = 1000000007;
// const int MOD = 998244353;
template <class T> inline int add(T &a, T b, T M = MOD) {
a = (a + M) % M;
b = (b + M) % M;
a = (a + b) % M;
return a;
};
template <class T> inline int mul(T &a, T b, T M = MOD) {
if (a >= M)
a %= M;
if (b >= M)
b %= M;
a *= b;
if (a >= M)
a %= M;
return a;
};
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
const string abc = "abcdefghijklmnopqrstuvwxyz";
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),
make_pair(0, -1)};
////////////////////////////////////////////////////////////////////
///////////////////////___modpow___////////////////////
ll modpow(ll a, ll n, const ll &MOD = MOD) {
ll ret = n == 0 ? 1 : modpow(a, n / 2, MOD);
(ret *= ret) %= MOD;
if (n % 2)
((ret *= a) %= MOD);
return ret;
}
///////////////////////___modinv___////////////////////
ll modinv(ll d, const ll &MOD = MOD) { return modpow(d, MOD - 2, MOD); }
////////////////////////////////////////////////////////////////////
int n, m, a[110000];
priority_queue<P> que;
signed main() {
cin >> n >> m;
rep(i, n) cin >> a[i];
sort(a, a + n);
rep(i, m) {
int b, c;
cin >> b >> c;
que.push(P(c, b));
}
int ans = 0, i = 0;
rep(i, n) ans += a[i];
while (!que.empty()) {
P p = que.top();
que.pop();
if (p.first < a[i])
break;
ans += p.first;
ans -= a[i];
i++;
if (p.second > 1)
que.push(P(p.first, p.second - 1));
}
cout << ans << endl;
}
| //#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> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
const int MOD = 1000000007;
// const int MOD = 998244353;
template <class T> inline int add(T &a, T b, T M = MOD) {
a = (a + M) % M;
b = (b + M) % M;
a = (a + b) % M;
return a;
};
template <class T> inline int mul(T &a, T b, T M = MOD) {
if (a >= M)
a %= M;
if (b >= M)
b %= M;
a *= b;
if (a >= M)
a %= M;
return a;
};
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
const string abc = "abcdefghijklmnopqrstuvwxyz";
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),
make_pair(0, -1)};
////////////////////////////////////////////////////////////////////
///////////////////////___modpow___////////////////////
ll modpow(ll a, ll n, const ll &MOD = MOD) {
ll ret = n == 0 ? 1 : modpow(a, n / 2, MOD);
(ret *= ret) %= MOD;
if (n % 2)
((ret *= a) %= MOD);
return ret;
}
///////////////////////___modinv___////////////////////
ll modinv(ll d, const ll &MOD = MOD) { return modpow(d, MOD - 2, MOD); }
////////////////////////////////////////////////////////////////////
int n, m, a[110000];
priority_queue<P> que;
signed main() {
cin >> n >> m;
rep(i, n) cin >> a[i];
sort(a, a + n);
rep(i, m) {
int b, c;
cin >> b >> c;
que.push(P(c, b));
}
int ans = 0, i = 0;
rep(i, n) ans += a[i];
while (!que.empty() && i < n) {
P p = que.top();
que.pop();
if (p.first < a[i])
break;
ans += p.first;
ans -= a[i];
i++;
if (p.second > 1)
que.push(P(p.first, p.second - 1));
}
cout << ans << endl;
}
| [
"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;
cin >> n >> m;
ll tmp;
rep(i, n) {
cin >> tmp;
q.push(tmp);
}
map<ll, ll, greater<ll>> mp;
ll b, c;
rep(i, m) {
cin >> b >> c;
mp[c] = b;
}
// cout << mp.begin()->first << endl;
for (auto itr : mp) {
c = itr.first;
b = itr.second;
if (c <= q.top()) {
break;
} else {
rep(j, b) {
if (c <= q.top())
break;
q.pop();
q.push(c);
}
}
}
ll ans = 0;
rep(i, n) {
ans += q.top();
// cout << q.top() << endl;
q.pop();
}
cout << ans << endl;
return 0;
}
| #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;
cin >> n >> m;
ll tmp;
rep(i, n) {
cin >> tmp;
q.push(tmp);
}
map<ll, ll, greater<ll>> mp;
ll b, c;
rep(i, m) {
cin >> b >> c;
mp[c] += b;
}
// cout << mp.begin()->first << endl;
for (auto itr : mp) {
c = itr.first;
b = itr.second;
if (c <= q.top()) {
break;
} else {
rep(j, b) {
if (c <= q.top())
break;
q.pop();
q.push(c);
}
}
}
ll ans = 0;
rep(i, n) {
ans += q.top();
// cout << q.top() << endl;
q.pop();
}
cout << ans << endl;
return 0;
}
| [
"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.push(a);
}
map<int, int> memo;
REP(i, M) {
int a, b;
cin >> a >> b;
pq.push(b);
memo[b] = a - 1;
}
int ans = 0;
REP(i, N) {
int d = pq.top();
ans += d;
if (memo[d] == 0)
pq.pop();
else
memo[d]--;
}
cout << ans << endl;
} | #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.push(a);
}
map<int, int> memo;
REP(i, M) {
int a, b;
cin >> a >> b;
pq.push(b);
memo[b] += a - 1;
}
int ans = 0;
REP(i, N) {
int d = pq.top();
ans += d;
if (memo[d] == 0)
pq.pop();
else
memo[d]--;
}
cout << ans << endl;
} | [
"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>, greater<int>> que;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
// que.push(a.at(i));
}
vector<ll> sum(n + 1, 0);
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
sum.at(i + 1) = sum.at(i) + a.at(i);
}
vector<vector<int>> b(m, vector<int>(2));
for (int i = 0; i < m; i++) {
cin >> b.at(i).at(1) >> b.at(i).at(0);
}
sort(b.rbegin(), b.rend());
int flag = 0;
ll ans = 0;
int cnt = 0;
/*
for(int i = 0; i < n; i++){
cout << a.at(i) << " ";
}
cout << '\n';
for(int i = 0; i <= n; i++){
cout << sum.at(i) << " ";
}
cout << '\n';
*/
for (int i = 0; i < m; i++) {
if (cnt >= n || a.at(cnt) > b.at(i).at(0)) {
break;
}
int lmt = min(n - cnt - 1, b.at(i).at(1)) + cnt;
if (a.at(lmt) < b.at(i).at(0)) {
ans += (ll)b.at(i).at(0) * min(n - cnt - 1, b.at(i).at(1));
ans -= sum[lmt] - sum[cnt];
// cout << cnt << " " << lmt << " ";
cnt = lmt;
} else {
int border =
distance(a.begin(), lower_bound(a.begin(), a.end(), b.at(i).at(0)));
ans += (ll)b.at(i).at(0) * (border - cnt);
ans -= sum[border] - sum[cnt];
// cout << cnt << " " << border << " ";
cnt = border;
}
}
for (int i = 0; i < n; i++) {
ans += a.at(i);
}
/*
for(int i = 0; i < m; i++) {
while(b.at(i).at(1) > 0) {
b.at(i).at(1)--;
if(que.top() > b.at(i).at(0)) {
break;
}
que.pop();
//que.push(b.at(i).at(0));
ans += b.at(i).at(0);
}
}
while(!que.empty()){
ans += que.top();
que.pop();
}
*/
cout << ans << '\n';
return 0;
} | #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>, greater<int>> que;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
// que.push(a.at(i));
}
vector<ll> sum(n + 1, 0);
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
sum.at(i + 1) = sum.at(i) + a.at(i);
}
vector<vector<int>> b(m, vector<int>(2));
for (int i = 0; i < m; i++) {
cin >> b.at(i).at(1) >> b.at(i).at(0);
}
sort(b.rbegin(), b.rend());
int flag = 0;
ll ans = 0;
int cnt = 0;
/*
for(int i = 0; i < n; i++){
cout << a.at(i) << " ";
}
cout << '\n';
for(int i = 0; i <= n; i++){
cout << sum.at(i) << " ";
}
cout << '\n';
*/
for (int i = 0; i < m; i++) {
if (cnt >= n || a.at(cnt) > b.at(i).at(0)) {
break;
}
int lmt = min(n - cnt, b.at(i).at(1)) + cnt;
if (a.at(lmt - 1) < b.at(i).at(0)) {
ans += (ll)b.at(i).at(0) * min(n - cnt, b.at(i).at(1));
ans -= sum[lmt] - sum[cnt];
// cout << cnt << " " << lmt << " ";
cnt = lmt;
} else {
int border =
distance(a.begin(), lower_bound(a.begin(), a.end(), b.at(i).at(0)));
ans += (ll)b.at(i).at(0) * (border - cnt);
ans -= sum[border] - sum[cnt];
// cout << cnt << " " << border << " ";
cnt = border;
}
}
for (int i = 0; i < n; i++) {
ans += a.at(i);
}
/*
for(int i = 0; i < m; i++) {
while(b.at(i).at(1) > 0) {
b.at(i).at(1)--;
if(que.top() > b.at(i).at(0)) {
break;
}
que.pop();
//que.push(b.at(i).at(0));
ans += b.at(i).at(0);
}
}
while(!que.empty()){
ans += que.top();
que.pop();
}
*/
cout << ans << '\n';
return 0;
} | [
"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 */
/* main */
int main() {
int N, M, b, c;
cin >> N >> M;
vector<int> a(N);
vector<pii> v(M);
for (int i = 0; i < N; i++)
cin >> a[i];
for (int i = 0; i < M; i++) {
cin >> b >> c;
v[i] = pii(c, b);
}
sort(a.begin(), a.end());
sort(v.begin(), v.end(), greater<pii>());
int j = 0;
for (int i = 0; i < N; i++) {
int c = v[j].first;
if (a[i] < c) {
a[i] = c;
v[j].second--;
}
if (v[j].second == 0)
j++;
}
cout << accumulate(a.begin(), a.end(), 0LL) << '\n';
}
| #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 */
/* main */
int main() {
int N, M, b, c;
cin >> N >> M;
vector<int> a(N);
vector<pii> v(M);
for (int i = 0; i < N; i++)
cin >> a[i];
for (int i = 0; i < M; i++) {
cin >> b >> c;
v[i] = pii(c, b);
}
sort(a.begin(), a.end());
sort(v.begin(), v.end(), greater<pii>());
int j = 0;
for (int i = 0; i < N && j < M; i++) {
int c = v[j].first;
if (a[i] < c) {
a[i] = c;
v[j].second--;
}
if (v[j].second == 0)
j++;
}
cout << accumulate(a.begin(), a.end(), 0LL) << '\n';
}
| [
"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;
return true;
}
return false;
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
vector<pair<ll, ll>> b(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i].first >> b[i].second;
sort(b.begin(), b.end(), greater<pair<ll, ll>>());
ll cnt = 0;
rep(i, m) {
if (cnt >= n)
break;
rep(j, b[i].first) {
a.push_back(b[i].second);
cnt++;
if (cnt >= n)
break;
}
}
sort(a.begin(), a.end(), greater<ll>());
ll res = 0;
rep(i, n) res += a[i];
cout << res << endl;
return 0;
} | #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;
return true;
}
return false;
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
vector<pair<ll, ll>> b(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i].second >> b[i].first;
sort(b.begin(), b.end(), greater<pair<ll, ll>>());
ll cnt = 0;
rep(i, m) {
if (cnt >= n)
break;
rep(j, b[i].second) {
a.push_back(b[i].first);
cnt++;
if (cnt >= n)
break;
}
}
sort(a.begin(), a.end(), greater<ll>());
ll res = 0;
rep(i, n) res += a[i];
cout << res << endl;
return 0;
} | [
"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 bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e15;
const int INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<Pi> b(m);
rep(i, m) { cin >> b[i].se >> b[i].fi; }
sort(begin(b), end(b), greater<Pi>());
bool flag = false;
rep(i, n) {
rep(j, b[i].se) {
if (a.size() != 2 * n) {
a.push_back(b[i].fi);
} else {
flag = true;
break;
}
}
if (flag)
break;
}
sort(begin(a), end(a), greater<int>());
ll ans = 0;
rep(i, n) { ans += a[i]; }
cout << ans << endl;
} | #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 bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e15;
const int INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<Pi> b(m);
rep(i, m) { cin >> b[i].se >> b[i].fi; }
sort(begin(b), end(b), greater<Pi>());
bool flag = false;
rep(i, m) {
rep(j, b[i].se) {
if (a.size() != 2 * n) {
a.push_back(b[i].fi);
} else {
flag = true;
break;
}
}
if (flag)
break;
}
sort(begin(a), end(a), greater<int>());
ll ans = 0;
rep(i, n) { ans += a[i]; }
cout << ans << endl;
} | [] | 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::sort(CB.begin(), CB.end());
int A_index = A.size() - 1;
int CB_index = CB.size() - 1;
int cur_CB_cnt = 0;
long long ans = 0;
for (int i = 0; i < N; i++) {
if (A[A_index] > CB[CB_index].first) {
ans += A[A_index];
A_index--;
} else {
ans += CB[CB_index].first;
cur_CB_cnt++;
if (cur_CB_cnt == CB[CB_index].second) {
CB_index--;
cur_CB_cnt = 0;
}
}
}
std::cout << ans << std::endl;
return 0;
}
| #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::sort(CB.begin(), CB.end());
int A_index = A.size() - 1;
int CB_index = CB.size() - 1;
int cur_CB_cnt = 0;
long long ans = 0;
for (int i = 0; i < N; i++) {
if (CB_index < 0 || A[A_index] > CB[CB_index].first) {
ans += A[A_index];
A_index--;
} else {
ans += CB[CB_index].first;
cur_CB_cnt++;
if (cur_CB_cnt == CB[CB_index].second) {
CB_index--;
cur_CB_cnt = 0;
}
}
}
std::cout << ans << std::endl;
return 0;
}
| [
"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[i]);
for (int i = 0; i < m; i++)
sc(b[i].second), sc(b[i].first);
sort(a.begin(), a.end());
sort(b.begin(), b.end(), greater<P>());
ll ans = 0;
for (int i = 0; i < n; i++) {
if (a[na] > b[nb].first)
ans += a[na], na++;
else {
ans += b[nb].first;
tmp++, na++;
if (b[nb].second == tmp)
tmp = 0, nb++;
}
}
cout << ans << endl;
return 0;
} | #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]);
for (int i = 0; i < m; i++)
sc(b[i].second), sc(b[i].first);
sort(a.begin(), a.end());
sort(b.begin(), b.end(), greater<P>());
ll ans = 0;
for (int i = 0; i < n; i++) {
if (a[na] > b[nb].first)
ans += a[na], na++;
else {
ans += b[nb].first;
tmp++, na++;
if (b[nb].second == tmp)
tmp = 0, nb++;
}
}
cout << ans << endl;
return 0;
} | [
"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) for (int i = 0; i < (n); ++i)
int main(int argc, char **argv) {
int N, M;
cin >> N >> M;
int A[N];
REP(i, N) cin >> A[i];
int B[M], C[M];
REP(i, M) cin >> B[i] >> C[i];
map<int, int> m;
REP(i, N) {
if (m.find(A[i]) != m.end())
m[A[i]] += 1;
else
m[A[i]] = 1;
}
pair<int, int> p[M];
REP(i, M) p[i] = make_pair(C[i], B[i]);
sort(p, p + M);
REP(i, M) {
int c = 0;
for (auto itr = m.begin(); itr != m.end();) {
if (itr->first >= p[i].first)
break;
else if (c >= p[i].second)
break;
else {
if (itr->second + c <= p[i].second) {
c += itr->second;
itr = m.erase(itr);
} else {
itr->second -= p[i].second - c;
c = p[i].second;
itr++;
}
}
}
if (c > 0) {
if (m.find(p[i].first) != m.end())
m[p[i].first] += c;
else
m[p[i].first] = c;
}
}
ll score = 0;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
score += (itr->first) * (itr->second);
}
cout << score << endl;
return 0;
}
| #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) for (int i = 0; i < (n); ++i)
int main(int argc, char **argv) {
int N, M;
cin >> N >> M;
ll A[N];
REP(i, N) cin >> A[i];
int B[M];
ll C[M];
REP(i, M) cin >> B[i] >> C[i];
map<ll, int> m;
REP(i, N) {
if (m.find(A[i]) != m.end())
m[A[i]] += 1;
else
m[A[i]] = 1;
}
pair<ll, int> p[M];
REP(i, M) p[i] = make_pair(C[i], B[i]);
sort(p, p + M);
REP(i, M) {
int c = 0;
for (auto itr = m.begin(); itr != m.end();) {
if (itr->first >= p[i].first)
break;
else if (c >= p[i].second)
break;
else {
if (itr->second + c <= p[i].second) {
c += itr->second;
itr = m.erase(itr);
} else {
itr->second -= p[i].second - c;
c = p[i].second;
itr++;
}
}
}
if (c > 0) {
if (m.find(p[i].first) != m.end())
m[p[i].first] += c;
else
m[p[i].first] = c;
}
}
ll score = 0;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
score += (itr->first) * (itr->second);
}
cout << score << endl;
return 0;
}
| [
"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 >> c;
q.push(make_pair(c, b));
}
while (n > 0) {
int qf = q.top().first;
int qs = q.top().second;
ans += qf * qs;
n -= qs;
if (n < 0)
ans += qf * n;
q.pop();
}
cout << ans << endl;
}
| #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 >> c;
q.push(make_pair(c, b));
}
while (n > 0) {
int qf = q.top().first;
int qs = q.top().second;
ans += (ll)qf * qs;
n -= qs;
if (n < 0)
ans += (ll)qf * n;
q.pop();
}
cout << ans << endl;
}
| [
"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>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (auto &t : a) {
cin >> t;
}
vector<pair<int, int>> op(n);
for (auto &t : op)
cin >> t.first >> t.second;
sort(op.rbegin(), op.rend(),
[&](pair<int, int> x, pair<int, int> y) { return x.second < y.second; });
sort(a.begin(), a.end());
vector<int> ra = a;
int pnt = 0;
for (auto t : op) {
while (pnt < n && a[pnt] < t.second && t.first > 0) {
a[pnt] = t.second;
pnt++;
t.first--;
}
}
int s = 0;
for (int i = 0; i < n; i++)
s += a[i];
cout << s << endl;
}
| #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>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (auto &t : a) {
cin >> t;
}
vector<pair<int, int>> op(m);
for (auto &t : op)
cin >> t.first >> t.second;
sort(op.rbegin(), op.rend(),
[&](pair<int, int> x, pair<int, int> y) { return x.second < y.second; });
sort(a.begin(), a.end());
vector<int> ra = a;
int pnt = 0;
for (auto t : op) {
while (pnt < n && a[pnt] < t.second && t.first > 0) {
a[pnt] = t.second;
pnt++;
t.first--;
}
}
int s = 0;
for (int i = 0; i < n; i++)
s += a[i];
cout << s << endl;
}
| [] | 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>;
using pli = pair<lint, lint>;
using pdd = pair<double, double>;
using pld = pair<ldouble, ldouble>;
using v1i = vector<int>;
using v1li = vector<lint>;
using v2i = vector<vector<int>>;
using v2li = vector<vector<lint>>;
using v3i = vector<vector<vector<int>>>;
using v3li = vector<vector<vector<lint>>>;
using v1b = vector<bool>;
using v2b = vector<vector<bool>>;
using v3b = vector<vector<vector<bool>>>;
using v1c = vector<char>;
using v2c = vector<vector<char>>;
using v3c = vector<vector<vector<char>>>;
constexpr lint mod1 = 1e9 + 7;
constexpr lint mod2 = 998244353;
int main() {
int n, m, c = 0, d = 0;
lint s = 0;
scanf("%d %d", &n, &m);
v1li a(n), p(n + 1, 0), q(n + 1, 0);
vector<pii> b(m);
rep(i, n) scanf("%ld", &a[i]);
rep(i, m) scanf("%d %d", &b[i].se, &b[i].fi);
sort(a.begin(), a.end());
sort(b.begin(), b.end());
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
priority_queue<int> pq;
rep(i, n) {
if (c >= m)
break;
pq.push(b[c].fi);
++d;
if (d == b[c].se) {
++c;
d = 0;
}
}
rep(i, n) {
p[i + 1] += p[i] + a[i];
if (pq.empty())
q[i + 1] = q[i];
else
q[i + 1] += q[i] + pq.top();
pq.pop();
}
rep(i, n + 1) s = max(s, p[i] + q[n - i]);
printf("%ld\n", s);
return 0;
} | #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>;
using pli = pair<lint, lint>;
using pdd = pair<double, double>;
using pld = pair<ldouble, ldouble>;
using v1i = vector<int>;
using v1li = vector<lint>;
using v2i = vector<vector<int>>;
using v2li = vector<vector<lint>>;
using v3i = vector<vector<vector<int>>>;
using v3li = vector<vector<vector<lint>>>;
using v1b = vector<bool>;
using v2b = vector<vector<bool>>;
using v3b = vector<vector<vector<bool>>>;
using v1c = vector<char>;
using v2c = vector<vector<char>>;
using v3c = vector<vector<vector<char>>>;
constexpr lint mod1 = 1e9 + 7;
constexpr lint mod2 = 998244353;
int main() {
int n, m, c = 0, d = 0;
lint s = 0;
scanf("%d %d", &n, &m);
v1li a(n), p(n + 1, 0), q(n + 1, 0);
vector<pii> b(m);
rep(i, n) scanf("%ld", &a[i]);
rep(i, m) scanf("%d %d", &b[i].se, &b[i].fi);
sort(a.begin(), a.end());
sort(b.begin(), b.end());
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
priority_queue<int> pq;
rep(i, n) {
if (c >= m)
break;
pq.push(b[c].fi);
++d;
if (d == b[c].se) {
++c;
d = 0;
}
}
rep(i, n) {
p[i + 1] += p[i] + a[i];
if (pq.empty())
q[i + 1] = q[i];
else {
q[i + 1] += q[i] + pq.top();
pq.pop();
}
}
rep(i, n + 1) s = max(s, p[i] + q[n - i]);
printf("%ld\n", s);
return 0;
} | [] | 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();
pq.pop();
if (cnt >= pairs.second) {
ans += pairs.first * pairs.second;
cnt -= pairs.second;
} else {
ans += cnt * pairs.first;
cnt -= pairs.second;
}
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n, m;
rep(i, n) {
ll a;
cin >> a;
pq.push(P(a, 1));
}
rep(i, m) {
ll b, c;
cin >> b >> c;
pq.push(P(c, b));
}
cout << solve(n) << endl;
return 0;
} | #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();
pq.pop();
if (cnt >= pairs.second) {
ans += pairs.first * pairs.second;
cnt -= pairs.second;
} else {
ans += cnt * pairs.first;
cnt -= pairs.second;
}
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
rep(i, n) {
ll a;
cin >> a;
pq.push(P(a, 1));
}
rep(i, m) {
ll b, c;
cin >> b >> c;
pq.push(P(c, b));
}
cout << solve(n) << endl;
return 0;
} | [] | 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;
vector<long long int> A(N);
vector<long long int> S(N + 1, 0);
for (int n = 0; n < N; n++) {
cin >> A[n];
}
sort(A.begin(), A.end());
for (int n = 0; n < N; n++) {
S[n + 1] = A[n] + S[n];
}
vector<pair<int, long long int>> BC(M);
for (int m = 0; m < M; m++) {
cin >> BC[m].first >> BC[m].second;
}
sort(BC.begin(), BC.end(), cmp);
// //debugging
// for(int m=0; m<M; m++) {
// cout << BC[m].second << endl;
// }
long long int sum = 0;
int count = 0;
int m = 0;
int count_sum = 0;
while (m < M) {
count = lower_bound(A.begin() + count, A.end(), BC[m].second) - A.begin() -
count;
count = min(count, BC[m].first);
if (count_sum + count > N)
break;
count_sum += count;
if (count <= 0)
break;
// cout << "sum = " << sum << " -> " ;
sum += BC[m].second * count;
// cout << sum << endl;
m++;
}
// cout << sum << endl;
sum += S[N] - S[count_sum];
// cout << S[N] - S[count_sum] << endl;
cout << sum << endl;
return 0;
} | #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;
vector<long long int> A(N);
vector<long long int> S(N + 1, 0);
for (int n = 0; n < N; n++) {
cin >> A[n];
}
sort(A.begin(), A.end());
for (int n = 0; n < N; n++) {
S[n + 1] = A[n] + S[n];
}
vector<pair<int, long long int>> BC(M);
for (int m = 0; m < M; m++) {
cin >> BC[m].first >> BC[m].second;
}
sort(BC.begin(), BC.end(), cmp);
// //debugging
// for(int m=0; m<M; m++) {
// cout << BC[m].second << endl;
// }
long long int sum = 0;
int count = 0;
int m = 0;
int count_sum = 0;
while (m < M) {
count = lower_bound(A.begin() + count_sum, A.end(), BC[m].second) -
A.begin() - count_sum;
count = min(count, BC[m].first);
if (count_sum + count > N)
break;
count_sum += count;
if (count <= 0)
break;
// cout << "sum = " << sum << " -> " ;
sum += BC[m].second * count;
// cout << sum << endl;
m++;
}
// cout << sum << endl;
sum += S[N] - S[count_sum];
// cout << S[N] - S[count_sum] << endl;
cout << sum << endl;
return 0;
} | [
"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--)
solve();
} else
solve();
}
| #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 (t--)
solve();
} else
solve();
}
| [
"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.