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 |
|---|---|---|---|---|---|---|---|
p03061 | #include <bits/stdc++.h>
using namespace std;
int Gcd(int a, int b) {
if (b == 0)
return a;
return Gcd(b, a % b);
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> L(N), R(N);
L[1] = A[0], R[N - 2] = A[N - 1];
for (int i = 2; i < N; i++)
... | #include <bits/stdc++.h>
using namespace std;
int Gcd(int a, int b) {
if (b == 0)
return a;
return Gcd(b, a % b);
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> L(N), R(N);
L[1] = A[0], R[N - 2] = A[N - 1];
for (int i = 2; i < N; i++)
... | [
"assignment.value.change",
"identifier.change"
] | 877,557 | 877,558 | u879581330 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(void) {
int n;
cin >> n;
vector<int> s(n);
for (auto &tmp : s) {
cin >> tmp;
}
int L[n], R[n];
L[0] = s[0];
R[n - 1] = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(void) {
int n;
cin >> n;
vector<int> s(n);
for (auto &tmp : s) {
cin >> tmp;
}
int L[n], R[n];
L[0] = s[0];
R[n - 1] = ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,559 | 877,560 | u850779832 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1e9
#define LINF 1e18
#define FOR(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define FORr(i, j, k) for (int i = j; i >= k; --i)
#define repr(i, j) FOR(i, j, 0)
typedef unsigned long long ull;
typedef pair<int, in... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1e9
#define LINF 1e18
#define FOR(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define FORr(i, j, k) for (int i = j; i >= k; --i)
#define repr(i, j) FOR(i, j, 0)
typedef unsigned long long ull;
typedef pair<int, in... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,561 | 877,562 | u292929213 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n), c(n), d(n), x(n);
rep(i, n) cin >> a[i];
c[0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n), c(n), d(n), x(n);
rep(i, n) cin >> a[i];
c[0... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 877,566 | 877,567 | u604231488 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> l(n);
vector<int> r(n);
for (int i = 0; i < n; i++) {
l[i + 1] = gc... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> l(n + 1);
vector<int> r(n + 1);
for (int i = 0; i < n; i++) {
l[i +... | [
"assignment.change"
] | 877,573 | 877,574 | u410878763 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ios() \
ios::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ios() \
ios::sync_with_stdio(0); ... | [
"expression.operation.binary.remove"
] | 877,588 | 877,589 | u904833081 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,590 | 877,591 | u124992729 | cpp |
p03061 | #define __USE_MINGW_ANSI_STDIO 0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef pair<ul, ul> ... | #define __USE_MINGW_ANSI_STDIO 0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef pair<ul, ul> ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 877,598 | 877,599 | u403848488 | cpp |
p03061 | #define __USE_MINGW_ANSI_STDIO 0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef pair<ul, ul> ... | #define __USE_MINGW_ANSI_STDIO 0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef pair<ul, ul> ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 877,600 | 877,599 | u403848488 | cpp |
p03067 |
#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 <deque> // deque
#include <iomanip>
#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 <deque> // deque
#include <iomanip>
#include <iostream>
... | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 877,619 | 877,620 | u927801748 | cpp |
p03067 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-24 18:55:13
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 877,623 | 877,624 | u095266283 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (((A < C && C < A) || (A > C && C > B)) ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (((A < C && C < B) || (A > C && C > B)) ? "Yes" : "No") << endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 877,625 | 877,626 | u379168673 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define mod 1000000007
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
int a, b, c;
... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define mod 1000000007
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
int a, b, c;
... | [
"misc.typo",
"control_flow.branch.if.condition.change"
] | 877,635 | 877,636 | u426143712 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (int i = 0; i < n; ++i)
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c;
cin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (int i = 0; i < n; ++i)
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c;
cin... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,639 | 877,640 | u375398641 | cpp |
p03067 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define YY cout << "Yes" << endl
#define NN cout << "No" << endl
#define pint pair<int,... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define YY cout << "Yes" << endl
#define NN cout << "No" << endl
#define pint pair<int,... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,641 | 877,642 | u820341516 | cpp |
p03067 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define YY cout << "Yes" << endl
#define NN cout << "No" << endl
#define pint pair<int,... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define YY cout << "Yes" << endl
#define NN cout << "No" << endl
#define pint pair<int,... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,643 | 877,642 | u820341516 | cpp |
p03067 | #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... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,650 | 877,651 | u545364250 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
scanf("%d%d%d", &a, &b, &c);
if (a > b)
swap(a, b);
if (a < c && c < b)
puts("YES");
else
puts("NO");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
scanf("%d%d%d", &a, &b, &c);
if (a > b)
swap(a, b);
if (a < c && c < b)
puts("Yes");
else
puts("No");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 877,654 | 877,655 | u887700001 | cpp |
p03067 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int a = max(max(A, B), C);
int b = min(min(A, B), C);
if (B != a && B != b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int a = max(max(A, B), C);
int b = min(min(A, B), C);
if (C != a && C != b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,656 | 877,657 | u101808526 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x + modulo)) % modulo)
#define Inf 1000000000
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A - B) * (C - B) < 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x + modulo)) % modulo)
#define Inf 1000000000
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A - C) * (C - B) < 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,668 | 877,669 | u118797367 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define llint long long int
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > c) {
swap(a, c);
}
if (c > a && c < b) {
cout << "Yes" << endl;
} else ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define llint long long int
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b) {
swap(a, b);
}
if (c > a && c < b) {
cout << "Yes" << endl;
} else ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 877,689 | 877,690 | u274962354 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c && b > c) {
cout << "YES" << endl;
} else if (a > c && 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 < c && b > c) {
cout << "Yes" << endl;
} else if (a > c && b < c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,693 | 877,694 | u844201387 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
c... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
c... | [
"expression.operation.binary.remove"
] | 877,697 | 877,698 | u334351654 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vc vector
#define a first
#define b second
#define pb pusu_back
#define INF (1000000000)
#define MOD (100... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vc vector
#define a first
#define b second
#define pb pusu_back
#define INF (1000000000)
#define MOD (100... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,706 | 877,707 | u855985627 | cpp |
p03067 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change"
] | 877,711 | 877,712 | u099918199 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int a, b, c;
cin >> a >> b >> c;
cout << ((b - a) * (b - c) > 0 ? "Yes" : "No") << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int a, b, c;
cin >> a >> b >> c;
cout << ((c - a) * (b - c) > 0 ? "Yes" : "No") << "\n";
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 877,717 | 877,718 | u586598623 | cpp |
p03067 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#inc... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"misc.opposites"
] | 877,719 | 877,720 | u960267905 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b) {
if (c < b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
if (b < c) {
cout << "Yes" << endl;
} else {
cout <... | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c) {
if (c < b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
if (b < c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,731 | 877,732 | u441823651 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define INF ((1 << 30) - 1) // int32_t
#define MOD 1000000007
#define MOD2
#define all(a) (a).begin(), (a).end()
#define mkp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
bool flag = true;
... | #include <bits/stdc++.h>
using namespace std;
#define INF ((1 << 30) - 1) // int32_t
#define MOD 1000000007
#define MOD2
#define all(a) (a).begin(), (a).end()
#define mkp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
bool flag = false;
... | [
"misc.opposites",
"variable_declaration.value.change"
] | 877,734 | 877,735 | u355424600 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,738 | 877,739 | u801513186 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 877,740 | 877,739 | u801513186 | cpp |
p03067 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a < c && c < b || b < c && c < a) {
cout << "Yes" << endl;
} else {
cout << "NO" << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a < c && c < b || b < c && c < a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,745 | 877,746 | u845000384 | cpp |
p03067 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
string ans;
if ((c - b) * (b - a) > 0) {
ans = "Yes";
} else {
ans = "No";
}
cout << ans << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
string ans;
if ((b - c) * (c - a) > 0) {
ans = "Yes";
} else {
ans = "No";
}
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 877,751 | 877,752 | u889344512 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec se... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec se... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 877,753 | 877,754 | u379947938 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec se... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec se... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,755 | 877,754 | u379947938 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (min(a, c) < b && b < max(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 (min(a, b) < c && c < max(a, b)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,758 | 877,759 | u596200441 | cpp |
p03067 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 877,760 | 877,761 | u051493691 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b && c < b)
cout << "Yes" << endl;
else if (a > b && c > b)
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 < c && c < b)
cout << "Yes" << endl;
else if (a > c && c > b)
cout << "Yes" << endl;
// else if(a<b&&b<<c)cout<<"Yes"<<endl;
else {
cout << "No" << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,773 | 877,774 | u122496126 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b && c < b)
cout << "Yes" << endl;
if (a > b && c > b)
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 < c && c < b)
cout << "Yes" << endl;
else if (a > c && c > b)
cout << "Yes" << endl;
// else if(a<b&&b<<c)cout<<"Yes"<<endl;
else {
cout << "No" << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 877,775 | 877,774 | u122496126 | cpp |
p03067 | #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() {
int A, B, C;
cin >> A >> B >> C;
if (B > A)
swap(A, B);
if (C >= A && C <= B)
cout << "Yes" << endl;
else
cout << "N... | #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() {
int A, B, C;
cin >> A >> B >> C;
if (B < A)
swap(A, B);
if (C >= A && C <= B)
cout << "Yes" << endl;
else
cout << "N... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 877,776 | 877,777 | u157322125 | cpp |
p03067 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
locale l = loca... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
locale l = loca... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 877,778 | 877,779 | u372550522 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | [
"call.arguments.add",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 877,783 | 877,784 | u656771711 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | [
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 877,785 | 877,784 | u656771711 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= max(a, b) && c >= max(a, b)) {
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 (c <= max(a, b) && c >= min(a, b)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 877,795 | 877,796 | u244626757 | cpp |
p03067 | #include <algorithm>
#include <stdio.h>
#include <utility>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%s", (min(a, b) < c && c < min(b, a)) ? "Yes" : "No");
return 0;
} | #include <algorithm>
#include <stdio.h>
#include <utility>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%s", (min(a, b) < c && c < max(b, a)) ? "Yes" : "No");
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 877,799 | 877,800 | u114234520 | cpp |
p03067 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
complex<long double> cmpmp;
const long long int mod = 1000000... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
complex<long double> cmpmp;
const long long int mod = 1000000... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 877,801 | 877,802 | u018872912 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((C > A && C < B) || (C > B && 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 ((C > A && C < B) || (C > B && C < A))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,807 | 877,808 | u757389058 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (C > A && C < B || C > B && 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 ((C > A && C < B) || (C > B && C < A))
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"
] | 877,810 | 877,808 | u757389058 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int a[3];
int b;
int main() {
cin >> a[0] >> a[1] >> a[2];
b = a[2];
sort(a, a + 3);
if (a[2] == b)
cout << "Yes" << endl;
else
cout << "No" << end... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int a[3], b;
int main() {
cin >> a[0] >> a[1] >> a[2];
b = a[2];
sort(a, a + 3);
if (a[1] == b)
cout << "Yes" << endl;
else
cout << "No" << endl;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 877,823 | 877,824 | u519950235 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int a[3];
int b;
int main() {
cin >> a[0] >> a[1] >> a[2];
b = a[1];
sort(a, a + 3);
if (a[1] == b)
cout << "Yes" << endl;
else
cout << "No" << end... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int a[3], b;
int main() {
cin >> a[0] >> a[1] >> a[2];
b = a[2];
sort(a, a + 3);
if (a[1] == b)
cout << "Yes" << endl;
else
cout << "No" << endl;
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 877,825 | 877,824 | u519950235 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int a[3];
int d;
int main() {
cin >> a[0] >> a[1] >> a[2];
d = a[2];
sort(a, a + 1);
if (d == a[1])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int a[3], d;
int main() {
cin >> a[0] >> a[1] >> a[2];
d = a[2];
sort(a, a + 3);
if (d == a[1])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,826 | 877,827 | u519950235 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int a[3];
int b;
int main() {
cin >> a[0] >> a[1] >> a[2];
b = a[2];
sort(a, a + 3);
if (a[2] == b)
cout << "Yes" << endl;
else
cout << "No" << end... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int a[3];
int b;
int main() {
cin >> a[0] >> a[1] >> a[2];
b = a[2];
sort(a, a + 3);
if (a[1] == b)
cout << "Yes" << endl;
else
cout << "No" << end... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 877,823 | 877,828 | u519950235 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int a[3];
int b;
int main() {
cin >> a[0] >> a[1] >> a[2];
b = a[1];
sort(a, a + 3);
if (a[1] == b)
cout << "Yes" << endl;
else
cout << "No" << end... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int a[3];
int b;
int main() {
cin >> a[0] >> a[1] >> a[2];
b = a[2];
sort(a, a + 3);
if (a[1] == b)
cout << "Yes" << endl;
else
cout << "No" << end... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 877,825 | 877,828 | u519950235 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c < b) {
cout << "Yes" << endl;
} else if (b < c < a) {
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 < c && c < b) {
cout << "Yes" << endl;
} else if (b < c && c < a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 877,837 | 877,838 | u896807328 | cpp |
p03067 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", a, b, c);
if (a < c && b > c) {
printf("Yes");
} else if (a > c && b < c) {
printf("Yes");
} else {
printf("No");
}
} | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a < c && b > c) {
printf("Yes\n");
} else if (a > c && b < c) {
printf("Yes\n");
} else {
printf("No\n");
}
} | [
"expression.operation.unary.reference.add",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 877,841 | 877,842 | u485873133 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b < c < a || a < c < b)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b < c && c < a || a < c && c < b)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 877,847 | 877,848 | u784706568 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (((b > c) && (c > a)) || ((b > c) && (c > a)))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (((b > c) && (c > a)) || ((b < c) && (c < a)))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 877,849 | 877,850 | u587883805 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c < min(a, b) || c > max(a, b))
cout << "NO";
else
cout << "YES";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= min(a, b) || c >= max(a, b))
cout << "No";
else
cout << "Yes";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,853 | 877,854 | u671291651 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define N 1e5 + 1;
#define INF 1e9
const ll MOD = 10e9 + 7;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
vector<int> ans;
ll a[200001];
ll b[200001];
vector<int> sorted;
int main() {
i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define N 1e5 + 1;
#define INF 1e9
const ll MOD = 10e9 + 7;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
vector<int> ans;
ll a[200001];
ll b[200001];
vector<int> sorted;
int main() {
i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,859 | 877,860 | u990641118 | cpp |
p03067 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,863 | 877,864 | u566864240 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a < c && c < a) || (a > c && c > b)) {
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 < c && c < b) || (a > c && c > b)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,871 | 877,872 | u813102292 | cpp |
p03067 | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | [
"identifier.change",
"call.arguments.change"
] | 877,877 | 877,878 | u030685402 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c && c < b)
cout << "Yes" << endl;
if (b < c && c < a)
cout << "Yes" << end... | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c && c < b)
cout << "Yes" << endl;
else if (b < c && c < a)
cout << "Yes" <... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 877,879 | 877,880 | u139300044 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c && c < b) {
cout << "yes" << endl;
return 0;
}
if (b < c && c < a) {
cout << "yes" << endl;
return 0;
}
cout << "no" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c && c < b) {
cout << "Yes" << endl;
return 0;
}
if (b < c && c < a) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,881 | 877,882 | u832103304 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if ((max(a, b) > c) && (c > min(a, b))) {
printf("Yes");
} else {
printf("False");
}
printf("\n");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if ((max(a, b) > c) && (c > min(a, b))) {
printf("Yes");
} else {
printf("No");
}
printf("\n");
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 877,884 | 877,885 | u597477070 | cpp |
p03067 | #include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | #include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,900 | 877,901 | u533101919 | cpp |
p03067 | #include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | #include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,902 | 877,901 | u533101919 | cpp |
p03067 | #include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | #include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,903 | 877,901 | u533101919 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<long long> vl;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(i, n) FOR(i, 0, n)
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c && b > c)
cout << "yes" <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<long long> vl;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(i, n) FOR(i, 0, n)
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c && b > c)
cout << "Yes" <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,910 | 877,911 | u638752443 | cpp |
p03067 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
printf(((c >= a && c <= b) || (c >= b && c <= a)) ? "YES" : "NO");
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
printf(((c >= a && c <= b) || (c >= b && c <= a)) ? "Yes" : "No");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 877,916 | 877,917 | u817141277 | cpp |
p03067 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,936 | 877,937 | u791593901 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a[3];
for (int &i : a)
cin >> i;
if (a[2] > a[0] and a[2] < a[1])
cout << "Yes";
else if (a[2] < a[0] and a[2] > a[1])
cout << "yes";
else
cout << "No";
} | #include <iostream>
using namespace std;
int main() {
int a[3];
for (int &i : a)
cin >> i;
if (a[2] > a[0] and a[2] < a[1])
cout << "Yes";
else if (a[2] < a[0] and a[2] > a[1])
cout << "Yes";
else
cout << "No";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,940 | 877,941 | u169909396 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a[3];
for (int &i : a)
cin >> i;
if (a[2] > a[0] and a[2] < a[1])
cout << "yes";
else if (a[2] < a[0] and a[2] > a[1])
cout << "yes";
else
cout << "no";
} | #include <iostream>
using namespace std;
int main() {
int a[3];
for (int &i : a)
cin >> i;
if (a[2] > a[0] and a[2] < a[1])
cout << "Yes";
else if (a[2] < a[0] and a[2] > a[1])
cout << "Yes";
else
cout << "No";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,942 | 877,941 | u169909396 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A < C && C < B && A < B) {
cout << "Yes" << endl;
}
else if (B < C && C < A && B < A) {
cout << "Yes" << endl;
}
else {
cout << "Yo" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A < C && C < B && A < B) {
cout << "Yes" << endl;
}
else if (B < C && C < A && B < A) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 877,943 | 877,944 | u562915225 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A;
cin >> B;
cin >> C;
if ((A > C && C > B) || (A < C && A < B)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A;
cin >> B;
cin >> C;
if ((A > C && C > B) || (A < C && C < B)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,945 | 877,946 | u783598783 | cpp |
p03067 | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a < b) {
if (b > c) {
cout << "Yes";
} else {
cout << "No";
}
} else {
if (b < c) {
cout << "Yes";
} else {
cout << "No";
}
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a < c) {
if (b > c) {
cout << "Yes";
} else {
cout << "No";
}
} else {
if (b < c) {
cout << "Yes";
} else {
cout << "No";
}
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,949 | 877,950 | u700598037 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A > C > B) {
cout << "Yes" << endl;
} else if (B > C > A) {
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 > C && C > B) {
cout << "Yes" << endl;
} else if (B > C && C > A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 877,953 | 877,954 | u801530021 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A > C > B) {
cout << "Yes" << endl;
} else if (B > C > A) {
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 > C && C > B) {
cout << "Yes" << endl;
} else if (B > C && C > A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 877,953 | 877,955 | u801530021 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int x[3] = {A, B, C};
sort(x, x + 3);
if (x[1] == B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int x[3] = {A, B, C};
sort(x, x + 3);
if (x[1] == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,969 | 877,970 | u618697411 | cpp |
p03067 | #include <iostream>
using namespace std;
void yorimichi(int a, int b, int c) {
if ((c - b) * (b - a) < 0) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
int main() {
int A, B, C;
cin >> A >> B >> C;
yorimichi(A, B, C);
return 0;
}
| #include <iostream>
using namespace std;
void yorimichi(int a, int b, int c) {
if ((c - b) * (c - a) < 0) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
int main() {
int A, B, C;
cin >> A >> B >> C;
yorimichi(A, B, C);
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,977 | 877,978 | u070471279 | cpp |
p03067 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"expression.operation.binary.remove"
] | 877,981 | 877,982 | u016572066 | cpp |
p03067 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int inputnum = 3;
int input[inputnum];
for (int i = 0; i < inputnum; i++) {
cin >> input[i];
}
if (input[1] > input[0]) {
if (input[2] >= input[0] & input[2] <= input[1]) {
cout << "Yes";
} else {
cout << "No";
... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int inputnum = 3;
int input[inputnum];
for (int i = 0; i < inputnum; i++) {
cin >> input[i];
}
if (input[1] > input[0]) {
if (input[2] >= input[0] & input[2] <= input[1]) {
cout << "Yes";
} else {
cout << "No";
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,983 | 877,984 | u987547145 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
if (min(a, b) >= c && max(a, b) <= c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
if (min(a, b) <= c && max(a, b) >= c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 877,989 | 877,990 | u191196346 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((b < c && b < a) || (b > 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 ((b < c && c < a) || (c > a && b > c)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,991 | 877,992 | u201188078 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int a, b, c;
int main(void) {
// Here your code !
scanf("%d %d %d", &a, &b, &c);
if ((a <= c && c <= b) || (b <= c && c <= a)) {
printf("Yes\n");
} else {
printf("%... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int a, b, c;
int main(void) {
// Here your code !
scanf("%d %d %d", &a, &b, &c);
if ((a <= c && c <= b) || (b <= c && c <= a)) {
printf("Yes\n");
} else {
printf("N... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 877,997 | 877,998 | u497422208 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((C >= A && C <= B) || (C <= A && C >> B)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((C >= A && C <= B) || (C <= A && C >= B)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 877,999 | 878,000 | u841494167 | cpp |
p03067 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
/*
int main() {
int N;
string S;
int K;
cin >> N >> S >> K;
return 0;
}
*/
int main() {
int A, B, C;
cin >> A >> B >> C;
string ans;
if ((A < C && C < B) || (B < C && C << A)... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
string ans;
if ((A < C && C < B) || (B < C && C < A)) {
ans = "Yes";
} else {
ans = "No";
}
cout << ans << endl;
return 0;
} | [
"misc.typo",
"control_flow.branch.if.condition.change"
] | 878,001 | 878,002 | u654115954 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A - B) * (B - C) < 0)
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 - C) * (B - C) < 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,003 | 878,004 | u889812821 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A < C && C < B) {
cout << "Yes" << endl;
}
if (B < C && C < A) {
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 < C && C < B) {
cout << "Yes" << endl;
} else if (B < C && C < A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 878,005 | 878,006 | u626463672 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b) {
cout << (c < b ? "Yes" : "No") << endl;
} else {
cout << (b < c ? "Yes" : "No") << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c) {
cout << (c < b ? "Yes" : "No") << endl;
} else {
cout << (b < c ? "Yes" : "No") << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,009 | 878,010 | u081445141 | cpp |
p03067 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if ((c > a and c > b) or (c < a and c < b)) {
cout << "no" << endl;
} else {
cout << "yes" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if ((c > a and c > b) or (c < a and c < b)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 878,013 | 878,014 | u471030817 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#define rg register
#define il inline
using namespace std;
typedef long long ll;
ll read() {
ll ans = 0, flag = 1;
char ch;
while ((c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#define rg register
#define il inline
using namespace std;
typedef long long ll;
ll read() {
ll ans = 0, flag = 1;
char ch;
while ((c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 878,025 | 878,026 | u361558096 | cpp |
p03067 | #include <bits/stdc++.h>
//#pragma warning( disable : 4996 )
#define ll long long
#define pb push_back
#define endl '\n'
#define fastIO \
cin.tie(0); \
ios_base::sync_with_stdio(false)
#d... | #include <bits/stdc++.h>
//#pragma warning( disable : 4996 )
#define ll long long
#define pb push_back
#define endl '\n'
#define fastIO \
cin.tie(0); \
ios_base::sync_with_stdio(false)
#d... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,031 | 878,030 | u630936832 | cpp |
p03067 | #include <bits/stdc++.h>
//#pragma warning( disable : 4996 )
#define ll long long
#define pb push_back
#define endl '\n'
#define fastIO \
cin.tie(0); \
ios_base::sync_with_stdio(false)
#d... | #include <bits/stdc++.h>
//#pragma warning( disable : 4996 )
#define ll long long
#define pb push_back
#define endl '\n'
#define fastIO \
cin.tie(0); \
ios_base::sync_with_stdio(false)
#d... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,032 | 878,030 | u630936832 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (((a < c) && (c < b)) && ((b < c) && (c < a))) {
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 < c) && (c < b)) || ((b < c) && (c < a))) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 878,035 | 878,036 | u509936198 | cpp |
p03067 | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repn(i, n) for (int i = 1; i <= (int)(n); i++)
#define reprn(i, n) for (int i = ((int)(n)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
using llint = long long int;
using lint = long int;
#incl... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repn(i, n) for (int i = 1; i <= (int)(n); i++)
#define reprn(i, n) for (int i = ((int)(n)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
using llint = long long int;
using lint = long int;
#incl... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 878,039 | 878,040 | u659075382 | cpp |
p03067 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 878,043 | 878,044 | u863104798 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
typedef vector<P> vip;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > c)
swap(a, c);
if (a < c && c < b) {
cout << "Yes" << endl;
} e... | #include <bits/stdc++.h>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
typedef vector<P> vip;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b)
swap(a, b);
if (a < c && c < b) {
cout << "Yes" << endl;
} e... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 878,060 | 878,061 | u171026188 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
typedef vector<P> vip;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c)
swap(a, c);
if (a < c && c < b) {
cout << "Yes" << endl;
} e... | #include <bits/stdc++.h>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
typedef vector<P> vip;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b)
swap(a, b);
if (a < c && c < b) {
cout << "Yes" << endl;
} e... | [
"identifier.change",
"call.arguments.change"
] | 878,062 | 878,061 | u171026188 | cpp |
p03067 | #include <algorithm>
#include <bitset>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#... | #include <algorithm>
#include <bitset>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#... | [
"literal.string.change",
"io.output.change"
] | 878,067 | 878,068 | u065923107 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.