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 <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define FORN(i, m, n) for (int i = m; i < (n); i++)
#define PRINT... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define FORN(i, m, n) for (int i = m; i < (n); i++)
#define PRINT... | [] | 740,975 | 740,976 | u585776323 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int ... | [
"assignment.change"
] | 740,983 | 740,984 | u557275893 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int ... | [
"variable_declaration.type.change",
"assignment.change"
] | 740,985 | 740,984 | u557275893 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
void fail() { cout << "-1" << endl; }
int main() {
string dict, target;
cin >> dict >> target;
unordered_map<char, vector<size_t>> idxs;
for (size_t i = 0; i < dict.size(); ++i) {
idxs[dict[i]].push_back(i);
}
uint64_t cnt = 0;
size_t last_pos = 0;
... | #include <bits/stdc++.h>
using namespace std;
void fail() { cout << "-1" << endl; }
int main() {
string dict, target;
cin >> dict >> target;
unordered_map<char, vector<size_t>> idxs;
for (size_t i = 0; i < dict.size(); ++i) {
idxs[dict[i]].push_back(i + 1);
}
uint64_t cnt = 0;
size_t last_pos = 0... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 740,986 | 740,987 | u072825550 | cpp |
p02937 | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define sqr(a) (a) * (a)
#define M(a, b) make_pair(a, b)
#define T(a, b, c) make_pair(a, make_pair(b, c))
#define F first
#define S second
#define all(x) (x.begin(), x.end())
#define d... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define sqr(a) (a) * (a)
#define M(a, b) make_pair(a, b)
#define T(a, b, c) make_pair(a, make_pair(b, c))
#define F first
#define S second
#define all(x) (x.begin(), x.end())
#define d... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 740,992 | 740,993 | u101358413 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define reg register
#define M 200005
char s[M];
char t[M];
int n, m;
int Min[M][26];
LL Ans = 0;
int main() {
memset(Min, -1, sizeof(Min));
scanf("%s%s", s + 1, t + 1);
n = strlen(s + 1), m = strlen(t + 1);
for (int i = n + 1; i <= n * 2; ++i)
... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define reg register
#define M 200005
char s[M];
char t[M];
int n, m;
int Min[M][26];
LL Ans = 0;
int main() {
memset(Min, -1, sizeof(Min));
scanf("%s%s", s + 1, t + 1);
n = strlen(s + 1), m = strlen(t + 1);
for (int i = n + 1; i <= n * 2; ++i)
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 740,994 | 740,995 | u508834119 | cpp |
p02937 | #include <bits/stdc++.h>
#define prArr(Arr, n) \
for (int _ = 0; _ < n; _++) \
cout << (Arr)[_] << " ";
using namespace std;
const int INF = (int)1e9 + 10;
const int MOD = 998244353;
vector<vector<int>> idx(2... | #include <bits/stdc++.h>
#define prArr(Arr, n) \
for (int _ = 0; _ < n; _++) \
cout << (Arr)[_] << " ";
using namespace std;
const int INF = (int)1e9 + 10;
const int MOD = 998244353;
vector<vector<int>> idx(2... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,996 | 740,997 | u327682315 | cpp |
p02937 | #include <bits/stdc++.h>
#define prArr(Arr, n) \
for (int _ = 0; _ < n; _++) \
cout << (Arr)[_] << " ";
using namespace std;
const int INF = (int)1e9 + 10;
const int MOD = 998244353;
vector<vector<int>> idx(2... | #include <bits/stdc++.h>
#define prArr(Arr, n) \
for (int _ = 0; _ < n; _++) \
cout << (Arr)[_] << " ";
using namespace std;
const int INF = (int)1e9 + 10;
const int MOD = 998244353;
vector<vector<int>> idx(2... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change"
] | 740,998 | 740,997 | u327682315 | cpp |
p02937 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | [
"assignment.change"
] | 741,001 | 741,002 | u896838289 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | [
"identifier.replace.add",
"literal.replace.remove"
] | 741,005 | 741,006 | u366644013 | cpp |
p02937 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#define FAST \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#define FAST \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,007 | 741,008 | u198590292 | cpp |
p02937 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<unsigned long long> p[26];
for (int i = 0; i < s.size(); i++) {
p[s[i] - 'a'].push_back(i + 1);
}
unsigned long long ans = 0;
string t;
cin >> t;
for (auto &&... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<unsigned long long> p[26];
for (int i = 0; i < s.size(); i++) {
p[s[i] - 'a'].push_back(i + 1);
}
unsigned long long ans = 0;
string t;
cin >> t;
for (auto &&... | [
"identifier.change",
"call.function.change",
"assignment.value.change"
] | 741,009 | 741,010 | u752074356 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> ms(26);
for (int i = 0; i < s.size(); ++i) {
ms[s[i] - 'a'].emplace_back(i);
}
int ind = 0;
long long ans = 0;
int sind = -1;
while (ind < t.size()) {
sind = -1;
while (ind < t.size... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> ms(26);
for (int i = 0; i < s.size(); ++i) {
ms[s[i] - 'a'].emplace_back(i);
}
int ind = 0;
long long ans = 0;
long long sind = -1;
while (ind < t.size()) {
sind = -1;
while (ind < ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 741,017 | 741,018 | u604693716 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
template <class T> void show_2d_vector(const vector<ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
template <class T> void show_2d_vector(const vector<ve... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,021 | 741,022 | u677421794 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
const long INF = 1000000000000000;
void bfs(long p, vector<vector<long>> &edge, vector<long> &cost,
vector<long> &ans) {
for (int i = 0; i < edge.at(p).size(); i++) {
if (ans.at(edge.at(p).at(i)) == -1) {
ans.at(edge.at(p).at(i)) = ans.at(p) + cost.at(... | #include <bits/stdc++.h>
using namespace std;
const long INF = 1000000000000000;
void bfs(long p, vector<vector<long>> &edge, vector<long> &cost,
vector<long> &ans) {
for (int i = 0; i < edge.at(p).size(); i++) {
if (ans.at(edge.at(p).at(i)) == -1) {
ans.at(edge.at(p).at(i)) = ans.at(p) + cost.at(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,025 | 741,026 | u968365254 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
// Common DS shorteners
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T> using vec = vector<T>;
template <typename K, typename V> using mp = unordered_map<K, V>;
template <typename K> using u... | #include <bits/stdc++.h>
using namespace std;
// Common DS shorteners
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T> using vec = vector<T>;
template <typename K, typename V> using mp = unordered_map<K, V>;
template <typename K> using u... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 741,027 | 741,028 | u386030504 | cpp |
p02937 | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
std::string S, T;
int memS, memT;
std::vector<int> v[26];
int main() {
std::cin.tie(... | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
std::string S, T;
int memS, memT;
std::vector<int> v[26];
int main() {
std::cin.tie(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,029 | 741,030 | u764058295 | cpp |
p02937 | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
std::string S, T;
int memS, memT;
std::vector<int> v[26];
int main() {
std::cin.tie(... | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
std::string S, T;
int memS, memT;
std::vector<int> v[26];
int main() {
std::cin.tie(... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 741,031 | 741,030 | u764058295 | cpp |
p02937 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define Ms(s, n) memset(s, n, sizeof(s))
#define Rp(i, l, m) for (int i = l; i < m; ++i)
#define Rpd(i, l, m) for (int i = l; i >= m; --i)
#define Rpp(i, l, m) f... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define Ms(s, n) memset(s, n, sizeof(s))
#define Rp(i, l, m) for (int i = l; i < m; ++i)
#define Rpd(i, l, m) for (int i = l; i >= m; --i)
#define Rpp(i, l, m) f... | [] | 741,036 | 741,037 | u671291651 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define Endl endl
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define pll pair... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define Endl endl
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define pll pair... | [
"assignment.change",
"expression.operation.binary.remove"
] | 741,038 | 741,039 | u303964289 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <ty... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <ty... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.remove"
] | 741,045 | 741,046 | u745250049 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = uno... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = uno... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"assignment.change"
] | 741,047 | 741,048 | u136378781 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < (n); i++)
using namespace std;
unordered_m... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < (n); i++)
using namespace std;
unordered_m... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,051 | 741,052 | u995792346 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
string S, T;
vector<int> X[26];
typedef long long ll;
ll solve() {
ll q = 0, r = 0;
for (int i = 0; i < T.size(); ++i) {
int c = T[i] - 'a';
if (X[c].empty()) {
return -1;
}
int k = upper_bound(X[c].begin(), X[c].end(), r) - X[c].begin();
if ... | #include <bits/stdc++.h>
using namespace std;
string S, T;
vector<int> X[26];
typedef long long ll;
ll solve() {
ll q = 0, r = -1;
for (int i = 0; i < T.size(); ++i) {
int c = T[i] - 'a';
if (X[c].empty()) {
return -1;
}
int k = upper_bound(X[c].begin(), X[c].end(), r) - X[c].begin();
if... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,055 | 741,056 | u637938292 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
char A[100005], B[100005];
int a, b, n, ne[100005][30], Ne[30], now, H[30], an, Next;
long long ans;
int main() {
scanf("%s", A + 1);
scanf("%s", B + 1);
a = strlen(A + 1);
b = strlen(B + 1);
for (int i = 1; i <= a; i++)
H[A[i] - 'a'] = 1;
an = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
char A[100005], B[100005];
long long a, b, n, ne[100005][30], Ne[30], now, H[30], an, Next;
long long ans;
int main() {
scanf("%s", A + 1);
scanf("%s", B + 1);
a = strlen(A + 1);
b = strlen(B + 1);
for (int i = 1; i <= a; i++)
H[A[i] - 'a'] = 1;
an = 0;
fo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 741,061 | 741,062 | u867285555 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 10;
int a[26][N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s, t;
cin >> s >> t;
int slen = s.size();
for (int i = 1; i <= slen; ++i) {
int tmp = s[i - 1] - 'a';
a[tmp][++a[tmp][0]] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 10;
int a[26][N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s, t;
cin >> s >> t;
int slen = s.size();
for (int i = 1; i <= slen; ++i) {
int tmp = s[i - 1] - 'a';
a[tmp][++a[tmp][0]] ... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 741,065 | 741,066 | u049421539 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (in... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (in... | [
"assignment.change"
] | 741,067 | 741,068 | u554953477 | cpp |
p02937 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
void fin(int n) {
cout << n << endl;
exit(0);
}
// template
// main
signed main() {
string s, t;
cin >> s >> t;
int N = s.size(), M = t.siz... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
void fin(int n) {
cout << n << endl;
exit(0);
}
// template
// main
signed main() {
string s, t;
cin >> s >> t;
int N = s.size(), M = t.siz... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,069 | 741,070 | u942774736 | cpp |
p02937 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
void fin(int n) {
cout << n << endl;
exit(0);
}
// template
// main
signed main() {
string s, t;
cin >> s >> t;
int N = s.size(), M = t.siz... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
void fin(int n) {
cout << n << endl;
exit(0);
}
// template
// main
signed main() {
string s, t;
cin >> s >> t;
int N = s.size(), M = t.siz... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,071 | 741,070 | u942774736 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 741,072 | 741,073 | u915020369 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define str string
#define fi first
#define se second
#define pb push_back
#define SET(a, b) memset(a, b, sizeof(a))
#define eps 1e-6
#define pi atan(1) * 4
#define mod 1000000007
#define inf 1000000... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define str string
#define fi first
#define se second
#define pb push_back
#define SET(a, b) memset(a, b, sizeof(a))
#define eps 1e-6
#define pi atan(1) * 4
#define mod 1000000007
#define inf 1000000... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,078 | 741,079 | u603167288 | cpp |
p02937 | /*
░░░░░░░░░░░░░░░░▄▄█▀▀██▄▄░░░░░░░
░░░░░░░░░░░░░▄█▀▀░░░░░░░▀█░░░░░░
░░░░░░░░░░░▄▀░░░░░░░░░░░░░█░░░░░
░░░░░░░░░▄█░░░░░░░░░░░░░░░█░░░░░
░░░░░░░██▀░░░░░░░▄▄▄░░▄░█▄█▄░░░░
░░░░░▄▀░░░░░░░░░░████░█▄██░▀▄░░░
░░░░█▀░░░░░░░░▄▄██▀░░█████░██░░░
░░░█▀░░░░░░░░░▀█░▀█▀█▀▀▄██▄█▀░░░
░░░██░░░░░░░░░░█░░█░█░░▀▀▄█▀░░░░
░░░░█░░░░░█░░░▀█░░░░... | /*
░░░░░░░░░░░░░░░░▄▄█▀▀██▄▄░░░░░░░
░░░░░░░░░░░░░▄█▀▀░░░░░░░▀█░░░░░░
░░░░░░░░░░░▄▀░░░░░░░░░░░░░█░░░░░
░░░░░░░░░▄█░░░░░░░░░░░░░░░█░░░░░
░░░░░░░██▀░░░░░░░▄▄▄░░▄░█▄█▄░░░░
░░░░░▄▀░░░░░░░░░░████░█▄██░▀▄░░░
░░░░█▀░░░░░░░░▄▄██▀░░█████░██░░░
░░░█▀░░░░░░░░░▀█░▀█▀█▀▀▄██▄█▀░░░
░░░██░░░░░░░░░░█░░█░█░░▀▀▄█▀░░░░
░░░░█░░░░░█░░░▀█░░░░... | [
"identifier.change",
"call.function.change"
] | 741,082 | 741,083 | u392848063 | cpp |
p02937 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(INF)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(INF)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,088 | 741,089 | u055148700 | cpp |
p02937 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define Maxn 100000
#define ll long long
char s[Maxn + 5], t[Maxn + 5];
vector<int> id[30];
int n, m;
int num;
int main() {
scanf("%s", s + 1);
scanf("%s", t + 1);
while (s[++n] != '\0')
;
n--;
while (t[++m] ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define Maxn 100000
#define ll long long
char s[Maxn + 5], t[Maxn + 5];
vector<int> id[30];
int n, m;
int num;
int main() {
scanf("%s", s + 1);
scanf("%s", t + 1);
while (s[++n] != '\0')
;
n--;
while (t[++m] ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,090 | 741,091 | u410132794 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scan... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scan... | [
"assignment.add"
] | 741,094 | 741,095 | u550398291 | cpp |
p02937 | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,101 | 741,102 | u283869437 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | [
"identifier.change",
"call.function.change"
] | 741,109 | 741,110 | u721367699 | cpp |
p02937 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i > (b); i--)
#define db(x) (cerr << #x << ": " << (x) << '\n')
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i > (b); i--)
#define db(x) (cerr << #x << ": " << (x) << '\n')
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,111 | 741,112 | u567489994 | cpp |
p02937 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i > (b); i--)
#define db(x) (cerr << #x << ": " << (x) << '\n')
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i > (b); i--)
#define db(x) (cerr << #x << ": " << (x) << '\n')
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 741,113 | 741,112 | u567489994 | cpp |
p02937 | #include <bits/stdtr1c++.h>
using namespace std;
#define INP "solve"
#define OUT "solve"
const int QQ = 3e5 + 10;
const int maxN = 3e5 + 10;
const int maxM = 3e5 + 10;
const int oo = 1e9;
const int module = 1e9 + 7;
const long double du = 1e-9;
void doc() {
freopen(INP ".inp", "r", stdin);
freopen(OUT ".out", "w",... | #include <bits/stdtr1c++.h>
using namespace std;
#define INP "solve"
#define OUT "solve"
const int QQ = 3e5 + 10;
const int maxN = 3e5 + 10;
const int maxM = 3e5 + 10;
const int oo = 1e9;
const int module = 1e9 + 7;
const long double du = 1e-9;
void doc() {
freopen(INP ".inp", "r", stdin);
freopen(OUT ".out", "w",... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,119 | 741,120 | u521455622 | cpp |
p02937 | #include <bits/stdtr1c++.h>
using namespace std;
#define INP "solve"
#define OUT "solve"
const int QQ = 3e5 + 10;
const int maxN = 3e5 + 10;
const int maxM = 3e5 + 10;
const int oo = 1e9;
const int module = 1e9 + 7;
const long double du = 1e-9;
void doc() {
freopen(INP ".inp", "r", stdin);
freopen(OUT ".out", "w",... | #include <bits/stdtr1c++.h>
using namespace std;
#define INP "solve"
#define OUT "solve"
const int QQ = 3e5 + 10;
const int maxN = 3e5 + 10;
const int maxM = 3e5 + 10;
const int oo = 1e9;
const int module = 1e9 + 7;
const long double du = 1e-9;
void doc() {
freopen(INP ".inp", "r", stdin);
freopen(OUT ".out", "w",... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,121 | 741,120 | u521455622 | cpp |
p02937 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using orde... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using orde... | [
"assignment.change"
] | 741,124 | 741,125 | u553927381 | cpp |
p02937 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#i... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,126 | 741,127 | u113106094 | cpp |
p02937 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#i... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,128 | 741,127 | u113106094 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
... | [
"identifier.change",
"call.function.change"
] | 741,131 | 741,132 | u072550332 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define reg register
typedef long long ll;
#define rep(i, a, b) for (int i = a, i##end = b; i <= i##end; ++i)
#define drep(i, a, b) for (int i = a, i##end = b; i >= i##end; --i)
char IO;
int rd() {
int s = 0, f = 0;
while (!isdigit(IO = getchar()))
if (IO == '-')
... | #include <bits/stdc++.h>
using namespace std;
#define reg register
typedef long long ll;
#define rep(i, a, b) for (int i = a, i##end = b; i <= i##end; ++i)
#define drep(i, a, b) for (int i = a, i##end = b; i >= i##end; --i)
char IO;
int rd() {
int s = 0, f = 0;
while (!isdigit(IO = getchar()))
if (IO == '-')
... | [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 741,135 | 741,134 | u891465773 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
bool notok(const string &s, const string &t) {
set<char> ss;
for (char c : s)
ss.insert(c);
for (int c : s) {
if (ss.count(c) == 0) {
return true;
}
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
... | #include <bits/stdc++.h>
using namespace std;
bool notok(const string &s, const string &t) {
set<char> ss;
for (char c : s)
ss.insert(c);
for (int c : t) {
if (ss.count(c) == 0) {
return true;
}
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
... | [
"identifier.change"
] | 741,138 | 741,139 | u210718367 | cpp |
p02937 | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template<typename key, typename val>
// using ordered_tree =
// tree<key, val, greater<>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ... | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template<typename key, typename val>
// using ordered_tree =
// tree<key, val, greater<>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ... | [
"assignment.change",
"expression.operation.binary.remove"
] | 741,142 | 741,143 | u432090061 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 1000000007, MAX = 200003, INF = 1 << 30;
int main() {
string S, T;
cin >> S >> T;
vector<int> when[26];
for (int i = 0; i < S.size(); i++) {
when[S[i] - 'a'].push_back(i);
}
bool o... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 1000000007, MAX = 200003, INF = 1 << 30;
int main() {
string S, T;
cin >> S >> T;
vector<int> when[26];
for (int i = 0; i < S.size(); i++) {
when[S[i] - 'a'].push_back(i);
}
bool o... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,144 | 741,145 | u133391510 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
int main() {
string s, t;
cin >> s >> t;
set<i64> st[30];
auto num = [](i64 c) { return (i64)(c) - 'a'; };
i64 n = s.size(... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
int main() {
string s, t;
cin >> s >> t;
set<i64> st[30];
auto num = [](i64 c) { return (i64)(c) - 'a'; };
i64 n = s.size(... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"expression.operation.binary.remove"
] | 741,146 | 741,147 | u852585808 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
int main() {
string s, t;
cin >> s >> t;
set<i64> st[30];
auto num = [](i64 c) { return (i64)(c) - 'a'; };
i64 n = s.size(... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
int main() {
string s, t;
cin >> s >> t;
set<i64> st[30];
auto num = [](i64 c) { return (i64)(c) - 'a'; };
i64 n = s.size(... | [
"assignment.change",
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"expression.operation.binary.remove"
] | 741,148 | 741,147 | u852585808 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (i = 0; i < n; i++)
#define int long long
using namespace std;
string s;
string t;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (i = 0; i < n; i++)
#define int long long
using namespace std;
string s;
string t;... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 741,151 | 741,152 | u610441939 | cpp |
p02937 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define re... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define re... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,155 | 741,156 | u171366497 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;
int nxt[200010][26];
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
int... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;
int nxt[200010][26];
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
int... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,157 | 741,158 | u984730891 | cpp |
p02937 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#includ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#includ... | [
"literal.number.change",
"assignment.value.change"
] | 741,159 | 741,160 | u279196402 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#if DEBUG && !ONLINE_JUDGE
#include "header.h"
#else
#define debug(args...)
#endif
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long lli;
typedef long double ld;
#define pb push_back
#define all(x) x.begin(), x.end()
#define SZ(x) (int)(x).size()
#defi... | #include <bits/stdc++.h>
using namespace std;
#if DEBUG && !ONLINE_JUDGE
#include "header.h"
#else
#define debug(args...)
#endif
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long lli;
typedef long double ld;
#define pb push_back
#define all(x) x.begin(), x.end()
#define SZ(x) (int)(x).size()
#defi... | [
"assignment.add"
] | 741,161 | 741,162 | u447708702 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#if DEBUG && !ONLINE_JUDGE
#include "header.h"
#else
#define debug(args...)
#endif
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long lli;
typedef long double ld;
#define pb push_back
#define all(x) x.begin(), x.end()
#define SZ(x) (int)(x).size()
#defi... | #include <bits/stdc++.h>
using namespace std;
#if DEBUG && !ONLINE_JUDGE
#include "header.h"
#else
#define debug(args...)
#endif
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long lli;
typedef long double ld;
#define pb push_back
#define all(x) x.begin(), x.end()
#define SZ(x) (int)(x).size()
#defi... | [
"variable_declaration.type.change",
"assignment.add"
] | 741,163 | 741,162 | u447708702 | cpp |
p02937 | #include <bits/stdc++.h>
// ios::sync_with_stdio(false);
// cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<pii, int> ppii;
typedef pair<int, pii> pipi;
typedef pair<ll, ll> pll;
typedef pair<pll, ll> ppll;
typedef pair<ll, pll> plpl;
typed... | #include <bits/stdc++.h>
// ios::sync_with_stdio(false);
// cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<pii, int> ppii;
typedef pair<int, pii> pipi;
typedef pair<ll, ll> pll;
typedef pair<pll, ll> ppll;
typedef pair<ll, pll> plpl;
typed... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 741,164 | 741,165 | u357265888 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | [
"assignment.change"
] | 741,166 | 741,167 | u287015418 | cpp |
p02937 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 741,176 | 741,177 | u202928696 | cpp |
p02938 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#include <cstdint>
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#include <cstdint>
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr ... | [
"control_flow.branch.if.condition.change"
] | 741,182 | 741,183 | u336517845 | cpp |
p02938 | #include <bits/stdc++.h>
using namespace std;
int mod = 1e9;
long long dp[61][2][2][2];
int main() {
long long l, r;
cin >> l >> r;
// dp[桁(i)][L(j)][R(k)][最上位(s)]
dp[60][0][0][0] = 1;
for (int i = 59; i >= 0; i--) {
int lb = (l >> i) & 1;
int rb = (r >> i) & 1;
for (int j = 0; j < 2; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
long long dp[61][2][2][2];
int main() {
long long l, r;
cin >> l >> r;
// dp[桁(i)][L(j)][R(k)][最上位(s)]
dp[60][0][0][0] = 1;
for (int i = 59; i >= 0; i--) {
int lb = (l >> i) & 1;
int rb = (r >> i) & 1;
for (int j = 0; j < 2; j++) ... | [
"assignment.change"
] | 741,186 | 741,187 | u013408661 | cpp |
p02938 | const int mod1 = 1000000007, mod2 = 998244353;
const int mod = mod1;
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
// Andrew He's modular-arithmetic class
template <int MOD_> struct modnum {
static constexpr int MOD = MOD_;
static_assert(MOD_ > 0, "MOD must be positive");
private:
using ll... | const int mod1 = 1000000007, mod2 = 998244353;
const int mod = mod1;
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
// Andrew He's modular-arithmetic class
template <int MOD_> struct modnum {
static constexpr int MOD = MOD_;
static_assert(MOD_ > 0, "MOD must be positive");
private:
using ll... | [
"literal.number.type.widen.change"
] | 741,190 | 741,191 | u799051262 | cpp |
p02938 | const int mod1 = 1000000007, mod2 = 998244353;
const int mod = mod1;
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
// Andrew He's modular-arithmetic class
template <int MOD_> struct modnum {
static constexpr int MOD = MOD_;
static_assert(MOD_ > 0, "MOD must be positive");
private:
using ll... | const int mod1 = 1000000007, mod2 = 998244353;
const int mod = mod1;
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
// Andrew He's modular-arithmetic class
template <int MOD_> struct modnum {
static constexpr int MOD = MOD_;
static_assert(MOD_ > 0, "MOD must be positive");
private:
using ll... | [
"literal.number.type.widen.change"
] | 741,192 | 741,191 | u799051262 | cpp |
p02938 | #include <iostream>
#include <vector>
using lli = long long int;
const lli mod = 1000000007;
struct ds {
lli data[4];
ds() : data{} {}
lli get(bool y, bool x) { return data[y * 2 + x]; }
};
int main() {
lli L, R;
std::cin >> L >> R;
lli dp[62][4] = {};
lli di = 1LL << 60;
bool t0 = true, t1 = true;... | #include <iostream>
#include <vector>
using lli = long long int;
const lli mod = 1000000007;
struct ds {
lli data[4];
ds() : data{} {}
lli get(bool y, bool x) { return data[y * 2 + x]; }
};
int main() {
lli L, R;
std::cin >> L >> R;
lli dp[62][4] = {};
lli di = 1LL << 60;
bool t0 = true, t1 = true;... | [
"expression.operation.binary.add"
] | 741,193 | 741,194 | u301030835 | cpp |
p02938 | // #include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n... | // #include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"expression.operation.unary.add"
] | 741,195 | 741,196 | u833515223 | cpp |
p02938 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000... | [
"variable_declaration.value.change",
"identifier.change"
] | 741,197 | 741,198 | u455366471 | cpp |
p02938 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 741,199 | 741,198 | u455366471 | cpp |
p02938 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 741,197 | 741,200 | u455366471 | cpp |
p02938 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | [
"literal.string.change"
] | 741,209 | 741,210 | u483814783 | cpp |
p02938 | #include <bits/stdc++.h>
#define IO_OP \
std::ios::sync_with_stdio(0); \
std::cin.tie(0);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) ... | #include <bits/stdc++.h>
#define IO_OP \
std::ios::sync_with_stdio(0); \
std::cin.tie(0);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) ... | [
"expression.operation.binary.add"
] | 741,213 | 741,214 | u454290303 | cpp |
p02938 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
long long l, r;
cin >> l >> r;
long long ans = 0;
// x ⊂ y
// (0, 0), (0, 1), (1, 1)
for (int k = 0; k < 62; k++) {
long long c = 1LL << k;
long long d = 1LL << (k + 1);
if (l >= d || c > r)
continue;
lon... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
long long l, r;
cin >> l >> r;
long long ans = 0;
// x ⊂ y
// (0, 0), (0, 1), (1, 1)
for (int k = 0; k < 62; k++) {
long long c = 1LL << k;
long long d = 1LL << (k + 1);
if (l >= d || c > r)
continue;
lon... | [
"control_flow.branch.if.add"
] | 741,220 | 741,221 | u521364030 | cpp |
p02938 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, in... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, in... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"identifier.change"
] | 741,222 | 741,223 | u621104964 | cpp |
p02938 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define MOD (long)(1e9 + 7)
#define MAX 1000000 // 階乗をいくつまで計算するか
class modlong;
void computeAll(long n);
modlong modComb(long n, long k);
modlong modFact(long n);
class modlong {
long val;
const lo... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define MOD (long)(1e9 + 7)
#define MAX 1000000 // 階乗をいくつまで計算するか
class modlong;
void computeAll(long n);
modlong modComb(long n, long k);
modlong modFact(long n);
class modlong {
long val;
const lo... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 741,226 | 741,227 | u956758464 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define rrep(i, n, m) for (int i = n; i >= (m); i--)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
con... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define rrep(i, n, m) for (int i = n; i >= (m); i--)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
con... | [
"literal.number.change",
"assignment.value.change"
] | 741,236 | 741,237 | u427344224 | cpp |
p02939 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i <= (int)(n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
type... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i <= (int)(n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
type... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 741,238 | 741,239 | u263000123 | cpp |
p02939 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,240 | 741,241 | u294700660 | cpp |
p02939 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
string s;
cin >> s;
int ans = 1;
for ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
string s;
cin >> s;
int ans = 1;
for ... | [
"control_flow.continue.remove",
"control_flow.break.add"
] | 741,255 | 741,256 | u818755983 | cpp |
p02939 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0;... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0;... | [] | 741,263 | 741,264 | u926046014 | cpp |
p02939 | #include <bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template <typename T_char> T_char ToUpper(T_char cX) { return toupper(cX); }
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
bool flag = false;
int num = 0;
while (num < n) {
if (num == n ... | #include <bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template <typename T_char> T_char ToUpper(T_char cX) { return toupper(cX); }
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
bool flag = false;
int num = 0;
while (num < n) {
if (num == n ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 741,270 | 741,271 | u145562832 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
string tmp = "";
int kotae = 0;
for (int i = 0; i < n; i++) {
int count = 1;
string a = s.substr(i, count);
if (tmp == a) {
while (tmp == a) {
count++;
a = s.substr(i, count);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
string tmp = "";
int kotae = 0;
for (int i = 0; i < n; i++) {
int count = 1;
string a = s.substr(i, count);
if (tmp == a) {
while (tmp == a) {
count++;
a = s.substr(i, count);
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 741,296 | 741,297 | u406647332 | cpp |
p02939 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 741,304 | 741,305 | u858929490 | cpp |
p02939 | #include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
std::string subS = "";
int i = 0;
int k = 0;
while (i < S.size()) {
k++;
if (subS == S.substr(i, 1)) {
subS = S.substr(i, 2);
i += 2;
if (i >= S.size()) {
k--;
}
} else {
subS ... | #include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
std::string subS = "";
int i = 0;
int k = 0;
while (i < S.size()) {
k++;
if (subS == S.substr(i, 1)) {
subS = S.substr(i, 2);
i += 2;
if (i > S.size()) {
k--;
}
} else {
subS =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,312 | 741,313 | u327750344 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int ans = 0;
string s1, s2 = " ";
for (int i = 0; i < (int)s.length(); i++) {
s1 += s[i];
if (s1 == s2)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int ans = 0;
string s1, s2 = "";
for (int i = 0; i < (int)s.length(); i++) {
s1 += s[i];
if (s1 == s2)
... | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 741,316 | 741,317 | u422430159 | cpp |
p02939 | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
string t, p = "";
int ans = 0;
rep(i, s.size() - 1) {
t += s[... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
string t, p = "";
int ans = 0;
rep(i, s.size()) {
t += s[i];
... | [
"expression.operation.binary.remove"
] | 741,322 | 741,323 | u547099897 | cpp |
p02939 | #include "bits/stdc++.h"
using namespace std;
void Main() {
string S;
cin >> S;
int ans = 0;
int took = -1;
string last = "";
for (int i = 0; i < S.size(); ++i) {
if (i == 0) {
last = S.substr(i, 1);
++ans;
took = 0;
continue;
}
string sub = S.substr(took, i - took);
... | #include "bits/stdc++.h"
using namespace std;
void Main() {
string S;
cin >> S;
int ans = 0;
int took = -1;
string last = "";
for (int i = 0; i < S.size(); ++i) {
if (i == 0) {
last = S.substr(0, 1);
++ans;
took = 0;
continue;
}
string sub = S.substr(took + 1, i - took... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 741,324 | 741,325 | u138886316 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, pre, post;
cin >> s;
pre = s.at(0), post = "";
int k = 0;
for (int i = 1; i < s.size(); i++) {
post += s[i];
if (pre != post) {
k++;
pre = post;
post = "";
}
}
cout << k << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, pre, post;
cin >> s;
pre = s.at(0), post = "";
int k = 1;
for (int i = 1; i < s.size(); i++) {
post += s.at(i);
if (pre != post) {
k++;
pre = post;
post = "";
}
}
cout << k << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"call.add"
] | 741,332 | 741,333 | u889173297 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
string S;
cin >> S;
vector<int> g(S.size() + 1);
g.at(0) = 0;
g.at(1) = 1;
if (S.size() == 1) {
cout << 1 << endl;
return 0;
}
if (S.at(0) == S.at(1)) {
g.at(2) = 1;
} else {
g.at(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
string S;
cin >> S;
vector<int> g(S.size() + 1);
g.at(0) = 0;
g.at(1) = 1;
if (S.size() < 2) {
cout << 1 << endl;
return 0;
}
if (S.at(0) == S.at(1)) {
g.at(2) = 1;
} else {
g.at(2... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 741,338 | 741,339 | u089241640 | cpp |
p02939 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
string S;
int main() {
cin >> S;
ll ans = 0;
bool prev_one = false;
rep(i, S.size()) {
// 最後の2個
if (i == ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
string S;
int main() {
cin >> S;
ll ans = 0;
bool prev_one = false;
rep(i, S.size()) {
// 最後の2個
if (i == ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 741,344 | 741,345 | u455366471 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int dp[200001][2];
string s;
int main() {
ios::sync_with_stdio(false);
cin >> s;
int n = s.size();
s = '?' + s;
for (int i = 1; i <= n; i++) {
dp[i][1] = dp[i][2] = -1e9;
}
dp[1][1] = 0;
for (int i = 2; i <= n; i++) {
dp[i][1] = max(dp[i][1], dp[i - ... | #include <bits/stdc++.h>
using namespace std;
int dp[200001][2];
string s;
int main() {
ios::sync_with_stdio(false);
cin >> s;
int n = s.size();
s = '?' + s;
for (int i = 1; i <= n; i++) {
dp[i][1] = dp[i][2] = -1e9;
}
dp[1][1] = 1;
for (int i = 2; i <= n; i++) {
dp[i][1] = max(dp[i][1], dp[i - ... | [
"literal.number.change",
"assignment.value.change"
] | 741,356 | 741,357 | u707303246 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int dp[200001][2];
string s;
int main() {
ios::sync_with_stdio(false);
cin >> s;
int n = s.size();
s = '?' + s;
for (int i = 1; i <= n; i++) {
dp[i][1] = dp[i][2] = -1e9;
}
dp[1][1] = 0;
for (int i = 2; i <= n; i++) {
dp[i][1] = max(dp[i][1], dp[i - ... | #include <bits/stdc++.h>
using namespace std;
int dp[200001][2];
string s;
int main() {
ios::sync_with_stdio(false);
cin >> s;
int n = s.size();
s = '?' + s;
for (int i = 1; i <= n; i++) {
dp[i][1] = dp[i][2] = -1e9;
}
dp[1][1] = 1;
for (int i = 2; i <= n; i++) {
dp[i][1] = max(dp[i][1], dp[i - ... | [
"literal.number.change",
"assignment.value.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 741,358 | 741,357 | u707303246 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int N = S.size();
vector<int> dp(N, 0);
dp.at(0) == 1;
if (N > 1)
dp.at(1) = (S.at(0) == S.at(1)) ? 1 : 2;
if (N > 2)
dp.at(2)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int N = S.size();
vector<int> dp(N, 0);
dp.at(0) = 1;
if (N > 1)
dp.at(1) = (S.at(0) == S.at(1)) ? 1 : 2;
if (N > 2)
dp.at(2) ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 741,359 | 741,360 | u433685759 | cpp |
p02939 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
string s;
int g[s.size()];
g[0] = 1;
if (s.size() == 1) {
cout << g[0] << endl;
return 0;
}
if (s[0] == s[1])
g[1] = 1;
else
g[1] = 2;
... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
string s;
cin >> s;
int g[s.size()];
g[0] = 1;
if (s.size() == 1) {
cout << g[0] << endl;
return 0;
}
if (s[0] == s[1])
g[1] = 1;
else
... | [] | 741,367 | 741,368 | u201553784 | cpp |
p02939 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <... | [
"identifier.change",
"io.output.change"
] | 741,373 | 741,374 | u356754940 | cpp |
p02939 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | [
"call.arguments.change"
] | 741,379 | 741,380 | u812973725 | cpp |
p02939 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
// ceil() 切り上げ, floor() 切り捨て
// next_permutation(all(x))
int main(void) {
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
// ceil() 切り上げ, floor() 切り捨て
// next_permutation(all(x))
int main(void) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.condition.change"
] | 741,387 | 741,388 | u675042710 | cpp |
p02939 | #include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
// region template
#pragma region template
#define pb push_back
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
/**
* \brief Input help... | #include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
// region template
#pragma region template
#define pb push_back
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
/**
* \brief Input help... | [
"literal.number.change"
] | 741,401 | 741,402 | u729337236 | cpp |
p02939 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CO... |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CO... | [] | 741,407 | 741,408 | u156778176 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll find(int n) {
int left = 1, right = n;
while (left < right) {
int mid = (left + right + 1) / 2;
if ((1ll * mid * (mid + 1)) / 2 > n) {
right = mid - 1;
} else {
left = mid;
}
}
return left;
}
int main() {
io... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll find(int n) {
int left = 1, right = n;
while (left < right) {
int mid = (left + right + 1) / 2;
if ((1ll * mid * (mid + 1)) / 2 > n) {
right = mid - 1;
} else {
left = mid;
}
}
return left;
}
int main() {
io... | [
"assignment.change"
] | 741,409 | 741,410 | u225717512 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
const int n = 2 * 1e5;
int a[n];
int main() {
string s;
cin >> s;
int e = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) {
e++;
}
if (s[i] == s[i - 1]) {
if (i == s.size() - 1 - 2) {
cout << e + 2;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
const int n = 2 * 1e5;
int a[n];
int main() {
string s;
cin >> s;
int e = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) {
e++;
}
if (s[i] == s[i - 1]) {
if (i == s.size() - 1 - 2) {
cout << e + 3;
return 0;
... | [
"literal.number.change",
"io.output.change"
] | 741,413 | 741,414 | u994462919 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.