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 8
values |
|---|---|---|---|---|---|---|---|
p03106 | #include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
//# Functions for Vector/Matrix
template <typename T> vector<T> zeros(int length) {
vector<T> vec(length, 0);
return vec;
}
template <typename T> vector<vector<T>> zeros(tuple<int, int> d... | #include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
//# Functions for Vector/Matrix
template <typename T> vector<T> zeros(int length) {
vector<T> vec(length, 0);
return vec;
}
template <typename T> vector<vector<T>> zeros(tuple<int, int> d... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 918,035 | 918,036 | u190076745 | cpp |
p03106 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 918,039 | 918,040 | u566864240 | cpp |
p03106 | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int A, B, K;
scanf("%d%d%d", &A, &B, &K);
int cnt = 0, i;
for (i = 0; i < K; i++) {
do {
cnt++;
} while (A % cnt != 0 || B % cnt != 0);
}
printf("%d", cnt);
puts("");
return 0;
}
| #include <stdio.h>
#include <stdlib.h>
int main(void) {
int A, B, K;
scanf("%d%d%d", &A, &B, &K);
int cnt = A + 1, i;
for (i = 0; i < K; i++) {
do {
cnt--;
} while (A % cnt != 0 || B % cnt != 0);
}
printf("%d", cnt);
puts("");
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove"
] | 918,041 | 918,042 | u792455295 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int cd(int a, int b, int k) {
int count = 0;
int i;
int list[100];
int u = max(a, b);
for (i = 1; i < u; i++) {
if (a % i == 0 && b % i == 0) {
count++;
list[count] = i;
}
}
return list[count - k + 1];
}
int main() {
int a, b, k;
int ... | #include <bits/stdc++.h>
using namespace std;
int cd(int a, int b, int k) {
int count = 0;
int i;
int list[100];
int u = max(a, b);
for (i = 1; i <= u; i++) {
if (a % i == 0 && b % i == 0) {
count++;
list[count] = i;
}
}
return list[count - k + 1];
}
int main() {
int a, b, k;
int... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 918,043 | 918,044 | u637568962 | cpp |
p03106 | #include <stdio.h>
int main() {
long long int A, B, K, D = 0, j;
scanf("%lld%lld%lld", &A, &B, &K);
for (long long int i = 1; D != K; i++) {
if (A % i == 0 && B % i == 0)
D++;
j = i;
}
printf("%lld", j);
return 0;
}
| #include <stdio.h>
int main() {
long long int A, B, K, D = 0, j;
scanf("%lld%lld%lld", &A, &B, &K);
for (long long int i = A; D != K; i--) {
if (A % i == 0 && B % i == 0)
D++;
j = i;
}
printf("%lld", j);
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 918,045 | 918,046 | u910424986 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[100], i, j = 0;
for (i = 1; i <= 100; i++) {
if ((a % i == 0) && (b % i == 0)) {
ans[j++] = i;
}
}
cout << ans[k - 1] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[100], i, j = 0;
for (i = 1; i <= 100; i++) {
if ((a % i == 0) && (b % i == 0)) {
ans[j++] = i;
}
}
cout << ans[j - k] << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 918,058 | 918,059 | u483349999 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[100], i, j = 0;
for (i = 1; i <= 100; i++) {
if ((a % i == 0) && (b % i == 0)) {
ans[j++] = i;
}
}
cout << ans[k - 1];
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[100], i, j = 0;
for (i = 1; i <= 100; i++) {
if ((a % i == 0) && (b % i == 0)) {
ans[j++] = i;
}
}
cout << ans[j - k] << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.newline.add"
] | 918,060 | 918,059 | u483349999 | cpp |
p03106 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define pp pair<ll, pair<ll, ll>>
#define rep(i, a, b) for (ll i = a; i < b; i += 1)
#define all(c) (c).begin(), (c).end()
#... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define pp pair<ll, pair<ll, ll>>
#define rep(i, a, b) for (ll i = a; i < b; i += 1)
#define all(c) (c).begin(), (c).end()
#... | [
"variable_access.subscript.index.change",
"io.output.change",
"call.arguments.add",
"identifier.replace.add",
"literal.replace.remove"
] | 918,061 | 918,062 | u889695981 | cpp |
p03106 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int x;
if (a < b)
x = a;
else
x = b;
vector<int> v;
for (int i = 1; i <= x; i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
cout << v[k - 1] << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int x;
if (a < b)
x = a;
else
x = b;
vector<int> v;
for (int i = 1; i <= x; i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
cout << v[v.size() - k] << endl;
}
| [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 918,063 | 918,064 | u927804708 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int i;
vector<int> aa, bb, common;
for (i = 1; i < a; i++) {
if (a % i == 0)
aa.push_back(i);
}
for (i = 1; i < b; i++) {
if (b % i == 0)
bb.push_back(i);
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int i;
vector<int> aa, bb, common;
for (i = 1; i <= a; i++) {
if (a % i == 0)
aa.push_back(i);
}
for (i = 1; i <= b; i++) {
if (b % i == 0)
bb.push_back(i);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 918,078 | 918,079 | u820315626 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> intersection;
int limit = max(a, b);
for (int i = 1; i < limit; i++) {
if (a % i == 0 && b % i == 0) {
intersection.push_back... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> intersection;
int limit = max(a, b);
for (int i = 1; i <= limit; i++) {
if (a % i == 0 && b % i == 0) {
intersection.push_bac... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 918,089 | 918,090 | u422029490 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
int n = 1;
int m = 1;
cin >> a >> b >> k;
for (int i = 1; i <= a; i++) {
if (a % i == 0 && b % i == 0) {
n = n + 1;
}
}
for (int l = 1; l <= a; l++) {
if (a % l == 0 && b % l == 0) {
if (n - k + 1 == m) {
co... | #include <iostream>
using namespace std;
int main() {
int a, b, k;
int n = 1;
int m = 1;
cin >> a >> b >> k;
for (int i = 1; i <= a; i++) {
if (a % i == 0 && b % i == 0) {
n = n + 1;
}
}
for (int l = 1; l <= a; l++) {
if (a % l == 0 && b % l == 0) {
if (n - k == m) {
cout <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 918,116 | 918,117 | u401817927 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 918,124 | 918,125 | u900306103 | cpp |
p03107 | #include "bits/stdc++.h"
using namespace std;
void solve() {
string S;
cin >> S;
int l = S.size(), z = 0;
for (char c : S) {
z += c == '0';
}
z = min(z, l - z);
cout << l - z * 2 << endl;
}
int main(void) {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
void solve() {
string S;
cin >> S;
int l = S.size(), z = 0;
for (char c : S) {
z += c == '0';
}
z = min(z, l - z);
cout << z * 2 << endl;
}
int main(void) {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 918,126 | 918,127 | u344412812 | cpp |
p03107 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define hi // cerr<<"hi"<<endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1... | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define hi // cerr<<"hi"<<endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 918,132 | 918,133 | u130196064 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
stack<int> st;
int res = 0;
for (int i = 0; i < n; i++) {
if (!st.empty() && st.top() != s[i]) {
res++;
st.pop();
} else
st.push(s[i]);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
stack<int> st;
int res = 0;
for (int i = 0; i < n; i++) {
if (!st.empty() && st.top() != s[i]) {
res += 2;
st.pop();
} else
st.push(s[i]);
}
cout << res << endl;
return 0;
} | [] | 918,138 | 918,139 | u283229916 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define db(x) cout << #x << " = " << (x) << "\n";
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
string s;
cin >> s;
stack<char> st;
int count = 0;
for (int i = 0; i < s.length(); ++i) {
if (!st.emp... | #include <bits/stdc++.h>
using namespace std;
#define db(x) cout << #x << " = " << (x) << "\n";
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
string s;
cin >> s;
stack<char> st;
int count = 0;
for (int i = 0; i < s.length(); ++i) {
if (!st.emp... | [
"call.add"
] | 918,140 | 918,141 | u448203679 | cpp |
p03107 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> void chmax(T &a, T b) {
i... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> void chmax(T &a, T b) {
i... | [
"expression.operation.binary.add"
] | 918,144 | 918,145 | u635484372 | cpp |
p03107 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <sys/time.h>
#include <sys/timeb.h>
#include <time.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ulong unsigned long long int
template <typename T> bool InRange(T t, T l, T r) { return l <= t && t < r; }
int main... | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <sys/time.h>
#include <sys/timeb.h>
#include <time.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ulong unsigned long long int
template <typename T> bool InRange(T t, T l, T r) { return l <= t && t < r; }
int main... | [] | 918,146 | 918,147 | u774845108 | cpp |
p03107 | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
ci... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
ci... | [
"expression.operation.binary.add"
] | 918,148 | 918,149 | u562319622 | cpp |
p03107 | #include <stdio.h>
#include <string.h>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, a = 0, b = 0, c, n, m;
char s[100010];
scanf("%s", s);
n = strlen(s);
for (i = 0; i < n; ++i) {
if (s[i] == '0')
++a;
else
++b;
}
printf("%lld", a < b ? a : b);
return 0;
} | #include <stdio.h>
#include <string.h>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, a = 0, b = 0, c, n, m;
char s[100010];
scanf("%s", s);
n = strlen(s);
for (i = 0; i < n; ++i) {
if (s[i] == '0')
++a;
else
++b;
}
printf("%lld", a < b ? a * 2 : b * 2);
ret... | [
"expression.operation.binary.add"
] | 918,150 | 918,151 | u440920318 | cpp |
p03107 | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 918,152 | 918,153 | u003873207 | cpp |
p03108 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define m... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define m... | [
"control_flow.return.add"
] | 918,178 | 918,179 | u860546679 | cpp |
p03108 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 918,193 | 918,194 | u415325136 | cpp |
p03107 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int num1 = 0, num0 = 0;
string s;
cin >> s;
// cout << atoi(s.cs()) << "\n";
for (int k = 0; k < s.size(); k++) {
if (s[k] - '0' == 1)
num1++;
else if (s[k... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int num1 = 0, num0 = 0;
string s;
cin >> s;
// cout << atoi(s.cs()) << "\n";
for (int k = 0; k < s.size(); k++) {
if (s[k] - '0' == 1)
num1++;
else if (s[k... | [
"expression.operation.binary.add"
] | 918,210 | 918,211 | u217596176 | cpp |
p03107 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typede... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typede... | [
"expression.operation.binary.add"
] | 918,214 | 918,215 | u294531924 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0, count1 = 0, count2 = 0;
string S;
cin >> S;
int N = S.size();
if (N == 0) {
cout << 0 << endl;
} else {
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == '1') {
count1++;
} else
count2++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0, count1 = 0, count2 = 0;
string S;
cin >> S;
int N = S.size();
if (N == 1) {
cout << 0 << endl;
} else {
for (int i = 0; i < N; i++) {
if (S.at(i) == '1') {
count1++;
} else
count2++;
}
coun... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 918,220 | 918,221 | u332840922 | cpp |
p03107 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
for (int i = 1; i < s.length(); i++) {
if (s[i] == '0')
a++;
if (s[i] == '1')
b++;
}
if (a > b)
a = b;
cout << a * 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
a++;
if (s[i] == '1')
b++;
}
if (a > b)
a = b;
cout << a * 2 << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 918,231 | 918,232 | u412025794 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c1 = 0, c0 = 0, ans = 0;
for (int i = 0; i < ((sizeof s) - 1); i++) {
if (s[i] == '1')
c1++;
if (s[i] == '0')
c0++;
}
while (c0 > 0 && c1 > 0) {
ans += 2;
c0--;
c1--;
}
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c1 = 0, c0 = 0, ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
c1++;
if (s[i] == '0')
c0++;
}
while (c0 > 0 && c1 > 0) {
ans += 2;
c0--;
c1--;
}
cout << ans << endl;
retur... | [
"control_flow.loop.for.condition.change"
] | 918,237 | 918,238 | u022832318 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //配列の受け取り
int intpow(int x, int y) {
double a = x, b = y;
return pow(a, b);
} //(x,y) xをy乗する
int intfabs(int x) {
double... | #include <bits/stdc++.h>
using namespace std;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //配列の受け取り
int intpow(int x, int y) {
double a = x, b = y;
return pow(a, b);
} //(x,y) xをy乗する
int intfabs(int x) {
double... | [
"expression.operation.binary.add"
] | 918,241 | 918,242 | u160321725 | cpp |
p03107 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) for (int i = (a); i > (b); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR... | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) for (int i = (a); i > (b); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR... | [
"literal.number.change",
"assignment.value.change"
] | 918,243 | 918,244 | u669551866 | cpp |
p03107 | #include <stdio.h>
int main() {
int n_red = 0, n_blue = 0;
char c;
while (1) {
scanf("%c", &c);
if (c == '0')
n_red++;
else if (c == '1')
n_blue;
else
break;
}
int ans = n_red > n_blue ? 2 * n_blue : 2 * n_red;
printf("%d", ans);
return 0;
} | #include <stdio.h>
int main() {
int n_red = 0, n_blue = 0;
char c;
while (1) {
scanf("%c", &c);
if (c == '0')
n_red++;
else if (c == '1')
n_blue++;
else
break;
}
int ans = n_red > n_blue ? 2 * n_blue : 2 * n_red;
printf("%d", ans);
return 0;
} | [] | 918,245 | 918,246 | u735008991 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, n = s.size();
stack<char> st;
for (int i = 0; i < n; i++) {
if (st.empty())
st.push(s[i]);
else {
if (st.top() != s[i]) {
ans++;
st.pop();
} else
st.push(s[i]);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, n = s.size();
stack<char> st;
for (int i = 0; i < n; i++) {
if (st.empty())
st.push(s[i]);
else {
if (st.top() != s[i]) {
ans++;
st.pop();
} else
st.push(s[i]);
}
... | [
"expression.operation.binary.add"
] | 918,251 | 918,252 | u401775402 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
vector<int> a;
for (int i = 0; i < s.size(); i++) {
a.push_back(s[i] - '0');
while (a.size() > 1 && abs(a[a.size() - 1] - a[a.size() - 2]) > 0)
a.erase(a.begin() + a.size() - 1), a.erase(a.begin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
vector<int> a;
for (int i = 0; i < s.size(); i++) {
a.push_back(s[i] - '0');
while (a.size() > 1 && abs(a[a.size() - 1] - a[a.size() - 2]) > 0)
a.erase(a.begin() + a.size() - 1), a.erase(a.begin... | [
"expression.operation.binary.add"
] | 918,257 | 918,258 | u036561304 | cpp |
p03107 | //
// Created by 永徳泰明 on 2019-03-03.
//
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fill(x, y) memset(x, y, sizeof(x))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const i... | //
// Created by 永徳泰明 on 2019-03-03.
//
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fill(x, y) memset(x, y, sizeof(x))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const i... | [
"variable_declaration.value.change"
] | 918,264 | 918,265 | u779937111 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N0 = 0, N1 = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == '0')
N0++;
else
N1++;
}
cout << min(N0, N1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N0 = 0, N1 = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == '0')
N0++;
else
N1++;
}
cout << 2 * min(N0, N1) << endl;
} | [
"expression.operation.binary.add"
] | 918,268 | 918,269 | u017271745 | cpp |
p03107 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 918,270 | 918,271 | u978036461 | cpp |
p03107 | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
int c0 = 0;
int c1 = 1;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (stoi(s.substr(i, 1)) == 1) {
c1++;
} else {
c0++;
}... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
int c0 = 0;
int c1 = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (stoi(s.substr(i, 1)) == 1) {
c1++;
} else {
c0++;
}... | [
"literal.number.change",
"variable_declaration.value.change"
] | 918,278 | 918,279 | u347588083 | cpp |
p03107 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stack>
#include <string>
int main() {
std ::string Str;
std ::cin >> Str;
int Len = Str.size(), Ans = 0;
std ::stack<int> Stack;
Stack.push(Str[0] - '0');
for (int i = 1; i < Len; i++) {
int Now = Str[i] - '0';
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stack>
#include <string>
int main() {
std ::string Str;
std ::cin >> Str;
int Len = Str.size(), Ans = 0;
std ::stack<int> Stack;
Stack.push(Str[0] - '0');
for (int i = 1; i < Len; i++) {
int Now = Str[i] - '0';
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 918,282 | 918,283 | u317481056 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
//しょっぱなやばい、とけなそう感･･･
//方針たたんな
//最後から見るか。
//連結数はN(N-1)/2。最後は-1;
//毎回すべての連結確認する、はむりむり
// 1[2,3,,,10] 2[3,4,,,10] 3[4,5,,,10]みたいな
//和を足せばいい？
//んなことないか。1-2,1-3,2-3で1-2きれても3連結
//孤立した島の積をとるか
// 1-2-3,4-5-6だったら3*3=9がだめ 3+3+3
// 1,2,3,4,5だったら？5*4/2 4+4+4+4+4)/... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
//しょっぱなやばい、とけなそう感･･･
//方針たたんな
//最後から見るか。
//連結数はN(N-1)/2。最後は-1;
//毎回すべての連結確認する、はむりむり
// 1[2,3,,,10] 2[3,4,,,10] 3[4,5,,,10]みたいな
//和を足せばいい？
//んなことないか。1-2,1-3,2-3で1-2きれても3連結
//孤立した島の積をとるか
// 1-2-3,4-5-6だったら3*3=9がだめ 3+3+3
// 1,2,3,4,5だったら？5*4/2 4+4+4+4+4)/... | [
"control_flow.return.add"
] | 918,407 | 918,410 | u071282706 | cpp |
p03108 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
#define ve vector
const int INF = 1000000007;
typedef long lo... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
#define ve vector
const int INF = 1000000007;
typedef long lo... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 918,435 | 918,438 | u820341516 | cpp |
p03108 | #include <bits/stdc++.h>
#define MAXN 100005
using namespace std;
long long fa[MAXN], a[MAXN], b[MAXN], cnt[MAXN], ans[MAXN];
long long find1(long long v) { return fa[v] = fa[v] == v ? v : find1(fa[v]); }
void merge1(long long x, long long y) {
fa[x] = y;
cnt[x] += cnt[y];
}
int main() {
long long n, m;
cin >>... | #include <bits/stdc++.h>
#define MAXN 100005
using namespace std;
long long fa[MAXN], a[MAXN], b[MAXN], cnt[MAXN], ans[MAXN];
long long find1(long long v) { return fa[v] = fa[v] == v ? v : find1(fa[v]); }
void merge1(long long x, long long y) {
fa[x] = y;
cnt[y] += cnt[x];
}
int main() {
long long n, m;
cin >>... | [
"assignment.change"
] | 918,460 | 918,461 | u959625800 | cpp |
p03108 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
struct union_find {
union_find(int n) {
for (int i = 0; i <= n; i++) {
par.push_back(i);
rank.push_back(0);
size.push_back(1);
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = fi... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
struct union_find {
union_find(int n) {
for (int i = 0; i <= n; i++) {
par.push_back(i);
rank.push_back(0);
size.push_back(1);
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = fi... | [
"call.arguments.change"
] | 918,515 | 918,517 | u119098168 | cpp |
p03108 | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define FORe(i, k, n) for (int i = (k); i <= (n); i++)
#define FORr(i, k, n) for (int i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (int i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ... | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define FORe(i, k, n) for (int i = (k); i <= (n); i++)
#define FORr(i, k, n) for (int i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (int i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 918,605 | 918,603 | u961136005 | cpp |
p03108 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | [] | 918,632 | 918,634 | u103850114 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
struct unionFind {
vector<int> par;
vector<long> count;
unionFind(int n) : par(n) {
for (int i = 0; i < n; i++)
par[i] = i;
count.resize(n);
for (int i = 0; i < n; i++)
count[i] = 1;
}
int find(int x) {
if (par[x] == x)
return x... | #include <bits/stdc++.h>
using namespace std;
struct unionFind {
vector<int> par;
vector<long> count;
unionFind(int n) : par(n) {
for (int i = 0; i < n; i++)
par[i] = i;
count.resize(n);
for (int i = 0; i < n; i++)
count[i] = 1;
}
int find(int x) {
if (par[x] == x)
return x... | [] | 918,650 | 918,652 | u523698212 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
ll inf = LLONG_MAX;
long double pi = M_PI;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
ll inf = LLONG_MAX;
long double pi = M_PI;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 918,656 | 918,658 | u071019032 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
class DisjointSet {
public:
vector<int> p;
DisjointSet(int n) { p = vector<int>(n, -1); }
int root(int x) {
if (p[x] < 0)
return x;
p[x] = root(p[x]);
return p[x];
}
int size(int x) { return -p[root(x)]; }
bool connect(int x, int y) {
... | #include <bits/stdc++.h>
using namespace std;
class DisjointSet {
public:
vector<int> p;
DisjointSet(int n) { p = vector<int>(n, -1); }
int root(int x) {
if (p[x] < 0)
return x;
p[x] = root(p[x]);
return p[x];
}
int size(int x) { return -p[root(x)]; }
bool connect(int x, int y) {
... | [
"assignment.change"
] | 918,761 | 918,762 | u142234618 | cpp |
p03108 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
ll MOD = 1000000007;
// a^p
// 2^3 = 2 * 2^2
// 2^2 = 2 * (2^1)
// 2^1 = 2
ll modpow(ll a, ll p, ll mod) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
ll MOD = 1000000007;
// a^p
// 2^3 = 2 * 2^2
// 2^2 = 2 * (2^1)
// 2^1 = 2
ll modpow(ll a, ll p, ll mod) {
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 918,770 | 918,771 | u237620737 | cpp |
p03108 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
class UnionFind {
public:
// 親の番号を格納。ルートだった場合は-(その集合のサイズ)
vector<ll> parents;
UnionFind(ll N) { paren... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
class UnionFind {
public:
// 親の番号を格納。ルートだった場合は-(その集合のサイズ)
vector<ll> parents;
UnionFind(ll N) { paren... | [
"control_flow.branch.if.condition.change"
] | 918,772 | 918,773 | u237620737 | cpp |
p03108 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
class UnionFind {
public:
// 親の番号を格納。ルートだった場合は-(その集合のサイズ)
vector<ll> parents;
UnionFind(ll N) { paren... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
class UnionFind {
public:
// 親の番号を格納。ルートだった場合は-(その集合のサイズ)
vector<ll> parents;
UnionFind(ll N) { paren... | [
"control_flow.branch.if.condition.change"
] | 918,774 | 918,773 | u237620737 | cpp |
p03108 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
class UnionFind {
public:
// 親の番号を格納。ルートだった場合は-(その集合のサイズ)
vector<ll> parents;
UnionFind(ll N) { paren... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
class UnionFind {
public:
// 親の番号を格納。ルートだった場合は-(その集合のサイズ)
vector<ll> parents;
UnionFind(ll N) { paren... | [
"control_flow.branch.if.condition.change"
] | 918,775 | 918,773 | u237620737 | cpp |
p03108 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
class UnionFind {
public:
// 親の番号を格納。ルートだった場合は-(その集合のサイズ)
vector<ll> parents;
UnionFind(ll N) { paren... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
class UnionFind {
public:
// 親の番号を格納。ルートだった場合は-(その集合のサイズ)
vector<ll> parents;
UnionFind(ll N) { paren... | [
"assignment.value.change",
"assignment.change"
] | 918,776 | 918,777 | u237620737 | cpp |
p03108 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
class UnionFind {
public:
// 親の番号を格納。ルートだった場合は-(その集合のサイズ)
vector<ll> parents;
UnionFind(ll N) { paren... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
class UnionFind {
public:
// 親の番号を格納。ルートだった場合は-(その集合のサイズ)
vector<ll> parents;
UnionFind(ll N) { paren... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 918,775 | 918,777 | u237620737 | cpp |
p03108 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
class UnionFind {
public:
vector<int> Parent;
UnionFind(int n) { Parent = vector<int>(n, -1); }
int root(int a) {
if (Parent[a] < 0)
return a;
return Parent[a] = root(Parent[a]);
}
int size(int a) { return -Par... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
class UnionFind {
public:
vector<int> Parent;
UnionFind(int n) { Parent = vector<int>(n, -1); }
int root(int a) {
if (Parent[a] < 0)
return a;
return Parent[a] = root(Parent[a]);
}
int size(int a) { return -Par... | [
"expression.operation.binary.remove"
] | 918,790 | 918,791 | u633402865 | cpp |
p03108 | #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.branch.if.condition.change"
] | 918,333 | 918,334 | u284045566 | cpp |
p03108 | #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.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 918,335 | 918,334 | u284045566 | cpp |
p03108 | #include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 1e5;
struc... | #include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 1e5;
struc... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 918,375 | 918,376 | u595984176 | cpp |
p03108 | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | [] | 918,381 | 918,383 | u714564133 | cpp |
p03108 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 918,390 | 918,396 | u863537799 | cpp |
p03108 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 918,400 | 918,396 | u863537799 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct union_find {
vector<int> par;
union_find(int n) : par(n, -1) {}
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool unite(int x, int y) {
int rx = root(x);
int ry = root... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct union_find {
vector<int> par;
union_find(int n) : par(n, -1) {}
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool unite(int x, int y) {
int rx = root(x);
int ry = root... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 918,411 | 918,412 | u646962247 | cpp |
p03108 | #include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = v... | #include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = v... | [
"assignment.change"
] | 918,528 | 918,530 | u518042385 | cpp |
p03108 | #define _USE_MATH_DEFINES
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <complex>
#include <iterator>
#include <sstream>
#include <bitset>
#include <cstring>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <set>
... | #define _USE_MATH_DEFINES
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <complex>
#include <iterator>
#include <sstream>
#include <bitset>
#include <cstring>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <set>
... | [
"variable_declaration.type.change"
] | 918,540 | 918,537 | u870307668 | cpp |
p03108 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int MAX_N = 100010;
int par[MAX_N];
int rnk[MAX_N];
void init(int n) {
rep(i, n) {
par[i] = i;
rnk[i] = 0;
}
}
int find(int x) {
if (par[x] == x) {
return x;
} else {
retur... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int MAX_N = 100010;
int par[MAX_N];
int rnk[MAX_N];
void init(int n) {
rep(i, n) {
par[i] = i;
rnk[i] = 0;
}
}
int find(int x) {
if (par[x] == x) {
return x;
} else {
retur... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 918,587 | 918,586 | u555962250 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp ... | [
"call.remove"
] | 918,647 | 918,651 | u395620499 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 918,690 | 918,692 | u160429264 | cpp |
p03108 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
#pragma region UnionFind
struct UnionFind {
vector<int> p... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
#pragma region UnionFind
struct UnionFind {
vector<int> p... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 918,701 | 918,700 | u521389909 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<long> p;
vector<long> w;
UnionFind(long n) {
p.resize(n + 1);
w.resize(n + 1, 1);
for (long i = 1; i <= n; i++)
p[i] = i;
}
long find(long x) {
if (p[x] == x)
return x;
return p[x] = find(p[x]);
}
void... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<long> p;
vector<long> w;
UnionFind(long n) {
p.resize(n + 1);
w.resize(n + 1, 1);
for (long i = 1; i <= n; i++)
p[i] = i;
}
long find(long x) {
if (p[x] == x)
return x;
return p[x] = find(p[x]);
}
void... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 918,971 | 918,972 | u792720861 | cpp |
p03108 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 918,983 | 918,982 | u688789047 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define INF (i64)(1e18)
#define MOD (i64)(1e9 + 7)
#define REP(i, n) for (i64 i = 0; i < (n); i++)
#define RREP(i, n) for (i64 i = (n)-1; i >= 0; i--)
#define RANGE(i, a, b) for (i64 i = (a); i < (b); i++)
#define RRANGE(i, a, b) for (i64 i = (b)-... | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define INF (i64)(1e18)
#define MOD (i64)(1e9 + 7)
#define REP(i, n) for (i64 i = 0; i < (n); i++)
#define RREP(i, n) for (i64 i = (n)-1; i >= 0; i--)
#define RANGE(i, a, b) for (i64 i = (a); i < (b); i++)
#define RRANGE(i, a, b) for (i64 i = (b)-... | [] | 919,016 | 919,017 | u880126159 | cpp |
p03108 | #include <iostream>
#include <vector>
using namespace std;
struct UnionFind {
vector<long long> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(long long N) : par(N) { //最初は全てが根であるとして初期化
for (long long i = 0; i < N; i++)
par[i] = i;
}
long long root(
long long x) { // データxが属する木の根を再帰で得る... | #include <iostream>
#include <vector>
using namespace std;
struct UnionFind {
vector<long long> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(long long N) : par(N) { //最初は全てが根であるとして初期化
for (long long i = 0; i < N; i++)
par[i] = i;
}
long long root(
long long x) { // データxが属する木の根を再帰で得る... | [
"expression.operation.binary.remove"
] | 919,061 | 919,062 | u868132236 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct UnionFind {
vector<ll> rnk, par, num;
UnionFind(ll N) : rnk(N), par(N), num(N) { init(); }
void init() {
for (ll i = 0; i < rnk.size(); i++) {
rnk[i] = 0;
par[i] = i;
num[i] = 1;
}
}
ll find(ll x) {
if (p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct UnionFind {
vector<ll> rnk, par, num;
UnionFind(ll N) : rnk(N), par(N), num(N) { init(); }
void init() {
for (ll i = 0; i < rnk.size(); i++) {
rnk[i] = 0;
par[i] = i;
num[i] = 1;
}
}
ll find(ll x) {
if (p... | [
"literal.string.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 919,108 | 919,109 | u265359795 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
const int MAX_V = 100000;
int par[MAX_V];
int depth[MAX_V];
int num[MAX_V];
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
depth[i] = 0;
num[i] = 1;
}
}
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x... | #include <bits/stdc++.h>
using namespace std;
const int MAX_V = 100000;
int par[MAX_V];
int depth[MAX_V];
int num[MAX_V];
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
depth[i] = 0;
num[i] = 1;
}
}
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 919,203 | 919,204 | u465233477 | cpp |
p03108 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
... | [
"expression.operation.binary.remove"
] | 919,242 | 919,243 | u135572611 | cpp |
p03108 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
... | [
"expression.operation.binary.remove"
] | 919,242 | 919,245 | u135572611 | cpp |
p03108 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.remove",
"call.arguments.add"
] | 919,246 | 919,245 | u135572611 | cpp |
p03108 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef unsigned char UINT8;
typedef short SINT16;
typedef unsigned short UINT16;
typedef int SINT32;
typedef unsigned int ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef unsigned char UINT8;
typedef short SINT16;
typedef unsigned short UINT16;
typedef int SINT32;
typedef unsigned int ... | [
"assignment.change"
] | 919,356 | 919,357 | u824905100 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
#define CIN(T, x) \
T x; \
cin >> x;
#define CINS(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
#define CIN(T, x) \
T x; \
cin >> x;
#define CINS(... | [
"variable_declaration.type.change",
"literal.number.change"
] | 919,377 | 919,376 | u339233484 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
const int V;
// par[x] := xのroot
vector<int> par;
// sz[x] := xを含む集合のサイズ
vector<int> sz;
UnionFind(const int V) : V(V), par(vector<int>(V)), sz(vector<int>(V, 1)) {
for (int i = 0; i < V; ++i)
par[i] = i;
}
bool unite(int x, int... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
const int V;
// par[x] := xのroot
vector<int> par;
// sz[x] := xを含む集合のサイズ
vector<int> sz;
UnionFind(const int V) : V(V), par(vector<int>(V)), sz(vector<int>(V, 1)) {
for (int i = 0; i < V; ++i)
par[i] = i;
}
bool unite(int x, int... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 919,390 | 919,391 | u918753189 | cpp |
p03108 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 919,408 | 919,409 | u633284019 | cpp |
p03108 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 919,479 | 919,480 | u406225550 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define FORRE(i, a, b) for (int i = (b); i >= (a); --i)
#define rep(i, n) for (ll i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define FORRE(i, a, b) for (int i = (b); i >= (a); --i)
#define rep(i, n) for (ll i... | [
"call.remove",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 919,493 | 919,494 | u995997203 | cpp |
p03108 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | [
"control_flow.branch.if.condition.change"
] | 919,554 | 919,555 | u239493918 | cpp |
p03108 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
struct UnionFind {
int *par;
ll *size;
UnionFind(int n) {
par = (int *)malloc(sizeof(int) * n);
s... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
struct UnionFind {
int *par;
ll *size;
UnionFind(int n) {
par = (int *)malloc(sizeof(int) * n);
s... | [
"expression.operation.binary.remove"
] | 919,610 | 919,611 | u582848517 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define DO {
#define END }
typedef long long ll;
#define MAXN 100000
ll f[MAXN];
ll weighted[MAXN];
ll init() {
REP(i, MAXN) {
f[i] = i;
weighted[i] = 1;
}
}
ll ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define DO {
#define END }
typedef long long ll;
#define MAXN 100000
ll f[MAXN];
ll weighted[MAXN];
ll init() {
REP(i, MAXN) {
f[i] = i;
weighted[i] = 1;
}
}
ll ... | [
"variable_declaration.name.change",
"identifier.change"
] | 919,653 | 919,654 | u786318703 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
#define INT(a) scanf("%d", &a)
#define STR(a) scanf("%s", a)
#define DBL(a) scanf("%lf", &a)
#define LNG(a) scanf("%lld", &a)
#define PI acos(-1)
#define MX 100005
int u[MX], v[MX];
long long ans[MX];
long long cur;
struct UF {
int root[MX], SZ[MX];
UF() {}
UF(int n... | #include <bits/stdc++.h>
using namespace std;
#define INT(a) scanf("%d", &a)
#define STR(a) scanf("%s", a)
#define DBL(a) scanf("%lf", &a)
#define LNG(a) scanf("%lld", &a)
#define PI acos(-1)
#define MX 100005
int u[MX], v[MX];
long long ans[MX];
long long cur;
struct UF {
int root[MX], SZ[MX];
UF() {}
UF(int n... | [
"literal.number.type.widen.change"
] | 919,673 | 919,674 | u402651318 | cpp |
p03108 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<ll, P> P1;
#define fr first
#define sc... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<ll, P> P1;
#define fr first
#define sc... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 919,776 | 919,777 | u245366924 | cpp |
p03108 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | [] | 919,778 | 919,779 | u574045761 | cpp |
p03108 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"function.return_value.change",
"call.arguments.add"
] | 919,780 | 919,779 | u574045761 | cpp |
p03108 | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<int, int>
#... | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<int, int>
#... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 919,791 | 919,792 | u977365687 | cpp |
p03108 | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) {... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) {... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"call.add"
] | 919,816 | 919,817 | u526532903 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
... | [
"call.arguments.change"
] | 919,854 | 919,855 | u943094398 | cpp |
p03108 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class UnionFind {
public:
vector<int> par;
UnionFind(int N) { par = vector<int>(N, -1); }
int root(int x) {
if (par[x] < 0)
return x;
return par[x] = root(par[x]);
}
int size(int x) { return -par[r... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class UnionFind {
public:
vector<int> par;
UnionFind(int N) { par = vector<int>(N, -1); }
int root(int x) {
if (par[x] < 0)
return x;
return par[x] = root(par[x]);
}
int size(int x) { return -par... | [] | 919,881 | 919,882 | u798944838 | cpp |
p03108 | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX_N = 100, MAX_M = 10e2;
struct UnionFind { // MAX_N定義必要要素数
int Par[MAX_N]; //親は"-子供(自分含め)"を所持
int N;
UnionFind(int n) {
N = n;
for (int i = 0; i < N; i++)
Par[i] = -1;
}
bool unite(int a, int b) {
int par_a =... | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX_N = 10e5, MAX_M = 10e5;
struct UnionFind { // MAX_N定義必要要素数
int Par[MAX_N]; //親は"-子供(自分含め)"を所持
int N;
UnionFind(int n) {
N = n;
for (int i = 0; i < N; i++)
Par[i] = -1;
}
bool unite(int a, int b) {
int par_a ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 919,885 | 919,886 | u174265495 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m > 4)
cout << "TBT" << endl;
else
cout << "Heisei" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m > 4)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 919,924 | 919,925 | u995732479 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
char s[10];
cin >> s;
if (s[5] == 0 && s[6] <= '4')
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | #include <iostream>
using namespace std;
int main() {
char s[10];
cin >> s;
if (s[5] == '0' && s[6] <= '4')
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 919,926 | 919,927 | u043707543 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s > "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 919,942 | 919,943 | u758405447 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int Y = 0, M = 0;
for (int i = 0; i < 4; i++) {
Y *= 10;
Y += S[i] - '0';
}
for (int i = 4; i < 7; i++) {
M *= 10;
M += S[i] - '0';
}
if (Y < 2019) {
cout << "Heisei" << endl;
} else if (M < 5 && Y == 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int Y = 0, M = 0;
for (int i = 0; i < 4; i++) {
Y *= 10;
Y += S[i] - '0';
}
for (int i = 5; i < 7; i++) {
M *= 10;
M += S[i] - '0';
}
if (Y < 2019) {
cout << "Heisei" << endl;
} else if (M < 5 && Y == 2... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 919,958 | 919,959 | u158290747 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep0(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;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main() {
string S;
cin >> S;
int year = atoi(S.... | #include <bits/stdc++.h>
#define rep0(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;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main() {
string S;
cin >> S;
int year = atoi(S.... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 919,985 | 919,986 | u290292036 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.