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 |
|---|---|---|---|---|---|---|---|
p02937 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,944 | 739,945 | u715366261 | cpp |
p02937 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,946 | 739,945 | u715366261 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,965 | 739,966 | u604329931 | cpp |
p02937 | #include <bits/stdc++.h>
using std::bitset;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reps(i, s, e) for (int i = s; i < (int)e; i++)
#define coutd(i) cout << std::fixed << std::setprecision(i)
typedef long double ... | #include <bits/stdc++.h>
using std::bitset;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reps(i, s, e) for (int i = s; i < (int)e; i++)
#define coutd(i) cout << std::fixed << std::setprecision(i)
typedef long double ... | [] | 739,967 | 739,968 | u718048349 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007; // 998244353;
void solve() {
string s, t;
cin >> s >> t;
vector<set<int>> vs(26);
rep(i, s.size()) vs[int(s[i] - 'a')].insert(i + 1);
int k = 1;
ll ans = 0;
rep(i, t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007; // 998244353;
void solve() {
string s, t;
cin >> s >> t;
vector<set<int>> vs(26);
rep(i, s.size()) vs[int(s[i] - 'a')].insert(i + 1);
int k = 0;
ll ans = 0;
rep(i, t... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.unary.arithmetic.remove"
] | 739,969 | 739,970 | u528388170 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007; // 998244353;
void solve() {
string s, t;
cin >> s >> t;
vector<set<int>> vs(26);
rep(i, s.size()) vs[int(s[i] - 'a')].insert(i + 1);
int k = -1;
ll ans = 0;
rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007; // 998244353;
void solve() {
string s, t;
cin >> s >> t;
vector<set<int>> vs(26);
rep(i, s.size()) vs[int(s[i] - 'a')].insert(i + 1);
int k = 0;
ll ans = 0;
rep(i, t... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.unary.arithmetic.remove"
] | 739,971 | 739,970 | u528388170 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007; // 998244353;
void solve() {
string s, t;
cin >> s >> t;
vector<set<int>> vs(26);
rep(i, s.size()) vs[int(s[i] - 'a')].insert(i + 1);
int k = 0;
ll ans = 0;
rep(i, t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007; // 998244353;
void solve() {
string s, t;
cin >> s >> t;
vector<set<int>> vs(26);
rep(i, s.size()) vs[int(s[i] - 'a')].insert(i + 1);
int k = 0;
ll ans = 0;
rep(i, t... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 739,972 | 739,970 | u528388170 | cpp |
p02937 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef tree<int, null_type, less<int>, rb_tree_tag,
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef tree<int, null_type, less<int>, rb_tree_tag,
... | [
"assignment.change"
] | 739,973 | 739,974 | u644164234 | cpp |
p02937 | /*
URL https://
SCORE 0
AC false
WA false
TLE false
MLE false
TASK_TYPE
FAILURE_TYPE
NOTES
*/
#include <algorithm>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#includ... | /*
URL https://
SCORE 0
AC false
WA false
TLE false
MLE false
TASK_TYPE
FAILURE_TYPE
NOTES
*/
#include <algorithm>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#includ... | [
"identifier.change"
] | 739,975 | 739,976 | u071730284 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,990 | 739,989 | u697968316 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 739,990 | 739,991 | u697968316 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,992 | 739,991 | u697968316 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string t;
cin >> t;
int N = s.size();
int M = t.size();
vector<set<int>> pos(26);
for (int i = 0; i < N; i++) {
pos[s[i] - 'a'].insert(i);
}
bool ok = true;
for (int i = 0; i < M; i++) {
if (pos[t[i] - 'a'].empt... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string t;
cin >> t;
int N = s.size();
int M = t.size();
vector<set<int>> pos(26);
for (int i = 0; i < N; i++) {
pos[s[i] - 'a'].insert(i);
}
bool ok = true;
for (int i = 0; i < M; i++) {
if (pos[t[i] - 'a'].empt... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change"
] | 740,000 | 740,001 | u424374375 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<long long, long long>
#define ii pair<ll, ll>
#define mod 1000000007
#define endl '\n'
#define IOS \
std::ios::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<long long, long long>
#define ii pair<ll, ll>
#define mod 1000000007
#define endl '\n'
#define IOS \
std::ios::sync_with_stdio(false); ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,002 | 740,003 | u224168474 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define r... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 740,004 | 740,005 | u277556971 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define min(a, b) (a > b ? b : a)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define min(a, b) (a > b ? b : a)
... | [
"call.remove"
] | 740,008 | 740,009 | u277556971 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string s, t;
cin >> s >> t;
vector<ll> A[26];
for (int i = 0; i < s.size(); i++) {
A[s[i] - 'a'].push_back(i + 1);
}
ll ans = 0;
for (int i = 0; i < t.size(); i++) {
char... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string s, t;
cin >> s >> t;
vector<ll> A[26];
for (int i = 0; i < s.size(); i++) {
A[s[i] - 'a'].push_back(i + 1);
}
ll ans = 0;
for (int i = 0; i < t.size(); i++) {
char... | [
"identifier.change",
"call.function.change"
] | 740,010 | 740,011 | u083494782 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string s, t;
cin >> s >> t;
vector<int> A[26];
for (int i = 0; i < s.size(); i++) {
A[s[i] - 'a'].push_back(i + 1);
}
ll ans = 0;
for (int i = 0; i < t.size(); i++) {
cha... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string s, t;
cin >> s >> t;
vector<ll> A[26];
for (int i = 0; i < s.size(); i++) {
A[s[i] - 'a'].push_back(i + 1);
}
ll ans = 0;
for (int i = 0; i < t.size(); i++) {
char... | [
"identifier.change",
"call.function.change"
] | 740,012 | 740,011 | u083494782 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 740,013 | 740,014 | u190018920 | cpp |
p02937 | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1) * 4
#define pb push_back
#define... | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1) * 4
#define pb push_back
#define... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 740,023 | 740,024 | u526278960 | 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;
map<char, vector<int>> mp;
rep(i, s.size()) { mp[s[i]].push_back(i + 1); }
long long ans = 0;
int p = 0;
rep(i, t.size()) ... | #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;
map<char, vector<int>> mp;
rep(i, s.size()) { mp[s[i]].push_back(i + 1); }
long long ans = 0;
int p = 0;
rep(i, t.size()) ... | [
"identifier.change",
"call.function.change"
] | 740,031 | 740,032 | u929618357 | cpp |
p02937 | // In the name of GOD
#include <bits/stdc++.h>
#define ll long long
#define pp pair<int, int>
using namespace std;
const int N = 2e5 + 10, MOD = 1e9 + 7;
const ll INF = 1e18;
void solve() {
string s;
string t;
cin >> s >> t;
map<char, vector<int>> mp;
int i = 0;
for (char c : s) {
mp[c].push_back(i);
... | // In the name of GOD
#include <bits/stdc++.h>
#define ll long long
#define pp pair<int, int>
using namespace std;
const int N = 2e5 + 10, MOD = 1e9 + 7;
const ll INF = 1e18;
void solve() {
string s;
string t;
cin >> s >> t;
map<char, vector<int>> mp;
int i = 0;
for (char c : s) {
mp[c].push_back(i);
... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 740,040 | 740,041 | u927520692 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
//#include "cxx-prettyprint/prettyprint.hpp"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repR(i, n) for (int i = (n)-1; i > -1; i--)
#define rep1(i, n) for (int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) f... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
//#include "cxx-prettyprint/prettyprint.hpp"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repR(i, n) for (int i = (n)-1; i > -1; i--)
#define rep1(i, n) for (int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) f... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 740,042 | 740,043 | u529632089 | cpp |
p02937 | #include <iostream>
#include <map>
#include <set>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
map<char, set<int>> sm, tm;
for (int i = 0; i < s.length(); i++) {
sm[s[i]].insert(i);
}
for (int i = 0; i < t.length(); i++) {
tm[t[i]].insert(i);
}
for (auto q : tm) {
... | #include <iostream>
#include <map>
#include <set>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
map<char, set<int>> sm, tm;
for (int i = 0; i < s.length(); i++) {
sm[s[i]].insert(i);
}
for (int i = 0; i < t.length(); i++) {
tm[t[i]].insert(i);
}
for (auto q : tm) {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,096 | 740,097 | u506846578 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,098 | 740,099 | u684423349 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vec... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 740,102 | 740,103 | u009414205 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000 * 100 + 1
#define numberOfSetBits(S) \
__builtin_popcount(S) // __builtin_popcountl(S) __builtin_p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000 * 100 + 1
#define numberOfSetBits(S) \
__builtin_popcount(S) // __builtin_popcountl(S) __builtin_p... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,104 | 740,105 | u313568050 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> arf(26, vector<int>(0));
for (int i = 0; i < (int)s.size(); ++i) {
int x = s[i] - 'a';
arf[x].push_back(i + 1);
}
for (int i = 0; i < 26; ++i) {
arf[i].push_bac... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> arf(26, vector<int>(0));
for (int i = 0; i < (int)s.size(); ++i) {
int x = s[i] - 'a';
arf[x].push_back(i + 1);
}
for (int i = 0; i < 26; ++i) {
arf[i].push_bac... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,106 | 740,107 | u031240034 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> arf(26, vector<int>(0));
for (int i = 0; i < (int)s.size(); ++i) {
int x = s[i] - 'a';
arf[x].push_back(i + 1);
}
for (int i = 0; i < 26; ++i) {
arf[i].push_bac... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> arf(26, vector<int>(0));
for (int i = 0; i < (int)s.size(); ++i) {
int x = s[i] - 'a';
arf[x].push_back(i + 1);
}
for (int i = 0; i < 26; ++i) {
arf[i].push_bac... | [
"identifier.change",
"call.function.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,108 | 740,107 | u031240034 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
int main() {
string s, t;
cin >> s >> t;
s += s;
LL ans = 0, prev = -1;
vector<vector<LL>> chara(26);
rep(i, s.size()) {
int c = s[i] - 'a';
chara[c].emplace_back(i);
}
rep(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
int main() {
string s, t;
cin >> s >> t;
s += s;
LL ans = 0, prev = -1;
vector<vector<LL>> chara(26);
rep(i, s.size()) {
int c = s[i] - 'a';
chara[c].emplace_back(i);
}
rep(... | [
"identifier.change",
"call.function.change"
] | 740,112 | 740,113 | u226233437 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long LL;
int main() {
string s, t;
cin >> s >> t;
map<char, vector<int>> m;
rep(i, s.size()) {
char c = s[i];
m[c].emplace_back(i);
}
LL num = 0, pos = 0, ans = 0;
LL n = s.size();
r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long LL;
int main() {
string s, t;
cin >> s >> t;
map<char, vector<int>> m;
rep(i, s.size()) {
char c = s[i];
m[c].emplace_back(i);
}
LL num = -1, pos = 0, ans = 0;
LL n = s.size();
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,114 | 740,115 | u226233437 | cpp |
p02937 | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
string s, t;
vector<ll> c[30];
ll x, times;
int main() {
ll i, j, k;
cin >> s >> t;
for (i = 0; s[i]; i++)
c[s[i] - 'a'].push_back(i);
for (i = 0, j = -1; t[i]; i++) {
x = t[i] - 'a';
if (c[x].size() ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
string s, t;
vector<ll> c[30];
ll x, times;
int main() {
ll i, j, k;
cin >> s >> t;
for (i = 0; s[i]; i++)
c[s[i] - 'a'].push_back(i);
for (i = 0, j = -1; t[i]; i++) {
x = t[i] - 'a';... | [
"import.add",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 740,118 | 740,119 | u093170535 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
#define ppp(a) (cout << (a) << endl);
#define cop(a) \
for (auto x : (a)) { ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
#define ppp(a) (cout << (a) << endl);
#define cop(a) \
for (auto x : (a)) { ... | [
"assignment.add"
] | 740,146 | 740,147 | u306142032 | cpp |
p02937 | #if __has_include("../library/Basic/Debug.hpp")
#include "../library/Basic/Debug.hpp"
#else
/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <bitset>
#include <com... | #if __has_include("../library/Basic/Debug.hpp")
#include "../library/Basic/Debug.hpp"
#else
/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <bitset>
#include <com... | [
"assignment.change",
"expression.operation.binary.remove"
] | 740,150 | 740,151 | u059727354 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,154 | 740,155 | u506255180 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 740,156 | 740,155 | u506255180 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define FOR(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
template <class T> inline boo... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define FOR(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
template <class T> inline boo... | [
"identifier.change",
"call.function.change"
] | 740,159 | 740,160 | u272997285 | cpp |
p02937 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std:... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std:... | [
"literal.number.change",
"variable_declaration.value.change",
"io.output.change"
] | 740,167 | 740,166 | u752814744 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
int spos = 0;
long long result;
vector<int> sna;
for (auto &e : t) {
int sn = s.substr(spos).find(e);
if (sn == string::npos) {
if (s.find(e) == string::npos) {
result = -1;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
int spos = 0;
long long result = 0;
vector<int> sna;
for (auto &e : t) {
int sn = s.substr(spos).find(e);
if (sn == string::npos) {
if (s.find(e) == string::npos) {
result = -1;
bre... | [
"variable_declaration.value.change"
] | 740,177 | 740,178 | u280802329 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
int spos = 0;
long result;
vector<int> sna;
for (auto &e : t) {
int sn = s.substr(spos).find(e);
if (sn == string::npos) {
if (s.find(e) == string::npos) {
result = -1;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
int spos = 0;
long long result = 0;
vector<int> sna;
for (auto &e : t) {
int sn = s.substr(spos).find(e);
if (sn == string::npos) {
if (s.find(e) == string::npos) {
result = -1;
bre... | [
"variable_declaration.type.widen.change",
"variable_declaration.value.change"
] | 740,179 | 740,178 | u280802329 | cpp |
p02937 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
void chmax(long &target, long const &value) {
if (target < value) {
target = value;
}
}
int main() {
using namespace std;
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
vector<vector<long>> char... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
void chmax(long &target, long const &value) {
if (target < value) {
target = value;
}
}
int main() {
using namespace std;
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
vector<vector<long>> char... | [
"expression.operation.binary.remove"
] | 740,183 | 740,184 | u596082532 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
string s, t;
vector<int> abc[26];
int main() {
cin >> s >> t;
rep(i, s.size()) { abc[s[i] - 'a'].push_back(i); }
rep(i, s.size()) { abc[s[i] - 'a'].push_back(i + s.size()); }
... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
string s, t;
vector<int> abc[26];
int main() {
cin >> s >> t;
rep(i, s.size()) { abc[s[i] - 'a'].push_back(i); }
rep(i, s.size()) { abc[s[i] - 'a'].push_back(i + s.size()); }
... | [] | 740,192 | 740,193 | u499824662 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<long long>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<long long>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
... | [
"identifier.change",
"expression.operation.binary.change"
] | 740,194 | 740,195 | u073486874 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | [
"call.function.change"
] | 740,205 | 740,206 | u508571192 | cpp |
p02937 | #pragma GCC optimize "03"
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); ... | #pragma GCC optimize "03"
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); ... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 740,212 | 740,213 | u995439034 | cpp |
p02937 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
// struct UnionFind {
// vector<int> par;
// UnionFind(... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
// struct UnionFind {
// vector<int> par;
// UnionFind(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,217 | 740,218 | u677149117 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 1e5 + 10;
int pos[30];
int Nxt[MAX][30];
void pr(ll res) {
cout << res << "\n";
exit(0);
}
int main() {
string S, T;
cin >> S >> T;
int sz = S.size();
for (int i = 0; i < 26; i++)
pos[i] = sz;
for (int i = sz; i >=... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 1e5 + 10;
int pos[30];
int Nxt[MAX][30];
void pr(ll res) {
cout << res << "\n";
exit(0);
}
int main() {
string S, T;
cin >> S >> T;
int sz = S.size();
for (int i = 0; i < 26; i++)
pos[i] = sz + 1;
for (int i = sz; ... | [
"assignment.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,221 | 740,222 | u205197147 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | [
"assignment.change"
] | 740,223 | 740,224 | u033602950 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
void nope() {
cout << -1 << endl;
exit(0);
}
int32_t main() {
string s, t;
cin >> s >> t;
int n = s.length(), m = t.length();
vector<vector<int>> inds(26);
for (int i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
void nope() {
cout << -1 << endl;
exit(0);
}
int32_t main() {
string s, t;
cin >> s >> t;
int n = s.length(), m = t.length();
vector<vector<int>> inds(26);
for (int i = 0; i < n; ... | [
"expression.operation.binary.remove"
] | 740,227 | 740,228 | u455309216 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll i, j;
string s, t;
cin >> s >> t;
vector<ll> c_idx[26];
for (i = 0; i < s.length(); i++) {
c_idx[s[i] - 'a'].push_back(i);
}
ll next[26][s.length()];
for (i = 0; i < 26; i++) {
ll k = 0;
if (c_idx[i].size() =... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll i, j;
string s, t;
cin >> s >> t;
vector<ll> c_idx[26];
for (i = 0; i < s.length(); i++) {
c_idx[s[i] - 'a'].push_back(i);
}
ll next[26][s.length()];
for (i = 0; i < 26; i++) {
ll k = 0;
if (c_idx[i].size() =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,233 | 740,234 | u898143674 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll i, j;
string s, t;
cin >> s >> t;
vector<int> c_idx[26];
for (i = 0; i < s.length(); i++) {
c_idx[s[i] - 'a'].push_back(i);
}
int next[26][s.length()];
for (i = 0; i < 26; i++) {
ll k = 0;
if (c_idx[i].size()... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll i, j;
string s, t;
cin >> s >> t;
vector<ll> c_idx[26];
for (i = 0; i < s.length(); i++) {
c_idx[s[i] - 'a'].push_back(i);
}
ll next[26][s.length()];
for (i = 0; i < 26; i++) {
ll k = 0;
if (c_idx[i].size() =... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,235 | 740,234 | u898143674 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define rando ... | #include <bits/stdc++.h>
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define rando ... | [
"assignment.change"
] | 740,236 | 740,237 | u036734295 | cpp |
p02937 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,241 | 740,242 | u065923107 | cpp |
p02937 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 740,243 | 740,242 | u065923107 | cpp |
p02937 | /* author : mpily :-()
title : Competing.cpp
time :Tue Aug 27 09:33:36 2019
*/
#include <bits/stdc++.h>
using namespace std;
vector<int> letters[26];
int getAns(string s, string t) {
int indexs = 0;
int indext = 0;
int rounds = 0;
int prev = indext;
while (indext < t.size()) {
if (s[indexs % s.size()]... | /* author : mpily :-()
title : Competing.cpp
time :Tue Aug 27 09:33:36 2019
*/
#include <bits/stdc++.h>
using namespace std;
vector<int> letters[26];
int getAns(string s, string t) {
int indexs = 0;
int indext = 0;
int rounds = 0;
int prev = indext;
while (indext < t.size()) {
if (s[indexs % s.size()]... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,247 | 740,248 | u605757515 | cpp |
p02937 | #include "bits/stdc++.h"
using namespace std;
#define REP(k, m, n) for (int(k) = (m); (k) < (n); (k)++)
#define rep(i, n) REP((i), 0, (n))
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
map<char, vector<ll>> mp;
rep(i, s.size()) mp[s[i]].push_back(i);
ll loop = 0;
ll now = -1;
for (char... | #include "bits/stdc++.h"
using namespace std;
#define REP(k, m, n) for (int(k) = (m); (k) < (n); (k)++)
#define rep(i, n) REP((i), 0, (n))
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
map<char, vector<ll>> mp;
rep(i, s.size()) mp[s[i]].push_back(i);
ll loop = 0;
ll now = -1;
for (char... | [
"identifier.change",
"call.function.change",
"assignment.value.change"
] | 740,249 | 740,250 | u692632484 | cpp |
p02937 | #include <iostream>
#include <string>
#include <vector>
const int NUM_CHAR = 'z' - 'a' + 1;
inline constexpr int charToIndex(char c) { return c - 'a'; }
int main() {
std::string s, t;
std::cin >> s;
std::cin >> t;
// nextIndex[i][charToIndex(c)]: sใฎi็ช็ฎใใ่ฆใฆใๆฌกใฎcใพใงใฎ่ท้ข
std::vector<std::vector<int>> nextDistan... | #include <iostream>
#include <string>
#include <vector>
const int NUM_CHAR = 'z' - 'a' + 1;
inline constexpr int charToIndex(char c) { return c - 'a'; }
int main() {
std::string s, t;
std::cin >> s;
std::cin >> t;
// nextIndex[i][charToIndex(c)]: sใฎi็ช็ฎใใ่ฆใฆใๆฌกใฎcใพใงใฎ่ท้ข
std::vector<std::vector<int>> nextDistan... | [
"assignment.change"
] | 740,258 | 740,259 | u591440280 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> al(26);
for (int i = 0; i < s.size(); i++) {
al[s[i] - 'a'].push_back(i);
}
ll now = -1;
ll loop = 0;
for (int i = 0; i < t.size(); i++) {
ll id = t[i] - 'a';
if ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> al(26);
for (int i = 0; i < s.size(); i++) {
al[s[i] - 'a'].push_back(i);
}
ll now = -1;
ll loop = 0;
for (int i = 0; i < t.size(); i++) {
ll id = t[i] - 'a';
if ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,266 | 740,267 | u003019316 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define inf = 1e9 + 5;
#define dbg(vari) cerr << #vari << " = " << (vari) << endl;
void solve(std::string s, std::string t) {
unordered_map<char, vector<ll>> m;
for (int i = 0; i < s.size(); i++) {
char c = s[i];
m[c].push_back(i);
}
l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define inf = 1e9 + 5;
#define dbg(vari) cerr << #vari << " = " << (vari) << endl;
void solve(std::string s, std::string t) {
unordered_map<char, vector<ll>> m;
for (int i = 0; i < s.size(); i++) {
char c = s[i];
m[c].push_back(i);
}
l... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,268 | 740,269 | u407431337 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define inf = 1e9 + 5;
#define dbg(vari) cerr << #vari << " = " << (vari) << endl;
void solve(std::string s, std::string t) {
unordered_map<char, vector<ll>> m;
for (int i = 0; i < s.size(); i++) {
char c = s[i];
m[c].push_back(i);
}
l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define inf = 1e9 + 5;
#define dbg(vari) cerr << #vari << " = " << (vari) << endl;
void solve(std::string s, std::string t) {
unordered_map<char, vector<ll>> m;
for (int i = 0; i < s.size(); i++) {
char c = s[i];
m[c].push_back(i);
}
l... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 740,270 | 740,269 | u407431337 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 200005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define F first
#define S se... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 200005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define F first
#define S se... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,271 | 740,272 | u308590217 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define si set<int>
#define sl set<long long>
#define pq prioirty_queue
#define all(v) v.begin(), v.end()
#define left (2 * idx) + 1
#define right (2 * idx) + 2
#define FIO ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define si set<int>
#define sl set<long long>
#define pq prioirty_queue
#define all(v) v.begin(), v.end()
#define left (2 * idx) + 1
#define right (2 * idx) + 2
#define FIO ... | [
"identifier.change",
"call.function.change"
] | 740,275 | 740,276 | u166359301 | cpp |
p02937 | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define INPUT_INT(valName) \
int valName; \
cin >> valName;
#define INPUT_STR(valName) ... | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define INPUT_INT(valName) \
int valName; \
cin >> valName;
#define INPUT_STR(valName) ... | [
"assignment.change"
] | 740,277 | 740,278 | u911738004 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(string s, string t) {
int len = s.size();
s = '@' + s;
vector<int> sum[26];
for (char x = 0; x < 26; ++x) {
sum[x].resize(len + 1);
sum[x][0] = 0;
}
for (int j = 1; j <= len; ++j) {
for (char x = 0; x < 26; ++x)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(string s, string t) {
int len = s.size();
s = '@' + s;
vector<int> sum[26];
for (char x = 0; x < 26; ++x) {
sum[x].resize(len + 1);
sum[x][0] = 0;
}
for (int j = 1; j <= len; ++j) {
for (char x = 0; x < 26; ++x)
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,281 | 740,282 | u745685739 | cpp |
p02937 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <un... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <un... | [] | 740,285 | 740,286 | u096453658 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int inf = 1e8;
int nxt[maxn << 1][26];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
string s1;
cin >> s >> s1;
int n = s.length();
int n1 = s1.length();
s += s;
for (int i = 0; i < n; i++) {
for ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int inf = 1e8;
int nxt[maxn << 1][26];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
string s1;
cin >> s >> s1;
int n = s.length();
int n1 = s1.length();
s += s;
for (int i = 0; i < n * 2; i++) {
... | [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,291 | 740,292 | u773531304 | cpp |
p02937 | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priori... | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priori... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 740,302 | 740,303 | u259210975 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [
"assignment.change"
] | 740,306 | 740,307 | u403813525 | cpp |
p02937 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
inline void rd(char &c) {
int i;
for (;;) {
i = getchar_unlocked();
if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) {
break;
}
}
c = i;
}
inline int rd(char c[]) {
int i, sz = 0;
for (;;) {
i =... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
inline void rd(char &c) {
int i;
for (;;) {
i = getchar_unlocked();
if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) {
break;
}
}
c = i;
}
inline int rd(char c[]) {
int i, sz = 0;
for (;;) {
i =... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"assignment.change",
"literal.number.change"
] | 740,314 | 740,315 | u066369439 | cpp |
p02937 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
inline void rd(char &c) {
int i;
for (;;) {
i = getchar_unlocked();
if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) {
break;
}
}
c = i;
}
inline int rd(char c[]) {
int i, sz = 0;
for (;;) {
i =... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
inline void rd(char &c) {
int i;
for (;;) {
i = getchar_unlocked();
if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) {
break;
}
}
c = i;
}
inline int rd(char c[]) {
int i, sz = 0;
for (;;) {
i =... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"assignment.change",
"literal.number.change"
] | 740,314 | 740,316 | u066369439 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long
#define pb(x) push_back(x)
using namespace std;
int main() {
ll n, m;
string s, t;
cin >> s >> t;
n = s.length();
m = t.length();
vector<ll> adj[26];
for (ll i = 0; i < n; i++) {
adj[s[i] - 'a'].pb(i);
}
ll iter = 0;
ll ind = 0;
for (ll i = 0... | #include <bits/stdc++.h>
#define ll long long
#define pb(x) push_back(x)
using namespace std;
int main() {
ll n, m;
string s, t;
cin >> s >> t;
n = s.length();
m = t.length();
vector<ll> adj[26];
for (ll i = 0; i < n; i++) {
adj[s[i] - 'a'].pb(i);
}
ll iter = 0;
ll ind = 0;
for (ll i = 0... | [
"assignment.change",
"expression.operation.binary.remove"
] | 740,317 | 740,318 | u357713705 | cpp |
p02937 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<long long>> ab2vec(26);
for (long long i = 0; i < s.size(); i++) {
ab2vec[s[i] - 'a'].push_back(i);
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<long long>> ab2vec(26);
for (long long i = 0; i < s.size(); i++) {
ab2vec[s[i] - 'a'].push_back(i);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,321 | 740,322 | u990764614 | cpp |
p02937 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<long long>> ab2vec(26);
for (long long i = 0; i < s.size(); i++) {
ab2vec[s[i] - 'a'].push_back(i);
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<long long>> ab2vec(26);
for (long long i = 0; i < s.size(); i++) {
ab2vec[s[i] - 'a'].push_back(i);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,323 | 740,322 | u990764614 | cpp |
p02937 | // g++ 5.4.0
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll c[27] = {0};
ll l[27][1000001];
ll bsearch(ll *ar, ll l, ll r, ll v) {
ll ret = -1;
while (l <= r) {
ll m = (l + r) / 2;
if (ar[m] >= v) {
ret = ar[m];
r = m - 1;
} else
l = m + 1;
}
return ... | // g++ 5.4.0
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll c[27] = {0};
ll l[27][1000001];
ll bsearch(ll *ar, ll l, ll r, ll v) {
ll ret = -1;
while (l <= r) {
ll m = (l + r) / 2;
if (ar[m] >= v) {
ret = ar[m];
r = m - 1;
} else
l = m + 1;
}
return ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,324 | 740,325 | u453299312 | cpp |
p02937 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
string s, t;
set<int> se[30];
int main() {
cin >> s >> t;
int ss = s.size(), ts = t.size();
rep(i, 26... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
string s, t;
set<int> se[30];
int main() {
cin >> s >> t;
int ss = s.size(), ts = t.size();
rep(i, 26... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,332 | 740,333 | u110996038 | cpp |
p02937 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
vector<set<int>> pos(26);
for (int i = 0; i < s.size(); ++i)
pos[s[i] - 'a'].insert(i);
long long ans = 1;
int prev_pos;
for (int i = 0; i < t.size(); ++i) ... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
vector<set<int>> pos(26);
for (int i = 0; i < s.size(); ++i)
pos[s[i] - 'a'].insert(i);
long long ans = 1;
int prev_pos;
for (int i = 0; i < t.size(); ++i) ... | [
"call.function.change"
] | 740,334 | 740,335 | u725661271 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 998244353;
vector<int> k[26];
signed main() {
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
k[s[i] - 'a'].push_back(i);
}
int ans1 = 0, ans2 = 0, ok, ng, mid;
for (int i = 0; i < t.size(); i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 998244353;
vector<int> k[26];
signed main() {
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
k[s[i] - 'a'].push_back(i);
}
int ans1 = 0, ans2 = -1, ok, ng, mid;
for (int i = 0; i < t.size(); i++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,341 | 740,342 | u651317892 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 740,356 | 740,357 | u598755311 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 740,358 | 740,357 | u598755311 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
string s, t;
cin >> s >> t;
int n = s.length(), m = t.length();
vector<vector<int>> nxt(n, vector<int>(26, -1));
nxt[n - 1][s[n - 1] - 'a'] = n - 1;
for (int i = n - 2; i >= 0; --i) {
nxt[i] = nxt[i + 1];
nxt[i][s... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
string s, t;
cin >> s >> t;
int n = s.length(), m = t.length();
vector<vector<int>> nxt(n, vector<int>(26, -1));
nxt[n - 1][s[n - 1] - 'a'] = n - 1;
for (int i = n - 2; i >= 0; --i) {
nxt[i] = nxt[i + 1];
nxt[i][s... | [
"expression.operation.binary.remove",
"assignment.change"
] | 740,369 | 740,370 | u342757721 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll ans = 0;
int n = s.size();
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll ans = 0;
int n = s.size();
int ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 740,385 | 740,386 | u656572785 | cpp |
p02937 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define input(arr, n) ... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define input(arr, n) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,391 | 740,392 | u181228520 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
vector<int> pos[26];
int main() {
#if DEBUG
freopen("in.txt", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i < s1.size(); ++i)
pos[s1[i] - 'a'].push_back(i... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
vector<int> pos[26];
int main() {
#if DEBUG
freopen("in.txt", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i < s1.size(); ++i)
pos[s1[i] - 'a'].push_back(i... | [
"assignment.change"
] | 740,393 | 740,394 | u277427445 | cpp |
p02937 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll i, p, ans;
string s, t;
int main() {
cin >> s >> t;
map<char, vector<ll>> a;
for (; i < s.size(); i++)
a[s[i]].push_back(i + 1);
for (auto &i : t) {
if (!a[i].size())
... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll i, p, ans;
string s, t;
int main() {
cin >> s >> t;
map<char, vector<ll>> a;
for (; i < s.size(); i++)
a[s[i]].push_back(i + 1);
for (auto &i : t) {
if (!a[i].size())
... | [
"identifier.change",
"call.function.change"
] | 740,401 | 740,402 | u952593352 | cpp |
p02937 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll i, p, ans;
string s, t;
int main() {
cin >> s >> t;
map<char, vector<ll>> a;
for (; i < s.size(); i++)
a[s[i]].push_back(i + 1);
for (i : t) {
if (!a[i].size())
... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll i, p, ans;
string s, t;
int main() {
cin >> s >> t;
map<char, vector<ll>> a;
for (; i < s.size(); i++)
a[s[i]].push_back(i + 1);
for (auto &i : t) {
if (!a[i].size())
... | [
"identifier.change",
"call.function.change"
] | 740,403 | 740,402 | u952593352 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define pb push_back
#define sz size
#define xx first
#define yy second
#define all(x) begin(x), end(x)
#define FOR(i, start, end) for (ll i = start; i < end; ++i)
#define FORD(i, start, end) for (ll i = end - 1; i >= start; --... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define pb push_back
#define sz size
#define xx first
#define yy second
#define all(x) begin(x), end(x)
#define FOR(i, start, end) for (ll i = start; i < end; ++i)
#define FORD(i, start, end) for (ll i = end - 1; i >= start; --... | [
"assignment.change"
] | 740,404 | 740,405 | u511954806 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define TR(X) \
({ ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define TR(X) \
({ ... | [
"identifier.change",
"call.function.change"
] | 740,410 | 740,411 | u882935040 | cpp |
p02937 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,414 | 740,415 | u017271745 | cpp |
p02937 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 740,416 | 740,415 | u017271745 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
int back[100000][26];
int main() {
string s, t;
cin >> s >> t;
int sl = s.length();
int t... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
int back[100000][26];
int main() {
string s, t;
cin >> s >> t;
int sl = s.length();
int t... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,419 | 740,420 | u976817999 | cpp |
p02937 | // warm heart, wagging tail,and a smile just for you!
//
// โโโโโโโโ
// โโโโโโโโโโโ
// โโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโ... | // warm heart, wagging tail,and a smile just for you!
//
// โโโโโโโโ
// โโโโโโโโโโโ
// โโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโ... | [
"expression.operation.binary.remove"
] | 740,428 | 740,429 | u239493918 | cpp |
p02937 | // Author: Vamsi Krishna Reddy Satti
// With love for Competitive Programming!
#include <bits/stdc++.h>
using namespace std;
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); ... | // Author: Vamsi Krishna Reddy Satti
// With love for Competitive Programming!
#include <bits/stdc++.h>
using namespace std;
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); ... | [
"literal.number.change",
"assignment.value.change"
] | 740,437 | 740,438 | u060072952 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#incl... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,443 | 740,444 | u468440945 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define initdp(a, b) \
for (int i = 0; i <= a; i++) ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define initdp(a, b) \
for (int i = 0; i <= a; i++) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,445 | 740,446 | u133630059 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
long long ans;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s;
cin >> t;
int ssize = s.size(), tsize = t.size();
vector<set<int>> A(26);
for (int i = 0; i < ssize; i++) {
A[s[i] - 'a'].insert(i);
}
vector<int> N(tsi... | #include <bits/stdc++.h>
using namespace std;
long long ans;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s;
cin >> t;
int ssize = s.size(), tsize = t.size();
vector<vector<int>> A(26);
for (int i = 0; i < ssize; i++) {
A[s[i] - 'a'].push_back(i);
}
vector<int>... | [
"call.function.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,449 | 740,448 | u572532976 | cpp |
p02937 | #include <bits/stdc++.h>
#define N (200005)
#define int long long
#define debug(x) cerr << #x << " : " << x << endl
#define CM cerr << (&MOP2 - &MOP1) / 1024.0 / 1024.0 << endl
using namespace std;
template <class T> inline T Min(T x, T y) { return x < y ? x : y; }
template <class T> inline T Max(T x, T y) { return x >... | #include <bits/stdc++.h>
#define N (200005)
#define int long long
#define debug(x) cerr << #x << " : " << x << endl
#define CM cerr << (&MOP2 - &MOP1) / 1024.0 / 1024.0 << endl
using namespace std;
template <class T> inline T Min(T x, T y) { return x < y ? x : y; }
template <class T> inline T Max(T x, T y) { return x >... | [
"expression.operation.binary.remove"
] | 740,452 | 740,453 | u392797842 | cpp |
p02937 | #include <bits/stdc++.h>
#define N (200005)
#define int long long
#define debug(x) cerr << #x << " : " << x << endl
#define CM cerr << (&MOP2 - &MOP1) / 1024.0 / 1024.0 << endl
using namespace std;
template <class T> inline T Min(T x, T y) { return x < y ? x : y; }
template <class T> inline T Max(T x, T y) { return x >... | #include <bits/stdc++.h>
#define N (200005)
#define int long long
#define debug(x) cerr << #x << " : " << x << endl
#define CM cerr << (&MOP2 - &MOP1) / 1024.0 / 1024.0 << endl
using namespace std;
template <class T> inline T Min(T x, T y) { return x < y ? x : y; }
template <class T> inline T Max(T x, T y) { return x >... | [
"assignment.change",
"expression.operation.binary.remove"
] | 740,454 | 740,453 | u392797842 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
int n = s.size(), m = t.size();
int now = 0;
ll ans = 0;
vector<vector<int>> v(26);
bool used[26] = {};
for (int i = 0; i < n; i++) {
used[s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
int n = s.size(), m = t.size();
int now = -2;
ll ans = 0;
vector<vector<int>> v(26);
bool used[26] = {};
for (int i = 0; i < n; i++) {
used[s... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,469 | 740,470 | u676029460 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ran 101101
char s[ran], t[ran];
vector<int> v[33];
int main() {
scanf("%s%s", s, t);
int ls = strlen(s);
int lt = strlen(t);
for (int i = 0; i < ls; i++)
v[s[i] - 'a'].push_back(i);
int cur = 0, cycle = 0;
for (int i = 0; i < lt; i++) {
int i... | #include <bits/stdc++.h>
using namespace std;
#define ran 101101
char s[ran], t[ran];
vector<int> v[33];
int main() {
scanf("%s%s", s, t);
int ls = strlen(s);
int lt = strlen(t);
for (int i = 0; i < ls; i++)
v[s[i] - 'a'].push_back(i);
int cur = -1, cycle = 0;
for (int i = 0; i < lt; i++) {
int ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,475 | 740,476 | u534772498 | cpp |
p02937 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define LL long long
string s, t;
LL pos, cnt;
int main() {
cin >> s >> t;
for (int i = 0; i <= t.length(); i++) {
pos = s.find(t[i], pos);
if (pos == -1) {
pos = s.find(t[i], 0);
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define LL long long
string s, t;
LL pos, cnt;
int main() {
cin >> s >> t;
for (int i = 0; i < t.length(); i++) {
pos = s.find(t[i], pos);
if (pos == -1) {
pos = s.find(t[i], 0);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change"
] | 740,477 | 740,478 | u520815352 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.