problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
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 itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int mod = 1000000000 + 7;
const static int inf = INT_MAX / 2;
const static llong INF = LLONG_MAX / 2;
const static double eps = 1e-10;
const static int dx[] = {1, 0, -1, 0};
const static int dy[] = {0, 1, 0, -1};
signed main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && a == c)
cout << "Yes" << endl;
cout << "No" << endl;
return 0;
} | #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 itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int mod = 1000000000 + 7;
const static int inf = INT_MAX / 2;
const static llong INF = LLONG_MAX / 2;
const static double eps = 1e-10;
const static int dx[] = {1, 0, -1, 0};
const static int dy[] = {0, 1, 0, -1};
signed main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && a == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"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 ll = long long;
constexpr int inf = INT_MAX / 2;
constexpr ll infl = 1LL << 60;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
void _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>
#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 ll = long long;
constexpr int inf = INT_MAX / 2;
constexpr ll infl = 1LL << 60;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
void _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,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 <stack>
#include <string>
#include <utility>
#include <vector>
// clang-format off
template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T clamp(T val, T min, T max) { return val < min ? min : (max < val ? max : val); }
template <typename T> size_t max_index(T begin, T end) { return distance(begin, max_element(begin, end)); }
template <typename T> size_t min_index(T begin, T end) { return distance(begin, min_element(begin, end)); }
// clang-format on
#define int long long
using namespace std;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << 'Yes';
else
cout << 'No';
cout << endl;
return 0;
}
|
#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 <stack>
#include <string>
#include <utility>
#include <vector>
// clang-format off
template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T clamp(T val, T min, T max) { return val < min ? min : (max < val ? max : val); }
template <typename T> size_t max_index(T begin, T end) { return distance(begin, max_element(begin, end)); }
template <typename T> size_t min_index(T begin, T end) { return distance(begin, min_element(begin, end)); }
// clang-format on
#define int long long
using namespace std;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
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",
"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 == c) {
cout << "Yes" << endl;
}
cout << "No" << endl;
return 0;
} | #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 == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"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);
#define VSORT(v) sort(v.begin(), v.end());
#define vint vector<int>
#define vvint vector<vector<int>>
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
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;
#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);
#define VSORT(v) sort(v.begin(), v.end());
#define vint vector<int>
#define vvint vector<vector<int>>
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
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,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>::value,
"this input_graph function can only be in type \"int\" or "
"\"long long int\"!\n");
vector<vector<T>> a(array_num, vector<T>());
for (T i = 0; i < edge_num; i++) {
T d1, d2;
cin >> d1 >> d2;
a.at(d1 - 1).emplace_back(d2 - 1);
a.at(d2 - 1).emplace_back(d1 - 1);
}
return a;
}
template <typename T> vector<T> input_vector(T array_num) {
static_assert(is_same<T, int>::value || is_same<T, ll>::value,
"this input_vector function can only be in type \"int\" or "
"\"long long int\"!\n");
vector<T> a(array_num, 0);
for (T i = 0; i < array_num; i++) {
cin >> a.at(i);
}
return a;
}
int main() {
int n, k, d;
cin >> n >> k >> d;
if (n == k && k == d) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| #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>::value,
"this input_graph function can only be in type \"int\" or "
"\"long long int\"!\n");
vector<vector<T>> a(array_num, vector<T>());
for (T i = 0; i < edge_num; i++) {
T d1, d2;
cin >> d1 >> d2;
a.at(d1 - 1).emplace_back(d2 - 1);
a.at(d2 - 1).emplace_back(d1 - 1);
}
return a;
}
template <typename T> vector<T> input_vector(T array_num) {
static_assert(is_same<T, int>::value || is_same<T, ll>::value,
"this input_vector function can only be in type \"int\" or "
"\"long long int\"!\n");
vector<T> a(array_num, 0);
for (T i = 0; i < array_num; i++) {
cin >> a.at(i);
}
return a;
}
int main() {
int n, k, d;
cin >> n >> k >> d;
if (n == k && k == d) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| [
"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)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
using ll = long long;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const pid_t pid = getpid();
// Problem Specific Parameter:
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b and b == c) {
puts("Yes");
} else {
puts("NO");
}
return 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)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
using ll = long long;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const pid_t pid = getpid();
// Problem Specific Parameter:
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b and b == c) {
puts("Yes");
} else {
puts("No");
}
return 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, l)); // lで初期化
#define vvll(vec, n, m, l) vector<vector<ll>> vec(n, vector<ll>(m, l));
#define vint vector<int>
#define pint pair<int, int>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define all(x) (x).begin(), (x).end()
#define debug system("pause")
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a == b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #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, l)); // lで初期化
#define vvll(vec, n, m, l) vector<vector<ll>> vec(n, vector<ll>(m, l));
#define vint vector<int>
#define pint pair<int, int>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define all(x) (x).begin(), (x).end()
#define debug system("pause")
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
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,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;
if (A == B and B == C)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #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;
if (A == B and B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"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)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #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)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"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; i++)
#define initialize(array, size, value) \
for (lli i = 0; i < size; i++) \
array[i] = value
#define couta(array, size) \
for (lli i = 0; i < size; i++) \
cout << array[i] << " "
#define vl vector<lli>
#define vp vector<pair<lli, lli>>
#define sl set<lli>
#define msp multiset<pair<long long, long long>> S;
#define pll pair<lli, lli>
#define mll \
map<lli, \
lli> // for( map<lli, lli>::iterator
// i=temp.begin();i!=temp.end();i++)cout<<i->fi<<" "<<i->se<<endl;
#define mvl map<lli, vl>
#define umll unordered_map<lli, lli>
#define vt vector<pair<lli, pll>>
#define vf vector<pair<pll, pll>>
#define qu queue<lli>
#define pq priority_queue<lli>
#define dq deque<lli>
#define ptr vector<lli>::iterator
#define bs(array, x) \
binary_search(array.begin(), array.end(), \
x) // also valid for set and multiset
#define lb(array, x) lower_bound(array.begin(), array.end(), x)
#define ub(array, x) upper_bound(array.begin(), array.end(), x)
#define nobw(array, i, j) \
upper_bound(array.begin(), array.end(), j) - \
lower_bound(array.begin(), array.end(), \
i) // number of numbers between i & j
#define vc clear()
#define endl '\n'
#define sp system("pause");
#define INF 9223372036854775807
#define MINF -9223372036854775808
typedef tree<pll, null_type, less<pll>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
// ios::sync_with_stdio(0);
// cin.tie(0);
lli a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "YES";
else
cout << "NO";
return 0;
}
| #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; i++)
#define initialize(array, size, value) \
for (lli i = 0; i < size; i++) \
array[i] = value
#define couta(array, size) \
for (lli i = 0; i < size; i++) \
cout << array[i] << " "
#define vl vector<lli>
#define vp vector<pair<lli, lli>>
#define sl set<lli>
#define msp multiset<pair<long long, long long>> S;
#define pll pair<lli, lli>
#define mll \
map<lli, \
lli> // for( map<lli, lli>::iterator
// i=temp.begin();i!=temp.end();i++)cout<<i->fi<<" "<<i->se<<endl;
#define mvl map<lli, vl>
#define umll unordered_map<lli, lli>
#define vt vector<pair<lli, pll>>
#define vf vector<pair<pll, pll>>
#define qu queue<lli>
#define pq priority_queue<lli>
#define dq deque<lli>
#define ptr vector<lli>::iterator
#define bs(array, x) \
binary_search(array.begin(), array.end(), \
x) // also valid for set and multiset
#define lb(array, x) lower_bound(array.begin(), array.end(), x)
#define ub(array, x) upper_bound(array.begin(), array.end(), x)
#define nobw(array, i, j) \
upper_bound(array.begin(), array.end(), j) - \
lower_bound(array.begin(), array.end(), \
i) // number of numbers between i & j
#define vc clear()
#define endl '\n'
#define sp system("pause");
#define INF 9223372036854775807
#define MINF -9223372036854775808
typedef tree<pll, null_type, less<pll>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
// ios::sync_with_stdio(0);
// cin.tie(0);
lli 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,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 main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #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 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,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);
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(A.begin(), A.end());
sort(B.begin(), B.end());
reverse(A.begin(), A.end());
reverse(B.begin(), B.end());
vector<long long> AB(x * y);
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
AB[i * y + j] = A[i] + B[j];
}
}
sort(AB.begin(), AB.end());
reverse(AB.begin(), AB.end());
int s = max(3000, x * y);
vector<long long> ABC(s * z);
for (int i = 0; i < s; i++) {
for (int j = 0; j < z; j++) {
ABC[i * z + j] = AB[i] + C[j];
}
}
sort(ABC.begin(), ABC.end());
reverse(ABC.begin(), ABC.end());
for (int i = 0; i < k; i++) {
cout << ABC[i] << endl;
}
}
| #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);
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(A.begin(), A.end());
sort(B.begin(), B.end());
reverse(A.begin(), A.end());
reverse(B.begin(), B.end());
vector<long long> AB(x * y);
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
AB[i * y + j] = A[i] + B[j];
}
}
sort(AB.begin(), AB.end());
reverse(AB.begin(), AB.end());
int s = min(k, x * y);
vector<long long> ABC(s * z);
for (int i = 0; i < s; i++) {
for (int j = 0; j < z; j++) {
ABC[i * z + j] = AB[i] + C[j];
}
}
sort(ABC.begin(), ABC.end());
reverse(ABC.begin(), ABC.end());
for (int i = 0; i < k; i++) {
cout << ABC[i] << endl;
}
}
| [
"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 solve(const vector<SI> &V) { return 0; }
void test() {
{
vector<UI> A = {4, 6};
vector<UI> B = {1, 5};
vector<UI> C = {3, 8};
UI K = 8;
vector<SI> V = {0, 1, 2};
assert(solve(V) == 0);
}
cerr << "OK" << endl;
}
int main() {
UI X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<UI> A(X), B(Y), C(Z);
for (SI i = 0; i < X; i++) {
cin >> A[i];
}
for (SI i = 0; i < Y; i++) {
cin >> B[i];
}
for (SI i = 0; i < Z; i++) {
cin >> C[i];
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
sort(C.begin(), C.end());
reverse(C.begin(), C.end());
vector<UI> ABC;
for (size_t i = 0; i < X; i++) {
for (size_t j = 0; j < Y; j++) {
if ((i + 1) * (j + 1) > K)
break;
for (size_t k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) + (k + 1) > K)
break;
ABC.push_back(A[i] + B[j] + C[k]);
}
}
}
sort(ABC.begin(), ABC.end());
reverse(ABC.begin(), ABC.end());
for (size_t i = 0; i < K; i++) {
cout << ABC[i] << std::endl;
}
return 0;
}
| #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 solve(const vector<SI> &V) { return 0; }
void test() {
{
vector<UI> A = {4, 6};
vector<UI> B = {1, 5};
vector<UI> C = {3, 8};
UI K = 8;
vector<SI> V = {0, 1, 2};
assert(solve(V) == 0);
}
cerr << "OK" << endl;
}
int main() {
UI X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<UI> A(X), B(Y), C(Z);
for (SI i = 0; i < X; i++) {
cin >> A[i];
}
for (SI i = 0; i < Y; i++) {
cin >> B[i];
}
for (SI i = 0; i < Z; i++) {
cin >> C[i];
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
sort(C.begin(), C.end());
reverse(C.begin(), C.end());
vector<UI> ABC;
for (size_t i = 0; i < X; i++) {
for (size_t j = 0; j < Y; j++) {
if ((i + 1) * (j + 1) > K)
break;
for (size_t k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
ABC.push_back(A[i] + B[j] + C[k]);
}
}
}
sort(ABC.begin(), ABC.end());
reverse(ABC.begin(), ABC.end());
for (size_t i = 0; i < K; i++) {
cout << ABC[i] << std::endl;
}
return 0;
}
| [
"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 = 1000000007;
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int X, Y, Z;
int K;
cin >> X >> Y >> Z;
cin >> K;
vector<int> 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];
vector<ll> AB;
REP(i, X) {
REP(j, Y) { AB.push_back(A[i] + B[j]); }
}
sort(AB.begin(), AB.end(), greater<ll>());
vector<ll> ABC;
for (int i = 0; i < min(K, (int)AB.size()); i++) {
for (int j = 0; j < Z; j++) {
ABC.push_back(AB[i] + C[j]);
}
}
sort(ABC.begin(), ABC.end(), greater<ll>());
REP(i, K) { cout << ABC[i] << endl; }
return 0;
} | #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 = 1000000007;
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
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 (int i = 0; i < Z; i++)
cin >> C[i];
vector<ll> AB;
REP(i, X) {
REP(j, Y) { AB.push_back(A[i] + B[j]); }
}
sort(AB.begin(), AB.end(), greater<ll>());
vector<ll> ABC;
for (int i = 0; i < min(K, (int)AB.size()); i++) {
for (int j = 0; j < Z; j++) {
ABC.push_back(AB[i] + C[j]);
}
}
sort(ABC.begin(), ABC.end(), greater<ll>());
REP(i, K) { cout << ABC[i] << endl; }
return 0;
} | [] | 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 < b; i++)
cin >> B[i];
for (int i = 0; i < c; i++)
cin >> C[i];
for (int i = 0; i < a; i++)
for (int j = 0; j < b; j++)
AB[i * b + j] = A[i] + B[j];
AB[a * b] = -INT_MAX;
C[c] = -INT_MAX;
sort(AB, AB + a * b);
sort(C, C + c);
reverse(AB, AB + a * b);
reverse(C, C + c);
for (int i = 0; i < c; i++)
pq.push(make_pair(AB[0] + C[i], make_pair(0, i)));
while (K--) {
pair<LL, pair<int, int>> p = pq.top();
pq.pop();
cout << p.first << endl;
int u = p.second.first, v = p.second.second;
pq.push(make_pair(AB[u + 1] + C[v], make_pair(u + 1, v)));
}
}
int main() {
#ifdef yukihana0416
freopen("in.txt", "r", stdin);
#endif // yukihana0416
work();
return 0;
}
| #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 < b; i++)
cin >> B[i];
for (int i = 0; i < c; i++)
cin >> C[i];
for (int i = 0; i < a; i++)
for (int j = 0; j < b; j++)
AB[i * b + j] = A[i] + B[j];
AB[a * b] = -INT_MAX;
C[c] = -INT_MAX;
// sort(AB, AB + a * b, [](int x, int y){return x > y;});
// sort(C, C + c, [](int x, int y){return x > y;});
sort(AB, AB + a * b);
sort(C, C + c);
reverse(AB, AB + a * b);
reverse(C, C + c);
for (int i = 0; i < c; i++)
pq.push(make_pair(AB[0] + C[i], make_pair(0, i)));
while (K--) {
pair<LL, pair<int, int>> p = pq.top();
pq.pop();
cout << p.first << endl;
int u = p.second.first, v = p.second.second;
pq.push(make_pair(AB[u + 1] + C[v], make_pair(u + 1, v)));
}
}
int main() {
#ifdef yukihana0416
freopen("in.txt", "r", stdin);
#endif // yukihana0416
work();
return 0;
}
| [
"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 < b; i++)
cin >> B[i];
for (int i = 0; i < c; i++)
cin >> C[i];
for (int i = 0; i < a; i++)
for (int j = 0; j < b; j++)
AB[i * b + j] = A[i] + B[j];
AB[a * b] = -INT_MAX;
C[c] = -INT_MAX;
sort(AB, AB + a * b);
sort(C, C + c);
reverse(AB, AB + a * b);
reverse(C, C + c);
for (int i = 0; i < c; i++)
pq.push(make_pair(AB[0] + C[i], make_pair(0, i)));
while (K--) {
pair<LL, pair<int, int>> p = pq.top();
pq.pop();
cout << p.first << endl;
int u = p.second.first, v = p.second.second;
pq.push(make_pair(AB[u + 1] + C[v], make_pair(u + 1, v)));
}
}
int main() {
#ifdef yukihana0416
freopen("in.txt", "r", stdin);
#endif // yukihana0416
work();
return 0;
}
| #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 < b; i++)
cin >> B[i];
for (int i = 0; i < c; i++)
cin >> C[i];
for (int i = 0; i < a; i++)
for (int j = 0; j < b; j++)
AB[i * b + j] = A[i] + B[j];
AB[a * b] = -INT_MAX;
C[c] = -INT_MAX;
sort(AB, AB + a * b);
sort(C, C + c);
reverse(AB, AB + a * b);
reverse(C, C + c);
for (int i = 0; i < c; i++)
pq.push(make_pair(AB[0] + C[i], make_pair(0, i)));
while (K--) {
pair<LL, pair<int, int>> p = pq.top();
pq.pop();
cout << p.first << endl;
int u = p.second.first, v = p.second.second;
pq.push(make_pair(AB[u + 1] + C[v], make_pair(u + 1, v)));
}
}
int main() {
#ifdef yukihana0416
freopen("in.txt", "r", stdin);
#endif // yukihana0416
work();
return 0;
}
| [
"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 namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
using M_BOOL = bool;
#define M_TRUE (true)
#define M_FALSE (false)
#define DIVISOR (1000000007)
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = M_TRUE;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
static SQWORD calcZeroToNumXor(SQWORD sqNum) {
SQWORD sqRet = 0;
for (DWORD dwBit = 1; dwBit < 64; dwBit++) {
SQWORD sqMask = 0x1LL << dwBit;
if (sqMask & sqNum) {
if (0 == (sqNum & 0x1)) {
sqRet |= sqMask;
}
}
}
/* lowest bit */
if ((sqNum % 4 == 1) || (sqNum % 4 == 2)) {
sqRet |= 1;
}
return sqRet;
}
#define SQWORD_INF_N (-10000000000)
typedef tuple<SDWORD, SDWORD, SDWORD> cake_indice;
typedef struct {
SQWORD sqVal;
SDWORD lIdxA;
SDWORD lIdxB;
SDWORD lIdxC;
} ST_CAKE_SELECT;
typedef priority_queue<ST_CAKE_SELECT, vector<ST_CAKE_SELECT>,
function<bool(ST_CAKE_SELECT, ST_CAKE_SELECT)>>
pq_cake;
typedef set<cake_indice> set_cake;
typedef struct {
vector<SQWORD> vsqInput_A;
vector<SQWORD> vsqInput_B;
vector<SQWORD> vsqInput_C;
} ST_INPUT;
static void addCakeSet(pq_cake &q, set_cake &setCakes, ST_INPUT &stInput,
SDWORD lIdxA, SDWORD lIdxB, SDWORD lIdxC) {
SQWORD sqValue = stInput.vsqInput_A[lIdxA] + stInput.vsqInput_B[lIdxB] +
stInput.vsqInput_C[lIdxC];
q.push(ST_CAKE_SELECT{sqValue, lIdxA, lIdxB, lIdxC});
setCakes.insert((cake_indice){lIdxA, lIdxB, lIdxC});
}
int main() {
ST_INPUT stInput;
SQWORD sqInput_X = inputSQWORD();
SQWORD sqInput_Y = inputSQWORD();
SQWORD sqInput_Z = inputSQWORD();
SQWORD sqInput_K = inputSQWORD();
for (SQWORD sqIdx = 0; sqIdx < sqInput_X; sqIdx++) {
stInput.vsqInput_A.emplace_back(inputSQWORD());
}
for (SQWORD sqIdx = 0; sqIdx < sqInput_Y; sqIdx++) {
stInput.vsqInput_B.emplace_back(inputSQWORD());
}
for (SQWORD sqIdx = 0; sqIdx < sqInput_Z; sqIdx++) {
stInput.vsqInput_C.emplace_back(inputSQWORD());
}
sort(stInput.vsqInput_A.begin(), stInput.vsqInput_A.end(), greater<SQWORD>());
sort(stInput.vsqInput_B.begin(), stInput.vsqInput_B.end(), greater<SQWORD>());
sort(stInput.vsqInput_C.begin(), stInput.vsqInput_C.end(), greater<SQWORD>());
/* add index0(largest) */
auto cake_is_high = [](ST_CAKE_SELECT l, ST_CAKE_SELECT r) {
return l.sqVal < r.sqVal;
};
pq_cake q(cake_is_high);
set<cake_indice> setCakes;
addCakeSet(q, setCakes, stInput, 0, 0, 0);
vector<SQWORD> vsqAns;
for (SDWORD lIdx = 0; lIdx < sqInput_K; lIdx++) {
ST_CAKE_SELECT sel = q.top();
vsqAns.emplace_back(sel.sqVal);
q.pop();
SDWORD lIdxA = sel.lIdxA;
SDWORD lIdxB = sel.lIdxB;
SDWORD lIdxC = sel.lIdxC;
if (lIdxA + 1 < sqInput_X) {
auto next = (cake_indice){lIdxA + 1, lIdxB, lIdxC};
auto it = setCakes.find(next);
if (it == setCakes.end()) {
addCakeSet(q, setCakes, stInput, lIdxA + 1, lIdxB, lIdxC);
}
}
if (lIdxB + 1 < sqInput_Y) {
auto next = (cake_indice){lIdxA, lIdxB + 1, lIdxC};
auto it = setCakes.find(next);
if (it == setCakes.end()) {
addCakeSet(q, setCakes, stInput, lIdxA, lIdxB + 1, lIdxC);
}
}
if (lIdxC + 1 < sqInput_Z) {
auto next = (cake_indice){lIdxA + 1, lIdxB, lIdxC + 1};
auto it = setCakes.find(next);
if (it == setCakes.end()) {
addCakeSet(q, setCakes, stInput, lIdxA, lIdxB, lIdxC + 1);
}
}
}
for (auto it : vsqAns) {
printf("%lld\n", it);
}
return 0;
} | #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 namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
using M_BOOL = bool;
#define M_TRUE (true)
#define M_FALSE (false)
#define DIVISOR (1000000007)
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = M_TRUE;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
static SQWORD calcZeroToNumXor(SQWORD sqNum) {
SQWORD sqRet = 0;
for (DWORD dwBit = 1; dwBit < 64; dwBit++) {
SQWORD sqMask = 0x1LL << dwBit;
if (sqMask & sqNum) {
if (0 == (sqNum & 0x1)) {
sqRet |= sqMask;
}
}
}
/* lowest bit */
if ((sqNum % 4 == 1) || (sqNum % 4 == 2)) {
sqRet |= 1;
}
return sqRet;
}
#define SQWORD_INF_N (-10000000000)
typedef tuple<SDWORD, SDWORD, SDWORD> cake_indice;
typedef struct {
SQWORD sqVal;
SDWORD lIdxA;
SDWORD lIdxB;
SDWORD lIdxC;
} ST_CAKE_SELECT;
typedef priority_queue<ST_CAKE_SELECT, vector<ST_CAKE_SELECT>,
function<bool(ST_CAKE_SELECT, ST_CAKE_SELECT)>>
pq_cake;
typedef set<cake_indice> set_cake;
typedef struct {
vector<SQWORD> vsqInput_A;
vector<SQWORD> vsqInput_B;
vector<SQWORD> vsqInput_C;
} ST_INPUT;
static void addCakeSet(pq_cake &q, set_cake &setCakes, ST_INPUT &stInput,
SDWORD lIdxA, SDWORD lIdxB, SDWORD lIdxC) {
SQWORD sqValue = stInput.vsqInput_A[lIdxA] + stInput.vsqInput_B[lIdxB] +
stInput.vsqInput_C[lIdxC];
q.push(ST_CAKE_SELECT{sqValue, lIdxA, lIdxB, lIdxC});
setCakes.insert((cake_indice){lIdxA, lIdxB, lIdxC});
}
int main() {
ST_INPUT stInput;
SQWORD sqInput_X = inputSQWORD();
SQWORD sqInput_Y = inputSQWORD();
SQWORD sqInput_Z = inputSQWORD();
SQWORD sqInput_K = inputSQWORD();
for (SQWORD sqIdx = 0; sqIdx < sqInput_X; sqIdx++) {
stInput.vsqInput_A.emplace_back(inputSQWORD());
}
for (SQWORD sqIdx = 0; sqIdx < sqInput_Y; sqIdx++) {
stInput.vsqInput_B.emplace_back(inputSQWORD());
}
for (SQWORD sqIdx = 0; sqIdx < sqInput_Z; sqIdx++) {
stInput.vsqInput_C.emplace_back(inputSQWORD());
}
sort(stInput.vsqInput_A.begin(), stInput.vsqInput_A.end(), greater<SQWORD>());
sort(stInput.vsqInput_B.begin(), stInput.vsqInput_B.end(), greater<SQWORD>());
sort(stInput.vsqInput_C.begin(), stInput.vsqInput_C.end(), greater<SQWORD>());
/* add index0(largest) */
auto cake_is_high = [](ST_CAKE_SELECT l, ST_CAKE_SELECT r) {
return l.sqVal < r.sqVal;
};
pq_cake q(cake_is_high);
set<cake_indice> setCakes;
addCakeSet(q, setCakes, stInput, 0, 0, 0);
vector<SQWORD> vsqAns;
for (SDWORD lIdx = 0; lIdx < sqInput_K; lIdx++) {
ST_CAKE_SELECT sel = q.top();
vsqAns.emplace_back(sel.sqVal);
q.pop();
SDWORD lIdxA = sel.lIdxA;
SDWORD lIdxB = sel.lIdxB;
SDWORD lIdxC = sel.lIdxC;
if (lIdxA + 1 < sqInput_X) {
auto next = (cake_indice){lIdxA + 1, lIdxB, lIdxC};
auto it = setCakes.find(next);
if (it == setCakes.end()) {
addCakeSet(q, setCakes, stInput, lIdxA + 1, lIdxB, lIdxC);
}
}
if (lIdxB + 1 < sqInput_Y) {
auto next = (cake_indice){lIdxA, lIdxB + 1, lIdxC};
auto it = setCakes.find(next);
if (it == setCakes.end()) {
addCakeSet(q, setCakes, stInput, lIdxA, lIdxB + 1, lIdxC);
}
}
if (lIdxC + 1 < sqInput_Z) {
auto next = (cake_indice){lIdxA, lIdxB, lIdxC + 1};
auto it = setCakes.find(next);
if (it == setCakes.end()) {
addCakeSet(q, setCakes, stInput, lIdxA, lIdxB, lIdxC + 1);
}
}
}
for (auto it : vsqAns) {
printf("%lld\n", it);
}
return 0;
} | [
"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(a));
sort(begin(b), end(b));
sort(begin(c), end(c));
auto check = [&](ll v) {
ll cnt = 0;
for (int i = 0; i < x; ++i) {
for (int j = 0; j < y; ++j) {
cnt += c.end() - lower_bound(begin(c), end(c), v - a[i] - b[j]);
}
}
return cnt >= k;
};
ll lb = 0, ub = 1e18;
while (ub - lb > 1) {
const ll mid = (ub + lb) >> 1;
(check(mid) ? lb : ub) = mid;
}
vector<ll> ans;
for (int i = 0; i < x; ++i) {
for (int j = 0; j < y; ++j) {
const int fst =
upper_bound(begin(c), end(c), lb - a[i] - b[j]) - begin(c);
for (int l = fst; l < z; ++l) {
ans.push_back(a[i] + b[j] + c[l]);
}
}
}
while ((int)ans.size() < k)
ans.push_back(ub);
sort(rbegin(ans), rend(ans));
for (auto t : ans) {
cout << t << endl;
}
} | #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(a));
sort(begin(b), end(b));
sort(begin(c), end(c));
auto check = [&](ll v) {
ll cnt = 0;
for (int i = 0; i < x; ++i) {
for (int j = 0; j < y; ++j) {
cnt += c.end() - lower_bound(begin(c), end(c), v - a[i] - b[j]);
}
}
return cnt >= k;
};
ll lb = 0, ub = 1e18;
while (ub - lb > 1) {
const ll mid = (ub + lb) >> 1;
(check(mid) ? lb : ub) = mid;
}
vector<ll> ans;
for (int i = 0; i < x; ++i) {
for (int j = 0; j < y; ++j) {
const int fst =
upper_bound(begin(c), end(c), lb - a[i] - b[j]) - begin(c);
for (int l = fst; l < z; ++l) {
ans.push_back(a[i] + b[j] + c[l]);
}
}
}
while ((int)ans.size() < k)
ans.push_back(lb);
sort(rbegin(ans), rend(ans));
for (auto t : ans) {
cout << t << endl;
}
} | [
"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, B, C;
void input() {
cin >> X >> Y >> Z >> K;
A.resize(X);
for (auto &a : A)
cin >> a;
B.resize(Y);
for (auto &b : B)
cin >> b;
C.resize(Z);
for (auto &c : C)
cin >> c;
}
bool cut_search(ll p, vector<ll> *sums = nullptr) {
int cnt = 0;
for (auto a : A) {
for (auto b : B) {
for (auto c : C) {
ll sum = 0ll + a + b + c;
if (sum < p)
break;
cnt++;
if (sums)
sums->push_back(sum);
else if (cnt >= K)
return true;
}
}
}
return cnt >= K;
}
void solve() {
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
sort(C.rbegin(), C.rend());
ll l = 0, r = 0ll + A[0] + B[0] + C[0];
ll p = 0;
while (l <= r) {
ll c = (l + r) / 2;
if (cut_search(c)) {
p = c;
l = c + 1;
} else {
r = c - 1;
}
}
vector<ll> sums;
cut_search(p, &sums);
sort(sums.rbegin(), sums.rend());
for (int i = 0; i < K; i++)
cout << sums[i] << endl;
}
int main() {
input();
solve();
return 0;
}
| #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, C;
void input() {
cin >> X >> Y >> Z >> K;
A.resize(X);
for (auto &a : A)
cin >> a;
B.resize(Y);
for (auto &b : B)
cin >> b;
C.resize(Z);
for (auto &c : C)
cin >> c;
}
bool cut_search(ll p, vector<ll> *sums = nullptr) {
int cnt = 0;
for (auto a : A) {
for (auto b : B) {
for (auto c : C) {
ll sum = 0ll + a + b + c;
if (sum < p)
break;
cnt++;
if (sums)
sums->push_back(sum);
else if (cnt >= K)
return true;
}
}
}
return cnt >= K;
}
void solve() {
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
sort(C.rbegin(), C.rend());
ll l = 0, r = 0ll + A[0] + B[0] + C[0];
ll p = 0;
while (l <= r) {
ll c = (l + r) / 2;
if (cut_search(c)) {
p = c;
l = c + 1;
} else {
r = c - 1;
}
}
vector<ll> sums;
cut_search(p, &sums);
sort(sums.rbegin(), sums.rend());
for (int i = 0; i < K; i++)
cout << sums[i] << endl;
}
int main() {
input();
solve();
return 0;
}
| [] | 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, B, C;
void input() {
cin >> X >> Y >> Z >> K;
A.resize(X);
for (auto &a : A)
cin >> a;
B.resize(Y);
for (auto &b : B)
cin >> b;
C.resize(Z);
for (auto &c : C)
cin >> c;
}
bool cut_search(ll p, vector<ll> *sums = nullptr) {
int cnt = 0;
for (auto a : A) {
for (auto b : B) {
for (auto c : C) {
ll sum = 0ll + a + b + c;
if (sum < p)
break;
cnt++;
if (sums)
sums->push_back(sum);
else if (cnt >= K)
return true;
}
}
}
return cnt >= K;
}
void solve() {
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
sort(C.rbegin(), C.rend());
ll l = 0, r = A[0] + B[0] + C[0];
ll p = 0;
while (l <= r) {
ll c = (l + r) / 2;
if (cut_search(c)) {
p = c;
l = c + 1;
} else {
r = c - 1;
}
}
vector<ll> sums;
cut_search(p, &sums);
sort(sums.rbegin(), sums.rend());
for (int i = 0; i < K; i++)
cout << sums[i] << endl;
}
int main() {
input();
solve();
return 0;
}
| #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, C;
void input() {
cin >> X >> Y >> Z >> K;
A.resize(X);
for (auto &a : A)
cin >> a;
B.resize(Y);
for (auto &b : B)
cin >> b;
C.resize(Z);
for (auto &c : C)
cin >> c;
}
bool cut_search(ll p, vector<ll> *sums = nullptr) {
int cnt = 0;
for (auto a : A) {
for (auto b : B) {
for (auto c : C) {
ll sum = 0ll + a + b + c;
if (sum < p)
break;
cnt++;
if (sums)
sums->push_back(sum);
else if (cnt >= K)
return true;
}
}
}
return cnt >= K;
}
void solve() {
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
sort(C.rbegin(), C.rend());
ll l = 0, r = 0ll + A[0] + B[0] + C[0];
ll p = 0;
while (l <= r) {
ll c = (l + r) / 2;
if (cut_search(c)) {
p = c;
l = c + 1;
} else {
r = c - 1;
}
}
vector<ll> sums;
cut_search(p, &sums);
sort(sums.rbegin(), sums.rend());
for (int i = 0; i < K; i++)
cout << sums[i] << endl;
}
int main() {
input();
solve();
return 0;
}
| [
"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 val) : v(val) {}
operator ull() const { return v; }
ull operator=(ll x) { return v = x % MOD; }
ull operator+=(ll x) { return operator=(v + x); }
ull operator*=(ll x) { return operator=(v *x); }
};
} // namespace
// MARK: - answer
ll X, Y, Z, K;
vector<ll> A, B, C;
void input() {
cin >> X >> Y >> Z >> K;
A.resize(X);
for (auto &a : A)
cin >> a;
B.resize(Y);
for (auto &b : B)
cin >> b;
C.resize(Z);
for (auto &c : C)
cin >> c;
}
void solve() {
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
vector<ll> AB;
for (auto a : A)
for (auto b : B)
AB.push_back(a * b);
sort(AB.rbegin(), AB.rend());
AB.resize(min(size_t(K), AB.size()));
sort(C.rbegin(), C.rend());
vector<ll> ABC;
for (auto ab : AB)
for (auto c : C)
ABC.push_back(ab * c);
sort(ABC.rbegin(), ABC.rend());
for (int i = 0; i < K; i++)
cout << ABC[i] << endl;
}
int main() {
input();
// cout << (solve() ? "Yay!" : ":(") << endl;
solve();
return 0;
}
| #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 val) : v(val) {}
operator ull() const { return v; }
ull operator=(ll x) { return v = x % MOD; }
ull operator+=(ll x) { return operator=(v + x); }
ull operator*=(ll x) { return operator=(v *x); }
};
} // namespace
// MARK: - answer
ll X, Y, Z, K;
vector<ll> A, B, C;
void input() {
cin >> X >> Y >> Z >> K;
A.resize(X);
for (auto &a : A)
cin >> a;
B.resize(Y);
for (auto &b : B)
cin >> b;
C.resize(Z);
for (auto &c : C)
cin >> c;
}
void solve() {
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
vector<ll> AB;
for (auto a : A)
for (auto b : B)
AB.push_back(a + b);
sort(AB.rbegin(), AB.rend());
AB.resize(min(size_t(K), AB.size()));
sort(C.rbegin(), C.rend());
vector<ll> ABC;
for (auto ab : AB)
for (auto c : C)
ABC.push_back(ab + c);
sort(ABC.rbegin(), ABC.rend());
for (int i = 0; i < K; i++)
cout << ABC[i] << endl;
}
int main() {
input();
// cout << (solve() ? "Yay!" : ":(") << endl;
solve();
return 0;
}
| [
"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 (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(A.begin(), A.end(), greater<long long>());
sort(B.begin(), B.end(), greater<long long>());
sort(C.begin(), C.end(), greater<long long>());
for (int a = 0; a < X; a++) {
for (int b = 0; b < Y; b++) {
ret.push_back(A[a] + B[b]);
}
}
sort(ret.begin(), ret.end(), greater<long long>());
for (int k = 0; k < K || k < X * Y; k++) {
for (int c = 0; c < Z; c++) {
ret2.push_back(ret[k] + C[c]);
}
}
sort(ret2.begin(), ret2.end(), greater<long long>());
for (int i = 0; i < K; i++) {
cout << ret2[i] << endl;
}
} | #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 (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(A.begin(), A.end(), greater<long long>());
sort(B.begin(), B.end(), greater<long long>());
sort(C.begin(), C.end(), greater<long long>());
for (int a = 0; a < X; a++) {
for (int b = 0; b < Y; b++) {
ret.push_back(A[a] + B[b]);
}
}
sort(ret.begin(), ret.end(), greater<long long>());
for (int k = 0; k < min(K, X * Y); k++) {
for (int c = 0; c < Z; c++) {
ret2.push_back(ret[k] + C[c]);
}
}
sort(ret2.begin(), ret2.end(), greater<long long>());
for (int i = 0; i < K; i++) {
cout << ret2[i] << endl;
}
} | [
"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) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end() å
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
template <typename T> void print(T x) { std::cout << x << '\n'; }
// typedef long long ll;
#define TENNINE 1000000005
#define TENFIVE 100005
//#define int long long
signed main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<int> a(x);
vector<int> b(x);
vector<int> c(x);
rep(i, x) { cin >> a[i]; }
rep(i, y) { cin >> b[i]; }
rep(i, z) { cin >> c[i]; }
sort(a.begin(), a.end(), greater<int>());
sort(b.begin(), b.end(), greater<int>());
sort(c.begin(), c.end(), greater<int>());
vector<int> ans;
rep(i, k) {
rep(j, k) {
rep(s, k) {
if ((i + 1) * (j + 1) * (s + 1) <= k) {
ans.pb(a[i] + b[j] + c[s]);
} else
break;
}
}
}
sort(ans.begin(), ans.end(), greater<int>());
rep(i, k) { cout << ans[i] << endl; }
return 0;
}
| #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) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end() å
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
template <typename T> void print(T x) { std::cout << x << '\n'; }
// typedef long long ll;
#define TENNINE 1000000005
#define TENFIVE 100005
//#define int long long
signed main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<int> a(x);
vector<int> b(x);
vector<int> c(x);
rep(i, x) { cin >> a[i]; }
rep(i, y) { cin >> b[i]; }
rep(i, z) { cin >> c[i]; }
sort(a.begin(), a.end(), greater<int>());
sort(b.begin(), b.end(), greater<int>());
sort(c.begin(), c.end(), greater<int>());
vector<int> ans;
rep(i, x) {
rep(j, y) {
rep(s, z) {
if ((i + 1) * (j + 1) * (s + 1) <= k) {
ans.pb(a[i] + b[j] + c[s]);
} else
break;
}
}
}
sort(ans.begin(), ans.end(), greater<int>());
rep(i, k) { cout << ans[i] << endl; }
return 0;
}
| [] | 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);
}
}
vector<ll> tmp(x[0] * x[1]);
int k = 0;
for (int i = 0; i < x[0]; i++) {
for (int j = 0; j < x[1]; j++) {
tmp[k] = a[0][i] + a[1][j];
k++;
}
}
sort(tmp.begin(), tmp.end(), greater<int>());
int n = min(K, x[0] * x[1]);
vector<ll> ans(n * x[2]);
k = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < x[2]; j++) {
ans[k] = tmp[i] + a[2][j];
k++;
}
}
sort(ans.begin(), ans.end(), greater<int>());
for (int i = 0; i < K; i++) {
cout << ans[i] << endl;
}
} | #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);
}
}
vector<ll> tmp(x[0] * x[1]);
int k = 0;
for (int i = 0; i < x[0]; i++) {
for (int j = 0; j < x[1]; j++) {
tmp[k] = a[0][i] + a[1][j];
k++;
}
}
sort(tmp.begin(), tmp.end(), greater<ll>());
int n = min(K, x[0] * x[1]);
vector<ll> ans(n * x[2]);
k = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < x[2]; j++) {
ans[k] = tmp[i] + a[2][j];
k++;
}
}
sort(ans.begin(), ans.end(), greater<ll>());
for (int i = 0; i < K; i++) {
cout << ans[i] << endl;
}
} | [
"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;
cnt++;
if (cnt >= K)
return true;
}
}
}
return false;
}
int main() {
cin >> X >> Y >> Z >> K;
long long tmp;
for (int i = 0; i < X; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < Y; i++) {
cin >> tmp;
b.push_back(tmp);
}
for (int i = 0; i < Z; i++) {
cin >> tmp;
c.push_back(tmp);
}
sort(a.begin(), a.end(), greater<long long>());
sort(b.begin(), b.end(), greater<long long>());
sort(c.begin(), c.end(), greater<long long>());
long long ok = 0;
long long ng = 30000000000;
while (abs(ok - ng) > 1) {
long long mid = (ok + ng) / 2;
if (solve(mid)) {
ok = mid;
} else {
ng = mid;
}
// cout << "ok:" << ok << "\tng:" << ng << endl;
}
vector<long long> ans;
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] < ng)
break;
ans.push_back(a[i] + b[j] + c[k]);
}
}
}
if (ans.size() < K) {
for (int i = 0; i < K - ans.size(); i++)
ans.push_back(ng - 1);
}
sort(ans.begin(), ans.end(), greater<long long>());
for (int i = 0; i < K; i++) {
cout << ans[i] << endl;
}
return 0;
} | #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;
cnt++;
if (cnt >= K)
return true;
}
}
}
return false;
}
int main() {
cin >> X >> Y >> Z >> K;
long long tmp;
for (int i = 0; i < X; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < Y; i++) {
cin >> tmp;
b.push_back(tmp);
}
for (int i = 0; i < Z; i++) {
cin >> tmp;
c.push_back(tmp);
}
sort(a.begin(), a.end(), greater<long long>());
sort(b.begin(), b.end(), greater<long long>());
sort(c.begin(), c.end(), greater<long long>());
long long ok = 0;
long long ng = 30000000000;
while (abs(ok - ng) > 1) {
long long mid = (ok + ng) / 2;
if (solve(mid)) {
ok = mid;
} else {
ng = mid;
}
// cout << "ok:" << ok << "\tng:" << ng << endl;
}
vector<long long> ans;
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] < ng - 1)
break;
ans.push_back(a[i] + b[j] + c[k]);
}
}
}
if (ans.size() < K) {
for (int i = 0; i < K - ans.size(); i++)
ans.push_back(ng - 1);
}
sort(ans.begin(), ans.end(), greater<long long>());
for (int i = 0; i < K; i++) {
cout << ans[i] << endl;
}
return 0;
} | [
"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 (int i = 0; i < Z; i++)
cin >> A[i];
vector<ll> AB;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
AB.push_back(A[i] + B[j]);
}
}
sort(AB.begin(), AB.end());
reverse(AB.begin(), AB.end());
vector<ll> ABC;
for (int i = 0; i < min(K, (int)AB.size()); i++) {
for (int j = 0; j < Z; j++) {
ABC.push_back(AB[i] + C[j]);
}
}
sort(ABC.begin(), ABC.end());
reverse(ABC.begin(), ABC.end());
for (int i = 0; i < K; i++) {
cout << ABC[i] << '\n';
}
}
| #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 (int i = 0; i < Z; i++)
cin >> C[i];
vector<ll> AB;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
AB.push_back(A[i] + B[j]);
}
}
sort(AB.begin(), AB.end());
reverse(AB.begin(), AB.end());
vector<ll> ABC;
for (int i = 0; i < min(K, (int)AB.size()); i++) {
for (int j = 0; j < Z; j++) {
ABC.push_back(AB[i] + C[j]);
}
}
sort(ABC.begin(), ABC.end());
reverse(ABC.begin(), ABC.end());
for (int i = 0; i < K; i++) {
cout << ABC[i] << '\n';
}
}
| [
"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 second
#define ALL(x) (x).begin(), (x).end()
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const ll MOD = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//-------------------
int main() {
int a, b, c;
cin >> a >> b >> c;
bool ok = true;
if (a != b)
ok = false;
if (b != c)
ok = false;
if (c != a)
ok = false;
if (ok) {
cout << "Yes" << endl;
} else {
cout << "False" << endl;
}
return 0;
} |
#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 second
#define ALL(x) (x).begin(), (x).end()
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const ll MOD = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//-------------------
int main() {
int a, b, c;
cin >> a >> b >> c;
bool ok = true;
if (a != b)
ok = false;
if (b != c)
ok = false;
if (c != a)
ok = false;
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"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' << endl;
}
return 0;
} | #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" << endl;
}
return 0;
}
| [
"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 << "\n";
return 0;
} | [
"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), sizeof((a)))
#define precision(x, d) cout << fixed << setprecision(d) << x
#define minQueue priority_queue<ll, vector<ll>, greater<ll>>
#define maxQueue priority_queue<ll, vector<ll>, less<ll>>
#define deb1(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout << #x << " : " << x << " " << #y << " : " << y << endl;
#define deb3(x, y, z) \
cout << #x << " : " << x << " " << #y << " : " << y << " " << #z << " : " \
<< z << endl;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define READ freopen("input.txt", "r", stdin);
#define WRITE freopen("output.txt", "w", stdout);
#define RANDOM srand(time(NULL));
#define MOD 1000000007
#define NAX 1000005
#define INF LONG_LONG_MAX
#define MINF LONG_LONG_MIN
int main() {
FAST;
ll a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| // 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), sizeof((a)))
#define precision(x, d) cout << fixed << setprecision(d) << x
#define minQueue priority_queue<ll, vector<ll>, greater<ll>>
#define maxQueue priority_queue<ll, vector<ll>, less<ll>>
#define deb1(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout << #x << " : " << x << " " << #y << " : " << y << endl;
#define deb3(x, y, z) \
cout << #x << " : " << x << " " << #y << " : " << y << " " << #z << " : " \
<< z << endl;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define READ freopen("input.txt", "r", stdin);
#define WRITE freopen("output.txt", "w", stdout);
#define RANDOM srand(time(NULL));
#define MOD 1000000007
#define NAX 1000005
#define INF LONG_LONG_MAX
#define MINF LONG_LONG_MIN
int main() {
FAST;
ll 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,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)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll INF = 1LL << 60;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a == b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #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)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll INF = 1LL << 60;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
int main() {
ll 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,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;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
ll gcd(ll m, ll n) {
if (n == 0)
return abs(m);
return (gcd(n, m % n));
}
void putYN(bool b) {
if (b) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
int main() {
ll A, B, C;
cin >> A >> B >> C;
putYN(A == B && A == C);
return 0;
}
| #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;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
ll gcd(ll m, ll n) {
if (n == 0)
return abs(m);
return (gcd(n, m % n));
}
void putYN(bool b) {
if (b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
int main() {
ll A, B, C;
cin >> A >> B >> C;
putYN(A == B && A == C);
return 0;
}
| [
"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 <unordered_map>
#include <unordered_set>
#include <vector>
#define all(x) (x).begin(), (x).end()
#define fori(i, n) for (int i = 0; i < n; i++)
#define rep(i, s, e) for (int i = (s); i <= (e); ++i)
#define repr(i, s, e) for (int i = (s); i >= (e); --i)
#define ll long long int
#define pb push_back
namespace io {
class input_reader {
std::istream ∈
void throw_error() {
throw std::runtime_error("No more inputs while reading number");
}
template <typename T> inline void readIntegerValue(T &f) {
bool positive = true;
f = 0;
char c;
if (!in.get(c))
throw_error();
while (c < '0' || c > '9') {
if (c == '-')
positive = false;
if (!in.get(c))
throw_error();
}
while (c >= '0' && c <= '9') {
f = (f << 3) + (f << 1) + (c & 15);
if (!in.get(c))
break;
}
if (!positive)
f *= -1;
}
public:
explicit input_reader(std::istream &in) : in(in) {}
inline void read(int &f) { readIntegerValue(f); }
inline void read(short &f) { readIntegerValue(f); }
inline void read(long int &f) { readIntegerValue(f); }
inline void read(long long int &f) { readIntegerValue(f); }
inline void read(unsigned int &f) { readIntegerValue(f); }
inline void read(unsigned short &f) { readIntegerValue(f); }
inline void read(unsigned long int &f) { readIntegerValue(f); }
inline void read(unsigned long long int &f) { readIntegerValue(f); }
template <typename T> inline void read(std::vector<T> &f) {
for (auto &i : f)
read(i);
}
template <typename T, int N> inline void read(std::array<T, N> &res) {
for (auto &i : res)
read(i);
}
template <typename T1, typename T2> inline void read(std::pair<T1, T2> &p) {
in.read(p.first, p.second);
}
template <typename T> inline void read(T &f) { in >> f; }
template <typename T, typename... Args>
inline void read(T &t, Args &...args) {
read(t), read(args...);
}
template <typename T> inline void readArray(int n, T *res) {
while (n--)
read(*(res++));
}
template <typename T> inline input_reader &operator>>(T &t) {
return read(t), *this;
}
};
} // namespace io
namespace io {
class output_writer {
std::ostream &out;
template <typename T> inline void printIntegerHelper(T x) {
if (x >= 10)
printIntegerHelper(x / 10);
out.put(x % 10 + 48);
}
template <typename T> inline void printInteger(T x) {
if (x < 0)
out.put('-'), x = -x;
printIntegerHelper(x);
}
template <typename T> inline void printArray(T &ar) {
bool first = true;
for (auto &t : ar)
print((first) ? first = false, "" : " ", t);
}
public:
explicit output_writer(std::ostream &out) : out(out) {}
inline void flush() { out.flush(); }
inline void print() {}
inline void print(char x) { out.put(x); }
inline void print(short x) { printInteger(x); }
inline void print(int x) { printInteger(x); }
inline void print(long int x) { printInteger(x); }
inline void print(long long int x) { printInteger(x); }
inline void print(unsigned short x) { printInteger(x); }
inline void print(unsigned int x) { printInteger(x); }
inline void print(unsigned long int x) { printInteger(x); }
inline void print(unsigned long long int x) { printInteger(x); }
template <typename T1> inline void print(const T1 &t1) { out << t1; }
template <typename T1> inline void print(const std::vector<T1> &t1) {
printArray(t1);
}
template <typename T1, int N> inline void print(const std::array<T1, N> &t1) {
printArray(t1);
}
template <typename T1, int N, int M>
inline void print(const std::array<std::array<T1, M>, N> &t1) {
for (auto &t : t1)
println(t);
}
template <typename T1>
inline void print(const std::vector<std::vector<T1>> &t1) {
for (auto &t : t1)
println(t);
}
template <typename T, typename... Args>
inline void print(const T &t, Args... args) {
print(t), print(args...);
}
template <typename... Args> inline void println(Args... args) {
print(args...), print('\n');
}
template <typename T> output_writer &operator<<(const T &t) {
return print(t), *this;
}
};
} // namespace io
inline ll pow_mod(const ll a, const ll b, const ll MOD) {
if (b == 0)
return 1;
if (b == 1)
return a % MOD;
ll res = pow_mod(a * a % MOD, b >> 1, MOD);
if (b & 1)
res = res * a % MOD;
return res % MOD;
}
inline ll mod_inv(const ll a, const ll MOD) { return pow_mod(a, MOD - 2, MOD); }
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
using namespace std;
class ARegularTriangle {
class Solver {
io::input_reader in;
io::output_writer out;
public:
Solver(std::istream &in, std::ostream &out) : in(in), out(out) {}
void solve() {
int a, b, c;
in.read(a, b, c);
out << ((a == b && b == c) ? "YES" : "NO");
}
};
public:
void solve(std::istream &in, std::ostream &out) { Solver(in, out).solve(); }
};
int main() {
std::ios_base::sync_with_stdio(false), cin.tie(0);
ARegularTriangle solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* 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 <unordered_map>
#include <unordered_set>
#include <vector>
#define all(x) (x).begin(), (x).end()
#define fori(i, n) for (int i = 0; i < n; i++)
#define rep(i, s, e) for (int i = (s); i <= (e); ++i)
#define repr(i, s, e) for (int i = (s); i >= (e); --i)
#define ll long long int
#define pb push_back
namespace io {
class input_reader {
std::istream ∈
void throw_error() {
throw std::runtime_error("No more inputs while reading number");
}
template <typename T> inline void readIntegerValue(T &f) {
bool positive = true;
f = 0;
char c;
if (!in.get(c))
throw_error();
while (c < '0' || c > '9') {
if (c == '-')
positive = false;
if (!in.get(c))
throw_error();
}
while (c >= '0' && c <= '9') {
f = (f << 3) + (f << 1) + (c & 15);
if (!in.get(c))
break;
}
if (!positive)
f *= -1;
}
public:
explicit input_reader(std::istream &in) : in(in) {}
inline void read(int &f) { readIntegerValue(f); }
inline void read(short &f) { readIntegerValue(f); }
inline void read(long int &f) { readIntegerValue(f); }
inline void read(long long int &f) { readIntegerValue(f); }
inline void read(unsigned int &f) { readIntegerValue(f); }
inline void read(unsigned short &f) { readIntegerValue(f); }
inline void read(unsigned long int &f) { readIntegerValue(f); }
inline void read(unsigned long long int &f) { readIntegerValue(f); }
template <typename T> inline void read(std::vector<T> &f) {
for (auto &i : f)
read(i);
}
template <typename T, int N> inline void read(std::array<T, N> &res) {
for (auto &i : res)
read(i);
}
template <typename T1, typename T2> inline void read(std::pair<T1, T2> &p) {
in.read(p.first, p.second);
}
template <typename T> inline void read(T &f) { in >> f; }
template <typename T, typename... Args>
inline void read(T &t, Args &...args) {
read(t), read(args...);
}
template <typename T> inline void readArray(int n, T *res) {
while (n--)
read(*(res++));
}
template <typename T> inline input_reader &operator>>(T &t) {
return read(t), *this;
}
};
} // namespace io
namespace io {
class output_writer {
std::ostream &out;
template <typename T> inline void printIntegerHelper(T x) {
if (x >= 10)
printIntegerHelper(x / 10);
out.put(x % 10 + 48);
}
template <typename T> inline void printInteger(T x) {
if (x < 0)
out.put('-'), x = -x;
printIntegerHelper(x);
}
template <typename T> inline void printArray(T &ar) {
bool first = true;
for (auto &t : ar)
print((first) ? first = false, "" : " ", t);
}
public:
explicit output_writer(std::ostream &out) : out(out) {}
inline void flush() { out.flush(); }
inline void print() {}
inline void print(char x) { out.put(x); }
inline void print(short x) { printInteger(x); }
inline void print(int x) { printInteger(x); }
inline void print(long int x) { printInteger(x); }
inline void print(long long int x) { printInteger(x); }
inline void print(unsigned short x) { printInteger(x); }
inline void print(unsigned int x) { printInteger(x); }
inline void print(unsigned long int x) { printInteger(x); }
inline void print(unsigned long long int x) { printInteger(x); }
template <typename T1> inline void print(const T1 &t1) { out << t1; }
template <typename T1> inline void print(const std::vector<T1> &t1) {
printArray(t1);
}
template <typename T1, int N> inline void print(const std::array<T1, N> &t1) {
printArray(t1);
}
template <typename T1, int N, int M>
inline void print(const std::array<std::array<T1, M>, N> &t1) {
for (auto &t : t1)
println(t);
}
template <typename T1>
inline void print(const std::vector<std::vector<T1>> &t1) {
for (auto &t : t1)
println(t);
}
template <typename T, typename... Args>
inline void print(const T &t, Args... args) {
print(t), print(args...);
}
template <typename... Args> inline void println(Args... args) {
print(args...), print('\n');
}
template <typename T> output_writer &operator<<(const T &t) {
return print(t), *this;
}
};
} // namespace io
inline ll pow_mod(const ll a, const ll b, const ll MOD) {
if (b == 0)
return 1;
if (b == 1)
return a % MOD;
ll res = pow_mod(a * a % MOD, b >> 1, MOD);
if (b & 1)
res = res * a % MOD;
return res % MOD;
}
inline ll mod_inv(const ll a, const ll MOD) { return pow_mod(a, MOD - 2, MOD); }
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
using namespace std;
class ARegularTriangle {
class Solver {
io::input_reader in;
io::output_writer out;
public:
Solver(std::istream &in, std::ostream &out) : in(in), out(out) {}
void solve() {
int a, b, c;
in.read(a, b, c);
out << ((a == b && b == c) ? "Yes" : "No");
}
};
public:
void solve(std::istream &in, std::ostream &out) { Solver(in, out).solve(); }
};
int main() {
std::ios_base::sync_with_stdio(false), cin.tie(0);
ARegularTriangle solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| [
"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;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// bucket1
// bool ch[10] = {0};
// bool check(int n){
// while(n!=0){
// if(ch[n%10]) return false;
// n /= 10;
// }
// return true;
// }
// --------write my code!!!!!----------//
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
;
} | #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;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// bucket1
// bool ch[10] = {0};
// bool check(int n){
// while(n!=0){
// if(ch[n%10]) return false;
// n /= 10;
// }
// return true;
// }
// --------write my code!!!!!----------//
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,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;
double euclid_distance(double a, double b) { return sqrt(a * a + b * b); }
int gcd(long long int a, long long int b) {
long long int r;
if (a < b) {
int tmp;
tmp = a;
a = b;
b = tmp;
}
while (r != 0) {
r = a % b;
a = b;
b = r;
}
return r;
}
void Integer_factorization(long long int b, long long int n) {
long long int a = 2;
long long int count = 0;
long long int ans = 1;
long long int ndash = n;
if (b == 1)
cout << n << endl;
else {
while (ndash >= a * a) {
if (n % a == 0) {
count++;
n /= a;
if (count % b == 0) {
ans *= a;
}
} else {
a++;
count = 0;
}
}
cout << ans << endl;
}
}
void ys() { cout << "Yes" << endl; }
void yb() { cout << "YES" << endl; }
void ns() { cout << "No" << endl; }
void nb() { cout << "NO" << endl; }
void solve(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c)
ys();
else
ns();
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| #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;
double euclid_distance(double a, double b) { return sqrt(a * a + b * b); }
int gcd(long long int a, long long int b) {
long long int r;
if (a < b) {
int tmp;
tmp = a;
a = b;
b = tmp;
}
while (r != 0) {
r = a % b;
a = b;
b = r;
}
return r;
}
void Integer_factorization(long long int b, long long int n) {
long long int a = 2;
long long int count = 0;
long long int ans = 1;
long long int ndash = n;
if (b == 1)
cout << n << endl;
else {
while (ndash >= a * a) {
if (n % a == 0) {
count++;
n /= a;
if (count % b == 0) {
ans *= a;
}
} else {
a++;
count = 0;
}
}
cout << ans << endl;
}
}
void ys() { cout << "Yes" << endl; }
void yb() { cout << "YES" << endl; }
void ns() { cout << "No" << endl; }
void nb() { cout << "NO" << endl; }
void solve(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
ys();
else
ns();
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| [
"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.