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 |
|---|---|---|---|---|---|---|---|
p03079 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int A, B, C;
std::cin >> A >> B >> C;
if (A == B == C)
std::cout << "Yes" << '\n';
else
std::cout << "No" << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int A, B, C;
std::cin >> A >> B >> C;
if (A == B && B == C)
std::cout << "Yes" << '\n';
else
std::cout << "No" << '\n';
}
| [
"control_flow.branch.if.condition.change"
] | 895,197 | 895,198 | u720829795 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i < n; ++i)
#define fore(i, a) for (auto &i : a)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto it... | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i < n; ++i)
#define fore(i, a) for (auto &i : a)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto it... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 895,199 | 895,200 | u943004959 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,201 | 895,202 | u633497951 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a == b) && (b == c)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a == b) && (b == c)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,203 | 895,204 | u421240979 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a == b) && (b == c)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,205 | 895,204 | u421240979 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 895,207 | 895,208 | u205606491 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 895,209 | 895,208 | u205606491 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 895,210 | 895,208 | u205606491 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
}
else {
cout << " No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 895,212 | 895,208 | u205606491 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 895,213 | 895,208 | u205606491 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
char a, b, c;
int main() {
cin >> a >> b >> c;
if (a == b && b == c && c == a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int a, b, c;
int main() {
cin >> a >> b >> c;
if (a == b && b == c && c == a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 895,214 | 895,215 | u394482932 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
char a, b, c;
int main() {
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int a, b, c;
int main() {
cin >> a >> b >> c;
if (a == b && b == c && c == a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change"
] | 895,216 | 895,215 | u394482932 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a == b) && (b == c)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a == b) && (b == c)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,219 | 895,220 | u203927510 | cpp |
p03079 | #include <bits/stdc++.h>
#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 fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
using ... | #include <bits/stdc++.h>
#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 fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
using ... | [
"control_flow.branch.if.condition.change"
] | 895,221 | 895,222 | u430494842 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,223 | 895,224 | u561001859 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
string s = (a == b && b == c && a == c) ? "YES" : "NO";
cout << s << '\n';
return 0;
}
| #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
string s = (a == b && b == c && a == c) ? "Yes" : "No";
cout << s << '\n';
return 0;
}
| [
"literal.string.change",
"literal.string.case.change"
] | 895,225 | 895,226 | u244459371 | cpp |
p03079 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstddef>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstddef>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | [
"literal.string.change",
"io.output.change"
] | 895,227 | 895,228 | u076865901 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b =... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b =... | [
"control_flow.branch.else.add"
] | 895,231 | 895,232 | u114234520 | cpp |
p03079 | #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) // vec.size()がnの時等の高速化
#define all(x) (x).begin(), (x).end()
#define SORT(v, n) sort(v, v + n);
#def... | #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) // vec.size()がnの時等の高速化
#define all(x) (x).begin(), (x).end()
#define SORT(v, n) sort(v, v + n);
#def... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,233 | 895,234 | u432998668 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define HOST
#ifdef HOST
#include "common_algorithm.h"
#include "data_structure.h"
#endif
ll inf = 1e9 + 7;
template <typename T> vector<vector<T>> input_graph(T array_num, T edge_num) {
static_assert(is_same<T, int>::value || is_same<T, ll>::va... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define HOST
#ifdef HOST
#include "common_algorithm.h"
#include "data_structure.h"
#endif
ll inf = 1e9 + 7;
template <typename T> vector<vector<T>> input_graph(T array_num, T edge_num) {
static_assert(is_same<T, int>::value || is_same<T, ll>::va... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,244 | 895,245 | u958897332 | cpp |
p03079 | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#... | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 895,250 | 895,251 | u269175074 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 895,258 | 895,259 | u570417673 | cpp |
p03079 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll A, B, C;
cin >> A >> B >> C;
cout << (A == B && B == C ? "YES" : "NO") << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll A, B, C;
cin >> A >> B >> C;
cout << (A == B && B == C ? "Yes" : "No") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,262 | 895,263 | u456065785 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
#define vvint(vec, n, m, l) \
vector<vector<int>> vec(n, vector<int>(m... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
#define vvint(vec, n, m, l) \
vector<vector<int>> vec(n, vector<int>(m... | [
"control_flow.branch.if.condition.change"
] | 895,264 | 895,265 | u776194115 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<string> VS;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int A, B, C;
cin >> A >> B >> C;
... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<string> VS;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int A, B, C;
cin >> A >> B >> C;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,268 | 895,269 | u594140666 | cpp |
p03079 | #include <cstdio>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
puts(a == b && b == c ? "YES" : "NO");
}
| #include <cstdio>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
puts(a == b && b == c ? "Yes" : "No");
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 895,271 | 895,272 | u127130661 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define mp make_pair
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define MOD 1000000007
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c)
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define mp make_pair
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define MOD 1000000007
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
... | [
"control_flow.branch.if.condition.change"
] | 895,273 | 895,274 | u522548464 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
using int_ = int;
#define int int_least64_t
int_ main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
vector<int> v;
copy_n(istream_iterator<int>(cin), 3, back_inserter(v));
if (v[0] == v[1] && v[1] == v[2])
cout << "yes\n";
else
cout << "no\n";
... | #include <bits/stdc++.h>
using namespace std;
using int_ = int;
#define int int_least64_t
int_ main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
vector<int> v;
copy_n(istream_iterator<int>(cin), 3, back_inserter(v));
if (v[0] == v[1] && v[1] == v[2])
cout << "Yes\n";
else
cout << "No\n";
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,275 | 895,276 | u246488512 | cpp |
p03079 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && c == a) {
cout << "Yes\n";
}
{ cout << "No\n"; }
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && c == a) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 895,277 | 895,278 | u544397444 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,281 | 895,282 | u774144672 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,285 | 895,286 | u221119670 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,308 | 895,309 | u058186113 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,326 | 895,327 | u749027673 | cpp |
p03079 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "yes";
} else {
cout << "no";
}
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes";
} else {
cout << "No";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,328 | 895,329 | u170179411 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
;
}
}
| [
"control_flow.branch.if.condition.change"
] | 895,336 | 895,337 | u688825490 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,338 | 895,339 | u066647962 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == b && b == c)
printf("yes");
else
printf("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == b && b == c)
printf("Yes");
else
printf("No");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 895,343 | 895,344 | u356929542 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a, b, c;
if (a == b && a == c) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && a == c) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| [] | 895,359 | 895,360 | u979163294 | cpp |
p03079 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <map>
#include <string>
#include <vector>
int main(void) {
char a, b, c;
std::cin >> a >> b >> c;
std::cout << ((a == b && a == c) ? "Yes" : "No") << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <map>
#include <string>
#include <vector>
int main(void) {
int64_t a, b, c;
std::cin >> a >> b >> c;
std::cout << ((a == b && a == c) ? "Yes" : "No") << std::endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 895,363 | 895,364 | u100280611 | cpp |
p03079 | #include <algorithm>
#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); (i)++)
typedef long long ll;
int mai... | #include <algorithm>
#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); (i)++)
typedef long long ll;
int mai... | [
"control_flow.branch.if.condition.change"
] | 895,373 | 895,374 | u917282863 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b || b == c || a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,378 | 895,379 | u737063309 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b || b == c || a == c) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,380 | 895,379 | u737063309 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A == B) && (B == C)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A == B) && (B == C)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,387 | 895,388 | u552847961 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == 1)
cout << "No" << endl;
else if (A == B || B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == 1)
cout << "No" << endl;
else if (A == B && B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,389 | 895,390 | u926089862 | cpp |
p03079 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == b && b == c) {
printf("Yas\n");
} else {
printf("No\n");
}
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == b && b == c) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 895,401 | 895,402 | u165974862 | cpp |
p03079 | #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
uint8_t A, B, C;
cin >> A >> B >> C;
uint8_t res = 0;
if (A == B) {
if (B == C) {
if (C == A) {
cout << "Yes" << endl;
res = 1;
}
}
}
if (!res)
cout << "No" << endl;
return 0;
}
| #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
uint32_t A, B, C;
cin >> A >> B >> C;
uint8_t res = 0;
if (A == B) {
if (B == C) {
if (C == A) {
cout << "Yes" << endl;
res = 1;
}
}
}
if (!res)
cout << "No" << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 895,417 | 895,418 | u846796522 | cpp |
p03079 | #include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T = int> T in() {
T temp;
cin >> temp;
return temp;
}
int main() {
int A(in()), B(in()), C(in());
string ans = (A == B && B == C) ? "Yew" : "No";
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T = int> T in() {
T temp;
cin >> temp;
return temp;
}
int main() {
int A(in()), B(in()), C(in());
string ans = (A == B && B == C) ? "Yes" : "No";
cout << ans << endl;
return 0;
}
| [
"literal.string.change"
] | 895,425 | 895,426 | u074059110 | cpp |
p03079 | #include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T = int> T in() {
T temp;
cin >> temp;
return temp;
}
int main() {
int A(in()), B(in()), C(in());
string ans = (A == B && B == C) ? "YES" : "NO";
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T = int> T in() {
T temp;
cin >> temp;
return temp;
}
int main() {
int A(in()), B(in()), C(in());
string ans = (A == B && B == C) ? "Yes" : "No";
cout << ans << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change"
] | 895,427 | 895,426 | u074059110 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,428 | 895,429 | u974931918 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,430 | 895,429 | u974931918 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << 'Yes';
} else {
cout << 'No';
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes";
} else {
cout << "No";
}
} | [
"literal.string.change",
"io.output.change"
] | 895,431 | 895,432 | u709810602 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A == B) || (B == C))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A == B) && (B == C))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,439 | 895,440 | u136160424 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A == B) && (B == C))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 895,441 | 895,440 | u136160424 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 895,442 | 895,443 | u930201172 | cpp |
p03078 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> A(x);
vector<long long> B(y);
vector<long long> C(z);
f... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> A(x);
vector<long long> B(y);
vector<long long> C(z);
f... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 895,444 | 895,445 | u845620905 | cpp |
p03078 | #include <algorithm>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef int64_t SI;
typedef uint64_t UI;
void read(SI &N, vector<SI> &V) {
cin >> N;
V.resize(N);
for (size_t i = 0; i < N; i++) {
SI x;
cin >> x;
V[i] = x;
}
}
int... | #include <algorithm>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef int64_t SI;
typedef uint64_t UI;
void read(SI &N, vector<SI> &V) {
cin >> N;
V.resize(N);
for (size_t i = 0; i < N; i++) {
SI x;
cin >> x;
V[i] = x;
}
}
int... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 895,475 | 895,476 | u842192201 | cpp |
p03078 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
const int MOD... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
const int MOD... | [] | 895,486 | 895,487 | u824337972 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
#define LL long long
int a, b, c;
int K;
int A[maxn], B[maxn], C[maxn];
LL AB[maxn * maxn];
priority_queue<pair<LL, pair<int, int>>> pq;
void work() {
cin >> a >> b >> c >> K;
for (int i = 0; i < a; i++)
cin >> A[i];
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
#define LL long long
int a, b, c;
int K;
LL A[maxn], B[maxn], C[maxn];
LL AB[maxn * maxn];
priority_queue<pair<LL, pair<int, int>>> pq;
void work() {
cin >> a >> b >> c >> K;
for (int i = 0; i < a; i++)
cin >> A[i];
for (int i = 0; i ... | [
"variable_declaration.type.change"
] | 895,492 | 895,493 | u154574371 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
#define LL long long
int a, b, c;
int K;
int A[maxn], B[maxn], C[maxn];
LL AB[maxn * maxn];
priority_queue<pair<LL, pair<int, int>>> pq;
void work() {
cin >> a >> b >> c >> K;
for (int i = 0; i < a; i++)
cin >> A[i];
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
#define LL long long
int a, b, c;
int K;
LL A[maxn], B[maxn], C[maxn];
LL AB[maxn * maxn];
priority_queue<pair<LL, pair<int, int>>> pq;
void work() {
cin >> a >> b >> c >> K;
for (int i = 0; i < a; i++)
cin >> A[i];
for (int i = 0; i ... | [
"variable_declaration.type.change"
] | 895,492 | 895,495 | u154574371 | cpp |
p03078 | #pragma GCC optimize("O3")
#include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using names... | #pragma GCC optimize("O3")
#include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using names... | [
"expression.operation.binary.remove"
] | 895,496 | 895,497 | u487476769 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
for (int i = 0; i < x; ++i)
cin >> a[i];
for (int i = 0; i < y; ++i)
cin >> b[i];
for (int i = 0; i < z; ++i)
cin >> c[i];
sort(begin(a), end... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
for (int i = 0; i < x; ++i)
cin >> a[i];
for (int i = 0; i < y; ++i)
cin >> b[i];
for (int i = 0; i < z; ++i)
cin >> c[i];
sort(begin(a), end... | [
"identifier.change",
"call.arguments.change"
] | 895,498 | 895,499 | u733618878 | cpp |
p03078 | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
// MARK: - header
namespace {
using namespace std;
using ll = long long;
using ull = unsigned long long;
} // namespace
// MARK: - answer
int X, Y, Z, K;
vector<int> A, ... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
// MARK: - header
namespace {
using namespace std;
using ll = long long;
using ull = unsigned long long;
} // namespace
// MARK: - answer
int X, Y, Z, K;
vector<ll> A, B... | [] | 895,500 | 895,501 | u500092662 | cpp |
p03078 | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
// MARK: - header
namespace {
using namespace std;
using ll = long long;
using ull = unsigned long long;
} // namespace
// MARK: - answer
int X, Y, Z, K;
vector<int> A, ... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
// MARK: - header
namespace {
using namespace std;
using ll = long long;
using ull = unsigned long long;
} // namespace
// MARK: - answer
int X, Y, Z, K;
vector<ll> A, B... | [
"assignment.change"
] | 895,502 | 895,501 | u500092662 | cpp |
p03078 | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
// MARK: - header
namespace {
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <ull MOD> struct Mod {
ull v = 0;
Mod(){};
Mod(ull ... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
// MARK: - header
namespace {
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <ull MOD> struct Mod {
ull v = 0;
Mod(){};
Mod(ull ... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 895,503 | 895,504 | u500092662 | cpp |
p03078 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int X, Y, Z, K;
vector<long long> A(1001, 0);
vector<long long> B(1001, 0);
vector<long long> C(1001, 0);
vector<long long> ret;
vector<long long> ret2;
cin >> X >> Y >> Z >> K;
for (in... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int X, Y, Z, K;
vector<long long> A(1001, 0);
vector<long long> B(1001, 0);
vector<long long> C(1001, 0);
vector<long long> ret;
vector<long long> ret2;
cin >> X >> Y >> Z >> K;
for (in... | [
"control_flow.loop.for.condition.change",
"call.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"call.arguments.change"
] | 895,525 | 895,526 | u119477929 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | [] | 895,536 | 895,537 | u888717396 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
vector<int> x(3);
int K;
cin >> x[0] >> x[1] >> x[2] >> K;
vector<vector<ll>> a(3);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < x[i]; j++) {
ll l;
cin >> l;
a[i].push_back(l);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
vector<int> x(3);
int K;
cin >> x[0] >> x[1] >> x[2] >> K;
vector<vector<ll>> a(3);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < x[i]; j++) {
ll l;
cin >> l;
a[i].push_back(l);... | [
"call.arguments.change"
] | 895,542 | 895,543 | u686805923 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int X, Y, Z, K;
vector<long long> a, b, c;
bool solve(long long P) {
int cnt = 0;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if (a[i] + b[j] + c[k] < P)
break;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int X, Y, Z, K;
vector<long long> a, b, c;
bool solve(long long P) {
int cnt = 0;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if (a[i] + b[j] + c[k] < P)
break;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 895,560 | 895,561 | u269476572 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int X, Y, Z;
int K;
cin >> X >> Y >> Z;
cin >> K;
vector<ll> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++)
cin >> A[i];
for (int i = 0; i < Y; i++)
cin >> B[i];
for... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int X, Y, Z;
int K;
cin >> X >> Y >> Z;
cin >> K;
vector<ll> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++)
cin >> A[i];
for (int i = 0; i < Y; i++)
cin >> B[i];
for... | [
"identifier.change",
"expression.operation.binary.change"
] | 895,575 | 895,576 | u603234915 | cpp |
p03079 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && c == a)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && c == a)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,589 | 895,590 | u821732221 | cpp |
p03079 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 895,591 | 895,592 | u720721463 | cpp |
p03079 |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE s... |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE s... | [
"literal.string.change",
"io.output.change"
] | 895,593 | 895,594 | u297590902 | cpp |
p03079 | #include <bits/stdc++.h>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << 'Yes' << endl;
} else {
cout << 'No' ... | #include <bits/stdc++.h>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "No" ... | [
"literal.string.change",
"io.output.change"
] | 895,595 | 895,596 | u426397594 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A == B) && (A == C) && (B == C))
cout << "yes";
else
cout << "no";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A == B) && (A == C) && (B == C))
cout << "Yes";
else
cout << "No";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,597 | 895,598 | u074014027 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && A == C) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 895,607 | 895,608 | u640827947 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
printf("YES");
else
printf("NO");
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
printf("Yes");
else
printf("No");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 895,609 | 895,610 | u577588667 | cpp |
p03079 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
string S;
if (A == B) {
if (A == C) {
S = "Yes";
}
} else {
S = "No";
}
cout << S << "\n";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
string S;
if (A == B && A == C) {
// if (A == C) {
S = "Yes";
// }
} else {
S = "No";
}
cout << S << "... | [
"control_flow.branch.if.condition.change"
] | 895,615 | 895,616 | u669951493 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a;
int b;
int c;
cin >> a;
cin >> b;
cin >> c;
if (a == b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a;
int b;
int c;
cin >> a;
cin >> b;
cin >> c;
if (a == b && a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 895,617 | 895,618 | u506441365 | cpp |
p03079 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B || B == C) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
;
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,619 | 895,620 | u180345531 | cpp |
p03079 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a == b && a == c) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
| #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a == b && a == c) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 895,621 | 895,622 | u653280732 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "YES";
else
cout << "NO";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes";
else
cout << "No";
cout << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,633 | 895,634 | u414768457 | cpp |
p03079 | #include <iostream>
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << ((a == b && b == c) ? "YES" : "NO") << std::flush;
}
| #include <iostream>
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << ((a == b && b == c) ? "Yes" : "No") << std::endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change",
"identifier.change"
] | 895,635 | 895,636 | u257681527 | cpp |
p03079 | #include <iostream>
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << ((a == b && b == c) ? "YES" : "NO") << std::endl;
}
| #include <iostream>
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << ((a == b && b == c) ? "Yes" : "No") << std::endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 895,637 | 895,636 | u257681527 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b || b == c || a == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && a == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,641 | 895,642 | u596546626 | cpp |
p03079 | #include <stdio.h>
int main(void) {
int n1, n2, n3;
scanf("%d", &n1);
scanf("%d", &n2);
scanf("%d", &n3);
if (n1 = n2 = n3) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int n1, n2, n3;
scanf("%d", &n1);
scanf("%d", &n2);
scanf("%d", &n3);
if (n1 == n2 && n2 == n3) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 895,646 | 895,647 | u180133008 | cpp |
p03079 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b || b == c) {
cout << "Yes\n";
return 0;
}
cout << "No\n";
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes\n";
return 0;
}
cout << "No\n";
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,648 | 895,649 | u653206280 | cpp |
p03079 | // Brijesh Panara (201601074)
// DAIICT (India)
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define FILL(a, b) memset((a), (b), s... | // Brijesh Panara (201601074)
// DAIICT (India)
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define FILL(a, b) memset((a), (b), s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,653 | 895,654 | u924370463 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "'Yes'" << endl;
} else {
cout << "'No'" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 895,657 | 895,658 | u416964274 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a != b || b != c || a != c)
printf("NO");
else
puts("YES");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a != b || b != c || a != c)
printf("No");
else
puts("Yes");
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 895,666 | 895,667 | u872681634 | cpp |
p03079 | #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 (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #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 (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [
"control_flow.branch.if.condition.change"
] | 895,668 | 895,669 | u135572611 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
if (a[1] == a[2] && a[3] == a[2]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
if (a[1] == a[2] && a[0] == a[2]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 895,670 | 895,671 | u848676730 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B || B == C) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,672 | 895,673 | u823974338 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B || B == C) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,676 | 895,673 | u823974338 | cpp |
p03079 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <vector>
#define FORi(N) for (int i = 0; i < N; ++i)
#define FORj(N) for (int j = 0; j < N; ++j)
using namespace std;
usin... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <vector>
#define FORi(N) for (int i = 0; i < N; ++i)
#define FORj(N) for (int j = 0; j < N; ++j)
using namespace std;
usin... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,678 | 895,679 | u373586461 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "yes";
else
cout << "no";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes";
else
cout << "No";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,684 | 895,685 | u799544051 | cpp |
p03079 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Ido Kessler
*/
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Ido Kessler
*/
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include ... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 895,688 | 895,689 | u734806473 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
string ret;
if (a == b && b == c) {
ret = "YES";
} else {
ret = "NO";
}
cout << ret << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
string ret;
if (a == b && b == c) {
ret = "Yes";
} else {
ret = "No";
}
cout << ret << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 895,690 | 895,691 | u966286365 | cpp |
p03079 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
re... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
re... | [
"control_flow.branch.if.condition.change"
] | 895,692 | 895,693 | u496074393 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 100000000
typedef long long ll;
using namespace std;
doubl... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 100000000
typedef long long ll;
using namespace std;
doubl... | [
"control_flow.branch.if.condition.change"
] | 895,694 | 895,695 | u843974324 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 895,696 | 895,697 | u684863590 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.