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 | //============================================================================
// Name : e.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <algorit... | //============================================================================
// Name : e.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <algorit... | [
"expression.operation.binary.remove"
] | 739,522 | 739,523 | u342703951 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
... | [
"assignment.add"
] | 739,526 | 739,527 | u455067221 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_... | [
"assignment.change"
] | 739,530 | 739,531 | u160429264 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = s.size();
map<char, vector<l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = s.size();
map<char, vector<l... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,536 | 739,537 | u482770395 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
int n = s.size();
map<char, vector<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = s.size();
map<char, vector<l... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,538 | 739,537 | u482770395 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
map<char, vector<ll>> mp;
int n = s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
map<char, vector<ll>> mp;
int n = s... | [
"identifier.change",
"call.function.change"
] | 739,539 | 739,540 | u482770395 | cpp |
p02937 | #include <bits/stdc++.h>
#include <math.h>
#include <regex>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
int main() {
string s, t;
cin >> s >> t;
... | #include <bits/stdc++.h>
#include <math.h>
#include <regex>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
int main() {
string s, t;
cin >> s >> t;
... | [
"expression.operation.binary.remove"
] | 739,543 | 739,544 | u628597699 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 5;
string s, t;
int n, m;
bool ha[maxn];
ll ans = 0;
map<char, vector<int... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 5;
string s, t;
int n, m;
bool ha[maxn];
ll ans = 0;
map<char, vector<int... | [
"identifier.change",
"call.function.change",
"assignment.value.change"
] | 739,555 | 739,556 | u774417629 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
vector<int> pos[26];
int n = t.length(), m = s.length();
for (int i = 0; i < m; i++) {
pos[s[i] - 'a'].push_back(i);
}
long long ans = 0;
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
vector<int> pos[26];
int n = t.length(), m = s.length();
for (int i = 0; i < m; i++) {
pos[s[i] - 'a'].push_back(i);
}
long long ans = 0;
for (int i = 0; i < n... | [
"assignment.change"
] | 739,561 | 739,562 | u370709193 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
vector<int> pos[26];
int n = t.length(), m = s.length();
for (int i = 0; i < m; i++) {
pos[s[i] - 'a'].push_back(i);
}
int ans = 0;
for (int i = 0; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
vector<int> pos[26];
int n = t.length(), m = s.length();
for (int i = 0; i < m; i++) {
pos[s[i] - 'a'].push_back(i);
}
long long ans = 0;
for (int i = 0; i < n... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 739,563 | 739,562 | u370709193 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <un... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <un... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,575 | 739,576 | u293523151 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> ord(26);
int sl = s.length();
int tl = t.length(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> ord(26);
int sl = s.length();
int tl = t.length(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,577 | 739,578 | u437779154 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
// typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
//#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
// typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
//#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
retur... | [
"assignment.change"
] | 739,583 | 739,584 | u541784678 | cpp |
p02937 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 739,587 | 739,588 | u644778646 | cpp |
p02937 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,589 | 739,588 | u644778646 | cpp |
p02937 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,589 | 739,590 | u644778646 | cpp |
p02937 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,589 | 739,591 | u644778646 | 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(void) {
string s;
string t;
cin >> s;
cin >> t;
map<char, vector<int>> mp;
rep(i, s.size()) {
mp[s[i]].push_back(i);
mp[s[i]].push_back(i + s.size());
}
for (char i = 'a'... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(void) {
string s;
string t;
cin >> s;
cin >> t;
map<char, vector<int>> mp;
rep(i, s.size()) {
mp[s[i]].push_back(i);
mp[s[i]].push_back(i + s.size());
}
for (char i = 'a'... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,592 | 739,593 | u247576416 | cpp |
p02937 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [
"identifier.change",
"call.function.change"
] | 739,602 | 739,603 | u498141549 | cpp |
p02937 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 739,604 | 739,603 | u498141549 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | [
"identifier.change"
] | 739,607 | 739,608 | u530107518 | cpp |
p02937 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef long long ll;
typedef pair<ll, ll> P;
ll Abs(l... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef long long ll;
typedef pair<ll, ll> P;
ll Abs(l... | [
"identifier.change",
"call.function.change"
] | 739,609 | 739,610 | u744305661 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define show(x) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define show(x) \
{ ... | [
"call.function.change",
"control_flow.branch.if.condition.change"
] | 739,613 | 739,614 | u317715099 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/* 判定式を指定できるめぐる式二分探索 */
/* input: arr:行列、callback:判定方法の関数ポインタ、
* userQuery:判定に使用するための引数(省略可)*/
/* output: 条件を満たす要素の最小値(全て満たさなければ要素サイズを返す) */
/* 制約事項:
* 行列のある要素に対して判定方法callba... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/* 判定式を指定できるめぐる式二分探索 */
/* input: arr:行列、callback:判定方法の関数ポインタ、
* userQuery:判定に使用するための引数(省略可)*/
/* output: 条件を満たす要素の最小値(全て満たさなければ要素サイズを返す) */
/* 制約事項:
* 行列のある要素に対して判定方法callba... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,615 | 739,616 | u317715099 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/* 判定式を指定できるめぐる式二分探索 */
/* input: arr:行列、callback:判定方法の関数ポインタ、
* userQuery:判定に使用するための引数(省略可)*/
/* output: 条件を満たす要素の最小値(全て満たさなければ要素サイズを返す) */
/* 制約事項:
* 行列のある要素に対して判定方法callba... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/* 判定式を指定できるめぐる式二分探索 */
/* input: arr:行列、callback:判定方法の関数ポインタ、
* userQuery:判定に使用するための引数(省略可)*/
/* output: 条件を満たす要素の最小値(全て満たさなければ要素サイズを返す) */
/* 制約事項:
* 行列のある要素に対して判定方法callba... | [
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,617 | 739,616 | u317715099 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr ll INF = (1LL << 55);
int main() {
string s, t;
cin >> s >> t;
int n = sz(s);
vector<set<int>> st(26);
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr ll INF = (1LL << 55);
int main() {
string s, t;
cin >> s >> t;
int n = sz(s);
vector<set<int>> st(26);
for (int i = 0; i < n; i++... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,618 | 739,619 | u108540384 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr ll INF = (1LL << 55);
int main() {
string s, t;
cin >> s >> t;
int n = sz(s);
vector<set<int>> st(26);
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr ll INF = (1LL << 55);
int main() {
string s, t;
cin >> s >> t;
int n = sz(s);
vector<set<int>> st(26);
for (int i = 0; i < n; i++... | [
"literal.number.change",
"variable_declaration.value.change",
"call.function.change"
] | 739,620 | 739,619 | u108540384 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(s.size())
typedef long long ll;
//部分列判定 -> 場所i以降で文字Cが最初に現れる位置を保存しておく
//各文字が文字列のどの位置にあるかのリストを作る
int main() {
string s, t;
cin >> s >> t;
int n = sz(s), m = sz(t);
vector<vector<int>> is(26);
rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
//部分列判定 -> 場所i以降で文字Cが最初に現れる位置を保存しておく
//各文字が文字列のどの位置にあるかのリストを作る
int main() {
string s, t;
cin >> s >> t;
int n = sz(s), m = sz(t);
vector<vector<int>> is(26);
rep(i, ... | [
"preprocessor.define.value.change"
] | 739,621 | 739,622 | u108540384 | cpp |
p02937 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (ll i = a; i <= b; i++)
#define FORD(i, a, b) for (ll i = a; i >= b; i--)
#define FORL(i, x) for (int i = head[x]; i; i = nxt[i])
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define EACH(i, c) ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (ll i = a; i <= b; i++)
#define FORD(i, a, b) for (ll i = a; i >= b; i--)
#define FORL(i, x) for (int i = head[x]; i; i = nxt[i])
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define EACH(i, c) ... | [
"assignment.change",
"expression.operation.binary.remove"
] | 739,629 | 739,630 | u054501336 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int n = S.size(), m = T.size();
vector<vector<int>> D(2 * n + 1, vector<int>(26, n + 1));
string U = S + S;
for (int i = 2 * n; i > 0; i--) {
for (int j = 0; j < 26; j++)
D[i - 1][j] = D[i][j] + 1;
int k =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int n = S.size(), m = T.size();
vector<vector<int>> D(2 * n + 1, vector<int>(26, n + 1));
string U = S + S;
for (int i = 2 * n; i > 0; i--) {
for (int j = 0; j < 26; j++)
D[i - 1][j] = D[i][j] + 1;
int k =... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,631 | 739,632 | u268793453 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
vector<vector<int>> nextidx(const string &s) {
int n = s.size();
vector<vector<int>> ret(n + 1, vector<int>(26, n));
for (int i = n - 1; i >= 0; --i) {
for (int j = 0; j < 26; ++j)
... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
vector<vector<int>> nextidx(const string &s) {
int n = s.size();
vector<vector<int>> ret(n + 1, vector<int>(26, n));
for (int i = n - 1; i >= 0; --i) {
for (int j = 0; j < 26; ++j)
... | [
"variable_declaration.type.change",
"assignment.change",
"expression.operation.binary.remove"
] | 739,635 | 739,636 | u756088996 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 739,637 | 739,638 | u414947284 | cpp |
p02937 | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
... | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"expression.operation.binary.change"
] | 739,643 | 739,642 | u934272719 | cpp |
p02937 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define ln '\n'
const long long MOD = 1000000007LL;
// const long long MOD = 998244353LL;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<i... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define ln '\n'
const long long MOD = 1000000007LL;
// const long long MOD = 998244353LL;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,651 | 739,652 | u842939260 | cpp |
p02937 | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | [
"assignment.change",
"expression.operation.binary.remove"
] | 739,656 | 739,657 | u150376070 | cpp |
p02937 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <list>
#include <map> //m... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <list>
#include <map> //m... | [
"expression.unary.arithmetic.add"
] | 739,660 | 739,661 | u341406884 | cpp |
p02937 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <list>
#include <map> //m... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <list>
#include <map> //m... | [
"variable_declaration.type.change",
"expression.unary.arithmetic.add"
] | 739,662 | 739,661 | u341406884 | cpp |
p02937 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <list>
#include <map> //m... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <list>
#include <map> //m... | [
"variable_declaration.type.change",
"expression.unary.arithmetic.add"
] | 739,663 | 739,661 | u341406884 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CONST = 1000000007;
const int BIG_INT = 1000000000;
int main() {
string s, t;
cin >> s >... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CONST = 1000000007;
const int BIG_INT = 1000000000;
int main() {
string s, t;
cin >> s >... | [
"identifier.change",
"call.function.change"
] | 739,666 | 739,667 | u156778176 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | [
"assignment.change"
] | 739,668 | 739,669 | u824327013 | 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;
vector<vector<int>> pos(26);
for (int i = 0; i < (int)S.size(); i++) {
pos[S[i] - 'a'].emplace_back(i);
}
int res = 0, p = 0;
for (int i = 0; i < (int)T.size(); i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S, T;
cin >> S >> T;
vector<vector<int>> pos(26);
for (int i = 0; i < (int)S.size(); i++) {
pos[S[i] - 'a'].emplace_back(i);
}
int res = 0, p = -1;
for (int i = 0; i < (int)T.size(); i++) {... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,670 | 739,671 | u782098901 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
string S, T;
vector<vector<int64_t>> inS(26);
int64_t solve(char ch, int64_t p) {
int c = ch - 'a';
if (inS[c].empty())
return -p;
p %= S.length();
int res = lower_bound(inS[c].begin(), inS[c].end(), p) - inS[c].begin();
return inS[c][res] - p;
}
int main(... | #include <bits/stdc++.h>
using namespace std;
string S, T;
vector<vector<int64_t>> inS(26);
int64_t solve(char ch, int64_t p) {
int c = ch - 'a';
if (inS[c].empty())
return -p;
p %= S.length();
int res = lower_bound(inS[c].begin(), inS[c].end(), p) - inS[c].begin();
return inS[c][res] + 1 - p;
}
int m... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change"
] | 739,687 | 739,688 | u285358283 | cpp |
p02937 | //他者回答参考
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define per(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair... | //他者回答参考
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define per(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair... | [
"assignment.change",
"expression.operation.binary.remove"
] | 739,691 | 739,692 | u877847737 | cpp |
p02937 | #pragma region
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rre... | #pragma region
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rre... | [
"control_flow.branch.if.condition.change"
] | 739,697 | 739,698 | u908318580 | cpp |
p02937 | #pragma region
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rre... | #pragma region
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rre... | [
"assignment.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,699 | 739,700 | u908318580 | cpp |
p02937 | #pragma region
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rre... | #pragma region
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rre... | [
"assignment.change",
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,701 | 739,700 | u908318580 | cpp |
p02937 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,713 | 739,714 | u136342563 | cpp |
p02937 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,715 | 739,714 | u136342563 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, a, b) for (int i = a; i < (b); ++i)
#define reprev(i, n) for (int i = n - 1; i >= 0; --i)
#define reprrev(i, a, b) for (int i = b - 1; i >= (a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, a, b) for (int i = a; i < (b); ++i)
#define reprev(i, n) for (int i = n - 1; i >= 0; --i)
#define reprrev(i, a, b) for (int i = b - 1; i >= (a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 739,716 | 739,717 | u495903598 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(... | [
"assignment.change"
] | 739,720 | 739,721 | u697090185 | cpp |
p02937 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T> &v, bool is_reverse = false, ll num = 0) {
if (num == 0)
num = (ll)v.size();
cout << endl;
cout << "i= ";
for (ll i = 0; i < num; i++)
cout << i << " ";
cout << endl;
cout << ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T> &v, bool is_reverse = false, ll num = 0) {
if (num == 0)
num = (ll)v.size();
cout << endl;
cout << "i= ";
for (ll i = 0; i < num; i++)
cout << i << " ";
cout << endl;
cout << ... | [
"assignment.change"
] | 739,724 | 739,725 | u153607901 | cpp |
p02937 | #include <bits/stdc++.h>
#include <ctime>
#include <iostream>
using namespace std;
#define _LL long long
#define rep(i, n) for (_LL i = 0; i < (_LL)(n); i++)
#define vecrep(itr, v) for (auto itr = (v).begin(); itr != (v).end(); itr++)
int main() {
string s, t;
cin >> s >> t;
vector<_LL> index[26];
_LL slen = s... | #include <bits/stdc++.h>
#include <ctime>
#include <iostream>
using namespace std;
#define _LL long long
#define rep(i, n) for (_LL i = 0; i < (_LL)(n); i++)
#define vecrep(itr, v) for (auto itr = (v).begin(); itr != (v).end(); itr++)
int main() {
string s, t;
cin >> s >> t;
vector<_LL> index[26];
_LL slen = s... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,726 | 739,727 | u131663893 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
const ll M = 1e9 + 7;
int main(void) {
string s, t;
ll ans = 0, cur = 0, n, m, x;
bool ok = true;
cin >> s >> t;
n = s.length(), m = t.length();
vector<set<int>> vs(26);
rep(i, 26) vs[i].in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
const ll M = 1e9 + 7;
int main(void) {
string s, t;
ll ans = 0, cur = 0, n, m, x;
bool ok = true;
cin >> s >> t;
n = s.length(), m = t.length();
vector<set<int>> vs(26);
rep(i, 26) vs[i].in... | [
"assignment.value.change",
"call.function.change",
"expression.operation.binary.remove"
] | 739,736 | 739,737 | u767543103 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
// cout << fixed << setprecision(10) << flush;
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
s[i] -= 'a';
}
for (int j = 0; j < t.size(); j++) {
t[j] -= 'a';
}
// last['d'-'a'][i] は i 文字目より真に... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
// cout << fixed << setprecision(10) << flush;
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
s[i] -= 'a';
}
for (int j = 0; j < t.size(); j++) {
t[j] -= 'a';
}
// last['d'-'a'][i] は i 文字目より真に... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,738 | 739,739 | u658401995 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ll int
typedef pair<ll, ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define f first
#define s second
#define FOR(i, s, e) for (ll i = s; i <= ll(e); ++i)
#define DEC(i, s, e) for (ll i = s; i >= ll(e); --i)
#define pb push_back
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ll int
typedef pair<ll, ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define f first
#define s second
#define FOR(i, s, e) for (ll i = s; i <= ll(e); ++i)
#define DEC(i, s, e) for (ll i = s; i >= ll(e); --i)
#define pb push_back
#def... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,740 | 739,741 | u801120804 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ll int
typedef pair<ll, ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define f first
#define s second
#define FOR(i, s, e) for (ll i = s; i <= ll(e); ++i)
#define DEC(i, s, e) for (ll i = s; i >= ll(e); --i)
#define pb push_back
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ll int
typedef pair<ll, ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define f first
#define s second
#define FOR(i, s, e) for (ll i = s; i <= ll(e); ++i)
#define DEC(i, s, e) for (ll i = s; i >= ll(e); --i)
#define pb push_back
#def... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 739,742 | 739,741 | u801120804 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typ... | [
"variable_declaration.value.change"
] | 739,743 | 739,744 | u968778920 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
vector<vector<int>> v(26);
for (int i = 0; i < s.size(); ++i)
v.at(s.at(i) - 'a').emplace_back(i);
for (int i = 0; i < s.size(); ++i)
v.at(s.at(i) - 'a').emplace_back(i + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
vector<vector<int>> v(26);
for (int i = 0; i < s.size(); ++i)
v.at(s.at(i) - 'a').emplace_back(i);
for (int i = 0; i < s.size(); ++i)
v.at(s.at(i) - 'a').emplace_back(i + ... | [
"assignment.change",
"call.add"
] | 739,752 | 739,753 | u104613587 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(pos, mp) for (ll pos = mp.begin(); pos != mp.end(); pos - ++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int I... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(pos, mp) for (ll pos = mp.begin(); pos != mp.end(); pos - ++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int I... | [
"expression.operation.unary.arithmetic.add"
] | 739,754 | 739,755 | u969116807 | 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;
int l;
cin >> s >> t;
l = s.size();
vector<vector<int>> al(26);
rep(i, 26) { al[i].push_back(-1); }
rep(i, l) { al[s[i] - 97].push_back(... | #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;
int l;
cin >> s >> t;
l = s.size();
vector<vector<int>> al(26);
rep(i, 26) { al[i].push_back(-1); }
rep(i, l) { al[s[i] - 97].push_back(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,760 | 739,761 | u992471673 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template <class S> S sum(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template <class S> S sum(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { re... | [
"call.arguments.change",
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,773 | 739,774 | u466335531 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template <class S> S sum(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template <class S> S sum(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { re... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,775 | 739,774 | u466335531 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.... | [
"call.add"
] | 739,776 | 739,777 | u617826263 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.... | [
"identifier.replace.add",
"literal.replace.remove",
"call.add"
] | 739,778 | 739,777 | u617826263 | cpp |
p02937 | #include <iostream>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
bool pass = true, over = false;
long long ans = 0;
int alp[26][s.size()], now = -1;
for (int i = s.size() - 1; i >= 0; i--) {
if (i == s.size() - 1) {
for (int j = 0; j < 26; j++) {
alp[j][i] = -1;
}
... | #include <iostream>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
bool pass = true, over = false;
long long ans = 0;
int alp[26][s.size()], now = -1;
for (int i = s.size() - 1; i >= 0; i--) {
if (i == s.size() - 1) {
for (int j = 0; j < 26; j++) {
alp[j][i] = -1;
}
... | [
"assignment.value.change"
] | 739,779 | 739,780 | u353919145 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<pair<int, int>> vii;
const int INF = 0x3f3f3f3f;
const int T = 1e5 + 3;
const int N = 27;
int v[T][N];
str... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<pair<int, int>> vii;
const int INF = 0x3f3f3f3f;
const int T = 1e5 + 3;
const int N = 27;
int v[T][N];
str... | [
"expression.operation.unary.arithmetic.add"
] | 739,783 | 739,784 | u353919145 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pull = pair<ull, ll>;
using pis = pair<int, string>;
#define all(x) (x).begin(), (x).end()
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pull = pair<ull, ll>;
using pis = pair<int, string>;
#define all(x) (x).begin(), (x).end()
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 739,785 | 739,786 | u499966353 | cpp |
p02937 | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, w) for (int i = 0; i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1e9;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> G(26);
s = s + s;
int ch;
rep(i... | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, w) for (int i = 0; i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1e9;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> G(26);
s = s + s;
int ch;
rep(i... | [
"identifier.change",
"call.function.change"
] | 739,789 | 739,790 | u563170985 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
int sn = s.length();
int tn = t.length();
map<char, int> m;
vector<vector<int>> v(26);
for (int i = 0; i < sn; i++) {
auto itr = m.find(s[i]);
if (itr == m.end()) {
m[s[i]] = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
int sn = s.length();
int tn = t.length();
map<char, int> m;
vector<vector<int>> v(26);
for (int i = 0; i < sn; i++) {
auto itr = m.find(s[i]);
if (itr == m.end()) {
m[s[i]] = 1;
... | [
"identifier.change",
"call.function.change"
] | 739,791 | 739,792 | u457483230 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1000000007;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> A(26);
rep(i, s.size())... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1000000007;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> A(26);
rep(i, s.size())... | [
"expression.unary.arithmetic.add"
] | 739,803 | 739,804 | u896137920 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int N = S.size(), M = T.size();
S += S;
map<char, vector<int>> mp;
for (int i = 0; i < 2 * N; ++i)
mp[S[i]].push_back(i);
int64_t ans = -1;
for (auto &c : T) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int N = S.size(), M = T.size();
S += S;
map<char, vector<int>> mp;
for (int i = 0; i < 2 * N; ++i)
mp[S[i]].push_back(i);
int64_t ans = -1;
for (auto &c : T) {
... | [
"identifier.change",
"call.function.change"
] | 739,809 | 739,810 | u756388720 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
string T;
cin >> S >> T;
vector<vector<int>> A(26);
for (int i = 0; i < S.size(); i++)
A[S[i] - 'a'].push_back(i);
int ans = 0, n = 0;
for (int i = 0; i < T.size(); i++) {
if (A[T[i] - 'a'].size() == 0) {
puts("-1");
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
string T;
cin >> S >> T;
vector<vector<int>> A(26);
for (int i = 0; i < S.size(); i++)
A[S[i] - 'a'].push_back(i);
int ans = 0, n = -1;
for (int i = 0; i < T.size(); i++) {
if (A[T[i] - 'a'].size() == 0) {
puts("-1");
... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,820 | 739,821 | u306482197 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e16 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
vector<int> cnt[26];
signed main() {
string S, T;
cin >> S >> T;
for (int i = 0; i < S.size(); i++) {
cnt[S[i] - 'a'].push_... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e16 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
vector<int> cnt[26];
signed main() {
string S, T;
cin >> S >> T;
for (int i = 0; i < S.size(); i++) {
cnt[S[i] - 'a'].push_... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,822 | 739,823 | u237390401 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
string s, t;
cin >> s >> t;
lint N = s.size(), M = t.size();
vector<lint> cs(26, 0), ct(26, 0);
vector<vector<lint>> alp(26);
for (lint i = 0; i < N; i++) {
cs[s[i] - 'a']++;
alp[s[i] - 'a'].push_back(i + 1);
}
... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
string s, t;
cin >> s >> t;
lint N = s.size(), M = t.size();
vector<lint> cs(26, 0), ct(26, 0);
vector<vector<lint>> alp(26);
for (lint i = 0; i < N; i++) {
cs[s[i] - 'a']++;
alp[s[i] - 'a'].push_back(i + 1);
}
... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,826 | 739,827 | u265359795 | cpp |
p02937 | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v)... | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v)... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,837 | 739,838 | u619683748 | cpp |
p02937 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
long long n = s.size();
long long m = t.size();
vector<vector<long long>> index(30);
for (long long i = 0; i < 30; i++)
index[s[i] - 'a'].push_back(i + 1)... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
long long n = s.size();
long long m = t.size();
vector<vector<long long>> index(30);
for (long long i = 0; i < n; i++)
index[s[i] - 'a'].push_back(i + 1);... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 739,839 | 739,840 | u418879326 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
vector<ll> ch[27];
int main() {
string s, t;
cin >> s >> t;
for (ll i = 0; i < s.size(); i++) {
ll now = s[i] - 'a';
ch[now].push_back(i + 1);
}
for (ll i = 0; i < 26; i++) {
ch[i].pus... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
vector<ll> ch[27];
int main() {
string s, t;
cin >> s >> t;
for (ll i = 0; i < s.size(); i++) {
ll now = s[i] - 'a';
ch[now].push_back(i + 1);
}
for (ll i = 0; i < 26; i++) {
ch[i].pus... | [
"identifier.change",
"call.function.change"
] | 739,845 | 739,846 | u166378830 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> l(26);
for (int i = 0; i < (int)s.size(); i++) {
l[s[i] - 'a'].push_back(i + 1);
}
ll ans = 0;
ll cnt = 0;
bool ok = true;
for (int i = 0; i < (int)t.size(); i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> l(26);
for (int i = 0; i < (int)s.size(); i++) {
l[s[i] - 'a'].push_back(i + 1);
}
ll ans = 0;
ll cnt = 0;
bool ok = true;
for (int i = 0; i < (int)t.size(); i++) {
... | [
"assignment.change"
] | 739,849 | 739,850 | u515131769 | cpp |
p02937 | //
// Created by Koki Igarashi on 7/28/20.
//
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<pii, Int> ppi;
typedef... | //
// Created by Koki Igarashi on 7/28/20.
//
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<pii, Int> ppi;
typedef... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,851 | 739,852 | u414444658 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
string S;
cin >> S;
string T;
cin >> T;
ll len = S.size();
vector<vector<ll>> vec(26... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
string S;
cin >> S;
string T;
cin >> T;
ll len = S.size();
vector<vector<ll>> vec(26... | [
"identifier.change",
"call.function.change"
] | 739,853 | 739,854 | u356539385 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll = vector<ll>;
using vvll = vector<vll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
using plli = pair<ll, int>;
using vplli = vector<pair<l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll = vector<ll>;
using vvll = vector<vll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
using plli = pair<ll, int>;
using vplli = vector<pair<l... | [
"expression.operation.binary.remove",
"assignment.change"
] | 739,855 | 739,856 | u410506856 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> p;
typedef unsign... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> p;
typedef unsign... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,863 | 739,864 | u765815947 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> p;
typedef unsign... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> p;
typedef unsign... | [
"assignment.change"
] | 739,865 | 739,864 | u765815947 | cpp |
p02937 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
int main() {
string S, T;
cin >> S >> T;
string S2 = S + S;
long long ans = -1;
for (int n = 0; n < T.size(); ++n) {
string S3 = S2.substr(1 + ans % S.size());
int anstmp = S3.find(... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
int main() {
string S, T;
cin >> S >> T;
string S2 = S + S;
long long ans = -1;
for (int n = 0; n < T.size(); ++n) {
string S3 = S2.substr((1 + ans) % S.size());
int anstmp = S3.fin... | [
"call.arguments.change"
] | 739,866 | 739,867 | u835523614 | cpp |
p02937 | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 739,868 | 739,869 | u818349438 | cpp |
p02937 | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | [
"call.function.change"
] | 739,870 | 739,871 | u167931717 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF... | [
"assignment.change"
] | 739,872 | 739,873 | u259039862 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_... | [
"call.arguments.change"
] | 739,878 | 739,879 | u595289165 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s, t;
cin >> s >> t;
vector<vector<long long>> count(26);
for (long long i = 0; i < s.size(); i++) {
count[s[i] - 'a'].push_back(i);
}
long long mem = -1;
long long ans = 1;
for (long long i = 0; i < t.size(); i++) {
if (cou... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s, t;
cin >> s >> t;
vector<vector<long long>> count(26);
for (long long i = 0; i < s.size(); i++) {
count[s[i] - 'a'].push_back(i);
}
long long mem = -1;
long long ans = 0;
for (long long i = 0; i < t.size(); i++) {
if (cou... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,882 | 739,883 | u194393111 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define boost \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define int long long
#define ff first
#define ss second
#define pi pair<int, int>
int32_t m... | #include <bits/stdc++.h>
using namespace std;
#define boost \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define int long long
#define ff first
#define ss second
#define pi pair<int, int>
int32_t m... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,885 | 739,886 | u371555975 | 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 >> t;
map<char, set<int>> mp;
vector<vector<int>> v;
rep(i, s.size()) { v[s[i] - 'a'].push_back(i); }
int id = -1;
ll ans = 0;
rep(i, t.size()) {
in... | #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 >> t;
map<char, set<int>> mp;
vector<vector<int>> v(26);
rep(i, s.size()) { v[s[i] - 'a'].push_back(i); }
int id = -1;
ll ans = 0;
rep(i, t.size()) {
... | [
"call.arguments.add"
] | 739,891 | 739,892 | u489302942 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, n) for (ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, n) for (ll ... | [
"identifier.change",
"call.function.change"
] | 739,893 | 739,894 | u050087249 | cpp |
p02937 | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for (ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(), (a).end()
#... | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for (ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(), (a).end()
#... | [
"identifier.change"
] | 739,899 | 739,900 | u264265458 | cpp |
p02937 | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 739,907 | 739,908 | u714724786 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
string s, t;
cin >> s >> t;
vector<vector<ll>> a(26, vector... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
string s, t;
cin >> s >> t;
vector<vector<ll>> a(26, vector... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,911 | 739,912 | u755121033 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#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 <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,913 | 739,914 | u673211643 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,919 | 739,920 | u628332144 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,921 | 739,920 | u628332144 | cpp |
p02937 | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define PI 3.14... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define PI 3.14... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,930 | 739,931 | u866535689 | cpp |
p02937 | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = v... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = v... | [
"assignment.change"
] | 739,934 | 739,935 | u366381207 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.