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 <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v... | [
"assignment.change",
"expression.operation.binary.remove"
] | 740,497 | 740,498 | u275934251 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5 + 5;
int va[26], vb[26];
char a[N], b[N];
vector<int> v[26];
int main() {
scanf("%s%s", a, b);
int n = strlen(a), m = strlen(b), x, flag = 0;
for (int i = 0; i < n; i++) {
x = a[i] - 'a';
va[x] = 1;
v[x].push_back(i +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5 + 5;
int va[26], vb[26];
char a[N], b[N];
vector<int> v[26];
int main() {
scanf("%s%s", a, b);
int n = strlen(a), m = strlen(b), x, flag = 0;
for (int i = 0; i < n; i++) {
x = a[i] - 'a';
va[x] = 1;
v[x].push_back(i +... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 740,500 | 740,501 | u820628270 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep_down(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep_down(... | [
"variable_declaration.name.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_declaration.value.change"
] | 740,502 | 740,503 | u288087195 | cpp |
p02937 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int maxn = 1e5 + 5;
char s[maxn], t[maxn];
vector<int> pos[30];
int main() {
int lens, lent, cur = 0;
long long ans = 0;
vector<int>::iterator it;
scanf("%s%s", s, t);
lens = strlen(s);
lent = strlen(t);
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int maxn = 1e5 + 5;
char s[maxn], t[maxn];
vector<int> pos[30];
int main() {
int lens, lent, cur = 0;
long long ans = 0;
vector<int>::iterator it;
scanf("%s%s", s, t);
lens = strlen(s);
lent = strlen(t);
... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 740,506 | 740,507 | u303496477 | cpp |
p02937 | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:512000000")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#i... | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:512000000")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,511 | 740,512 | u258032299 | cpp |
p02937 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <iterator>
#include <set>
using namespace std;
using namespace __gnu_pbds;
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <iterator>
#include <set>
using namespace std;
using namespace __gnu_pbds;
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, in... | [
"assignment.change",
"expression.operation.binary.remove"
] | 740,521 | 740,522 | u888735570 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
std::size_t indexOf(char c) { return c - 'a'; }
int main(void) {
std::string s, t;
std::cin >> s >> t;
std::vector<std::vector<int>> map(27);
for (int i = 0; i < s.size(); i++) {
map[indexOf(s[i])... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
std::size_t indexOf(char c) { return c - 'a'; }
int main(void) {
std::string s, t;
std::cin >> s >> t;
std::vector<std::vector<int>> map(27);
for (int i = 0; i < s.size(); i++) {
map[indexOf(s[i])... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,525 | 740,526 | u257511191 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl "\n"
const int MAX = 100005;
const long long mod = 1.0e9 + 7;
ll ceil(ll a, ll b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl "\n"
const int MAX = 100005;
const long long mod = 1.0e9 + 7;
ll ceil(ll a, ll b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 740,531 | 740,532 | u103914968 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 1e5 + 5;
int lst[26], nxt[maxn][26];
int main() {
string s, t;
cin >> s >> t;
int n = s.length();
int m = t.length();
for (int i = 0; i < 26; i++)
lst[i] = -1;
for (int i = 0; i < 26; i++)
nxt[n][26] = -1;
for ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 1e5 + 5;
int lst[26], nxt[maxn][26];
int main() {
string s, t;
cin >> s >> t;
int n = s.length();
int m = t.length();
for (int i = 0; i < 26; i++)
lst[i] = -1;
for (int i = 0; i < 26; i++)
nxt[n][i] = -1;
for (... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 740,533 | 740,534 | u711524482 | cpp |
p02937 | /*-------enazuma11----------------*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(v) v.begin(), v.end()
#define inc(a, n) sort(a, a + n)
#define dec(a, n) sort(a, a + n, greater<int>())
#define rep(i... | /*-------enazuma11----------------*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(v) v.begin(), v.end()
#define inc(a, n) sort(a, a + n)
#define dec(a, n) sort(a, a + n, greater<int>())
#define rep(i... | [] | 740,537 | 740,538 | u944248697 | cpp |
p02937 | /*-------enazuma11----------------*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(v) v.begin(), v.end()
#define inc(a, n) sort(a, a + n)
#define dec(a, n) sort(a, a + n, greater<int>())
#define rep(i... | /*-------enazuma11----------------*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(v) v.begin(), v.end()
#define inc(a, n) sort(a, a + n)
#define dec(a, n) sort(a, a + n, greater<int>())
#define rep(i... | [] | 740,539 | 740,540 | u944248697 | cpp |
p02937 | #include "bits/stdc++.h"
#define REP(i, a, b) for (int i = (a); i <= (b); ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define FORV(a, A) for (auto &a : A)
using namespace std;
using ll = long long;
void Main() {
string S, T;
cin >> S >> T;
int pos, previous_pos = -1;
int xpos;
int s_len = S... | #include "bits/stdc++.h"
#define REP(i, a, b) for (int i = (a); i <= (b); ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define FORV(a, A) for (auto &a : A)
using namespace std;
using ll = long long;
void Main() {
string S, T;
cin >> S >> T;
int pos, previous_pos = -1;
int xpos;
int s_len = S... | [
"assignment.change"
] | 740,544 | 740,545 | u747184036 | cpp |
p02937 | // https://atcoder.jp/contests/abc138/tasks/abc138_e
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define FOR(i, a, b) for (int64_t i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
#if LOCAL & 01
std::ifstream in("./test/sample-1.in"); // input.txt
std::cin.rdbuf(in.rdbuf());
... | // https://atcoder.jp/contests/abc138/tasks/abc138_e
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define FOR(i, a, b) for (int64_t i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
#if LOCAL & 01
std::ifstream in("./test/sample-1.in"); // input.txt
std::cin.rdbuf(in.rdbuf());
... | [
"identifier.change",
"call.function.change"
] | 740,548 | 740,549 | u182321487 | cpp |
p02937 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1111111111;
template <class T> ostream &operator<<(os... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1111111111;
template <class T> ostream &operator<<(os... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 740,550 | 740,551 | u532573979 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define mp make_pair
#define pll pair<long long, long long>
#define vll vector<long long>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (long long)x.size()
#define hell 1000000007
#define lbnd low... | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define mp make_pair
#define pll pair<long long, long long>
#define vll vector<long long>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (long long)x.size()
#define hell 1000000007
#define lbnd low... | [
"expression.operation.binary.remove"
] | 740,552 | 740,553 | u006069211 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 740,556 | 740,557 | u640323045 | cpp |
p02937 | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
vector<int> v[30], v1[30];
string s, s1;
long long k = 0, ans = 0;
void st(char c, int x) {
int l = 0, r = v[c - 'a'].size(), w;
while (r - l != 1) {
w = (r + l) / 2;
if (v[c - 'a'][w] < x)
l = w;
else i... | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
vector<int> v[30], v1[30];
string s, s1;
long long k = 0, ans = 0;
void st(char c, int x) {
int l = 0, r = v[c - 'a'].size(), w;
while (r - l != 1) {
w = (r + l) / 2;
if (v[c - 'a'][w] < x)
l = w;
else i... | [
"control_flow.break.add"
] | 740,560 | 740,561 | u019229278 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
void solve() {
string s, t;
cin >> s >> t;
vector<int> pos[26];
s += s;
int n = s.size();
for (int i = 0; i < n; i++) {
pos[s[i] - 'a'].push_back(i);
}
long ans = 0, now = -1;
for (char c : t) {
int x = c - 'a';
if (pos[x].empty()) {
co... | #include <bits/stdc++.h>
using namespace std;
void solve() {
string s, t;
cin >> s >> t;
vector<int> pos[26];
s += s;
int n = s.size();
for (int i = 0; i < n; i++) {
pos[s[i] - 'a'].push_back(i);
}
long ans = 0, now = -1;
for (char c : t) {
int x = c - 'a';
if (pos[x].empty()) {
co... | [
"assignment.change"
] | 740,562 | 740,563 | u344412812 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
void solve() {
string s, t;
cin >> s >> t;
vector<int> pos[26];
s += s;
int n = s.size();
for (int i = 0; i < n; i++) {
pos[s[i] - 'a'].push_back(i);
}
long ans = 0, now = -1;
for (char c : t) {
int x = c - 'a';
if (pos[x].empty()) {
co... | #include <bits/stdc++.h>
using namespace std;
void solve() {
string s, t;
cin >> s >> t;
vector<int> pos[26];
s += s;
int n = s.size();
for (int i = 0; i < n; i++) {
pos[s[i] - 'a'].push_back(i);
}
long ans = 0, now = -1;
for (char c : t) {
int x = c - 'a';
if (pos[x].empty()) {
co... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,564 | 740,563 | u344412812 | cpp |
p02937 | #include <algorithm>
#include <bitset>
//#include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <t... | #include <algorithm>
#include <bitset>
//#include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <t... | [
"assignment.change"
] | 740,573 | 740,574 | u373586461 | cpp |
p02937 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < n; i++)
#define out(ans) cout << ans << endl;
const long long mod = 1e9 + 7;
int main() {
string s, t;
cin >> s >> t;
ll sn = s.size(), tn = t.size();
vector<ll> v[26];
rep(i, 0, sn) { v[s[i] - 'a'... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < n; i++)
#define out(ans) cout << ans << endl;
const long long mod = 1e9 + 7;
int main() {
string s, t;
cin >> s >> t;
ll sn = s.size(), tn = t.size();
vector<ll> v[26];
rep(i, 0, sn) { v[s[i] - 'a'... | [
"identifier.change",
"call.function.change"
] | 740,577 | 740,578 | u139458416 | cpp |
p02937 | #include <iostream>
#include <string>
using namespace std;
string s, t;
long long m;
long long p[100000];
int main() {
cin >> s >> t;
long long w = s.size();
s = s + s;
for (int i = 0; i < t.size(); i++) {
if (s.find_first_of(t[i]) == std::string::npos) {
m = -1;
break;
} else {
i... | #include <iostream>
#include <string>
using namespace std;
string s, t;
long long m;
long long p[100000];
int main() {
cin >> s >> t;
long long w = s.size();
s = s + s;
for (int i = 0; i < t.size(); i++) {
if (s.find_first_of(t[i]) == std::string::npos) {
m = -1;
break;
} else {
i... | [
"assignment.change"
] | 740,585 | 740,586 | u597243424 | cpp |
p02937 | //#include<bits/stdc++.h>
#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | //#include<bits/stdc++.h>
#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [] | 740,587 | 740,588 | u980074233 | cpp |
p02937 | //#include<bits/stdc++.h>
#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | //#include<bits/stdc++.h>
#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"call.function.change"
] | 740,589 | 740,588 | u980074233 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | [
"call.function.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"identifier.change"
] | 740,594 | 740,595 | u790171360 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"identifier.change"
] | 740,596 | 740,595 | u790171360 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
string s, t;
int A[26][100000];
int main() {
cin >> s >> t;
const int N = s.size();
for (int k = 0; k < 26; ++k) {
for (int i = 0; i < N; ++i) {
if (s[i] == 'a' + k) {
A[k][i] = 0;
} else {
A[k][i] = INF;
}
... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
string s, t;
int A[26][100000];
int main() {
cin >> s >> t;
const int N = s.size();
for (int k = 0; k < 26; ++k) {
for (int i = 0; i < N; ++i) {
if (s[i] == 'a' + k) {
A[k][i] = 0;
} else {
A[k][i] = INF;
}
... | [
"expression.operation.unary.arithmetic.add"
] | 740,599 | 740,600 | u993619636 | cpp |
p02937 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
long long int euclidean_gcd(long long int a, long long int b) {
if (a < b)
return euclidean_gcd(b, a);
long lo... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
long long int euclidean_gcd(long long int a, long long int b) {
if (a < b)
return euclidean_gcd(b, a);
long lo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 740,607 | 740,608 | u444349080 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 740,638 | 740,639 | u382880969 | cpp |
p02937 | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | [
"expression.operation.binary.remove"
] | 740,640 | 740,641 | u292813062 | cpp |
p02937 | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 740,642 | 740,641 | u292813062 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define vvi vector<vector<int>>
#define ll long long int
int main() {
string s, t;
cin >> s >> t;
vvi dic(30);
int num;
for (int i = 0; i < s.length(); i++) {
num = int(s[i]) - int('a');
dic[num].push_back(i);
}
ll j = 0;
ll count = 0;
int num... | #include <bits/stdc++.h>
using namespace std;
#define vvi vector<vector<int>>
#define ll long long int
int main() {
string s, t;
cin >> s >> t;
vvi dic(30);
int num;
for (int i = 0; i < s.length(); i++) {
num = int(s[i]) - int('a');
dic[num].push_back(i);
}
ll j = -1;
ll count = 0;
int nu... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,648 | 740,649 | u269804060 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
struct v {
vector<int> tos;
int counter;
};
int main() {
string s, t;
cin >> s >> t;
// 事前にsを処理して、アルファベット毎に... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
struct v {
vector<int> tos;
int counter;
};
int main() {
string s, t;
cin >> s >> t;
// 事前にsを処理して、アルファベット毎に... | [
"control_flow.loop.for.update.change"
] | 740,652 | 740,653 | u538188080 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
map<char, set<uint64_t>> chmap;
for (char c = 'a'; c <= 'z'; ++c) {
chmap.emplace(c, set<uint64_t>());
}
for (uint64_t n = 0; n < s.size(); ++n) {
chmap[s[n]].insert(n);
}
bool not_partial_flag = false;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
map<char, set<int64_t>> chmap;
for (char c = 'a'; c <= 'z'; ++c) {
chmap.emplace(c, set<int64_t>());
}
for (uint64_t n = 0; n < s.size(); ++n) {
chmap[s[n]].insert(n);
}
bool not_partial_flag = false;
i... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 740,670 | 740,671 | u198355306 | cpp |
p02937 | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
string s, t;
cin >> s >> t;
vector<i64> pos[26];
i64 ssize = s.size(), tsize = t.size();
for (i64 i = 0; i < ssize; i++)
pos[s[i] - 'a'].push_back(i);
for (i64 i = 0; i < tsize; i++)
if (pos[t[i] -... | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
string s, t;
cin >> s >> t;
vector<i64> pos[26];
i64 ssize = s.size(), tsize = t.size();
for (i64 i = 0; i < ssize; i++)
pos[s[i] - 'a'].push_back(i);
for (i64 i = 0; i < tsize; i++)
if (pos[t[i] -... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,684 | 740,685 | u623115612 | cpp |
p02937 | /*author : Yashvardhan
Sunday, August 18, 2019
6:46 PM
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#define mp make_pair
#define endl '\n'
#define a... | /*author : Yashvardhan
Sunday, August 18, 2019
6:46 PM
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#define mp make_pair
#define endl '\n'
#define a... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 740,694 | 740,695 | u368039995 | cpp |
p02937 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mkp(a, b) make_pair(a, b)
#define PI 3.14159265359
#define ll long long
#define ul unsigned long long
#define ld long double
#define mset(arr, val) memset(arr, val, sizeof arr)
#define MAXN (long long)2e5 + 5
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mkp(a, b) make_pair(a, b)
#define PI 3.14159265359
#define ll long long
#define ul unsigned long long
#define ld long double
#define mset(arr, val) memset(arr, val, sizeof arr)
#define MAXN (long long)2e5 + 5
... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 740,700 | 740,701 | u481634050 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef int64_t ll;
ll solve(const string &s, const string &t) {
int ns = s.length();
int nt = t.length();
vector<vector<ll>> cnts(26);
REP(i, ns) {
cnts[s[i] - 'a'].e... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef int64_t ll;
ll solve(const string &s, const string &t) {
int ns = s.length();
int nt = t.length();
vector<vector<ll>> cnts(26);
REP(i, ns) {
cnts[s[i] - 'a'].e... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 740,704 | 740,705 | u886956383 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 740,710 | 740,711 | u284045566 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | [
"assignment.value.change",
"call.function.change"
] | 740,712 | 740,713 | u568652083 | cpp |
p02937 | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, a, b) for (auto i = (a); i < (b); ++i)
using namespace std;
#define int long long
signed main() {
string ss;
getline(cin, ss, '\n');
string ts;
getline(cin, ts, '\n');
long long n = ss.size(), m = ts.size();
int s[n], t[m];
REP(i,... | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, a, b) for (auto i = (a); i < (b); ++i)
using namespace std;
#define int long long
signed main() {
string ss;
getline(cin, ss, '\n');
string ts;
getline(cin, ts, '\n');
long long n = ss.size(), m = ts.size();
int s[n], t[m];
REP(i,... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,714 | 740,715 | u883745615 | cpp |
p02937 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) x.begin(), x.end()
#define db(x) cout << #x << "=" << x << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, n, m) for (int i = n; i >= m; i--)
#define INF (1e9)
#defin... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) x.begin(), x.end()
#define db(x) cout << #x << "=" << x << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, n, m) for (int i = n; i >= m; i--)
#define INF (1e9)
#defin... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 740,738 | 740,739 | u556276145 | cpp |
p02937 | // abc138_e
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | // abc138_e
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,740 | 740,741 | u614550445 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> alpha(26);
for (ll i = 0; i < s.size(); i++) {
alpha[s[i] - 'a'].push_back(i);
}
ll ans = 0;
ll count = 0;
ll tpos = 0;
ll npos = 0;
while (tpos < t.size()) {
ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> alpha(26);
for (ll i = 0; i < s.size(); i++) {
alpha[s[i] - 'a'].push_back(i);
}
ll ans = 0;
ll count = 0;
ll tpos = 0;
ll npos = 0;
while (tpos < t.size()) {
ll ... | [
"assignment.change",
"expression.operation.binary.remove"
] | 740,742 | 740,743 | u410878763 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
string s, t;
long long ans, a, now, ls, lt;
int main() {
cin >> s >> t;
ls = s.size();
lt = t.size();
vector<vector<long long>> abc(26);
for (long long i = 0; i < ls; i++) {
a = s[i] - 97;
abc[a].push_back(i);
}
for (long long i = 0; i < lt; i++) {
... | #include <bits/stdc++.h>
using namespace std;
string s, t;
long long ans, a, now, ls, lt;
int main() {
cin >> s >> t;
ls = s.size();
lt = t.size();
vector<vector<long long>> abc(26);
for (long long i = 0; i < ls; i++) {
a = s[i] - 97;
abc[a].push_back(i);
}
now = -1;
for (long long i = 0; i < ... | [
"assignment.add"
] | 740,744 | 740,745 | u576357314 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
string s, t;
long long ans, a, now, ls, lt;
int main() {
cin >> s >> t;
ls = s.size();
lt = t.size();
vector<vector<long long>> abc(26);
for (long long i = 0; i < ls; i++) {
a = s[i] - 97;
abc[a].push_back(i);
}
for (long long i = 0; i < lt; i++) {
... | #include <bits/stdc++.h>
using namespace std;
string s, t;
long long ans, a, now, ls, lt;
int main() {
cin >> s >> t;
ls = s.size();
lt = t.size();
vector<vector<long long>> abc(26);
for (long long i = 0; i < ls; i++) {
a = s[i] - 97;
abc[a].push_back(i);
}
now = -1;
for (long long i = 0; i < ... | [
"assignment.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,746 | 740,745 | u576357314 | cpp |
p02937 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | [
"assignment.value.change",
"expression.operation.binary.remove"
] | 740,753 | 740,754 | u222293734 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n1 = s.size(), n2 = t.size(), fl = 0;
long long int cnt = 0, rem = 1, ans;
int a[26];
set<int> se[26];
set<int>::iterator s1;
for (int i = 0; i < 26; i++)
a[i] = -1;
for (int i = 0; i < n1; i++) {
int i... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n1 = s.size(), n2 = t.size(), fl = 0;
long long int cnt = 0, rem = 0, ans;
int a[26];
set<int> se[26];
set<int>::iterator s1;
for (int i = 0; i < 26; i++)
a[i] = -1;
for (int i = 0; i < n1; i++) {
int i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,766 | 740,767 | u547420959 | cpp |
p02937 | // SeeAlso: https://atcoder.jp/contests/abc138/tasks/abc138_e
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MAX 100000
typedef int _loop_int;
#define REP(i, n) for (int i = 0; i < n; i... | // SeeAlso: https://atcoder.jp/contests/abc138/tasks/abc138_e
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MAX 100000
typedef int _loop_int;
#define REP(i, n) for (int i = 0; i < n; i... | [
"call.remove"
] | 740,768 | 740,769 | u185518252 | cpp |
p02937 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,776 | 740,777 | u591075912 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
using namespace std;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#else
ios::sync_with_stdio(false);
... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
using namespace std;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#else
ios::sync_with_stdio(false);
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,780 | 740,781 | u042208369 | cpp |
p02937 | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s, t;
cin >> s >> t;
unsigned long long ans = 1;
int pre_index = 0, index;
rep(i, t.length()) {
char _t = t[i];
auto it = s.find(_t, pre_index);
if (it == string::npos) {
it = s.find... | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s, t;
cin >> s >> t;
unsigned long long ans = 0;
int pre_index = -1, index;
rep(i, t.length()) {
char _t = t[i];
auto it = s.find(_t, pre_index + 1);
if (it == string::npos) {
it = s... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,786 | 740,787 | u190679129 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define isin(x, l, r) ((l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define isin(x, l, r) ((l... | [
"expression.unary.arithmetic.add"
] | 740,796 | 740,797 | u777853124 | cpp |
p02937 | /*
!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
... | /*
!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
... | [
"literal.number.change",
"assignment.value.change"
] | 740,798 | 740,799 | u965943031 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
string s, t;
cin >> s >> t;
vector<int> s_num(26, 0), t_num(26, 0);
vector<vector<int>> a(26);
rep(i, s.size()) {
s_num[s[i] - 'a']++... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
string s, t;
cin >> s >> t;
vector<int> s_num(26, 0), t_num(26, 0);
vector<vector<int>> a(26);
rep(i, s.size()) {
s_num[s[i] - 'a']++... | [
"assignment.change"
] | 740,800 | 740,801 | u392423112 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
... | [
"assignment.change"
] | 740,806 | 740,807 | u179395482 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long
#define MAX 300005
#define pp pair<int, pair<int, pair<int, int>>>
#define pb push_back
#define mod 1000000007
using namespace std;
/*
* author: Kruti_20
*/
ll power(ll x, ll y);
ll gcd(ll a, ll b);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
... | #include <bits/stdc++.h>
#define ll long long
#define MAX 300005
#define pp pair<int, pair<int, pair<int, int>>>
#define pb push_back
#define mod 1000000007
using namespace std;
/*
* author: Kruti_20
*/
ll power(ll x, ll y);
ll gcd(ll a, ll b);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
... | [
"assignment.change"
] | 740,808 | 740,809 | u352059674 | 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() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = (ll)s.size();
ll m = (ll)t.size();
vector<int> alp(26, 0);
rep(i, n) alp[s[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() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = (ll)s.size();
ll m = (ll)t.size();
vector<int> alp(26, 0);
rep(i, n) alp[s[i] - 'a']++;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,812 | 740,813 | u755830696 | 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() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = (ll)s.size();
ll m = (ll)t.size();
vector<int> alp(26, 0);
rep(i, n) alp[s[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() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = (ll)s.size();
ll m = (ll)t.size();
vector<int> alp(26, 0);
rep(i, n) alp[s[i] - 'a']++;
... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 740,814 | 740,813 | u755830696 | cpp |
p02937 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define fio ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define fio ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,823 | 740,824 | u716033247 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
// tourist set
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
// tourist set
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 740,825 | 740,826 | u432688695 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
char buf[100100];
int nxt[30][100100];
string s, t;
string s2;
int n, m;
int main() {
scanf("%s", buf);
s = buf;
n = s.size();
s2 = s + s;
scanf("%s", buf);
t = buf;
m = t.size();
rep(num, 26) {
char now = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
char buf[100100];
int nxt[30][100100];
string s, t;
string s2;
int n, m;
int main() {
scanf("%s", buf);
s = buf;
n = s.size();
s2 = s + s;
scanf("%s", buf);
t = buf;
m = t.size();
rep(num, 26) {
char now = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,827 | 740,828 | u083800325 | cpp |
p02937 | #include <bits/stdc++.h>
#define int long long
#define MAXN 200010
using namespace std;
int n, m, A[30][MAXN];
char S[MAXN], T[MAXN];
long long ans;
bool vis[30];
signed main() {
scanf("%s", S + 1);
n = strlen(S + 1);
scanf("%s", T + 1);
m = strlen(T + 1);
for (int i = 1; i <= n; i++) {
int num = S[i] - '... | #include <bits/stdc++.h>
#define int long long
#define MAXN 200010
using namespace std;
int n, m, A[30][MAXN];
char S[MAXN], T[MAXN];
long long ans;
bool vis[30];
signed main() {
scanf("%s", S + 1);
n = strlen(S + 1);
scanf("%s", T + 1);
m = strlen(T + 1);
for (int i = 1; i <= n; i++) {
int num = S[i] - '... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 740,829 | 740,830 | u047371023 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_... | [
"identifier.change",
"call.function.change"
] | 740,831 | 740,832 | u635484372 | cpp |
p02937 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
typedef long long int ll;
using namespace std;
string s, t;
ll n;
ll nextIndex[26][100000];
int main() {
cin >> s >> t;
n = s.size();
for (int i = 0; i < 26; i++) {
vector<ll> shown;
for (int j = 0; j < n; j++)
if (s[j] == 'a' + i)... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
typedef long long int ll;
using namespace std;
string s, t;
ll n;
ll nextIndex[26][100000];
int main() {
cin >> s >> t;
n = s.size();
for (int i = 0; i < 26; i++) {
vector<ll> shown;
for (int j = 0; j < n; j++)
if (s[j] == 'a' + i)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,844 | 740,845 | u628262476 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"identifier.change",
"call.function.change"
] | 740,846 | 740,847 | u833393891 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pic pair<int, char>
#define pci pair<char, int>
#define pll pair<ll, ll>
#define plc pair<ll, char>
#define pcl pair<char, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pic pair<int, char>
#define pci pair<char, int>
#define pll pair<ll, ll>
#define plc pair<ll, char>
#define pcl pair<char, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 740,848 | 740,849 | u375708802 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
bool isOK(int index, int key, vector<ll> &a) {
/*indexが条件を満たすかどうかを判定(今回はkeyよりおおきいか)*/
if (a[index] > key)
return true;
else
return false;
}
int binary_search(int key, vector<ll> &a) {
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
bool isOK(int index, int key, vector<ll> &a) {
/*indexが条件を満たすかどうかを判定(今回はkeyよりおおきいか)*/
if (a[index] > key)
return true;
else
return false;
}
int binary_search(int key, vector<ll> &a) {
int... | [
"expression.operation.binary.remove"
] | 740,852 | 740,853 | u595893956 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,856 | 740,857 | u811472478 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | [
"literal.number.change",
"variable_declaration.value.change",
"call.function.change"
] | 740,858 | 740,857 | u811472478 | cpp |
p02937 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
unordered_ma... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
unordered_ma... | [
"expression.operation.binary.remove"
] | 740,859 | 740,860 | u419944616 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,861 | 740,862 | u187878098 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
t... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
t... | [
"identifier.change",
"call.function.change"
] | 740,863 | 740,864 | u997325490 | cpp |
p02937 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.function.change"
] | 740,869 | 740,870 | u725458677 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<long int> x[26];
// cout<<s<<endl;
for (long int i = 0; i < s.length(); i++) {
// cout<<s[i]<<endl;
x[s[i] - 'a'].push_back(i + 1);
}
long long int ans = 0;
long int temp1 = 1;
long int ans1 = INT_MA... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<long int> x[26];
// cout<<s<<endl;
for (long int i = 0; i < s.length(); i++) {
// cout<<s[i]<<endl;
x[s[i] - 'a'].push_back(i + 1);
}
long long int ans = 0;
long int temp1 = 1;
long int ans1 = INT_MA... | [
"assignment.change"
] | 740,877 | 740,878 | u492448945 | cpp |
p02937 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define LL long long
using namespace std;
long long vis[200];
char s[200010], t[200010];
long long id[27][200010];
int main() {
long long lens, lent, i, j;
scanf("%s", s), lens = strlen(s);
scanf("%s", t), lent = strlen(t);
for (i = 0;... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define LL long long
using namespace std;
long long vis[200];
char s[200010], t[200010];
long long id[27][200010];
int main() {
long long lens, lent, i, j;
scanf("%s", s), lens = strlen(s);
scanf("%s", t), lent = strlen(t);
for (i = 0;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,879 | 740,880 | u665380288 | cpp |
p02937 | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define rep1(i, n) for (auto i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
struct init {
init() {
cin.tie(0);
ios::sync_with_stdio(0);
... | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define rep1(i, n) for (auto i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
struct init {
init() {
cin.tie(0);
ios::sync_with_stdio(0);
... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 740,883 | 740,884 | u779159595 | cpp |
p02937 | #include <cstdio>
#include <cstring>
#include <vector>
const int MAXN = 1e5 + 5;
int lenS, lenT, cur;
char s[MAXN], t[MAXN];
std::vector<int> place[26];
int search(int key, int position) {
int left = 0, right = place[position].size() - 1, tmpAns = -1;
while (left <= right) {
int mid = (left + right) >> 1;
... | #include <cstdio>
#include <cstring>
#include <vector>
const int MAXN = 1e5 + 5;
int lenS, lenT;
long long int cur;
char s[MAXN], t[MAXN];
std::vector<int> place[26];
int search(int key, int position) {
int left = 0, right = place[position].size() - 1, tmpAns = -1;
while (left <= right) {
int mid = (left + r... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 740,904 | 740,903 | u645561303 | cpp |
p02937 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <uno... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <uno... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 740,905 | 740,906 | u348155686 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
vector<long long> vec[30];
long long id[30], cur, l;
int main() {
string s, t;
cin >> s >> t;
long long n = s.size();
for (int i = 0; i < s.size(); i++)
vec[s[i] - 'a'].push_back(i);
for (int i = 0; i < t.size(); i++) {
long long c =... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
vector<long long> vec[30];
long long id[30], cur, l = -1;
int main() {
string s, t;
cin >> s >> t;
long long n = s.size();
for (int i = 0; i < s.size(); i++)
vec[s[i] - 'a'].push_back(i);
for (int i = 0; i < t.size(); i++) {
long lon... | [
"variable_declaration.value.change"
] | 740,907 | 740,908 | u951561009 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
vector<long long> vec[30];
long long id[30], cur, l;
int main() {
string s, t;
cin >> s >> t;
long long n = s.size();
for (int i = 0; i < s.size(); i++)
vec[s[i] - 'a'].push_back(i);
for (int i = 0; i < t.size(); i++) {
long long c =... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
vector<long long> vec[30];
long long id[30], cur, l = -1;
int main() {
string s, t;
cin >> s >> t;
long long n = s.size();
for (int i = 0; i < s.size(); i++)
vec[s[i] - 'a'].push_back(i);
for (int i = 0; i < t.size(); i++) {
long lon... | [
"variable_declaration.value.change",
"literal.number.change",
"assignment.value.change"
] | 740,909 | 740,908 | u951561009 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mm 1000000007
#define pb push_back
// nestedcode
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s, t;
ll n, nn, i, p = -1, ans = 0;
map<char, vector<ll>> m;
cin >> s >> t;
n = s.length();
nn = t.... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mm 1000000007
#define pb push_back
// nestedcode
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s, t;
ll n, nn, i, p = -1, ans = 0;
map<char, vector<ll>> m;
cin >> s >> t;
n = s.length();
nn = t.... | [
"expression.operation.binary.add"
] | 740,915 | 740,916 | u995107278 | cpp |
p02937 | //
// Created by Naman Bhalla on 2019-08-18.
//
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
string s, t;
cin >> s >> t;
vector<vector<int>> ind(26);
long long int n = s.size();
for (int i = 0; i < n; ++i) {
ind[s[i] -... | //
// Created by Naman Bhalla on 2019-08-18.
//
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
string s, t;
cin >> s >> t;
vector<vector<int>> ind(26);
long long int n = s.size();
for (int i = 0; i < n; ++i) {
ind[s[i] -... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,917 | 740,918 | u959910661 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
string s, t;
cin >> s >> t;
set<char> unique_char;
for (auto c : s) {
unique_char.insert(c);
}
bool isBad = false;
for (auto c : t) {
if (unique_char.count(c) == 0)
isBad = tru... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
string s, t;
cin >> s >> t;
set<char> unique_char;
for (auto c : s) {
unique_char.insert(c);
}
bool isBad = false;
for (auto c : t) {
if (unique_char.count(c) == 0)
isBad = tru... | [
"assignment.change"
] | 740,924 | 740,925 | u235057691 | cpp |
p02937 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
#define SZ(a) int((a).size())
#define _REP(_1, _2, _3, _4, name, ...) name
#define _REP4(i, b, e, s) \
for (decltype(e) ... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
#define SZ(a) int((a).size())
#define _REP(_1, _2, _3, _4, name, ...) name
#define _REP4(i, b, e, s) \
for (decltype(e) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,933 | 740,934 | u872191059 | cpp |
p02937 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
#define SZ(a) int((a).size())
#define _REP(_1, _2, _3, _4, name, ...) name
#define _REP4(i, b, e, s) \
for (decltype(e) ... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
#define SZ(a) int((a).size())
#define _REP(_1, _2, _3, _4, name, ...) name
#define _REP4(i, b, e, s) \
for (decltype(e) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,935 | 740,934 | u872191059 | cpp |
p02937 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
using ll = long long;
ll inf = 100000000007ll;
string s, t;
int ssz, tsz;
map<char, set<ll>> mcs;
ll succ(int from, char c) { return *(mcs[c].upper_bound(from)); }
ll solve(int from, int... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
using ll = long long;
ll inf = 100000000007ll;
string s, t;
int ssz, tsz;
map<char, set<ll>> mcs;
ll succ(int from, char c) { return *(mcs[c].upper_bound(from)); }
ll solve(int from, int... | [
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 740,938 | 740,939 | u633757735 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int ls, lt;
char s[100004], t[100004];
vector<int> cs[34], ct[34];
vector<int>::iterator it;
int main() {
scanf("%s%s", s + 1, t + 1);
ls = strlen(s + 1);
lt = strlen(t + 1);
for (int i = 1; i <= ls; i++) {
cs[s[i] - 'a'].push_back(i);
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int ls, lt;
char s[100004], t[100004];
vector<int> cs[34], ct[34];
vector<int>::iterator it;
int main() {
scanf("%s%s", s + 1, t + 1);
ls = strlen(s + 1);
lt = strlen(t + 1);
for (int i = 1; i <= ls; i++) {
cs[s[i] - 'a'].push_back(i);
}
... | [
"assignment.change"
] | 740,940 | 740,941 | u628253919 | cpp |
p02937 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 10000000000000000
#define MOD 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 10000000000000000
#define MOD 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,944 | 740,945 | u452009494 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, x, n) for (ll i = x; i < (ll)(n); i++)
typ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, x, n) for (ll i = x; i < (ll)(n); i++)
typ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,946 | 740,947 | u317711717 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, x, n) for (ll i = x; i < (ll)(n); i++)
typ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, x, n) for (ll i = x; i < (ll)(n); i++)
typ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 740,948 | 740,947 | u317711717 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
s = s + s;
vector<vector<int>> nex(2 * n, vector<int>(26, -1));
for (int i = 2 * n - 2; i >= 0; i--) {
for (int j = 0; j < 26; j++) {
if (s[i + 1] == 'a' + j) {
nex[i][j] = i + 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
s = s + s;
vector<vector<int>> nex(2 * n, vector<int>(26, -1));
for (int i = 2 * n - 2; i >= 0; i--) {
for (int j = 0; j < 26; j++) {
if (s[i + 1] == 'a' + j) {
nex[i][j] = i + 1;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,953 | 740,954 | u891482208 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
s = s + s;
vector<vector<int>> nex(2 * n, vector<int>(26, -1));
for (int i = 2 * n - 2; i >= 0; i--) {
for (int j = 0; j < 26; j++) {
if (s[i + 1] == 'a' + j) {
nex[i][j] = i + 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
s = s + s;
vector<vector<int>> nex(2 * n, vector<int>(26, -1));
for (int i = 2 * n - 2; i >= 0; i--) {
for (int j = 0; j < 26; j++) {
if (s[i + 1] == 'a' + j) {
nex[i][j] = i + 1;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,955 | 740,954 | u891482208 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 740,956 | 740,957 | u268571052 | cpp |
p02937 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
#define fast ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
#define fast ... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 740,958 | 740,959 | u273957331 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, e) for (int i = a; i < e; ++i)
using LL = long long;
// template< unsigned mod >
// struct RollingHash {
// vector< unsigned > hashed, power;
//
// inline unsigned mul(unsigned a, unsigned b) const {
// unsigned long long x = (unsigned long long) a * b;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, e) for (int i = a; i < e; ++i)
using LL = long long;
// template< unsigned mod >
// struct RollingHash {
// vector< unsigned > hashed, power;
//
// inline unsigned mul(unsigned a, unsigned b) const {
// unsigned long long x = (unsigned long long) a * b;
... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change"
] | 740,962 | 740,963 | u110336585 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define MP make_pair
#define F first
#define S second
#define sz(v) (ll) v.size()
#define inf 100000000000000
#define vll vector<ll>
#define pll pair<ll, ll> nnnn
using namespace std;
const int N ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define MP make_pair
#define F first
#define S second
#define sz(v) (ll) v.size()
#define inf 100000000000000
#define vll vector<ll>
#define pll pair<ll, ll> nnnn
using namespace std;
const int N ... | [
"assignment.change"
] | 740,966 | 740,967 | u850006519 | cpp |
p02937 | #include <bits/stdc++.h>
#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 rrep(i, n) for (int i = ((int)(n)-1); i >= 0; (i)--)
#define rrep1(i, n) for (int i = ((int)(n)); i > 0; (i)--)
#define sz(c) ((int)(c).size())
#define all(x) (x).begin(), (x).end... | #include <bits/stdc++.h>
#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 rrep(i, n) for (int i = ((int)(n)-1); i >= 0; (i)--)
#define rrep1(i, n) for (int i = ((int)(n)); i > 0; (i)--)
#define sz(c) ((int)(c).size())
#define all(x) (x).begin(), (x).end... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 740,968 | 740,969 | u228214259 | cpp |
p02937 | #include <algorithm>
#include <chrono>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>... | #include <algorithm>
#include <chrono>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 740,970 | 740,971 | u394853232 | cpp |
p02937 | // --------------
// Tejas Pandey |
// 18 - 08 - 19 |
// ABC #138 |
// --------------
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define vi vector<int>
typedef long long int ll;
int main(void) {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
ios_base::sync_wi... | // --------------
// Tejas Pandey |
// 18 - 08 - 19 |
// ABC #138 |
// --------------
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define vi vector<int>
typedef long long int ll;
int main(void) {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
ios_base::sync_wi... | [
"variable_declaration.type.change"
] | 740,974 | 740,973 | u878492982 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.