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 |
|---|---|---|---|---|---|---|---|
p02936 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 6;
vector<int> e[maxn];
ll a[maxn];
void dfs(int u, int fa) {
a[u] += a[fa];
for (int i = 0; i < e[u].size(); i++) {
int v = e[u][i];
if (v == fa)
continue;
dfs(v, u);
}
}
int main() {
int n, q;
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 6;
vector<int> e[maxn];
ll a[maxn];
void dfs(int u, int fa) {
a[u] += a[fa];
for (int i = 0; i < e[u].size(); i++) {
int v = e[u][i];
if (v == fa)
continue;
dfs(v, u);
}
}
int main() {
int n, q;
cin >>... | [
"assignment.value.change"
] | 738,734 | 738,735 | u491404948 | cpp |
p02936 | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
void dfs(vi e[], int x, int p, int c[]) {
for (int y : e[x]) {
if (y != p) {
c[y] += c[x];
dfs(e, y, x, c);
}
}
}
int main() {
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
... | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
void dfs(vi e[], int x, int p, int c[]) {
for (int y : e[x]) {
if (y != p) {
c[y] += c[x];
dfs(e, y, x, c);
}
}
}
int main() {
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 738,740 | 738,741 | u587665681 | cpp |
p02936 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define endl '\n'
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int x, y, cnt[200001], fnt[200002];
vecto... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define endl '\n'
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int x, y, cnt[200001], fnt[200002];
vecto... | [
"call.arguments.change"
] | 738,775 | 738,776 | u366023106 | cpp |
p02936 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define endl '\n'
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int x, y, cnt[200001], fnt[200002];
vecto... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define endl '\n'
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int x, y, cnt[200001], fnt[200002];
vecto... | [
"call.arguments.change"
] | 738,777 | 738,776 | u366023106 | cpp |
p02936 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
vi adj[200001];
int d[200001];
void dfs(int x, int p, int s) {
for (int y : adj[x]) {
if (y == p)
continue;
df... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
vi adj[200001];
int d[200001];
void dfs(int x, int p, int s) {
for (int y : adj[x]) {
if (y == p)
continue;
df... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 738,788 | 738,789 | u562319622 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
void dfs(auto &tree, auto &count, auto &ans, int parent, int node, int sum) {
sum += count.at(node);
ans.at(node) = sum;
for (auto i : tree.at(node)) {
if (i == parent)
continue;
dfs(tree, count, ans, i, node, sum);
}
}
int main(void) {
int N, Q;
... | #include <bits/stdc++.h>
using namespace std;
void dfs(auto &tree, auto &count, auto &ans, int parent, int node, int sum) {
sum += count.at(node);
ans.at(node) = sum;
for (auto i : tree.at(node)) {
if (i == parent)
continue;
dfs(tree, count, ans, node, i, sum);
}
}
int main(void) {
int N, Q;
... | [
"call.arguments.change",
"call.arguments.add"
] | 738,795 | 738,796 | u090084494 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#defi... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 738,815 | 738,816 | u390193191 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | [
"assignment.value.change"
] | 738,828 | 738,829 | u430974466 | cpp |
p02936 | #include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<vector<int>> edge(N);
vector<int> value(N);
vector<int> total(N);
// cout << "NQ " << N << Q << endl;
for (int i = 0; i < N - 1; ++i) {
int a, b;
cin >> a >> b;
// cout ... | #include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<vector<int>> edge(N);
vector<int> value(N, 0);
vector<int> total(N);
// cout << "NQ " << N << Q << endl;
for (int i = 0; i < N - 1; ++i) {
int a, b;
cin >> a >> b;
// co... | [
"call.arguments.add",
"assignment.value.change"
] | 738,830 | 738,831 | u463950771 | cpp |
p02936 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
void AddScore(map<long long, vector<long long>> &C, long long *S, long long i,
int *visited) {
const auto r = C[i];
if (r.size() == 0... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
void AddScore(map<long long, vector<long long>> &C, long long *S, long long i,
int *visited) {
const auto r = C[i];
if (r.size() == 0... | [
"assignment.change",
"control_flow.branch.if.condition.change"
] | 738,836 | 738,837 | u838644735 | cpp |
p02936 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int n, q;
vector<vector<int>> adj;
vector<int> dfsn;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int n, q;
vector<vector<int>> adj;
vector<int> dfsn;
... | [
"call.arguments.change"
] | 738,855 | 738,856 | u827841970 | cpp |
p02936 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | [
"assignment.value.change"
] | 738,872 | 738,873 | u381714561 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
#define INF 987654321
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
#define MAX_N 200010
int in[MAX_N];
int out[MAX_N];
int trace_num = 0;
vector<int> edge[200010];
int N, Q;
void dfs(int start) {
in[start] = ++trace_num;
for (aut... | #include <bits/stdc++.h>
using namespace std;
#define INF 987654321
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
#define MAX_N 220010
int in[MAX_N];
int out[MAX_N];
int trace_num = 0;
vector<int> edge[MAX_N];
int N, Q;
void dfs(int start) {
in[start] = ++trace_num;
for (auto... | [
"preprocessor.define.value.change",
"literal.integer.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"literal.number.change",
"expression.operation.binary.change"
] | 738,887 | 738,888 | u112681763 | cpp |
p02936 | #include <iomanip>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
const int MAX_N = 200005;
const int MAX_Q = 200005;
int p[MAX_N], Q[MAX_Q], ans[MAX_N];
queue<int> V[MAX_N];
void init() {
for (int i = 0; i < MAX_N; ++i) {
p[i] = -1;
}
p[1] = 1;
return;
}
void tree(int n) {
... | #include <iomanip>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
const int MAX_N = 200005;
const int MAX_Q = 200005;
int p[MAX_N], Q[MAX_Q], ans[MAX_N];
queue<int> V[MAX_N];
void init() {
for (int i = 0; i < MAX_N; ++i) {
p[i] = -1;
}
p[1] = 1;
return;
}
void tree(int n) {
... | [] | 738,889 | 738,890 | u352969025 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0, temp = (int)(n); i < temp; ++i)
#define repi(i, start, end) for (int i = start, temp = (int)(end); i < end; ++i)
#define rfor(v, x) for (const auto &x : v) // xは値を表す
#define all(x) (x).begin(), (x)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0, temp = (int)(n); i < temp; ++i)
#define repi(i, start, end) for (int i = start, temp = (int)(end); i < end; ++i)
#define rfor(v, x) for (const auto &x : v) // xは値を表す
#define all(x) (x).begin(), (x)... | [
"assignment.value.change"
] | 738,895 | 738,896 | u432998668 | cpp |
p02936 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
... | [
"assignment.value.change"
] | 738,932 | 738,933 | u050445028 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vpl = vector<pll>;
using vb = vector<bool>;
using vs = vector<string>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define al... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vpl = vector<pll>;
using vb = vector<bool>;
using vs = vector<string>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define al... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 738,964 | 738,965 | u615346437 | cpp |
p02936 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const ll MAXX = 1e18;
vector<ll> hold[1000001];
// for eTour
pair<ll, ll> tim[1000001];
bool pass[1000001];
ll cnt = 0;
void eTour(ll sta = 1) {
pass[sta] = true;
tim[sta].first = ++cnt;
for (ll i = 0; i < hold[sta].size... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const ll MAXX = 1e18;
vector<ll> hold[1000001];
// for eTour
pair<ll, ll> tim[1000001];
bool pass[1000001];
ll cnt = 0;
void eTour(ll sta = 1) {
pass[sta] = true;
tim[sta].first = ++cnt;
for (ll i = 0; i < hold[sta].size... | [] | 739,004 | 739,005 | u508700891 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
int id, n, q, a, b, p;
vector<int> graph[200005];
int masuk[200005], keluar[200005];
long long arr[200005], tmp, x, ans[200005];
void dfs(int now, int par) {
id++;
masuk[now] = id;
for (int i = 0; i < graph[now].size(); i++) {
int nex = graph[now][i];
if (nex... | #include <bits/stdc++.h>
using namespace std;
int id, n, q, a, b, p;
vector<int> graph[200005];
int masuk[200005], keluar[200005];
long long arr[200005], tmp, x, ans[200005];
void dfs(int now, int par) {
id++;
masuk[now] = id;
for (int i = 0; i < graph[now].size(); i++) {
int nex = graph[now][i];
if (nex... | [] | 739,017 | 739,018 | u547105766 | cpp |
p02936 | #include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (auto i = (N)-1; i >= 0; i -= 1)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((... | #include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (auto i = (N)-1; i >= 0; i -= 1)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((... | [
"call.arguments.change"
] | 739,030 | 739,031 | u168578024 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
#define FOR(x, to) for (x = 0; x < (to); x++)
std::vector<int> to[200000];
std::vector<int> ans;
void dfs(int v, int p = -1) {
for (int u : to[v]) {
if (u == p)
continue;
ans[u] += ans[v];
dfs(u, v);
}
}
int main() {
int n, q;
cin >> n >> q;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(x, to) for (x = 0; x < (to); x++)
std::vector<int> to[200000];
std::vector<int> ans;
void dfs(int v, int p = -1) {
for (int u : to[v]) {
if (u == p)
continue;
ans[u] += ans[v];
dfs(u, v);
}
}
int main() {
int n, q;
cin >> n >> q;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 739,049 | 739,050 | u579754454 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
using ll = long long;
int main() {
int n, q;
cin >> n >> q;
vector<int> a(n - 1), b(n - 1), p(q), x(q);
rep(i, 0, n - 1) cin >> a[i] >> b[i];
rep(i, 0, q) cin >> p[i] >> x[i];
vector<ll> ans(n), r(n), ad(n);
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
using ll = long long;
int main() {
int n, q;
cin >> n >> q;
vector<int> a(n - 1), b(n - 1), p(q), x(q);
rep(i, 0, n - 1) cin >> a[i] >> b[i];
rep(i, 0, q) cin >> p[i] >> x[i];
vector<ll> ans(n), r(n), ad(n);
r... | [
"assignment.value.change"
] | 739,103 | 739,104 | u526854325 | cpp |
p02936 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int main(void) {
int N, Q;
cin >> N >> Q;
vector<pair<int, int>> ab(N - 1);
vector<int> ans(N);
rep(i, N - 1) cin >> ab[i].first >> ab[i].second;
sort(ab.begin(), ab.end());
rep(i, Q) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int main(void) {
int N, Q;
cin >> N >> Q;
vector<pair<int, int>> ab(N - 1);
vector<int> ans(N);
rep(i, N - 1) cin >> ab[i].first >> ab[i].second;
sort(ab.begin(), ab.end());
rep(i, Q) {... | [
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.change"
] | 739,107 | 739,108 | u895536055 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
vector<int64_t> counter;
unordered_map<int, vector<int>> edges;
void recur(int prev, int cur) {
counter[cur] += counter[prev];
for (auto next : edges[cur]) {
if (prev != next) {
recur(cur, next);
}
}
}
int main() {
int N, Q;
cin >> N >> Q;
edge... | #include <bits/stdc++.h>
using namespace std;
vector<int64_t> counter;
unordered_map<int, vector<int>> edges;
void recur(int prev, int cur) {
counter[cur] += counter[prev];
for (auto next : edges[cur]) {
if (prev != next) {
recur(cur, next);
}
}
}
int main() {
int N, Q;
cin >> N >> Q;
edge... | [
"literal.number.change",
"call.arguments.change"
] | 739,109 | 739,110 | u072825550 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
const int maxN = 500 * 1000 + 9;
ll fwt[maxN];
int n, q;
int tIn[maxN], tOut[maxN], dfsTime;
bool visited[maxN];
vector<int> g[maxN];
void upd(int idx, ll v) {
for (; idx <= n; idx += idx & -idx) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
const int maxN = 500 * 1000 + 9;
ll fwt[maxN];
int n, q;
int tIn[maxN], tOut[maxN], dfsTime;
bool visited[maxN];
vector<int> g[maxN];
void upd(int idx, ll v) {
for (; idx < maxN; idx += idx & -idx) {... | [
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 739,147 | 739,148 | u482794458 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
#define TRACE
#define M 1000000007
#define oo 1000000000000000007
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
#define pb push_back
#define M6 1000009
#define M5 500009
#define pi 3.... | #include <bits/stdc++.h>
using namespace std;
#define TRACE
#define M 1000000007
#define oo 1000000000000000007
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
#define pb push_back
#define M6 1000009
#define M5 500009
#define pi 3.... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 739,149 | 739,150 | u374517378 | cpp |
p02936 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define _min(x, y) x = min(x, y)
#define _max(x, y) x = max(x, y)
using namespace std;
#define MAX_NUM 200000
vector<vector<int>> path(MAX_NUM);
vector<int> p2score(MAX_NUM, 0);
void printQueue(queu... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define _min(x, y) x = min(x, y)
#define _max(x, y) x = max(x, y)
using namespace std;
#define MAX_NUM 200000
vector<vector<int>> path(MAX_NUM);
vector<int> p2score(MAX_NUM, 0);
void printQueue(queu... | [
"expression.operation.binary.remove"
] | 739,164 | 739,165 | u778614444 | cpp |
p02936 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author jcg
*/
#include <iostream>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
class DKi {
public:
void solve(std::istream &in, std::ostream &out) {
int N, Q;
in >> N >> Q;
st... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author jcg
*/
#include <iostream>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
class DKi {
public:
void solve(std::istream &in, std::ostream &out) {
int N, Q;
in >> N >> Q;
st... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 739,166 | 739,167 | u428138331 | cpp |
p02936 | #include <bits/stdc++.h>
#define int long long
const int N = 3e5 + 10;
using namespace std;
vector<int> adj[N];
int arr[N];
void dfs(int start, int par, int sum) {
arr[start] += sum;
sum = arr[start];
for (auto v : adj[start]) {
if (v != par) {
dfs(v, start, sum);
}
}
}
int32_t main() {
ios_base... | #include <bits/stdc++.h>
#define int long long
const int N = 3e5 + 10;
using namespace std;
vector<int> adj[N];
int arr[N];
void dfs(int start, int par, int sum) {
arr[start] += sum;
sum = arr[start];
for (auto v : adj[start]) {
if (v != par) {
dfs(v, start, sum);
}
}
}
int32_t main() {
ios_base... | [
"assignment.value.change"
] | 739,184 | 739,185 | u715191077 | cpp |
p02936 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll l... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll l... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 739,200 | 739,201 | u241367243 | cpp |
p02936 | // Sani buyuk Osman Pasa Plevneden cikmam diyor.
// FatihSultanMehmedHan
// Abdulhamid Han
// Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair<in... | // Sani buyuk Osman Pasa Plevneden cikmam diyor.
// FatihSultanMehmedHan
// Abdulhamid Han
// Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair<in... | [
"call.arguments.change"
] | 739,217 | 739,218 | u050607149 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
int n, q, va[200010], ans[200010];
vector<int> my_map[200010];
bool visited[200010];
void dfs(int now, int value) {
value += va[now];
ans[now] = value;
int t = my_map[now].size();
for (int i = 0; i < t; ++i) {
if (visited[my_map[now][i]])
continue;
vi... | #include <bits/stdc++.h>
using namespace std;
int n, q, va[200010], ans[200010];
vector<int> my_map[200010];
bool visited[200010];
void dfs(int now, int value) {
value += va[now];
ans[now] = value;
int t = my_map[now].size();
for (int i = 0; i < t; ++i) {
if (visited[my_map[now][i]])
continue;
vi... | [
"assignment.value.change"
] | 739,219 | 739,220 | u611637797 | cpp |
p02936 | /**
OJ :
Program Code :
Md. Mujahedul Azad (Turin)
Hajee Mohammad Danesh Science & Technology University
**/
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#i... | /**
OJ :
Program Code :
Md. Mujahedul Azad (Turin)
Hajee Mohammad Danesh Science & Technology University
**/
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#i... | [
"assignment.value.change"
] | 739,231 | 739,232 | u294473317 | cpp |
p02936 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#... | [
"identifier.change",
"call.arguments.change"
] | 739,233 | 739,234 | u516353059 | cpp |
p02936 | #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 ... | [] | 739,250 | 739,251 | u850006519 | cpp |
p02936 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second... | [
"call.arguments.change"
] | 739,254 | 739,255 | u175295878 | cpp |
p02936 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 739,256 | 739,255 | u175295878 | cpp |
p02936 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 200000
#define DB double
int n, Q, ct;
vector<int> G[MAXN + 1];
int dfn[MAXN + 2], ot[MAXN + 1];
int sum[MAXN + 1], id[MAXN + 2];
void dfs(int x, int fa) {
dfn[x] = ++ct;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 200000
#define DB double
int n, Q, ct;
vector<int> G[MAXN + 1];
int dfn[MAXN + 2], ot[MAXN + 1];
int sum[MAXN + 1], id[MAXN + 2];
void dfs(int x, int fa) {
dfn[x] = ++ct;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 739,259 | 739,260 | u778193086 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
struct FastIO {
FastIO() {
cin.tie(0);
ios::sync_w... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
struct FastIO {
FastIO() {
cin.tie(0);
ios::sync_w... | [
"call.add",
"call.arguments.change"
] | 739,285 | 739,286 | u687214625 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
int ctoi(char c) { return (int)c - (int)'a'; }
int main() {
string s, t;
cin >> s >> t;
vector<vi> char_pos(26);
for (int i = 0; i < s.size(); i++) {
char_pos[ctoi(s[i])].push_back(i);
}
vi count(26, 0);
vi res... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
int ctoi(char c) { return (int)c - (int)'a'; }
int main() {
string s, t;
cin >> s >> t;
vector<vi> char_pos(26);
for (int i = 0; i < s.size(); i++) {
char_pos[ctoi(s[i])].push_back(i);
}
vi count(26, 0);
vi res... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,291 | 739,292 | u495692658 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
int main() {
string s, t;
cin >> s >> t;
map<char, vector<ll>> mp;
set<char> st;
for (ll i = 0; i < s.size(); ++i) {
mp[s[i]].push_back(i + 1);
st.insert(s[i]);
}
bool flag = true;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
int main() {
string s, t;
cin >> s >> t;
map<char, vector<ll>> mp;
set<char> st;
for (ll i = 0; i < s.size(); ++i) {
mp[s[i]].push_back(i + 1);
st.insert(s[i]);
}
bool flag = true;
for (int i = 0; i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,303 | 739,304 | u849073847 | cpp |
p02937 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = s.size();
ll m = t.size... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = s.size();
ll m = t.size... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,307 | 739,308 | u374051158 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change"
] | 739,311 | 739,312 | u501163846 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,313 | 739,312 | u501163846 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
... | [
"expression.operation.binary.remove"
] | 739,314 | 739,315 | u137747137 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
... | [
"assignment.change",
"expression.operation.binary.remove"
] | 739,316 | 739,315 | u137747137 | cpp |
p02937 | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | [
"identifier.change",
"call.function.change"
] | 739,321 | 739,322 | u434874161 | cpp |
p02937 | #include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) ... | #include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,329 | 739,330 | u885634168 | cpp |
p02937 | #include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) ... | #include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 739,331 | 739,330 | u885634168 | cpp |
p02937 | #include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) ... | #include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 739,332 | 739,330 | u885634168 | cpp |
p02937 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int mai... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int mai... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,341 | 739,342 | u416773418 | cpp |
p02937 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
int main() {
string s, t;
cin >> s >> t;
long int num = s.size();
vector<int> a[26];
rep(i, s.size()) ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
int main() {
string s, t;
cin >> s >> t;
long int num = s.size();
vector<int> a[26];
rep(i, s.size()) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,343 | 739,344 | u416773418 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template ... | [
"identifier.change",
"call.function.change"
] | 739,345 | 739,346 | u601256797 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template ... | [
"identifier.change",
"call.function.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,347 | 739,346 | u601256797 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | [
"expression.operation.binary.add"
] | 739,348 | 739,349 | u601256797 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,350 | 739,349 | u601256797 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 739,351 | 739,349 | u601256797 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,352 | 739,349 | u601256797 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | [
"expression.operation.binary.remove"
] | 739,351 | 739,353 | u601256797 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"assignment.change",
"expression.operation.binary.remove"
] | 739,352 | 739,353 | u601256797 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF = 1e18;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
template <class T> inline... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF = 1e18;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
template <class T> inline... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 739,354 | 739,355 | u345188429 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
c... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 739,360 | 739,361 | u280175105 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(con... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(con... | [
"identifier.change",
"call.function.change",
"assignment.value.change"
] | 739,372 | 739,373 | u305824645 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
vector<ll> C[30];
int main() {
cin.tie(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
vector<ll> C[30];
int main() {
cin.tie(... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,374 | 739,375 | u340980616 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using arr = vector<ll>;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
constexpr int MAX = 2020;
string ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using arr = vector<ll>;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
constexpr int MAX = 2020;
string ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,388 | 739,389 | u843175622 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 739,394 | 739,395 | u666394517 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | [
"assignment.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,401 | 739,402 | u917282863 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"assignment.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,403 | 739,402 | u917282863 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const ll INF = 1e18 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const ll INF = 1e18 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,410 | 739,411 | u317379170 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const ll INF = 1e18 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const ll INF = 1e18 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,412 | 739,411 | u317379170 | cpp |
p02937 | //ヘッダー
#include <bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1e+9 + 7 // 10^9+7
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; ... | //ヘッダー
#include <bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1e+9 + 7 // 10^9+7
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,418 | 739,419 | u115927976 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 739,426 | 739,425 | u938389536 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 739,427 | 739,425 | u938389536 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | [
"identifier.change",
"call.function.change"
] | 739,428 | 739,429 | u649310245 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Map = map<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF = 1LL << 60;
ll MOD = 1000000007;
int main() {
string s;
cin >> s;
string t;
cin >> t;
ll u = s.size();
ll v = t.size();
map<c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Map = map<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
string t;
cin >> t;
ll u = s.size();
ll v = t.siz... | [
"expression.operation.unary.arithmetic.add"
] | 739,432 | 739,433 | u575802441 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Map = map<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF = 1LL << 60;
ll MOD = 1000000007;
int main() {
string s;
cin >> s;
string t;
cin >> t;
ll u = s.size();
ll v = t.size();
map<c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Map = map<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
string t;
cin >> t;
ll u = s.size();
ll v = t.siz... | [
"expression.operation.unary.arithmetic.add",
"literal.number.type.widen.change"
] | 739,434 | 739,433 | u575802441 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
typedef vector<int> vi;
const int INF = 1LL << 58;
const int MOD = 1000000007;
const int MAX_N = 200100;
signed main() {
// 以降 cin の入力元が 'input.txt' になる
// std::i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
typedef vector<int> vi;
const int INF = 1LL << 58;
const int MOD = 1000000007;
const int MAX_N = 200100;
signed main() {
// 以降 cin の入力元が 'input.txt' になる
// std::i... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 739,437 | 739,436 | u913836622 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<long> base(26, -1);
vector<vector<long>> data(s.size() + 1, vector<long>(26, -1));
for (int i = s.size(); i >= 0; i--) {
for (int j = 0; j < 26; j++)
data.at(i).at(j) = base.at(j);
if (i != 0)
bas... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<long> base(26, -1);
vector<vector<long>> data(s.size() + 1, vector<long>(26, -1));
for (int i = s.size(); i >= 0; i--) {
for (int j = 0; j < 26; j++)
data.at(i).at(j) = base.at(j);
if (i != 0)
bas... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,439 | 739,440 | u239087789 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,449 | 739,450 | u942393279 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,451 | 739,450 | u942393279 | cpp |
p02937 | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mod (ll)(1e9 + 7)
#define inf (ll)(3e18 + 7)
#define pi (double)acos(-1)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#defin... | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mod (ll)(1e9 + 7)
#define inf (ll)(3e18 + 7)
#define pi (double)acos(-1)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#defin... | [
"call.function.change"
] | 739,452 | 739,453 | u441250130 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<vector<int>> g;
vector<int> o;
map<int, int> ad;
vector<ll> c;
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> a(26, vector<ll>(0));
rep(i, s.size())... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<vector<int>> g;
vector<int> o;
map<int, int> ad;
vector<ll> c;
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> a(26, vector<ll>(0));
rep(i, s.size())... | [
"expression.unary.arithmetic.add"
] | 739,454 | 739,455 | u945901686 | cpp |
p02937 | #include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long l... | #include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long l... | [
"call.function.change"
] | 739,460 | 739,461 | u114234520 | cpp |
p02937 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(x) (x).begi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(x) (x).begi... | [
"assignment.change",
"expression.operation.binary.remove"
] | 739,464 | 739,465 | u796408111 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pq priority_queue
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long lo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pq priority_queue
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long lo... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,468 | 739,469 | u513211419 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> chr(26);
for (int i = 0; i < s.size(); i++)
chr[s[i] - 'a'].push_back(i);
long long x = 0;
int p = -1;
for (int i = 0; i < t.size(); i++) {
if (chr[t[i] - 'a'].size() == 0) {
cout << "-... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> chr(26);
for (int i = 0; i < s.size(); i++)
chr[s[i] - 'a'].push_back(i);
long long x = 0;
int p = -1;
for (int i = 0; i < t.size(); i++) {
if (chr[t[i] - 'a'].size() == 0) {
cout << "-... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,470 | 739,471 | u507850687 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define erep(i, a, n) for (int i = a; i <= n; i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define erep(i, a, n) for (int i = a; i <= n; i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vect... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"assignment.change",
"expression.operation.binary.remove"
] | 739,474 | 739,475 | u613960672 | cpp |
p02937 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> c[26];
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
s = s + s;
for (int i = 0; i < s.size(); i++) {
c[s[i] - 'a'].push_back(i);
}
for (int i = 0; i < t.size(); i++) {
if (c[t[i] - 'a'].e... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> c[26];
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
s = s + s;
for (int i = 0; i < s.size(); i++) {
c[s[i] - 'a'].push_back(i);
}
for (int i = 0; i < t.size(); i++) {
if (c[t[i] - 'a'].e... | [
"identifier.change",
"call.function.change"
] | 739,483 | 739,484 | u587366956 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
long long int ans = 0, now = 0;
cin >> s;
cin >> t;
vector<vector<long long int>> num(26);
for (int i = 0; i < s.size(); i++) {
num[s[i] - 'a'].push_back(i);
}
if (num[t[0] - 'a'].size() == 0) {
cout << -1 << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
long long int ans = 0, now = 0;
cin >> s;
cin >> t;
vector<vector<long long int>> num(26);
for (int i = 0; i < s.size(); i++) {
num[s[i] - 'a'].push_back(i);
}
if (num[t[0] - 'a'].size() == 0) {
cout << -1 << endl;
r... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 739,489 | 739,490 | u926416331 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
long long int ans = 0, now = 0;
cin >> s;
cin >> t;
vector<vector<long long int>> num(26);
for (int i = 0; i < s.size(); i++) {
num[s[i] - 'a'].push_back(i);
}
if (num[t[0] - 'a'].size() == 0) {
cout << -1 << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
long long int ans = 0, now = 0;
cin >> s;
cin >> t;
vector<vector<long long int>> num(26);
for (int i = 0; i < s.size(); i++) {
num[s[i] - 'a'].push_back(i);
}
if (num[t[0] - 'a'].size() == 0) {
cout << -1 << endl;
r... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"call.arguments.change"
] | 739,491 | 739,490 | u926416331 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
long long a = 0;
string s, t;
cin >> s >> t;
s += s;
vector<vector<int>> m(26), v(26, vector<int>((int)s.size(), -1));
rep(i, s.size()) m[s[i] - 'a'].push_back(i);
rep(i, 26) {
if (m[i].size() == ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
long long a = 0;
string s, t;
cin >> s >> t;
s += s;
vector<vector<int>> m(26), v(26, vector<int>((int)s.size(), -1));
rep(i, s.size()) m[s[i] - 'a'].push_back(i);
rep(i, 26) {
if (m[i].size() == ... | [
"literal.number.change",
"assignment.value.change"
] | 739,492 | 739,493 | u757584836 | cpp |
p02937 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
long long a = 1;
string s, t;
cin >> s >> t;
s += s;
vector<vector<int>> m(26), v(26, vector<int>((int)s.size(), -1));
rep(i, s.size()) m[s[i] - 'a'].push_back(i);
rep(i, 26) {
if (m[i].size() == ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
long long a = 0;
string s, t;
cin >> s >> t;
s += s;
vector<vector<int>> m(26), v(26, vector<int>((int)s.size(), -1));
rep(i, s.size()) m[s[i] - 'a'].push_back(i);
rep(i, 26) {
if (m[i].size() == ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 739,494 | 739,493 | u757584836 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); ++(i))
#define rFOR(i, a, n) for (int(i) = (n)-1; (i) >= (a); --(i))
#define erFOR(i, a, n) fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); ++(i))
#define rFOR(i, a, n) for (int(i) = (n)-1; (i) >= (a); --(i))
#define erFOR(i, a, n) fo... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,495 | 739,496 | u863044225 | cpp |
p02937 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
string s, t;
cin >> s >> t;
vector<vector<int>> pos(26);
for (int i = 0; i < s.size(); i++)
pos[s[i] - 'a'].push_back(i);
for (int i = 0; i < s.size(); i++)
pos[s[i] - 'a'].push_back(i + s.size());
ll ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
string s, t;
cin >> s >> t;
vector<vector<int>> pos(26);
for (int i = 0; i < s.size(); i++)
pos[s[i] - 'a'].push_back(i);
for (int i = 0; i < s.size(); i++)
pos[s[i] - 'a'].push_back(i + s.size());
ll ans = 0;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 739,497 | 739,498 | u180257813 | cpp |
p02937 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define DIV 1000000007
using namespace std;
using ll = long long;
int main(void) {
string s, t;
cin >> ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define DIV 1000000007
using namespace std;
using ll = long long;
int main(void) {
string s, t;
cin >> ... | [
"identifier.change",
"call.function.change"
] | 739,503 | 739,504 | u105100688 | cpp |
p02937 | #include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}... | #include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 739,508 | 739,509 | u468440139 | cpp |
p02937 | #include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}... | #include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,510 | 739,509 | u468440139 | cpp |
p02937 | #include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}... | #include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,511 | 739,509 | u468440139 | cpp |
p02937 | #include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll i, n, q, a, b, ans = 0, now;
char s[100010], t[100010];
vector<ll> vec[26];
scanf("%s%s", s, t);
for (i = 0; s[i]; ++i)
vec[s[i] - 'a'].push_back(i);
n = i;
for (i = 0; t[i]; ++i) ... | #include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll i, n, q, a, b, ans = -1, now;
char s[100010], t[100010];
vector<ll> vec[26];
scanf("%s%s", s, t);
for (i = 0; s[i]; ++i)
vec[s[i] - 'a'].push_back(i);
n = i;
for (i = 0; t[i]; ++i)... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,512 | 739,513 | u440920318 | cpp |
p02937 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)... | [
"expression.operation.binary.remove",
"assignment.change"
] | 739,514 | 739,515 | u828388155 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.