problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long trans[5];
long long min_trans;
long long time;
cin >> N;
for (int i = 0; i < 4; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 4; ++i) {
min_trans = min(min_trans, trans[i]);
}
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long trans[5];
long long min_trans;
long long time;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 5; ++i) {
min_trans = min(min_trans, trans[i]);
}
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,563 | 894,566 | u969265031 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long trans[5];
long long min_trans;
long long time;
cin >> N;
for (int i = 0; i < 4; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 5; ++i) {
min_trans = min(min_trans, trans[i]);
}
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long trans[5];
long long min_trans;
long long time;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 5; ++i) {
min_trans = min(min_trans, trans[i]);
}
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,565 | 894,566 | u969265031 | cpp |
p03077 | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
long long a[6], A, i, s = 0, j;
for (i = 0; i < 6; i++) {
scanf("%lld", &a[i]);
}
sort(a + 1, a + 6);
if (a[0] % a[1 + 1] != 0)
A = a[0] / a[1] + 1;
else
A = a[0] / a[1];
s = A + 4;
printf("%lld", s);
}
| #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
long long a[6], A, i, s = 0, j;
for (i = 0; i < 6; i++) {
scanf("%lld", &a[i]);
}
sort(a + 1, a + 6);
if (a[0] % a[1] != 0)
A = a[0] / a[1] + 1;
else
A = a[0] / a[1];
s = A + 4;
printf("%lld", s);
}
| [
"expression.operation.binary.remove"
] | 894,572 | 894,573 | u083496316 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> arr(5);
ll mini = LLONG_MAX;
for (int z = 0; z < 5; z++) {
cin >> arr[z];
mini = min(mini, arr[z]);
}
ll answer = n / mini;
if (n & 1)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> arr(5);
ll mini = LLONG_MAX;
for (int z = 0; z < 5; z++) {
cin >> arr[z];
mini = min(mini, arr[z]);
}
ll answer = n / mini;
if (n % mi... | [
"control_flow.branch.if.condition.change"
] | 894,582 | 894,583 | u553927381 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> arr(5);
ll mini = LLONG_MAX;
for (int z = 0; z < 5; z++) {
cin >> arr[z];
mini = min(mini, arr[z]);
}
ll answer = n / mini;
if (answer... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> arr(5);
ll mini = LLONG_MAX;
for (int z = 0; z < 5; z++) {
cin >> arr[z];
mini = min(mini, arr[z]);
}
ll answer = n / mini;
if (n % mi... | [
"control_flow.branch.if.condition.change"
] | 894,584 | 894,583 | u553927381 | cpp |
p03077 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// 入力
long long n;
vector<long long> C(5, 0);
cin >> n;
for (int i = 0; i < 5; ++i) {
cin >> C[i];
}
long long min_c = C[0];
for (int i = 1; i < 5; ++i) {
min_c = min(min_c, C[i]);
}
//
int ans ... |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// 入力
long long n;
vector<long long> C(5, 0);
cin >> n;
for (int i = 0; i < 5; ++i) {
cin >> C[i];
}
long long min_c = C[0];
for (int i = 1; i < 5; ++i) {
min_c = min(min_c, C[i]);
}
//
long lon... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 894,587 | 894,588 | u556799364 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
ll N;
vector<ll> V(5);
cin >> N;
rep(i, 0, 5) cin >> V[i];
ll mini = INF;
rep(i, 0, 5) mini = min(mini, V[i]);
ll ans = 4 + ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
ll INF = (1LL << 60) - 1;
int MOD = 1e9 + 7;
main() {
ll N;
vector<ll> V(5);
cin >> N;
rep(i, 0, 5) cin >> V[i];
ll mini = INF;
rep(i, 0, 5) mini = min(mini, V[i]);
ll ans = 4 + (... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 894,608 | 894,609 | u157322125 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, x, y, z, h, w, n, e;
void input() { cin >> n >> a >> b >> c >> d >> e; }
void solve() {
ll sum = 0;
int m = min({a, b, c, d, e});
sum += n % m == 0 ? m : n / m + 1;
sum += 4;
cout << su... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, x, y, z, h, w, n, e;
void input() { cin >> n >> a >> b >> c >> d >> e; }
void solve() {
ll sum = 0;
ll m = min({a, b, c, d, e});
sum += n % m == 0 ? n / m : n / m + 1;
sum += 4;
cout <<... | [
"variable_declaration.type.change"
] | 894,613 | 894,612 | u789199225 | cpp |
p03077 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
long long n;
long long tosi[5];
cin >> n;
cin >> tosi[0];
cin >> tosi[1];
cin >> tosi[2];
cin >> tosi[3];
cin >> tosi[4];
long int min = tosi[0];
for (int i = 0; i < 5; i++) {
if (tosi[i] < min) {
min = tosi[i];
... | #include <iostream>
#include <string.h>
using namespace std;
int main() {
long long n;
long long tosi[5];
cin >> n;
cin >> tosi[0];
cin >> tosi[1];
cin >> tosi[2];
cin >> tosi[3];
cin >> tosi[4];
long int min = tosi[0];
for (int i = 0; i < 5; i++) {
if (tosi[i] < min) {
min = tosi[i];
... | [] | 894,616 | 894,617 | u375879613 | cpp |
p03077 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long long N, A, B, C, D, E, m, t = 0;
cin >> N >> A >> B >> C >> D >> E;
m = min({A, B, C, D, E});
cout << 4 + N / m + (N / m != 0) << endl;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long long N, A, B, C, D, E, m, t = 0;
cin >> N >> A >> B >> C >> D >> E;
m = min({A, B, C, D, E});
cout << 4 + N / m + (N % m != 0) << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 894,618 | 894,619 | u313403396 | cpp |
p03077 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int t;
unsigned long long x[6];
for (t = 0; t < 6; t++)
cin >> x[t];
unsigned long long mini = x[1];
unsigned long long minit = 1;
for (t = 1; t < 6; t++) {
if (mini > x[t]) {
mini = x[t];
minit = t;
}
}
un... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int t;
unsigned long long x[6];
for (t = 0; t < 6; t++)
cin >> x[t];
unsigned long long mini = x[1];
unsigned long long minit = 1;
for (t = 1; t < 6; t++) {
if (mini > x[t]) {
mini = x[t];
minit = t;
}
}
un... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 894,635 | 894,636 | u344462910 | cpp |
p03077 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int t;
unsigned long long x[6];
for (t = 0; t < 6; t++)
cin >> x[t];
unsigned long long mini = x[1];
unsigned long long minit = 1;
for (t = 1; t < 6; t++) {
if (mini > x[t]) {
mini = x[t];
minit = t;
}
}
un... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int t;
unsigned long long x[6];
for (t = 0; t < 6; t++)
cin >> x[t];
unsigned long long mini = x[1];
unsigned long long minit = 1;
for (t = 1; t < 6; t++) {
if (mini > x[t]) {
mini = x[t];
minit = t;
}
}
un... | [
"variable_declaration.type.primitive.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 894,637 | 894,636 | u344462910 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> city(5, 0);
int n;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> city[i];
sort(city.begin(), city.end());
long long rtn = 0;
if (n % city[0] == 0) {
rtn += n / city[0];
} else {
rtn... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> city(5, 0);
long long n;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> city[i];
sort(city.begin(), city.end());
long long rtn = 0;
if (n % city[0] == 0) {
rtn += n / city[0];
} else {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 894,638 | 894,639 | u239023686 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, m[5], ans = 0;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> m[i];
}
for (int i = 4; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (m[j] > m[j + 1]) {
long long tmp = m[j];
m[j] = m[j +... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, m[5], ans = 0;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> m[i];
}
for (int i = 4; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (m[j] > m[j + 1]) {
long long tmp = m[j];
m[j] = m[j +... | [] | 894,648 | 894,649 | u801916231 | cpp |
p03077 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define INF ULLONG_MAX
ull N;
int main() {
cin >> N;
ull temp;
ull min_tra = INF;
for (int i = 0; i < 5; ++i) {
cin >> temp;
min_tra = min(temp, min_tra);
}
if (N % min_tra == 0)... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define INF ULLONG_MAX
ull N;
int main() {
cin >> N;
ull temp;
ull min_tra = INF;
for (int i = 0; i < 5; ++i) {
cin >> temp;
min_tra = min(temp, min_tra);
}
if (N % min_tra == 0)... | [
"literal.number.change",
"io.output.change"
] | 894,659 | 894,660 | u045354461 | cpp |
p03077 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll n, a, ans = 0, min = pow(10, 15);
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a;
if (min > a)
min = a;
}
ans = (long long)n / (long long)min + 5;
printf("%lld\n", ans);
} | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll n, a, ans = 0, min = pow(10, 15);
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a;
if (min > a)
min = a;
}
ans = (long long)(n - 1) / (long long)min + 5;
printf("%lld\n", ans);
} | [] | 894,667 | 894,668 | u839397805 | cpp |
p03078 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N =... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N =... | [
"call.arguments.change"
] | 894,675 | 894,676 | u916060970 | cpp |
p03078 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N =... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N =... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 894,677 | 894,676 | u916060970 | cpp |
p03078 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N =... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N =... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 894,678 | 894,676 | u916060970 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000;
int A[N], B[N], C[N];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int x, y, z, want;
cin >> x >> y >> z >> want;
for (int i = 0; i < x; i++)
cin >> A[i];
for (int i = 0; i < y; i++)
cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000;
ll A[N], B[N], C[N];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int x, y, z, want;
cin >> x >> y >> z >> want;
for (int i = 0; i < x; i++)
cin >> A[i];
for (int i = 0; i < y; i++)
cin >... | [
"variable_declaration.type.change"
] | 894,704 | 894,705 | u941439948 | cpp |
p03078 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
#define ull unsigned long... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
#define ull unsigned long... | [] | 894,715 | 894,716 | u903311413 | cpp |
p03078 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF (1 << 21);
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> x;
vector<ll> y;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF (1 << 21);
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> x;
vector<ll> y;
... | [
"misc.opposites",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 894,722 | 894,723 | u275488634 | cpp |
p03078 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF (1 << 21);
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> x;
vector<ll> y;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF (1 << 21);
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> x;
vector<ll> y;
... | [
"control_flow.loop.for.condition.change"
] | 894,725 | 894,723 | u275488634 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> xlist(x);
for (int i = 0; i < x; i++) {
cin >> xlist[i];
}
vector<ll> ylist(y);
for (int i = 0; i < y; i++) {
cin >> ylist[i];
}
vecto... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> xlist(x);
for (int i = 0; i < x; i++) {
cin >> xlist[i];
}
vector<ll> ylist(y);
for (int i = 0; i < y; i++) {
cin >> ylist[i];
}
vecto... | [
"expression.operation.binary.remove"
] | 894,730 | 894,731 | u146594935 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> xlist(x);
for (int i = 0; i < x; i++) {
cin >> xlist[i];
}
vector<ll> ylist(y);
for (int i = 0; i < y; i++) {
cin >> ylist[i];
}
vecto... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> xlist(x);
for (int i = 0; i < x; i++) {
cin >> xlist[i];
}
vector<ll> ylist(y);
for (int i = 0; i < y; i++) {
cin >> ylist[i];
}
vecto... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 894,732 | 894,731 | u146594935 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a) for (int i = 0; i < (a); i++)
const ll MOD = 1000000007;
// const ll MOD=998244353;
int X, Y, Z;
ll K;
ll A[1010], B[1010], C[1010];
bool solve(ll mid) {
ll sum = 0;
rep(i, X) rep(j, Y) {
int k = lower_bound(C, C + Z + 1, mi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a) for (int i = 0; i < (a); i++)
const ll MOD = 1000000007;
// const ll MOD=998244353;
int X, Y, Z;
ll K;
ll A[1010], B[1010], C[1010];
bool solve(ll mid) {
ll sum = 0;
rep(i, X) rep(j, Y) {
int k = lower_bound(C, C + Z + 1, mi... | [
"literal.number.change",
"variable_declaration.value.change"
] | 894,740 | 894,741 | u046768272 | cpp |
p03078 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 894,751 | 894,752 | u964763428 | cpp |
p03078 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typed... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typed... | [
"call.arguments.change"
] | 894,782 | 894,783 | u630664279 | cpp |
p03078 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"call.arguments.change"
] | 894,796 | 894,797 | u284124505 | cpp |
p03078 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"call.arguments.change"
] | 894,798 | 894,797 | u284124505 | cpp |
p03078 | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 11451419194545;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X, 0);
vector<ll> B(Y,... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 11451419194545;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X, 0);
vector<ll> B(Y,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 894,799 | 894,800 | u048791623 | cpp |
p03078 | #include <algorithm>
#include <cstdio>
#include <map>
#include <queue>
using namespace std;
#define ll long long
struct s {
int v, i, j;
};
class cmp {
public:
bool operator()(const s &a, const s &b) { return a.v < b.v; }
};
int main() {
int x, y, z, k;
scanf("%d %d %d %d", &x, &y, &z, &k);
ll a[x], b[y], c[z... | #include <algorithm>
#include <cstdio>
#include <map>
#include <queue>
using namespace std;
#define ll long long
struct s {
ll v, i, j;
};
class cmp {
public:
bool operator()(const s &a, const s &b) { return a.v < b.v; }
};
int main() {
int x, y, z, k;
scanf("%d %d %d %d", &x, &y, &z, &k);
ll a[x], b[y], c[z]... | [] | 894,801 | 894,802 | u340969800 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z;
cin >> X >> Y >> Z;
long long K;
cin >> K;
vector<long long> A, B, C;
vector<pair<long long, int>> vec;
for (int a = 0; a < X; a++) {
long long b;
cin >> b;
A.push_back(b);
}
for (int a = 0; a < Y; a++) {
long lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z;
cin >> X >> Y >> Z;
long long K;
cin >> K;
vector<long long> A, B, C;
vector<pair<long long, int>> vec;
for (int a = 0; a < X; a++) {
long long b;
cin >> b;
A.push_back(b);
}
for (int a = 0; a < Y; a++) {
long lo... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 894,810 | 894,811 | u580402951 | cpp |
p03078 | #include <bits/stdc++.h>
#define LL long long
#define db double
using namespace std;
#define MAXN 200200
#define MAXE 400400
typedef pair<int, int> pii;
#define X first
#define Y second
const LL INF = (1LL << 62) | 3;
#define Debug(...) fprintf(stderr, __VA_ARGS__)
template <typename T> inline void read(T &x) {
in... | #include <bits/stdc++.h>
#define LL long long
#define db double
using namespace std;
#define MAXN 200200
#define MAXE 400400
typedef pair<int, int> pii;
#define X first
#define Y second
const LL INF = (1LL << 62) | 3;
#define Debug(...) fprintf(stderr, __VA_ARGS__)
template <typename T> inline void read(T &x) {
in... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 894,826 | 894,827 | u194743874 | cpp |
p03079 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 894,848 | 894,849 | u516525290 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm = 1000000000;
ll MM = mm + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.141592653589793
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "YES" << endl;
else
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm = 1000000000;
ll MM = mm + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.141592653589793
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes" << endl;
else
cou... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,852 | 894,853 | u927053131 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
// [正]三角形
int main(void) {
int a[3];
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
if (a[2] == a[1] and a[0] == a[1]) {
cout << "YES";
} else {
cout << "NO";
}
}
| #include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
// [正]三角形
int main(void) {
int a[3];
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
if (a[2] == a[1] and a[0] == a[1]) {
cout << "Yes"; //
} else {
cout << "No"; //
}
// cout<<endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,854 | 894,855 | u520276780 | cpp |
p03079 | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int a, b, c;
cin >> a >> b >> c;
if (a... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int a, b, c;
cin >> a >> b >> c;
if (a... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,856 | 894,857 | u273359100 | cpp |
p03079 | /*
author : nishi5451
created: 12.08.2020 14:48:15
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; 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;
re... | /*
author : nishi5451
created: 12.08.2020 14:48:15
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; 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;
re... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,858 | 894,859 | u033937898 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, k, i, j;
cin >> x >> y >> z >> k;
long long a[x], b, d[x * y] = {}, e[k * z] = {};
for (i = 0; i < x; i++) {
cin >> a[i];
}
for (i = 0; i < y; i++) {
cin >> b;
for (j = 0; j < x; j++) {
d[y * i + j] = a[j] + b;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, k, i, j;
cin >> x >> y >> z >> k;
long long a[x], b, d[x * y] = {}, e[k * z] = {};
for (i = 0; i < x; i++) {
cin >> a[i];
}
for (i = 0; i < y; i++) {
cin >> b;
for (j = 0; j < x; j++) {
d[x * i + j] = a[j] + b;
}
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 894,882 | 894,883 | u058348416 | cpp |
p03078 | #include <bits/stdc++.h>
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++) {... | #include <bits/stdc++.h>
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++) {... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 894,892 | 894,893 | u987594251 | cpp |
p03078 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
int main(int argc, char *argv[]) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int> A(X);
vector<int> B(Y);
vector<int> C(Z);
int i, j, k;
for (i = 0; i < X; i++) {
cin >> A[i];
}
for (i = 0; i < Y;... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
int main(int argc, char *argv[]) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<LL> A(X);
vector<LL> B(Y);
vector<LL> C(Z);
int i, j, k;
for (i = 0; i < X; i++) {
cin >> A[i];
}
for (i = 0; i < Y; i+... | [] | 894,905 | 894,906 | u875570028 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
long long k = 0, c[3] = {0};
vector<long long> cake[3], ans, lst;
void solve();
long long ch(long long now);
int main() {
for (int i = 0; i < 3; ++i)
cin >> c[i];
cin >> k;
for (int i = 0; i < 3; ++i) {
cake[i].resize(c[i]);
for (int j = 0; j < c[i]; +... | #include <bits/stdc++.h>
using namespace std;
long long k = 0, c[3] = {0};
vector<long long> cake[3], ans, lst;
void solve();
long long ch(long long now);
int main() {
for (int i = 0; i < 3; ++i)
cin >> c[i];
cin >> k;
for (int i = 0; i < 3; ++i) {
cake[i].resize(c[i]);
for (int j = 0; j < c[i]; +... | [
"assignment.change"
] | 894,911 | 894,912 | u269963329 | cpp |
p03079 | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define int long long
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(c) (c).rbegin(), (c).rend()
#define mp make_pair
#... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define int long long
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(c) (c).rbegin(), (c).rend()
#define mp make_pair
#... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 894,917 | 894,918 | u339937125 | cpp |
p03079 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstdlib>
#include <deque> // deque
#include <iostream> //... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstdlib>
#include <deque> // deque
#include <iostream> //... | [
"control_flow.branch.if.condition.change"
] | 894,919 | 894,920 | u527652459 | cpp |
p03079 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | [
"control_flow.branch.if.condition.change"
] | 894,926 | 894,927 | u688789047 | cpp |
p03079 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
int main(void) {
vector<ll> a(3);
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[0] + a[1] > a[2])
cout << "Yes" << endl;
else
cout << "No" << endl;
... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
int main(void) {
vector<ll> a(3);
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[0] == a[2])
cout << "Yes" << endl;
else
cout << "No" << endl;
return... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 894,933 | 894,934 | u755121033 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A == B && B == C ? "Yes" : "Np") << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A == B && B == C ? "Yes" : "No") << endl;
} | [
"literal.string.change",
"io.output.change"
] | 894,939 | 894,940 | u868132236 | cpp |
p03079 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a == b && b == c) ? "Yes" : "No";
}
| #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << ((a == b && b == c) ? "Yes" : "No");
} | [] | 894,941 | 894,942 | u424602097 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define LONGLONGMAX 9223372036854775807
#define LONGLONGMIN -9223372036854775807
#define INTMAX 32767
#define INTMIN -32767
#define ROUNDUP(divisor, dividend) (divisor + (dividend - 1)) / dividend
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (a == b && b == c ?... | #include <bits/stdc++.h>
using namespace std;
#define LONGLONGMAX 9223372036854775807
#define LONGLONGMIN -9223372036854775807
#define INTMAX 32767
#define INTMIN -32767
#define ROUNDUP(divisor, dividend) (divisor + (dividend - 1)) / dividend
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (a == b && b == c ?... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,943 | 894,944 | u890807039 | cpp |
p03079 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i, n) for (in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i, n) for (in... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,947 | 894,948 | u545364250 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (max({a, b, c}) == min({a, 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 (max({a, b, c}) == min({a, b, c})) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,949 | 894,950 | u519194615 | cpp |
p03079 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll a, b, c;
cin >> a, b, c;
if (a == b and b == c and a == c) {
cout << "Yes" << endl;
} e... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a == b and b == c and a == c) {
cout << "Yes" << endl;
... | [] | 894,953 | 894,954 | u473023730 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if (x == y == z) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if (x == y && y == z) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 894,955 | 894,956 | u178021677 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if (x == y == z) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if (x == y && y == z) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 894,955 | 894,957 | u178021677 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
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;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
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;
}
| [
"control_flow.branch.if.condition.change"
] | 894,958 | 894,959 | u902803949 | cpp |
p03079 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 894,960 | 894,961 | u247679666 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes" << endl;
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define 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;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 894,962 | 894,963 | u548834738 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 894,976 | 894,977 | u517197973 | cpp |
p03079 | #include <bits/stdc++.h>
#include <string>
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>
#include <string>
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",
"literal.string.case.change",
"io.output.change"
] | 894,981 | 894,982 | u512624048 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
int 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;
int B;
int C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 894,985 | 894,986 | u091026689 | cpp |
p03079 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,989 | 894,990 | u608258653 | cpp |
p03079 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | [
"control_flow.branch.if.condition.change"
] | 895,004 | 895,005 | u242679311 | cpp |
p03079 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
int main() {
ll a, b, c;
cin >> ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
int main() {
ll a, b, c;
cin >> ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,008 | 895,009 | u273928723 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 895,010 | 895,011 | u569778242 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a == b == c ? "Yes" : "No") << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a == b && b == c ? "Yes" : "No") << endl;
} | [
"expression.operation.binary.add"
] | 895,014 | 895,015 | u392569193 | 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,016 | 895,017 | u710135612 | cpp |
p03079 | #include <iostream>
#include <set>
using namespace std;
int main(int argc, const char *argv[]) {
set<int> st;
int x;
for (int i = 0; i < 2; i++) {
cin >> x;
st.insert(x);
}
if (st.size() == 1) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <iostream>
#include <set>
using namespace std;
int main(int argc, const char *argv[]) {
set<int> st;
int x;
for (int i = 0; i < 3; i++) {
cin >> x;
st.insert(x);
}
if (st.size() == 1) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 895,024 | 895,025 | u493080913 | 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,026 | 895,027 | u218759384 | cpp |
p03079 | #include <stdio.h>
int main(void) {
int A, B, C;
scanf("%d", &A);
scanf("%d", &B);
scanf("%d", &C);
if (A == B && B == C)
printf("yes");
else
printf("no");
return 0;
} | #include <stdio.h>
int main(void) {
int A, B, C;
scanf("%d", &A);
scanf("%d", &B);
scanf("%d", &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,032 | 895,033 | u956941456 | 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;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 895,036 | 895,037 | u795273869 | 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 && a == c) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 895,041 | 895,042 | u445015174 | 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";
} | #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";
} | [] | 895,052 | 895,053 | u455489956 | 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;
}
return 0;
}
| #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;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,062 | 895,063 | u673058289 | cpp |
p03079 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a == b && b == c) ? "Yes" : "No";
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a == b && b == c ? "Yes" : "No");
} | [] | 895,064 | 895,065 | u649972935 | cpp |
p03079 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a == b == c) {
std::cout << "Yes";
} else {
std::cout << "No";
}
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a == b && b == c) {
std::cout << "Yes";
} else {
std::cout << "No";
}
} | [
"control_flow.branch.if.condition.change"
] | 895,066 | 895,067 | u649972935 | cpp |
p03079 | /*input
2 2 2
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define IOS ... | /*input
3 4 5
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define IOS ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,070 | 895,071 | u010467501 | 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;
}
} | [] | 895,087 | 895,088 | u361841553 | cpp |
p03079 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
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;
}
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
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;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,092 | 895,093 | u954985773 | 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";
} | #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";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,094 | 895,095 | u070471279 | cpp |
p03079 | /* <rab:include(base.hpp)> */
#pragma GCC optimize("O3")
void solve(); /* この関数に問題ごとの処理を書く */
#if defined(EBUG) && !defined(ONLINE_JUDGE)
#define debug true
#else
#define NDEBUG /* <cassert>のincludeより前に定義する必要がある */
#define debug false
#endif
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#in... | /* <rab:include(base.hpp)> */
#pragma GCC optimize("O3")
void solve(); /* この関数に問題ごとの処理を書く */
#if defined(EBUG) && !defined(ONLINE_JUDGE)
#define debug true
#else
#define NDEBUG /* <cassert>のincludeより前に定義する必要がある */
#define debug false
#endif
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#in... | [
"identifier.change",
"io.output.change"
] | 895,098 | 895,099 | u032223772 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
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;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
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,102 | 895,103 | u317918118 | cpp |
p03079 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
string ans;
cin >> a >> b >> c;
ans = "No";
if (a == b == c) {
ans = "Yes";
}
cout << ans << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
string ans;
cin >> a >> b >> c;
ans = "No";
if (a == b && a == c) {
ans = "Yes";
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 895,104 | 895,105 | u365928729 | 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,116 | 895,117 | u348914050 | 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 && a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,118 | 895,117 | u348914050 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep0(i, b, s) for (int i = b; i < s; 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;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep0(i, b, s) for (int i = b; i < s; 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;
} | [
"control_flow.branch.if.condition.change"
] | 895,125 | 895,126 | u738835924 | 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,129 | 895,130 | u352152495 | 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;
} | [
"control_flow.branch.if.condition.change"
] | 895,132 | 895,130 | u352152495 | 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;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 895,139 | 895,140 | u170628605 | 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,146 | 895,147 | u587364000 | 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,148 | 895,147 | u587364000 | 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 && A == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 895,152 | 895,153 | u768838833 | cpp |
p03079 | #import <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 && A == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 895,154 | 895,153 | u768838833 | 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;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,155 | 895,156 | u386907894 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a != b || a != c || b != c) {
cout << "NO";
return 0;
}
cout << "YES";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a != b || a != c || b != c) {
cout << "No";
return 0;
}
cout << "Yes";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,157 | 895,158 | u314693739 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B) {
if (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;
} | [
"control_flow.branch.if.condition.change"
] | 895,163 | 895,164 | u464725395 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,177 | 895,178 | u929996201 | 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";
else
cout << "NO"
<< "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,182 | 895,178 | u929996201 | cpp |
p03079 | #include <bits/stdc++.h>
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 <bits/stdc++.h>
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;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,192 | 895,193 | u255412750 | cpp |
p03079 | #include <bits/stdc++.h>
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 <bits/stdc++.h>
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;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 895,194 | 895,193 | u255412750 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.