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 |
|---|---|---|---|---|---|---|---|
p02940 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) x.begin(), x.end()
#define db(x) cout << #x << "=" << x << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, n, m) for (int i = n; i >= m; i--)
#define INF (1e9)
#defin... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) x.begin(), x.end()
#define db(x) cout << #x << "=" << x << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, n, m) for (int i = n; i >= m; i--)
#define INF (1e9)
#defin... | [
"assignment.value.change"
] | 741,941 | 741,942 | u556276145 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<vector<int>> v(26);
int s = S.size();
for (int i = 0; i < s; i++) {
v[S[i] - 'a'].push_back(i);
v[S[i] - 'a'].push_back(i + s);
}
for (int i = 0; i < 26; i++) {
if (v[i].size() > 3) {
sort(v[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<vector<int>> v(26);
int s = S.size();
for (int i = 0; i < s; i++) {
v[S[i] - 'a'].push_back(i);
v[S[i] - 'a'].push_back(i + s);
}
for (int i = 0; i < 26; i++) {
if (v[i].size() > 3) {
sort(v[i]... | [
"literal.number.change",
"variable_declaration.value.change"
] | 742,057 | 742,058 | u275786410 | cpp |
p02937 | #include <bits/stdc++.h>
#define ts cout << "ok" << endl
#define int long long
#define hh puts("")
#define pc putchar
#define ite vector<int>::iterator
//#define getchar()
//(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++) char
// buf[1<<21],*p1=buf,*p2=buf;
using namespace std;
int n, m, use, now;
cha... | #include <bits/stdc++.h>
#define ts cout << "ok" << endl
#define int long long
#define hh puts("")
#define pc putchar
#define ite vector<int>::iterator
//#define getchar()
//(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++) char
// buf[1<<21],*p1=buf,*p2=buf;
using namespace std;
int n, m, use, now;
cha... | [
"identifier.change",
"call.function.change"
] | 742,071 | 742,072 | u108577768 | cpp |
p02937 | #include <bits/stdc++.h>
#define ts cout << "ok" << endl
#define int long long
#define hh puts("")
#define pc putchar
#define ite vector<int>::iterator
//#define getchar()
//(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++) char
// buf[1<<21],*p1=buf,*p2=buf;
using namespace std;
int n, m, use, now;
cha... | #include <bits/stdc++.h>
#define ts cout << "ok" << endl
#define int long long
#define hh puts("")
#define pc putchar
#define ite vector<int>::iterator
//#define getchar()
//(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++) char
// buf[1<<21],*p1=buf,*p2=buf;
using namespace std;
int n, m, use, now;
cha... | [
"identifier.change",
"call.function.change"
] | 742,071 | 742,073 | u108577768 | cpp |
p02937 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 742,074 | 742,075 | u102602414 | cpp |
p02937 | #include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
unordered_map<char, vector<int>> idx_m... | #include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
unordered_map<char, vector<int>> idx_m... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 742,076 | 742,077 | u775900747 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll ans = 0;
void Main() {
string S;
cin >> S;
string T;
cin >> T;
string S2 = S + S;
vector<vector<int>> alphabet(26);
For(i, 0, S2.size()) { alphab... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll ans = 0;
void Main() {
string S;
cin >> S;
string T;
cin >> T;
string S2 = S + S;
vector<vector<int>> alphabet(26);
For(i, 0, S2.size()) { alphab... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 742,080 | 742,081 | u813174766 | cpp |
p02937 | #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<int, int>;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
int m = t.size();
vector<vector<int>> sPos(26);
rep(i, n) {
int c = s.at(i) - 'a';
sPos.at(c).pus... | #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<int, int>;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
int m = t.size();
vector<vector<int>> sPos(26);
rep(i, n) {
int c = s.at(i) - 'a';
sPos.at(c).pus... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"assignment.change",
"expression.operation.binary.remove"
] | 742,084 | 742,085 | u048904090 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n... | [
"call.function.change"
] | 742,088 | 742,089 | u021648187 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | [
"identifier.change",
"call.function.change"
] | 742,092 | 742,093 | u471212175 | cpp |
p02937 | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL... | [
"identifier.change",
"call.function.change",
"assignment.value.change"
] | 742,106 | 742,105 | u528720841 | cpp |
p02937 | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change",
"assignment.value.change"
] | 742,107 | 742,105 | u528720841 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vecto... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vecto... | [
"identifier.change",
"call.function.change"
] | 742,115 | 742,116 | u242679311 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define s... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define s... | [
"assignment.change",
"expression.operation.binary.remove"
] | 742,119 | 742,120 | u227976892 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
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... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 742,124 | 742,125 | u052332717 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"assignment.change",
"expression.operation.binary.remove"
] | 742,126 | 742,127 | u832095504 | cpp |
p02937 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<b... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 742,128 | 742,129 | u354567428 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
//↓0-originか1-originでn回繰り返し
#define rep(i, n) for (int i = 0; i < ((in... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
//↓0-originか1-originでn回繰り返し
#define rep(i, n) for (int i = 0; i < ((in... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 742,138 | 742,139 | u457985479 | cpp |
p02937 | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.value.change"
] | 742,143 | 742,141 | u925940521 | cpp |
p02937 | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#else
#define debug(x)
#endif
#define all(s) begin(s), end(s)
#define rall(s) rbegin(s),... | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#else
#define debug(x)
#endif
#define all(s) begin(s), end(s)
#define rall(s) rbegin(s),... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 742,146 | 742,147 | u209647862 | cpp |
p02937 | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#define INFILE freopen("input.txt", "r", stdin)
#else
#define debug(x)
#define INFILE
#en... | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#define INFILE freopen("input.txt", "r", stdin)
#else
#define debug(x)
#define INFILE
#en... | [
"identifier.change",
"io.output.change"
] | 742,148 | 742,149 | u209647862 | cpp |
p02937 | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#define INFILE freopen("input.txt", "r", stdin)
#else
#define debug(x)
#define INFILE
#en... | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#define INFILE freopen("input.txt", "r", stdin)
#else
#define debug(x)
#define INFILE
#en... | [
"identifier.change",
"io.output.change"
] | 742,148 | 742,151 | u209647862 | cpp |
p02937 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e14;
const int ZERO = 0;
const int MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int, int> P;
signed main() {
string S, T;
cin >> S >> T;
vector<int> s[26];
for (int i = 0; i < S.size(); i++) {
s[S.at(i... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e14;
const int ZERO = 0;
const int MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int, int> P;
signed main() {
string S, T;
cin >> S >> T;
vector<int> s[26];
for (int i = 0; i < S.size(); i++) {
s[S.at(i... | [
"expression.operation.binary.remove"
] | 742,159 | 742,160 | u322714721 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
set<int> pos[128];
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++)
pos[s[i]].insert(i + 1);
string t;
cin >> t;
long long p = 0;
long long cnt = 0;
for (char c : t) {
if (pos[c].empty()) {
cout << -1 << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
set<int> pos[128];
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++)
pos[s[i]].insert(i + 1);
string t;
cin >> t;
long long p = 0;
long long cnt = 0;
for (char c : t) {
if (pos[c].empty()) {
cout << -1 << endl;
return ... | [
"assignment.change"
] | 742,164 | 742,165 | u729337236 | cpp |
p02937 | #include <iostream>
#include <vector>
using namespace std;
string s, t;
int main() {
cin >> s;
cin >> t;
string s_double = s + s;
vector<int> chr_idx[26];
for (int i = 0; i < s_double.size(); i++) {
chr_idx[s_double[i] - 'a'].push_back(i);
}
long long rep = 0, resid = 0;
for (int i = 0; i < t.s... | #include <iostream>
#include <vector>
using namespace std;
string s, t;
int main() {
cin >> s;
cin >> t;
string s_double = s + s;
vector<int> chr_idx[26];
for (int i = 0; i < s_double.size(); i++) {
chr_idx[s_double[i] - 'a'].push_back(i);
}
long long rep = 0, resid = 0;
for (int i = 0; i < t.s... | [
"assignment.change",
"expression.operation.binary.remove"
] | 742,166 | 742,167 | u425351967 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60... | [
"literal.number.change",
"variable_declaration.value.change"
] | 742,170 | 742,171 | u612271542 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL << 60)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Y... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL << 60)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Y... | [
"expression.operation.binary.remove"
] | 742,182 | 742,183 | u592610268 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
typedef long long ll;
vector<int> a[30];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
int l = s.length();
int l2 = t.length();
ll ans = 0;
for (int i = 0; i < l; ++i) {
a[s[i] - 'a'].push_... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
typedef long long ll;
vector<int> a[30];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
int l = s.length();
int l2 = t.length();
ll ans = 0;
for (int i = 0; i < l; ++i) {
a[s[i] - 'a'].push_... | [
"literal.number.change",
"variable_declaration.value.change"
] | 742,184 | 742,185 | u011492570 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
typedef long long ll;
vector<int> a[30];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
int l = s.length();
int l2 = t.length();
ll ans = 0;
for (int i = 0; i < l; ++i) {
a[s[i] - 'a'].push_... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
typedef long long ll;
vector<int> a[30];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
int l = s.length();
int l2 = t.length();
ll ans = 0;
for (int i = 0; i < l; ++i) {
a[s[i] - 'a'].push_... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 742,186 | 742,185 | u011492570 | cpp |
p02937 | #include <array>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using LL = long long;
using ULL = unsigned long long;
void solve() {
vector<unsigned> p[256];
string s, t;
cin >> s >> t;
rep(i, s.size()) p[s[i]].push_back(i);
unsigned pp = 0, cycle = 0;
rep(i... | #include <array>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using LL = long long;
using ULL = unsigned long long;
void solve() {
vector<unsigned> p[256];
string s, t;
cin >> s >> t;
rep(i, s.size()) p[s[i]].push_back(i);
unsigned pp = 0, cycle = 0;
rep(i... | [
"assignment.change"
] | 742,191 | 742,192 | u331948661 | cpp |
p02937 | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | [
"call.function.change"
] | 742,202 | 742,203 | u874947858 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s, t;
cin >> s;
cin >> t;
string ss = s + s;
vector<vector<int>> locate(26);
rep(i, ss.size()) { locate[ss[i] - 'a'].push_back(i); }
ll res = 0;
int p = 0;
rep(i, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s, t;
cin >> s;
cin >> t;
string ss = s + s;
vector<vector<int>> locate(26);
rep(i, ss.size()) { locate[ss[i] - 'a'].push_back(i); }
ll res = 0;
int p = 0;
rep(i, ... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 742,206 | 742,207 | u762183504 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, m, n) for (int i = m; i < n... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, m, n) for (int i = m; i < n... | [] | 742,208 | 742,209 | u008582165 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
string s, t;
cin >> s >> t;
ll ls = s.length(), lt = t.length();
map<char, vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
string s, t;
cin >> s >> t;
ll ls = s.length(), lt = t.length();
map<char, vector... | [
"identifier.change",
"call.function.change"
] | 742,219 | 742,220 | u680707192 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | [
"literal.number.change",
"variable_declaration.value.change"
] | 742,221 | 742,222 | u656771711 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Rep(i, n) for (int i = 0; i < n; ++i)
#define rep(i, n) for (int i = 1; i <= ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Rep(i, n) for (int i = 0; i < n; ++i)
#define rep(i, n) for (int i = 1; i <= ... | [
"expression.operation.binary.add"
] | 742,257 | 742,258 | u337199858 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
vector<int> pos[30];
int main() {
string s, t;
cin >> s >> t;
map<char, int> sn, tn;
for (char c : s)
sn[c]++;
bool ok = true;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
vector<int> pos[30];
int main() {
string s, t;
cin >> s >> t;
map<char, int> sn, tn;
for (char c : s)
sn[c]++;
bool ok = true;
... | [
"identifier.change",
"call.function.change"
] | 742,261 | 742,262 | u482544950 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 1e5 + 5;
int n, m, occ_next[N][256];
string s, t;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> s >> t;
n = s.size();
m = t.size();
memset(occ_next, -1, sizeof(occ_next));
// Preprocess t for ne... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 1e5 + 5;
int n, m, occ_next[N][256];
string s, t;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> s >> t;
n = s.size();
m = t.size();
memset(occ_next, -1, sizeof(occ_next));
// Preprocess t for ne... | [
"assignment.change",
"expression.operation.binary.remove"
] | 742,278 | 742,279 | u575588317 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string S, T;
int main() {
cin >> S >> T;
string S2 = S + S;
int next[S2.length() + 1][26];
for (int i = 0; i < 26; i++) {
next[S2.length()][i] = S2.length();
}
for (int i = S2.length() - 1; i >= 0; i--) {
for (int j = 0; j < 26; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string S, T;
int main() {
cin >> S >> T;
string S2 = S + S;
int next[S2.length() + 1][26];
for (int i = 0; i < 26; i++) {
next[S2.length()][i] = S2.length();
}
for (int i = S2.length() - 1; i >= 0; i--) {
for (int j = 0; j < 26; ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 742,282 | 742,283 | u488352661 | cpp |
p02937 | /*
友利奈緒ぱわーでACしてくれ！！！！！！！！！！！！
Charlotteまだ見てない人は見ような！！！！！！！
／ /:／ ＼:ヽ ＼
/ ／ ＼ ヽ
＼__L 彡 ヽ ',
ﾌ / / / / , ヽ ', ｊ
ﾚ / / / ', ヽ j
//... | /*
友利奈緒ぱわーでACしてくれ！！！！！！！！！！！！
Charlotteまだ見てない人は見ような！！！！！！！
／ /:／ ＼:ヽ ＼
/ ／ ＼ ヽ
＼__L 彡 ヽ ',
ﾌ / / / / , ヽ ', ｊ
ﾚ / / / ', ヽ j
//... | [
"expression.operation.binary.remove"
] | 742,286 | 742,287 | u949798495 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"assignment.change",
"expression.operation.binary.remove"
] | 742,288 | 742,289 | u696290869 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (ll i = a - 1; i >= 0; i--)
#define MOD 1000000007
// debug
#define debug(arr) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (ll i = a - 1; i >= 0; i--)
#define MOD 1000000007
// debug
#define debug(arr) ... | [
"call.function.change"
] | 742,292 | 742,293 | u336721073 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
long long ans = 0;
cin >> S >> T;
int N = S.size(), M = T.size();
vector<vector<int>> V('z' + 1, vector<int>(0));
for (int i = 0; i < N; i++)
V[S[i]].push_back(i);
for (int i = 0; i < M; i++) {
if (V[T[i]].size() == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
long long ans = 0;
cin >> S >> T;
int N = S.size(), M = T.size();
vector<vector<int>> V('z' + 1, vector<int>(0));
for (int i = 0; i < N; i++)
V[S[i]].push_back(i);
for (int i = 0; i < M; i++) {
if (V[T[i]].size() == 0) {
... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 742,302 | 742,303 | u122034453 | cpp |
p02937 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long lon... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long lon... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 742,307 | 742,308 | u485731913 | cpp |
p02937 | #include <bits/stdc++.h> // ver2.2.0
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int, int>
#define VPii vector<Pii>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir pr... | #include <bits/stdc++.h> // ver2.2.0
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int, int>
#define VPii vector<Pii>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir pr... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 742,309 | 742,310 | u095453583 | cpp |
p02937 | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> ... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> ... | [
"expression.operation.binary.remove"
] | 742,313 | 742,314 | u434208140 | cpp |
p02937 | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define PP pair<P, P>
#define all(v) v.begin(), v.end()
#define mkp... | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define PP pair<P, P>
#define all(v) v.begin(), v.end()
#define mkp... | [
"literal.number.change",
"variable_declaration.value.change"
] | 742,323 | 742,324 | u147049801 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
int n = sz(s), m = sz(t);
vector<vector<int>> is(26);
rep(i, n) is[s[i] - 'a'].push_back(i);
rep(i, n) is[s[i] - 'a'].push_b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
int n = sz(s), m = sz(t);
vector<vector<int>> is(26);
rep(i, n) is[s[i] - 'a'].push_back(i);
rep(i, n) is[s[i] - 'a'].push_b... | [
"call.arguments.change"
] | 742,325 | 742,326 | u506858457 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
map<char, set<long long>> char_pos;
int n = (int)s.size(), m = (int)t.size();
for (int i = 0; i < n; ++i) {
char_pos[s[i]].insert((long long)i);
}
long long pos = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
map<char, set<long long>> char_pos;
int n = (int)s.size(), m = (int)t.size();
for (int i = 0; i < n; ++i) {
char_pos[s[i]].insert((long long)i);
}
long long pos = -1;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 742,331 | 742,332 | u813181182 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define PI 3.14159265358979
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, s, e) for (int i = (s); i <= (e); ++i)
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define PI 3.14159265358979
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, s, e) for (int i = (s); i <= (e); ++i)
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#de... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 742,339 | 742,338 | u573653733 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (in... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (in... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 742,352 | 742,351 | u314008046 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
string S, T;
cin >> S >> T;
vector<int> V[26];
int used[26] = {};
rep(i, 0, S.size()) {
V[S[i] - 'a'].push_back(i);
used... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
string S, T;
cin >> S >> T;
vector<int> V[26];
int used[26] = {};
rep(i, 0, S.size()) {
V[S[i] - 'a'].push_back(i);
used... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 742,355 | 742,356 | u157322125 | cpp |
p02937 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
map<char, vector<int>> sMap;
for (int i = 0; i < s.size(); i++) {
if (sMap.find(s[i]) == sMap.end()) {
sMap.insert({s[i], vector<int>(1, i)});
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
map<char, vector<int>> sMap;
for (int i = 0; i < s.size(); i++) {
if (sMap.find(s[i]) == sMap.end()) {
sMap.insert({s[i], vector<int>(1, i)});
... | [
"identifier.change",
"call.function.change"
] | 742,359 | 742,360 | u007567244 | cpp |
p02941 | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define FO... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define FO... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 742,380 | 742,381 | u264312457 | cpp |
p02941 | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int NMAX = 1e5 + 5;
int n, a[NMAX], b[NMAX];
ll ans = 0;
pair<int, int> p;
bool possible = true;
priority_queue<pair<int,... | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int NMAX = 2 * 1e5 + 5;
int n, a[NMAX], b[NMAX];
ll ans = 0;
pair<int, int> p;
bool possible = true;
priority_queue<pair<... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 742,441 | 742,440 | u558431380 | cpp |
p02942 | #include <iostream>
#include <vector>
using namespace std;
class BipartiteMatch {
public:
explicit BipartiteMatch(int N, int M)
: N(N), M(M), g(N + M), match(N + M, -1), visit(N + M, 0) {}
public:
void addEdge(int a, int b) {
g[a].push_back(b + N);
g[b + N].push_back(a);
}
int maximumMatch() {
... | #include <iostream>
#include <vector>
using namespace std;
class BipartiteMatch {
public:
explicit BipartiteMatch(int N, int M)
: N(N), M(M), g(N + M), match(N + M, -1), visit(N + M, 0) {}
public:
void addEdge(int a, int b) {
g[a].push_back(b + N);
g[b + N].push_back(a);
}
int maximumMatch() {
... | [
"expression.operation.binary.remove"
] | 742,477 | 742,478 | u002023395 | cpp |
p02942 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100 + 10;
vector<int> g[N];
int vis[N], match[N];
bool dfs(int u) {
if (vis[u])
return false;
vis[u] = 1;
for (int v : g[u])
if (!match[v] || dfs(v)) {
match[v] = u;
return true;
}
return false;
}
int a[N][... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100 + 10;
vector<int> g[N];
int vis[N], match[N];
bool dfs(int u) {
if (vis[u])
return false;
vis[u] = 1;
for (int v : g[u])
if (!match[v] || dfs(match[v])) {
match[v] = u;
return true;
}
return false;
}
in... | [
"control_flow.branch.if.condition.change"
] | 742,487 | 742,488 | u401742026 | cpp |
p02942 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, a, b) for (int i = (a), _end_ = (b); i <= _end_; i++)
#define DREP(i, a, b) for (int i = (a), _end_ = (b); i >= _end_; i--)
#define EREP(i, u) for (int i = start[u]; i; i = e[i].next)
#define fi first
#define se second
#define mkr(a, b) m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, a, b) for (int i = (a), _end_ = (b); i <= _end_; i++)
#define DREP(i, a, b) for (int i = (a), _end_ = (b); i >= _end_; i--)
#define EREP(i, u) for (int i = start[u]; i; i = e[i].next)
#define fi first
#define se second
#define mkr(a, b) m... | [
"control_flow.branch.if.condition.change"
] | 742,495 | 742,496 | u057222094 | cpp |
p02943 | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template <class t> inline t read(t &x) {
char c = getchar();
bool f = 0;
x = 0;
while (!isdigit(c))
f |= c == '-', c = getchar();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ 48),... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template <class t> inline t read(t &x) {
char c = getchar();
bool f = 0;
x = 0;
while (!isdigit(c))
f |= c == '-', c = getchar();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ 48),... | [
"control_flow.loop.for.initializer.change"
] | 742,536 | 742,537 | u052435908 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
#define N 10010
int n, k;
char s[N], st[N];
int id[N], x[N], y[N], c[N];
void build(char *s) {
int n = strlen(s) + 1, m = 256;
for (int i = 0; i < m; i++)
c[i] = 0;
for (int i = 0; i < n; i++)
c[x[i] = s[i]]++;
for (int i = 1; i < m; i++)
c[i] += c[i ... | #include <bits/stdc++.h>
using namespace std;
#define N 10010
int n, k;
char s[N], st[N];
int id[N], x[N], y[N], c[N];
void build(char *s) {
int n = strlen(s) + 1, m = 256;
for (int i = 0; i < m; i++)
c[i] = 0;
for (int i = 0; i < n; i++)
c[x[i] = s[i]]++;
for (int i = 1; i < m; i++)
c[i] += c[i ... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 742,540 | 742,541 | u074493292 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n, k;
string s;
string go(string s, int h) {
string ret;
for (int i = h; i < n; i++) {
ret += s[i];
}
for (int i = n - 1; i >= n - h; i--) {
ret += s[i];
}
return ret;
}
string calc... | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n, k;
string s;
string go(string s, int h) {
string ret;
for (int i = h; i < n; i++) {
ret += s[i];
}
for (int i = n - 1; i >= n - h; i--) {
ret += s[i];
}
return ret;
}
string calc... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 742,548 | 742,549 | u878355493 | cpp |
p02943 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
usi... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
usi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 742,550 | 742,551 | u993074316 | cpp |
p02943 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
// here!!!
// define int long long !!!!!
#define int long long
// define int long long ... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
// here!!!
// define int long long !!!!!
#define int long long
// define int long long ... | [
"expression.operation.binary.add"
] | 742,552 | 742,553 | u943070796 | cpp |
p02943 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
// here!!!
// define int long long !!!!!
#define int long long
// define int long long ... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
// here!!!
// define int long long !!!!!
#define int long long
// define int long long ... | [
"expression.operation.binary.add"
] | 742,552 | 742,554 | u943070796 | cpp |
p02943 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | [
"assignment.change"
] | 742,561 | 742,562 | u942393279 | cpp |
p02943 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 742,563 | 742,562 | u942393279 | cpp |
p02943 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
while (cin >> N >> K) {
string S;
cin >> S;
vector<string> vs;
string T = S;
reverse(T.begin(), T.end());
S += T;
char best = 'z' + 1;
int len = 0;
int rep =... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
while (cin >> N >> K) {
string S;
cin >> S;
vector<string> vs;
string T = S;
reverse(T.begin(), T.end());
S += T;
char best = 'z' + 1;
int len = 0;
int rep =... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 742,568 | 742,569 | u002023395 | cpp |
p02943 | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod = 1000000007, INF = mod * mod * 3LL;
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(fa... | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod = 1000000007, INF = mod * mod * 3LL;
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(fa... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 742,570 | 742,571 | u192903163 | cpp |
p02943 | #include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 9999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i... | #include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 9999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i... | [
"identifier.change",
"call.arguments.change"
] | 742,574 | 742,575 | u618604643 | cpp |
p02943 | #include "algorithm"
#include "cmath"
#include "cstdio"
#include "cstring"
#include "iostream"
#include "map"
#include "queue"
#include "set"
#include "vector"
using namespace std;
#define MAXN 100006
//#define int long long
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for... | #include "algorithm"
#include "cmath"
#include "cstdio"
#include "cstring"
#include "iostream"
#include "map"
#include "queue"
#include "set"
#include "vector"
using namespace std;
#define MAXN 100006
//#define int long long
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for... | [
"control_flow.branch.if.condition.change"
] | 742,579 | 742,580 | u390140944 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
const int N = 5010;
char s[N * 2];
int n;
inline void FUCK(char t) {
for (int i = 1; i <= n; i++)
putchar(t);
exit(0);
}
int tmp[N * 2];
char res[N];
int main() {
int k;
scanf("%d%d%s", &n, &k, s + 1);
char t = 127;
for (int i = 1; i <= n; i++)
t = ... | #include <bits/stdc++.h>
using namespace std;
const int N = 5010;
char s[N * 2];
int n;
inline void FUCK(char t) {
for (int i = 1; i <= n; i++)
putchar(t);
exit(0);
}
int tmp[N * 2];
char res[N];
int main() {
int k;
scanf("%d%d%s", &n, &k, s + 1);
char t = 127;
for (int i = 1; i <= n; i++)
t = ... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 742,582 | 742,583 | u741086489 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
const int N = 5010;
char s[N * 2];
int n;
inline void FUCK(char t) {
for (int i = 1; i <= n; i++)
putchar(t);
exit(0);
}
int tmp[N * 2];
char res[N];
int main() {
int k;
scanf("%d%d%s", &n, &k, s + 1);
char t = 127;
for (int i = 1; i <= n; i++)
t = ... | #include <bits/stdc++.h>
using namespace std;
const int N = 5010;
char s[N * 2];
int n;
inline void FUCK(char t) {
for (int i = 1; i <= n; i++)
putchar(t);
exit(0);
}
int tmp[N * 2];
char res[N];
int main() {
int k;
scanf("%d%d%s", &n, &k, s + 1);
char t = 127;
for (int i = 1; i <= n; i++)
t = ... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 742,582 | 742,584 | u741086489 | cpp |
p02943 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_se... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_se... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 742,585 | 742,586 | u108304786 | cpp |
p02943 | #include <algorithm>
// #include <cstdlib>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
typedef double db;
const int oo = 2139063143;
const int N = 1010000;
const int P = 1000000007;
co... | #include <algorithm>
// #include <cstdlib>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
typedef double db;
const int oo = 2139063143;
const int N = 1010000;
const int P = 1000000007;
co... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.loop.condition.change"
] | 742,590 | 742,591 | u110991149 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
namespace io {
const int l = 1 << 20;
char buf[l], *s, *t, c;
inline void gc() {
if (s == t) {
t = (s = buf) + fread(buf, 1, l, stdin);
c = s == t ? EOF : *s++;
} else
c = *s++;
}
template <class IT> inline void gi(IT &x) {
x = 0;
gc();
while (c < '0' ... | #include <bits/stdc++.h>
using namespace std;
namespace io {
const int l = 1 << 20;
char buf[l], *s, *t, c;
inline void gc() {
if (s == t) {
t = (s = buf) + fread(buf, 1, l, stdin);
c = s == t ? EOF : *s++;
} else
c = *s++;
}
template <class IT> inline void gi(IT &x) {
x = 0;
gc();
while (c < '0' ... | [] | 742,592 | 742,593 | u238671650 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
const int N = 10010;
char s[N], ans[N];
int n, k;
int check(int l) {
for (int i = 0; i < n; i++) {
if (s[i + l] != ans[i]) {
return s[i + l] < ans[i];
}
}
return 0;
}
void cov(int l) {
for (int i = 0; i < n; i++)
ans[i] = s[i + l];
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 10010;
char s[N], ans[N];
int n, k;
int check(int l) {
for (int i = 0; i < n; i++) {
if (s[i + l] != ans[i]) {
return s[i + l] < ans[i];
}
}
return 0;
}
void cov(int l) {
for (int i = 0; i < n; i++)
ans[i] = s[i + l];
}
int main() {
... | [
"literal.number.change",
"call.arguments.change"
] | 742,594 | 742,595 | u493993074 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k, st = 0, ed;
cin >> n >> k >> s;
if (k > 30 || (1 << (k - 1)) >= n) {
cout << string(n, *min_element(s.begin(), s.end())) << "\n";
return 0;
}
string S = s;
reverse(S.begin(), S.end());
string T = s + S;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k, st = 0, ed;
cin >> n >> k >> s;
if (k > 30 || (1 << (k - 1)) >= n) {
cout << string(n, *min_element(s.begin(), s.end())) << "\n";
return 0;
}
string S = s;
reverse(S.begin(), S.end());
string T = s + S;
for (int i =... | [
"control_flow.loop.for.condition.change"
] | 742,598 | 742,599 | u004427876 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, a, b) for (int i = (a), _end_ = (b); i <= _end_; i++)
#define DREP(i, a, b) for (int i = (a), _end_ = (b); i >= _end_; i--)
#define EREP(i, u) for (int i = start[u]; i; i = e[i].next)
#define fi first
#define se second
#define mkr(a, b) m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, a, b) for (int i = (a), _end_ = (b); i <= _end_; i++)
#define DREP(i, a, b) for (int i = (a), _end_ = (b); i >= _end_; i--)
#define EREP(i, u) for (int i = start[u]; i; i = e[i].next)
#define fi first
#define se second
#define mkr(a, b) m... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 742,602 | 742,603 | u057222094 | cpp |
p02943 | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | [
"call.arguments.change"
] | 742,608 | 742,609 | u895067736 | cpp |
p02943 | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 742,610 | 742,611 | u434747175 | cpp |
p02943 | #include <bits/stdc++.h>
#define clr(x) memset(x, 0, sizeof x)
#define For(i, a, b) for (int i = (a); i <= (b); i++)
#define Fod(i, b, a) for (int i = (b); i >= (a); i--)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define fi first
#define se second
#define outval(x) cerr << #x " = " << x << endl
#defin... | #include <bits/stdc++.h>
#define clr(x) memset(x, 0, sizeof x)
#define For(i, a, b) for (int i = (a); i <= (b); i++)
#define Fod(i, b, a) for (int i = (b); i >= (a); i--)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define fi first
#define se second
#define outval(x) cerr << #x " = " << x << endl
#defin... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 742,612 | 742,613 | u773881973 | cpp |
p02943 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, k, last, mx, len;
char a, s[10010], ans[5050] = {0, 'z'}, now[5050];
void work(int l) {
for (int i = 1; i <= len; ++i)
now[n - len + i] = s[l - mx + 1 - i];
for (int i = 1; i <= n - len; ++i)
now[i] = a;
for (int i = 1; ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, k, last, mx, len;
char a, s[10010], ans[5050] = {0, 'z'}, now[5050];
void work(int l) {
for (int i = 1; i <= len; ++i)
now[n - len + i] = s[l - mx + 1 - i];
for (int i = 1; i <= n - len; ++i)
now[i] = a;
for (int i = 1; ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 742,614 | 742,615 | u361707943 | cpp |
p02943 | /*Lucky_Glass*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 20000;
int n, m;
char Is[N + 5], ReS[N + 5], It[N + 3], Ns[N + 3], Nans[N + 3];
int main() {
scanf("%d%d%s", &n, &m, Is + 1);
strcpy(ReS + 1, Is + 1);
reverse(ReS + 1, ReS + 1 + n);
s... | /*Lucky_Glass*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 20000;
int n, m;
char Is[N + 5], ReS[N + 5], It[N + 3], Ns[N + 3], Nans[N + 3];
int main() {
scanf("%d%d%s", &n, &m, Is + 1);
strcpy(ReS + 1, Is + 1);
reverse(ReS + 1, ReS + 1 + n);
s... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 742,616 | 742,617 | u414712570 | cpp |
p02943 | /*Lucky_Glass*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 5000;
int n, m;
char Is[N + 5], ReS[N + 5], It[N + 3], Ns[N + 3], Nans[N + 3];
int main() {
scanf("%d%d%s", &n, &m, Is + 1);
strcpy(ReS + 1, Is + 1);
reverse(ReS + 1, ReS + 1 + n);
st... | /*Lucky_Glass*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 20000;
int n, m;
char Is[N + 5], ReS[N + 5], It[N + 3], Ns[N + 3], Nans[N + 3];
int main() {
scanf("%d%d%s", &n, &m, Is + 1);
strcpy(ReS + 1, Is + 1);
reverse(ReS + 1, ReS + 1 + n);
s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 742,618 | 742,617 | u414712570 | cpp |
p02943 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 10000
#define LL long long
#define Pr pair<int, int>
#define X first
#define Y second
int n, k;
char s[MAXN + 5], Mn, Mx, ans[MAXN + 5], tmp[MAXN + 5];
LL read() {
LL x = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 10000
#define LL long long
#define Pr pair<int, int>
#define X first
#define Y second
int n, k;
char s[MAXN + 5], Mn, Mx, ans[MAXN + 5], tmp[MAXN + 5];
LL read() {
LL x = ... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 742,619 | 742,620 | u778193086 | cpp |
p02943 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
... | [
"expression.operation.binary.add"
] | 742,621 | 742,622 | u879099684 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
void read(int &x) {
x = 0;
int f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -f;
for (; isdigit(ch); ch = getchar())
x = x * 10 + ch - '0';
x *= f;
}
void print(int x) {
if (x < 0)
putchar('-'), x = -x;... | #include <bits/stdc++.h>
using namespace std;
void read(int &x) {
x = 0;
int f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -f;
for (; isdigit(ch); ch = getchar())
x = x * 10 + ch - '0';
x *= f;
}
void print(int x) {
if (x < 0)
putchar('-'), x = -x;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 742,623 | 742,624 | u074465060 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
typedef bool boolean;
const int N = 5005;
int n, K;
int mxR[N];
char s[N << 1], t[N], ans[N];
void check(char *s, int k, char min_c) {
int L = 0, p = n;
while (s[n - L] == min_c)
L++, p--;
L <<= k;
if (L >= n) {
for (int i = 1; i <= n; i++)
putchar(... | #include <bits/stdc++.h>
using namespace std;
typedef bool boolean;
const int N = 5005;
int n, K;
int mxR[N];
char s[N << 1], t[N], ans[N];
void check(char *s, int k, char min_c) {
int L = 0, p = n;
while (s[n - L] == min_c)
L++, p--;
L <<= k;
if (L >= n) {
for (int i = 1; i <= n; i++)
putchar(... | [
"control_flow.return.remove",
"control_flow.exit.add",
"call.arguments.add"
] | 742,627 | 742,628 | u355154283 | cpp |
p02943 | #define y1 askjdkasldjlkasd
#include <bits/stdc++.h>
#undef y1
using namespace std;
#define pb push_back
#define mp make_pair
#define fi(a, b) for (int i = a; i <= b; i++)
#define fj(a, b) for (int j = a; j <= b; j++)
#define fo(a, b) for (int o = a; o <= b; o++)
#define fdi(a, b) for (int i = a; i >= b; i--)
#define... | #define y1 askjdkasldjlkasd
#include <bits/stdc++.h>
#undef y1
using namespace std;
#define pb push_back
#define mp make_pair
#define fi(a, b) for (int i = a; i <= b; i++)
#define fj(a, b) for (int j = a; j <= b; j++)
#define fo(a, b) for (int o = a; o <= b; o++)
#define fdi(a, b) for (int i = a; i >= b; i--)
#define... | [
"expression.operation.binary.remove"
] | 742,629 | 742,630 | u197964611 | cpp |
p02943 | #define y1 askjdkasldjlkasd
#include <bits/stdc++.h>
#undef y1
using namespace std;
#define pb push_back
#define mp make_pair
#define fi(a, b) for (int i = a; i <= b; i++)
#define fj(a, b) for (int j = a; j <= b; j++)
#define fo(a, b) for (int o = a; o <= b; o++)
#define fdi(a, b) for (int i = a; i >= b; i--)
#define... | #define y1 askjdkasldjlkasd
#include <bits/stdc++.h>
#undef y1
using namespace std;
#define pb push_back
#define mp make_pair
#define fi(a, b) for (int i = a; i <= b; i++)
#define fj(a, b) for (int j = a; j <= b; j++)
#define fo(a, b) for (int o = a; o <= b; o++)
#define fdi(a, b) for (int i = a; i >= b; i--)
#define... | [
"expression.operation.binary.remove"
] | 742,631 | 742,630 | u197964611 | cpp |
p02943 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 10005;
int n, k;
char mi, mx, s[N], t[N], ans[N];
void ckmin() {
bool flag = false;
for (int i = 1; i <= n; i++) {
if (t[i] > ans[i]) {
break;
} else if (t[i] < ans[i]) {
flag = true;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 10005;
int n, k;
char mi, mx, s[N], t[N], ans[N];
void ckmin() {
bool flag = false;
for (int i = 1; i <= n; i++) {
if (t[i] > ans[i]) {
break;
} else if (t[i] < ans[i]) {
flag = true;
... | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 742,632 | 742,633 | u159112689 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
namespace mine {
#define double long double
typedef long long ll;
#define pr pair<int, int>
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bin(x) (1... | #include <bits/stdc++.h>
using namespace std;
namespace mine {
#define double long double
typedef long long ll;
#define pr pair<int, int>
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bin(x) (1... | [
"variable_declaration.add",
"identifier.change",
"control_flow.loop.condition.change"
] | 742,638 | 742,639 | u960093366 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most charming girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%%%%%%... | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most charming girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%%%%%%... | [
"variable_declaration.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 742,645 | 742,646 | u545001286 | cpp |
p02943 | // Relive your past life.
// Face your demons.
// The past is never dead,it is not even past.
// The memories are not only the key to the past but...also to the future.
// coded in Rusty Lake
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso64... | // Relive your past life.
// Face your demons.
// The past is never dead,it is not even past.
// The memories are not only the key to the past but...also to the future.
// coded in Rusty Lake
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso64... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 742,651 | 742,652 | u728472449 | cpp |
p02943 | // Relive your past life.
// Face your demons.
// The past is never dead,it is not even past.
// The memories are not only the key to the past but...also to the future.
// coded in Rusty Lake
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso64... | // Relive your past life.
// Face your demons.
// The past is never dead,it is not even past.
// The memories are not only the key to the past but...also to the future.
// coded in Rusty Lake
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso64... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 742,653 | 742,652 | u728472449 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 998244353;
int n, k, i;
char c[10005], ans[10005], mn = 127;
struct str {
char c[5005];
} p[5005];
bool cmp(str a, str b) { return strcmp(a.c + 1, b.c + 1) < 0; }
void dfs(char c[], int k) {
int i, j, mx = 0, s[10005];
memset(s, 0, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 998244353;
int n, k, i;
char c[10005], ans[10005], mn = 127;
struct str {
char c[5005];
} p[5005];
bool cmp(str a, str b) { return strcmp(a.c + 1, b.c + 1) < 0; }
void dfs(char c[], int k) {
int i, j, mx = 0, s[10005];
memset(s, 0, ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 742,655 | 742,656 | u204432355 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 998244353;
int n, k, i;
char c[10005], ans[10005], mn = 127;
struct str {
char c[5005];
} p[5005];
bool cmp(str a, str b) { return strcmp(a.c + 1, b.c + 1) < 0; }
void dfs(char c[], int k) {
int i, j, mx = 0, s[10005];
memset(s, 0, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 998244353;
int n, k, i;
char c[10005], ans[10005], mn = 127;
struct str {
char c[5005];
} p[5005];
bool cmp(str a, str b) { return strcmp(a.c + 1, b.c + 1) < 0; }
void dfs(char c[], int k) {
int i, j, mx = 0, s[10005];
memset(s, 0, ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 742,657 | 742,656 | u204432355 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 998244353;
int n, k, i;
char c[10005], ans[10005], mn = 127;
struct str {
char c[5005];
} p[5005];
bool cmp(str a, str b) { return strcmp(a.c + 1, b.c + 1) > 0; }
void dfs(char c[], int k) {
int i, j, mx = 0, s[10005];
memset(s, 0, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 998244353;
int n, k, i;
char c[10005], ans[10005], mn = 127;
struct str {
char c[5005];
} p[5005];
bool cmp(str a, str b) { return strcmp(a.c + 1, b.c + 1) < 0; }
void dfs(char c[], int k) {
int i, j, mx = 0, s[10005];
memset(s, 0, ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.off_by_one"
] | 742,658 | 742,656 | u204432355 | cpp |
p02943 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, K;
#define Maxn 10010
char S[Maxn], Ans[Maxn];
int L = 0, H;
int G = 0;
char c = 'z';
char ch[Maxn];
int sum[Maxn];
inline void solve() {
for (register int i = 1; i <= n - L; ++i)
ch[i] = ch[L - H + i];
fo... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, K;
#define Maxn 10010
char S[Maxn], Ans[Maxn];
int L = 0, H;
int G = 0;
char c = 'z';
char ch[Maxn];
int sum[Maxn];
inline void solve() {
for (register int i = 1; i <= n - L; ++i)
ch[i] = ch[L - H + i];
fo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 742,661 | 742,662 | u299340570 | cpp |
p02943 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, K;
#define Maxn 10010
char S[Maxn], Ans[Maxn];
int L = 0, H;
int G = 0;
char c = 'z';
char ch[Maxn];
int sum[Maxn];
inline void solve() {
for (register int i = 1; i <= n - L; ++i)
ch[i] = ch[L - H + i];
fo... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, K;
#define Maxn 10010
char S[Maxn], Ans[Maxn];
int L = 0, H;
int G = 0;
char c = 'z';
char ch[Maxn];
int sum[Maxn];
inline void solve() {
for (register int i = 1; i <= n - L; ++i)
ch[i] = ch[L - H + i];
fo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.add"
] | 742,664 | 742,662 | u299340570 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.