problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p03067 | #include <bits/stdc++.h>
using namespace std;
#define il inline
#define rg register
#define ll long long
#define CL(a, b) memset(a, b, sizeof a)
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > c > b || a < c < b)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define il inline
#define rg register
#define ll long long
#define CL(a, b) memset(a, b, sizeof a)
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > c && c > b || a < c && c < b)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 878,069 | 878,070 | u946679103 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#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 (A > C && C > B)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#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 (A > C && C > B)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,079 | 878,080 | u147571984 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a < b) {
if (a < c && b < c)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
if (b < c && c < a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a < b) {
if (a < c && c < b)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
if (b < c && c < a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 878,085 | 878,086 | u480831358 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (min(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 (min(A, B) < C && C < max(A, B)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 878,087 | 878,088 | u346059918 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; ++i)
cin >> a[i];
int x = a[1];
sort(a.begin(), a.end());
if (x != a[0] && x != a[2])
puts("No");
else
puts("Yes");
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; ++i)
cin >> a[i];
int x = a[2];
sort(a.begin(), a.end());
if (x != a[0] && x != a[2])
puts("Yes");
else
puts("No");
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 878,091 | 878,092 | u692336506 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; ++i)
cin >> a[i];
int x = a[1];
sort(a.begin(), a.end());
if (x != a[0] && x != a[2])
puts("Yes");
else
puts("No");
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; ++i)
cin >> a[i];
int x = a[2];
sort(a.begin(), a.end());
if (x != a[0] && x != a[2])
puts("Yes");
else
puts("No");
}
| [
"literal.number.change",
"variable_access.subscript.index.change"
] | 878,093 | 878,092 | u692336506 | cpp |
p03067 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A < B) {
if (C < A || B < C) {
printf("NO");
} else {
printf("Yes");
}
} else {
if (C < B || A < C) {
printf("NO");
} else {
printf("Yes");
}
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A < B) {
if (C < A || B < C) {
printf("No");
} else {
printf("Yes");
}
} else {
if (C < B || A < C) {
printf("No");
} else {
printf("Yes");
}
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 878,094 | 878,095 | u553386584 | cpp |
p03067 | #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;
} | #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;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,102 | 878,103 | u828664775 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
bool ok;
if (a <= c) {
if (a <= b && b <= c)
ok = true;
else
ok = false;
}
if (a >= c) {
if (a >= b && b >= c)
ok = true;
else
ok = false;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> c >> b;
bool ok;
if (a <= c) {
if (a <= b && b <= c)
ok = true;
else
ok = false;
}
if (a >= c) {
if (a >= b && b >= c)
ok = true;
else
ok = false;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operation.binary.remove"
] | 878,107 | 878,108 | u676029460 | 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>
#define rep(index, num) for (int index = 0; index < num; index++)
#define rep1(index, num) for (int index = 1; index <= num; index++)
#define scan(argument) cin >> argument
#define prin(argument) cout << argument << endl
#define kaigyo cout << endl
#define eps 1e-7
#define mp(a1, a2) make_pair(a1, a2)
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
ll INFl = 1e+18 + 1;
int INF = 1e+9 + 1;
int main() {
int A, B, C;
scan(A >> B >> C);
if ((B - A) * (B - C) < 0)
prin("Yes");
else
prin("No");
return 0;
}
| #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>
#define rep(index, num) for (int index = 0; index < num; index++)
#define rep1(index, num) for (int index = 1; index <= num; index++)
#define scan(argument) cin >> argument
#define prin(argument) cout << argument << endl
#define kaigyo cout << endl
#define eps 1e-7
#define mp(a1, a2) make_pair(a1, a2)
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
ll INFl = 1e+18 + 1;
int INF = 1e+9 + 1;
int main() {
int A, B, C;
scan(A >> B >> C);
if ((C - A) * (C - B) < 0)
prin("Yes");
else
prin("No");
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 878,114 | 878,115 | u222030240 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d, e, k, l, m, n, o = 0, p, q, x, y, z, max1 = 0, ans;
string s, t, u;
cin >> a >> b >> c;
if (a >= c && b <= c) {
cout << "Yes" << endl;
}
if (a <= c && b >= c) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d, e, k, l, m, n, o = 0, p, q, x, y, z, max1 = 0, ans;
string s, t, u;
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;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 878,118 | 878,119 | u953532675 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d, e, k, l, m, n, o = 0, p, q, x, y, z, max1 = 0, ans;
string s, t, u;
cin >> a >> b >> c;
if (a > c && b < c) {
cout << "Yes" << endl;
}
if (a < c && b > c) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d, e, k, l, m, n, o = 0, p, q, x, y, z, max1 = 0, ans;
string s, t, u;
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;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 878,120 | 878,119 | u953532675 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A > B && B > C) || (A < B && B < C)) {
cout << "No" << endl;
}
else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A < C && B < C) || (A > C && B > C)) {
cout << "No" << endl;
}
else {
cout << "Yes" << endl;
}
}
| [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,121 | 878,122 | u265530138 | 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;
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",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 878,123 | 878,124 | u177143886 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b) {
int t;
t = a;
a = b;
b = a;
}
if ((b - a) == 1)
cout << "No" << endl;
else if ((b > c) && (a < 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) {
int t;
t = a;
a = b;
b = t;
}
if ((b - a) == 1)
cout << "No" << endl;
else if ((b > c) && (a < c))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 878,127 | 878,128 | u936271647 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
typedef long long int lld;
typedef vector<lld> vl;
typedef vector<int> vi;
typedef vector<string> vs;
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
/// min_element(hoge.begin(),hoge.end(); 最小値 最大値はmax_element();
int map[100][100];
vi cl(1000);
vi ol(1000);
void print(int n);
void next(int locate);
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a < c && b > c) || (c > b && b < a)) {
cout << "Yes";
return 0;
} else {
cout << "No";
}
} | #include <algorithm>
#include <iostream>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
typedef long long int lld;
typedef vector<lld> vl;
typedef vector<int> vi;
typedef vector<string> vs;
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
/// min_element(hoge.begin(),hoge.end(); 最小値 最大値はmax_element();
int map[100][100];
vi cl(1000);
vi ol(1000);
void print(int n);
void next(int locate);
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a < c && b > c) || (c > b && c < a)) {
cout << "Yes";
return 0;
} else {
cout << "No";
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,135 | 878,136 | u696415377 | 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";
} else if (A > C && C > B) {
cout << "Yes";
} else {
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A < C && C < B) {
cout << "Yes";
} else if (A > C && C > B) {
cout << "Yes";
} else {
cout << "No";
}
} | [] | 878,140 | 878,141 | u478094431 | cpp |
p03067 | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string.h>
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 <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string.h>
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;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,163 | 878,164 | u375879613 | cpp |
p03067 | #include <bits/stdc++.h>
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 <bits/stdc++.h>
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"
] | 878,179 | 878,180 | u342466195 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
int 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;
int B;
int 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,189 | 878,190 | u162509656 | cpp |
p03067 | /* Bismillahirrahmanirrahim */
#include <bits/stdc++.h>
#define forA for (int i = 0; i < a; i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (((c >= a) && (c <= b)) || ((c <= a) && (c >= b)))
cout << "YES";
else
cout << "NO";
}
| /* Bismillahirrahmanirrahim */
#include <bits/stdc++.h>
#define forA for (int i = 0; i < a; i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (((c >= a) && (c <= b)) || ((c <= a) && (c >= b)))
cout << "Yes";
else
cout << "No";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,199 | 878,200 | u147525932 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A > C && C > B) {
cout << "Yes" << endl;
}
if (A < C && 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 (A > C && C > B) {
cout << "Yes" << endl;
} else if (A < C && C < B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 878,201 | 878,202 | u813262151 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A > C > B) {
cout << "Yes" << endl;
}
if (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 (A > C && C > B) {
cout << "Yes" << endl;
} else if (A < C && C < B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 878,203 | 878,202 | u813262151 | cpp |
p03067 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
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 <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
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"
] | 878,211 | 878,212 | u548472817 | cpp |
p03067 | #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 (a <= c && 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 (a >= c && c >= b) {
cout << "Yes" << endl;
} else if (a <= c && c <= b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,213 | 878,214 | u759162415 | cpp |
p03067 | #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 (a <= c && 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 (a >= c && c >= b) {
cout << "Yes" << endl;
} else if (a <= c && c <= b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,215 | 878,214 | u759162415 | cpp |
p03067 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
bool is_on_way = false;
if (a < c && c < b)
is_on_way = true;
else if (b < c && c < a)
is_on_way = true;
std::cout << (is_on_way ? "Yes" : "no") << std::endl;
return 0;
}
| #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
bool is_on_way = false;
if (a < c && c < b)
is_on_way = true;
if (b < c && c < a)
is_on_way = true;
std::cout << (is_on_way ? "Yes" : "No") << std::endl;
return 0;
}
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 878,216 | 878,217 | u863819006 | cpp |
p03067 | #include <bits/stdc++.h>
#define e erase
#define PB push_back
#define elif else if
#define forn(i, n) for (int i = 0; i < n; i++)
#define MP make_pair
using namespace std;
typedef long long int lli;
typedef long int li;
typedef vector<int> vi;
typedef vector<long long int> vii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
if (a >= c && b <= c) {
cout << "YES" << endl;
}
elif (a <= c && b >= c) { cout << "YES" << endl; }
else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define e erase
#define PB push_back
#define elif else if
#define forn(i, n) for (int i = 0; i < n; i++)
#define MP make_pair
using namespace std;
typedef long long int lli;
typedef long int li;
typedef vector<int> vi;
typedef vector<long long int> vii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
if (a >= c && b <= c) {
cout << "Yes" << endl;
}
elif (a <= c && b >= c) { cout << "Yes" << endl; }
else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"expression.operation.binary.change"
] | 878,218 | 878,219 | u482306068 | cpp |
p03067 | #include "bits/stdc++.h"
#include <cmath>
using namespace std;
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x)*1ll * (x))
#define all(x) x.begin(), x.end()
#define clr(a, v) memset(a, v, sizeof(a))
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define reflex ios_base::sync_with_stdio(false)
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = (int)2e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int kx[] = {-1, 1, 2, 2, 1, -1, -2, -2};
const int ky[] = {2, 2, 1, -1, -2, -2, -1, 1};
string conv(int a) {
stringstream ss;
ss << a;
string str = ss.str();
return str;
}
string conv(char a) {
stringstream ss;
ss << a;
string str = ss.str();
return str;
}
int conv(string a) {
stringstream geek(a);
int x = 0;
geek >> x;
return x;
}
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int mini = min(a, b);
int maxi = max(a, b);
if (mini <= c && c <= maxi)
cout << "yes";
else
cout << "no";
return 0;
}
| #include "bits/stdc++.h"
#include <cmath>
using namespace std;
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x)*1ll * (x))
#define all(x) x.begin(), x.end()
#define clr(a, v) memset(a, v, sizeof(a))
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define reflex ios_base::sync_with_stdio(false)
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = (int)2e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int kx[] = {-1, 1, 2, 2, 1, -1, -2, -2};
const int ky[] = {2, 2, 1, -1, -2, -2, -1, 1};
string conv(int a) {
stringstream ss;
ss << a;
string str = ss.str();
return str;
}
string conv(char a) {
stringstream ss;
ss << a;
string str = ss.str();
return str;
}
int conv(string a) {
stringstream geek(a);
int x = 0;
geek >> x;
return x;
}
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int mini = min(a, b);
int maxi = max(a, b);
if (mini <= c && c <= maxi)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,226 | 878,227 | u954456431 | cpp |
p03067 | #include "bits/stdc++.h"
#include <cmath>
using namespace std;
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x)*1ll * (x))
#define all(x) x.begin(), x.end()
#define clr(a, v) memset(a, v, sizeof(a))
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define reflex ios_base::sync_with_stdio(false)
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = (int)2e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int kx[] = {-1, 1, 2, 2, 1, -1, -2, -2};
const int ky[] = {2, 2, 1, -1, -2, -2, -1, 1};
string conv(int a) {
stringstream ss;
ss << a;
string str = ss.str();
return str;
}
string conv(char a) {
stringstream ss;
ss << a;
string str = ss.str();
return str;
}
int conv(string a) {
stringstream geek(a);
int x = 0;
geek >> x;
return x;
}
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int mini = min(a, b);
int maxi = max(a, b);
if (mini <= b && b <= maxi)
cout << "yes";
else
cout << "no";
return 0;
}
| #include "bits/stdc++.h"
#include <cmath>
using namespace std;
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x)*1ll * (x))
#define all(x) x.begin(), x.end()
#define clr(a, v) memset(a, v, sizeof(a))
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define reflex ios_base::sync_with_stdio(false)
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = (int)2e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int kx[] = {-1, 1, 2, 2, 1, -1, -2, -2};
const int ky[] = {2, 2, 1, -1, -2, -2, -1, 1};
string conv(int a) {
stringstream ss;
ss << a;
string str = ss.str();
return str;
}
string conv(char a) {
stringstream ss;
ss << a;
string str = ss.str();
return str;
}
int conv(string a) {
stringstream geek(a);
int x = 0;
geek >> x;
return x;
}
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int mini = min(a, b);
int maxi = max(a, b);
if (mini <= c && c <= maxi)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,228 | 878,227 | u954456431 | cpp |
p03067 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((min(a, b) < c && c < max(a, b)) ? "yes" : "no") << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((min(a, b) < c && c < max(a, b)) ? "Yes" : "No") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,229 | 878,230 | u544490237 | cpp |
p03067 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if ((a - b) * (c - b) > 0)
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) * (b - c) < 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change"
] | 878,239 | 878,240 | u630664279 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A < C && B > C) || (A > C && 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 < C && B > C) || (A > C && B < C))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,241 | 878,242 | u291552830 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c && c < b || b < c && c < b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <string>
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;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,243 | 878,244 | u383402878 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (C < B && C >> A) {
cout << "Yes" << endl;
} else if (C < A && C > B) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
// system("pause");
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (C < B && C > A) {
cout << "Yes" << endl;
} else if (C < A && C > B) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
// system("pause");
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 878,247 | 878,248 | u647622685 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B, C;
cin >> A, B, C;
if (max(A, B) >= C && C >= min(A, B)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
if (max(A, B) >= C && C >= min(A, B)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [] | 878,251 | 878,252 | u360441331 | 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,259 | 878,260 | u544437817 | 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;
else 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;
} | [
"misc.typo",
"control_flow.branch.if.condition.change"
] | 878,261 | 878,262 | u665871498 | 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 > c && c > b))
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
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;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 878,265 | 878,266 | u513726585 | cpp |
p03067 | #include <iostream>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll LINF = 1e18;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
if ((A < C and C < B) and (B < C and C < A))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll LINF = 1e18;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
if ((A < C and C < B) or (B < C and C < A))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"identifier.change"
] | 878,267 | 878,268 | u625729943 | cpp |
p03067 | #include <bits/stdc++.h>
#define mov(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007
#define INF 1e9 + 5
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > min(a, b) && c < max(a, b))
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
} | #include <bits/stdc++.h>
#define mov(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007
#define INF 1e9 + 5
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > min(a, b) && c < max(a, b))
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,271 | 878,272 | u527398664 | cpp |
p03067 | #include <bits/stdc++.h>
#define mov(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007
#define INF 1e9 + 5
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c >= min(a, b) && c <= max(a, b))
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
} | #include <bits/stdc++.h>
#define mov(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007
#define INF 1e9 + 5
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > min(a, b) && c < max(a, b))
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,273 | 878,272 | u527398664 | cpp |
p03067 | #include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <sys/timeb.h>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFL 1100000000000000000LL
#define EPS (1e-10)
#define MOD 1000000007
#define PI 3.1415926536
#define RMAX 4294967295
typedef long long ll;
typedef pair<int, int> Pi;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<Pi> vPi;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<double>> vvd;
typedef vector<vector<Pi>> vvPi;
typedef priority_queue<int, vector<int>, greater<int>> pqli;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqlll;
typedef priority_queue<Pi, vector<Pi>, greater<Pi>> pqlP;
struct Edge {
int from, to, cost;
bool operator<(Edge e) { return cost < e.cost; }
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
template <class T> using vec = vector<T>;
template <class T> using pql = priority_queue<T, vector<T>, greater<T>>;
string debug_show(Pi a) {
return "(" + to_string(a.first) + "," + to_string(a.second) + ")";
}
template <class T> struct augEdge {
T from, to;
int cost;
bool operator<(augEdge e) { return cost < e.cost; }
bool operator>(augEdge e) { return cost > e.cost; }
};
template <class T> using augGraph = vector<augEdge<T>>;
bool pairCompare(const Pi &firstElof, const Pi &secondElof) {
return firstElof.second > secondElof.second;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (c > a && b > c) {
cout << "Yes" << endl;
} else if (c < a && b > c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <sys/timeb.h>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFL 1100000000000000000LL
#define EPS (1e-10)
#define MOD 1000000007
#define PI 3.1415926536
#define RMAX 4294967295
typedef long long ll;
typedef pair<int, int> Pi;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<Pi> vPi;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<double>> vvd;
typedef vector<vector<Pi>> vvPi;
typedef priority_queue<int, vector<int>, greater<int>> pqli;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqlll;
typedef priority_queue<Pi, vector<Pi>, greater<Pi>> pqlP;
struct Edge {
int from, to, cost;
bool operator<(Edge e) { return cost < e.cost; }
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
template <class T> using vec = vector<T>;
template <class T> using pql = priority_queue<T, vector<T>, greater<T>>;
string debug_show(Pi a) {
return "(" + to_string(a.first) + "," + to_string(a.second) + ")";
}
template <class T> struct augEdge {
T from, to;
int cost;
bool operator<(augEdge e) { return cost < e.cost; }
bool operator>(augEdge e) { return cost > e.cost; }
};
template <class T> using augGraph = vector<augEdge<T>>;
bool pairCompare(const Pi &firstElof, const Pi &secondElof) {
return firstElof.second > secondElof.second;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (c > a && b > c) {
cout << "Yes" << endl;
} else if (c < a && b < c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,274 | 878,275 | u702133921 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (C < B && C > A)
cout << "Yes" << endl;
if (C < A && C > 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 < B && C > A)
cout << "Yes" << endl;
else if (C < A && C > B)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 878,276 | 878,277 | u034593013 | cpp |
p03067 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if ((a < c && c < b) || (a > c && b < c)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if ((a < c && c < b) || (a > c && b < c)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,280 | 878,281 | u341846697 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = int(5e5) + 2;
const int LG = 20;
const ll mod = 998244353;
const int INF = 2147483647;
const ll linf = 1e18;
const ld pi = acos(-1);
const ld EPS = 1e-10;
int a, b, c;
int main() {
cin >> a >> b >> c;
for (int i = min(a, b); i <= max(a, b); ++i) {
if (i == c) {
cout << "YES\n";
return 0;
}
}
cout << "NO\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = int(5e5) + 2;
const int LG = 20;
const ll mod = 998244353;
const int INF = 2147483647;
const ll linf = 1e18;
const ld pi = acos(-1);
const ld EPS = 1e-10;
int a, b, c;
int main() {
cin >> a >> b >> c;
for (int i = min(a, b); i <= max(a, b); ++i) {
if (i == c) {
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,282 | 878,283 | u829956284 | 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 <= c && 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) || (a <= c && c <= b))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,284 | 878,285 | u038054933 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, int B) { return (A + (B - 1)) / B; }
long long divCeil(int A, long long B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, long long B) { return (A + (B - 1)) / B; }
int main() {
int A, B, C;
cin >> A >> B >> C;
string ans = "No";
if ((A < C && C < B) || (B < C || C < A))
ans = "Yes";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, int B) { return (A + (B - 1)) / B; }
long long divCeil(int A, long long B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, long long B) { return (A + (B - 1)) / B; }
int main() {
int A, B, C;
cin >> A >> B >> C;
string ans = "No";
if ((A < C && C < B) || (B < C && C < A))
ans = "Yes";
cout << ans << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 878,289 | 878,290 | u811472478 | cpp |
p03067 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <exception>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace ::std;
typedef long long lint;
typedef long double ldouble;
#define rep(i, n) for (lint i = 0; i < (lint)(n); i++)
#define repi(i, a, b) for (lint i = lint(a); i < lint(b); i++)
#define rep2(i, a, b, c) for (lint i = lint(a); i > lint(b); i += c)
#define all(x) (x).begin(), (x).end()
#define sl(c) (('a') <= (c) && (c) <= ('z'))
#define ll(c) (('A') <= (c) && (c) <= ('Z'))
#define PI 3.141592653589793
#define cout (cout << fixed << setprecision(15))
#define makeupper(t) (transform(all(t), t.begin(), ::toupper))
#define makelower(t) (transform(all(t), t.begin(), ::tolower))
#define dist(x1, y1, x2, y2) (pow(pow(x2 - x1, 2) + pow(y2 - y1, 2), 0.5))
#define sum(a) accumulate(all(a), 0)
#define NEXT_LINE \
string junk; \
getline(cin, junk);
#define output(v, s) \
do { \
rep(i, v.size()) cout << (i ? s : "") << v[i]; \
cout << "\n"; \
} while (0)
#define LINT_MAX numeric_limits<lint>::max()
inline string replace(string str, string before, std::string after) {
string::size_type Pos(str.find(before));
while (Pos != std::string::npos) {
str.replace(Pos, before.length(), after);
Pos = str.find(before, Pos + after.length());
}
return str;
}
inline vector<string> split(string &s, string delim) {
vector<string> elems;
s = replace(s, "#", "HASH");
s = replace(s, delim, "#");
stringstream ss(s);
string item;
while (getline(ss, item, '#')) {
elems.push_back(replace(item, "HASH", "#"));
}
return elems;
}
inline vector<int> cross(vector<int> a, vector<int> b) {
return {a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2],
a[0] * b[1] - a[1] * b[0]};
}
inline int GCD(int a, int b) {
if (a < b)
swap(a, b);
if (a % b != 0)
GCD(b, a % b);
else
return b;
}
inline vector<lint> primeList(lint n) {
vector<bool> p(n + 1);
vector<lint> list;
repi(i, 1, n + 1) p[i] = true;
repi(i, 2, sqrt(n) + 1) {
if (p[i]) {
repi(j, 2, n / i + 1) { p[i * j] = false; }
}
}
repi(i, 2, n + 1) if (p[i]) list.push_back(i);
return list;
}
inline bool isPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false;
}
return true;
}
template <typename T> class Stack {
vector<T> stack;
public:
void push(T num) { stack.push_back(num); }
T pop() {
T num = stack[stack.size() - 1];
stack.erase(stack.end() - 1);
return num;
}
bool empty() { return stack.empty(); }
};
template <typename T> class Queue {
deque<T> queue;
public:
void push(T num) { queue.push_front(num); }
void push_back(T num) { queue.push_back(num); }
T pop() {
T num = queue[queue.size() - 1];
queue.pop_back();
return num;
}
bool empty() { return queue.empty(); }
};
inline vector<lint> decimalConversion(lint val, lint n) {
vector<lint> v;
while (1) {
if (val == 0)
break;
v.push_back(val % n);
val %= n;
}
reverse(all(v));
return v;
}
inline vector<lint> decimalConversion(lint val, lint n, lint size) {
vector<lint> v;
while (1) {
if (val == 0)
break;
v.push_back(val % n);
val %= n;
}
v.resize(n, 0);
reverse(all(v));
return v;
}
struct Data {
public:
lint cur, mp, a, b, c;
Data(lint _cur, lint _mp, lint _a, lint _b, lint _c) {
cur = _cur;
mp = _mp;
a = _a;
b = _b;
c = _c;
}
};
int main() {
lint a, b, c;
cin >> a >> b >> c;
if (min(a, b) <= c <= max(a, b))
cout << "Yes\n";
else
cout << "No\n";
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <exception>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace ::std;
typedef long long lint;
typedef long double ldouble;
#define rep(i, n) for (lint i = 0; i < (lint)(n); i++)
#define repi(i, a, b) for (lint i = lint(a); i < lint(b); i++)
#define rep2(i, a, b, c) for (lint i = lint(a); i > lint(b); i += c)
#define all(x) (x).begin(), (x).end()
#define sl(c) (('a') <= (c) && (c) <= ('z'))
#define ll(c) (('A') <= (c) && (c) <= ('Z'))
#define PI 3.141592653589793
#define cout (cout << fixed << setprecision(15))
#define makeupper(t) (transform(all(t), t.begin(), ::toupper))
#define makelower(t) (transform(all(t), t.begin(), ::tolower))
#define dist(x1, y1, x2, y2) (pow(pow(x2 - x1, 2) + pow(y2 - y1, 2), 0.5))
#define sum(a) accumulate(all(a), 0)
#define NEXT_LINE \
string junk; \
getline(cin, junk);
#define output(v, s) \
do { \
rep(i, v.size()) cout << (i ? s : "") << v[i]; \
cout << "\n"; \
} while (0)
#define LINT_MAX numeric_limits<lint>::max()
inline string replace(string str, string before, std::string after) {
string::size_type Pos(str.find(before));
while (Pos != std::string::npos) {
str.replace(Pos, before.length(), after);
Pos = str.find(before, Pos + after.length());
}
return str;
}
inline vector<string> split(string &s, string delim) {
vector<string> elems;
s = replace(s, "#", "HASH");
s = replace(s, delim, "#");
stringstream ss(s);
string item;
while (getline(ss, item, '#')) {
elems.push_back(replace(item, "HASH", "#"));
}
return elems;
}
inline vector<int> cross(vector<int> a, vector<int> b) {
return {a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2],
a[0] * b[1] - a[1] * b[0]};
}
inline int GCD(int a, int b) {
if (a < b)
swap(a, b);
if (a % b != 0)
GCD(b, a % b);
else
return b;
}
inline vector<lint> primeList(lint n) {
vector<bool> p(n + 1);
vector<lint> list;
repi(i, 1, n + 1) p[i] = true;
repi(i, 2, sqrt(n) + 1) {
if (p[i]) {
repi(j, 2, n / i + 1) { p[i * j] = false; }
}
}
repi(i, 2, n + 1) if (p[i]) list.push_back(i);
return list;
}
inline bool isPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false;
}
return true;
}
template <typename T> class Stack {
vector<T> stack;
public:
void push(T num) { stack.push_back(num); }
T pop() {
T num = stack[stack.size() - 1];
stack.erase(stack.end() - 1);
return num;
}
bool empty() { return stack.empty(); }
};
template <typename T> class Queue {
deque<T> queue;
public:
void push(T num) { queue.push_front(num); }
void push_back(T num) { queue.push_back(num); }
T pop() {
T num = queue[queue.size() - 1];
queue.pop_back();
return num;
}
bool empty() { return queue.empty(); }
};
inline vector<lint> decimalConversion(lint val, lint n) {
vector<lint> v;
while (1) {
if (val == 0)
break;
v.push_back(val % n);
val %= n;
}
reverse(all(v));
return v;
}
inline vector<lint> decimalConversion(lint val, lint n, lint size) {
vector<lint> v;
while (1) {
if (val == 0)
break;
v.push_back(val % n);
val %= n;
}
v.resize(n, 0);
reverse(all(v));
return v;
}
struct Data {
public:
lint cur, mp, a, b, c;
Data(lint _cur, lint _mp, lint _a, lint _b, lint _c) {
cur = _cur;
mp = _mp;
a = _a;
b = _b;
c = _c;
}
};
int main() {
lint a, b, c;
cin >> a >> b >> c;
if (min(a, b) <= c && c <= max(a, b))
cout << "Yes\n";
else
cout << "No\n";
} | [
"control_flow.branch.if.condition.change"
] | 878,297 | 878,298 | u168579419 | cpp |
p03067 |
#ifdef __GNUC__
#include <bits/stdc++.h>
#endif // __GNUC__
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int A, B, C;
std::cin >> A >> B >> C;
if (A > C)
std::swap(A, C);
std::cout << (A < C && C < B ? "Yes" : "No") << std::endl;
} | #ifdef __GNUC__
#include <bits/stdc++.h>
#endif // __GNUC__
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int A, B, C;
std::cin >> A >> B >> C;
if (A > B)
std::swap(A, B);
std::cout << (A < C && C < B ? "Yes" : "No") << std::endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 878,303 | 878,304 | u264304509 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#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" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#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" << endl;
else
cout << "No" << endl;
} | [
"misc.typo",
"control_flow.branch.if.condition.change"
] | 878,305 | 878,306 | u650243369 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y, z) for ((x) = (y)-1; (z) <= (x); (x)--)
#define repi(x, y, z) for ((x) = (z); (x) < (y); (x)++)
#define repiin(x, y, z) for ((x) = (z); (x) <= (y); (x)++)
#define reps(x, y, z) for ((x) = 0; (x) < (y); (x) += (z))
#define repis(x, y, z, s) for ((x) = (z); (x) < (y); (x) += (s))
#define repiins(x, y, z, s) for ((x) = (z); (x) <= (y); (x) += (s))
#define repit(x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define repit2(x) \
for (__typeof((x).begin()) it2 = (x).begin(); it2 != (x).end(); it2++)
#define nepit(x) \
for (__typeof((x).rbegin()) it = (x).rbegin(); it != (x).rend(); it++)
#define All(x) (x).begin(), (x).end()
#define Mem0(x) memset(x, 0, sizeof(x))
#define Mem1(x) memset(x, -1, sizeof(x))
// can be applied to string type
#define Unique(v) v.resize(unique(All(v)) - v.begin())
#define peq(p0, p1) (p0.first == p1.first && p0.second == p1.second)
#define End '\n'
#define Out(x) cout << (x) << End
template <typename T> void OutN(T x) {
size_t i, len = x.size() - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
#define OutaN(x) \
do { \
size_t i, len = sizeof(x) / sizeof(__typeof(x[0])) - 1; \
for (i = 0; i < len; i++) \
cout << x[i] << " "; \
cout << x[len] << '\n'; \
} while (0);
template <typename T> void Outit(T x) {
auto end = x.end();
end--;
for (auto it = x.begin(); it != end; it++)
cout << *it << " ";
cout << *end << '\n';
}
template <typename T> void Debug(const T &val) { cerr << val << End; }
template <typename T, typename... Args> void Debug(const T &val, Args... args) {
cerr << val << ' ';
Debug(std::forward<Args>(args)...);
}
template <typename T> inline bool Max(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool Min(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
// can be applied to string type
#define Sort(v) sort(All(v))
#define SortR(v) sort(All(v), std::greater<__typeof(v[0])>())
// array sorters
#define Sart(a) sort(a, a + sizeof(a) / sizeof(__typeof(a[0])));
#define SartR(a) \
sort(a, a + sizeof(a) / sizeof(__typeof(a[0])), \
std::greater<__typeof(a[0])>())
#define pb push_back
#define mp make_pair
#define a first
#define b second
#define lb std::lower_bound
#define ub std::upper_bound
#define lbi(v, x) lb(All(v), (x)) - v.begin()
#define ubi(v, x) ub(All(v), (x)) - v.begin()
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
#define LOCAL 0
int main() {
#if LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
// std::cout.precision(18);
int a, b, c;
cin >> a >> b >> c;
if (c < a)
swap(a, c);
if (a <= c && c <= b)
Out("Yes");
else
Out("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y, z) for ((x) = (y)-1; (z) <= (x); (x)--)
#define repi(x, y, z) for ((x) = (z); (x) < (y); (x)++)
#define repiin(x, y, z) for ((x) = (z); (x) <= (y); (x)++)
#define reps(x, y, z) for ((x) = 0; (x) < (y); (x) += (z))
#define repis(x, y, z, s) for ((x) = (z); (x) < (y); (x) += (s))
#define repiins(x, y, z, s) for ((x) = (z); (x) <= (y); (x) += (s))
#define repit(x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define repit2(x) \
for (__typeof((x).begin()) it2 = (x).begin(); it2 != (x).end(); it2++)
#define nepit(x) \
for (__typeof((x).rbegin()) it = (x).rbegin(); it != (x).rend(); it++)
#define All(x) (x).begin(), (x).end()
#define Mem0(x) memset(x, 0, sizeof(x))
#define Mem1(x) memset(x, -1, sizeof(x))
// can be applied to string type
#define Unique(v) v.resize(unique(All(v)) - v.begin())
#define peq(p0, p1) (p0.first == p1.first && p0.second == p1.second)
#define End '\n'
#define Out(x) cout << (x) << End
template <typename T> void OutN(T x) {
size_t i, len = x.size() - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
#define OutaN(x) \
do { \
size_t i, len = sizeof(x) / sizeof(__typeof(x[0])) - 1; \
for (i = 0; i < len; i++) \
cout << x[i] << " "; \
cout << x[len] << '\n'; \
} while (0);
template <typename T> void Outit(T x) {
auto end = x.end();
end--;
for (auto it = x.begin(); it != end; it++)
cout << *it << " ";
cout << *end << '\n';
}
template <typename T> void Debug(const T &val) { cerr << val << End; }
template <typename T, typename... Args> void Debug(const T &val, Args... args) {
cerr << val << ' ';
Debug(std::forward<Args>(args)...);
}
template <typename T> inline bool Max(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool Min(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
// can be applied to string type
#define Sort(v) sort(All(v))
#define SortR(v) sort(All(v), std::greater<__typeof(v[0])>())
// array sorters
#define Sart(a) sort(a, a + sizeof(a) / sizeof(__typeof(a[0])));
#define SartR(a) \
sort(a, a + sizeof(a) / sizeof(__typeof(a[0])), \
std::greater<__typeof(a[0])>())
#define pb push_back
#define mp make_pair
#define a first
#define b second
#define lb std::lower_bound
#define ub std::upper_bound
#define lbi(v, x) lb(All(v), (x)) - v.begin()
#define ubi(v, x) ub(All(v), (x)) - v.begin()
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
#define LOCAL 0
int main() {
#if LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
// std::cout.precision(18);
int a, b, c;
cin >> a >> b >> c;
if (b < a)
swap(a, b);
if (a <= c && c <= b)
Out("Yes");
else
Out("No");
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 878,307 | 878,308 | u518883877 | cpp |
p03067 | //#define frostbyte02
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define LLFOR(i, a, b) for (ll i = a; i <= b; i++)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define fi first
#define se second
#define pb push_back
#define fastio \
{ \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
}
#define sqr(x) (x) * (x)
#define sqrmod(x) (((x) % MOD) * ((x) % MOD)) % MOD
using namespace std;
const int MOD = 1e9 + 7;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
int main() {
#ifdef frostbyte02
freopen("input.txt", "r", stdin);
// freopen("output.txt","w",stdout);
#endif
fastio int a, b, c;
cin >> a >> b >> c;
if ((c <= b && c >= a) || (c <= a && c >= b))
cout << "YES";
else
cout << "NO";
return 0;
}
| //#define frostbyte02
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define LLFOR(i, a, b) for (ll i = a; i <= b; i++)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define fi first
#define se second
#define pb push_back
#define fastio \
{ \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
}
#define sqr(x) (x) * (x)
#define sqrmod(x) (((x) % MOD) * ((x) % MOD)) % MOD
using namespace std;
const int MOD = 1e9 + 7;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
int main() {
#ifdef frostbyte02
freopen("input.txt", "r", stdin);
// freopen("output.txt","w",stdout);
#endif
fastio int a, b, c;
cin >> a >> b >> c;
if ((c <= b && c >= a) || (c <= a && c >= b))
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,309 | 878,310 | u229742579 | cpp |
p03067 | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0}, dy[] = {0, 1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struct edge {
long long to, cost;
};
vector<vector<edge>> G;
long long mod_pow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) {
res = res * a % MOD;
}
a = a * a % MOD;
b >>= 1;
}
return res;
}
void addedge(int from, int to, int cost) {
G[from].push_back({to, cost});
G[to].push_back({from, cost});
}
//↑template↑
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((b <= c && a <= c) || (a <= c && c <= b)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0}, dy[] = {0, 1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struct edge {
long long to, cost;
};
vector<vector<edge>> G;
long long mod_pow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) {
res = res * a % MOD;
}
a = a * a % MOD;
b >>= 1;
}
return res;
}
void addedge(int from, int to, int cost) {
G[from].push_back({to, cost});
G[to].push_back({from, cost});
}
//↑template↑
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;
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 878,311 | 878,312 | u539402331 | 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"
] | 878,321 | 878,322 | u914086391 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
string ans;
cin >> a >> b >> c;
if (a < c) {
if (b < c) {
ans = "Yes";
} else {
ans = "No";
}
} else {
if (b > c) {
ans = "Yes";
} else {
ans = "No";
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
string ans;
cin >> a >> b >> c;
if (a < c) {
if (b > c) {
ans = "Yes";
} else {
ans = "No";
}
} else {
if (b < c) {
ans = "Yes";
} else {
ans = "No";
}
}
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,325 | 878,326 | u422725381 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
string ans;
cin >> a >> b >> c;
if (a < b) {
if (b > c) {
ans = "Yes";
} else {
ans = "No";
}
} else {
if (b < c) {
ans = "Yes";
} else {
ans = "No";
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
string ans;
cin >> a >> b >> c;
if (a < c) {
if (b > c) {
ans = "Yes";
} else {
ans = "No";
}
} else {
if (b < c) {
ans = "Yes";
} else {
ans = "No";
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,327 | 878,326 | u422725381 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
if ((b > c && a < c) || (b < c && a > c)) {
cout << ("YES");
} else {
cout << ("No");
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
if ((b > c && a < c) || (b < c && a > c)) {
cout << ("Yes");
} else {
cout << ("No");
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,336 | 878,337 | u461215920 | cpp |
p03067 | #include <iostream>
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;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a - c) * (c - b) >= 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change"
] | 878,338 | 878,339 | u125468789 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b) {
if (b < c && a > c)
cout << "YES" << endl;
else
cout << "NO" << endl;
} else {
if (a < c && 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) {
if (b < c && a > c)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
if (a < c && b > c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,352 | 878,351 | u900267897 | cpp |
p03067 | #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 (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) {
cout << "Yes" << endl;
} else if (A > C && C > B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return (0);
} | [
"control_flow.branch.if.condition.change"
] | 878,365 | 878,366 | u536923611 | cpp |
p03067 | #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 (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) {
cout << "Yes" << endl;
} else if (A > C && C > B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return (0);
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 878,367 | 878,366 | u536923611 | cpp |
p03067 | #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 (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) {
cout << "Yes" << endl;
} else if (A > C && C > B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return (0);
} | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,368 | 878,366 | u536923611 | 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)) {
std::cout << 'Yes' << std::endl;
} else {
std::cout << 'No' << std::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)) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
}
| [
"literal.string.change",
"expression.operation.binary.change"
] | 878,376 | 878,377 | u220522704 | 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)) {
std::cout << 'Yes' << std::endl;
} else {
std::cout << 'No' << std::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)) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"expression.operation.binary.change"
] | 878,378 | 878,377 | u220522704 | 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 < a && c < b))
cout << "Yes\n";
else
cout << "No\n";
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 < a && c < b))
cout << "No\n";
else
cout << "Yes\n";
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 878,384 | 878,385 | u026389788 | 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 < a && c < b))
cout << "Yes\n";
else
cout << "No\n";
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 < a && c < b))
cout << "No\n";
else
cout << "Yes\n";
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 878,386 | 878,385 | u026389788 | cpp |
p03067 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
int m = min(a, c);
int mx = max(a, c);
for (int i = m; i <= mx; ++i) {
if (i == b)
return cout << "No", 0;
}
cout << "Yes";
}
| #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
int m = min(a, b);
int mx = max(a, b);
for (int i = m; i <= mx; ++i) {
if (i == c)
return cout << "Yes", 0;
}
cout << "No";
}
| [
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 878,389 | 878,390 | u048764593 | cpp |
p03067 | #include <iostream>
#include <utility>
using namespace std;
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a > b) {
swap(a, b);
}
if (a <= c && c <= b) {
cout << "Yes"
<< "\n";
} else {
cout << "Np"
<< "\n";
}
return 0;
} | #include <iostream>
#include <utility>
using namespace std;
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a > b) {
swap(a, b);
}
if (a <= c && c <= b) {
cout << "Yes"
<< "\n";
} else {
cout << "No"
<< "\n";
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 878,391 | 878,392 | u811176339 | cpp |
p03067 | // --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>--------------------
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
// ---------------</Headers and namespaces>---------------
// -----------------<Defines and typedefs>----------------
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
typedef long long ll;
typedef long double LD;
#define int ll
#define double LD
#define pb push_back
#define mp make_pair
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define remax(a, b) a = max(a, b)
#define remin(a, b) a = min(a, b)
#define all(v) v.begin(), v.end()
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type, vector<type>, greater<type>>
#define ITR ::iterator it
#define WL(t) while (t--)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container, it) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
#define sqr(x) ((x) * (x))
// -----<SCANF>-----
#define sfi(x) scanf("%d", &x);
#define sfi2(x, y) scanf("%d%d", &x, &y);
#define sfi3(x, y, z) scanf("%d%d%d", &x, &y, &z);
#define sfl(x) scanf("%lld", &x);
#define sfl2(x, y) scanf("%lld%lld", &x, &y);
#define sfl3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define sfs(x) scanf("%s", x);
#define sfs2(x, y) scanf("%s%s", x, y);
#define sfs3(x, y, z) scanf("%s%s%s", x, y, z);
// ----</SCANF>-----
// ----<PRINTF>-----
#define pfi(x) printf("%d\n", x);
#define pfi2(x, y) printf("%d %d\n", x, y);
#define pfi3(x, y, z) printf("%d %d %d\n", x, y, z);
#define pfl(x) printf("%lld\n", x);
#define pfl2(x, y) printf("%lld %lld\n", x, y);
#define pfl3(x, y, z) printf("%lld %lld %lld\n", x, y, z);
#define pfs(x) printf("%s\n", x);
#define pfs2(x, y) printf("%s %s\n", x, y);
#define pfs3(x, y, z) printf("%s %s %s\n", x, y, z);
// ----</PRINTF>----
#define FLSH fflush(stdout)
#define fileIO(name) \
freopen(name ".in", "r", stdin); \
freopen(name ".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x);
#define FAST_IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
// ----------------</Defines and typedefs>----------------
// -------------------<Debugging stuff>-------------------
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
// ------------------</Debugging stuff>-------------------
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI = acos(-1);
const int INF = 1000000000;
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
// ------------------------</RNG>-------------------------
// -----------------<Modular Arithmetic>------------------
template <typename T> T gcd(T a, T b) { return (b ? __gcd(a, b) : a); }
template <typename T> T lcm(T a, T b) { return (a * (b / gcd(a, b))); }
int add(int a, int b, int c) {
int res = a + b;
return (res >= c ? res - c : res);
}
int mod_neg(int a, int b, int c) {
int res;
if (abs(a - b) < c)
res = a - b;
else
res = (a - b) % c;
return (res < 0 ? res + c : res);
}
int mul(int a, int b, int c) {
ll res = (ll)a * b;
return (res >= c ? res % c : res);
}
ll mulmod(ll a, ll b, ll m) {
ll q = (ll)(((LD)a * (LD)b) / (LD)m);
ll r = a * b - q * m;
if (r > m)
r %= m;
if (r < 0)
r += m;
return r;
}
template <typename T> T expo(T e, T n) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = x * p;
p = p * p;
n >>= 1;
}
return x;
}
template <typename T> T power(T e, T n, T m) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = mul(x, p, m);
p = mul(p, p, m);
n >>= 1;
}
return x;
}
template <typename T> T extended_euclid(T a, T b, T &x, T &y) {
T xx = 0, yy = 1;
y = 0;
x = 1;
while (b) {
T q = a / b, t = b;
b = a % b;
a = t;
t = xx;
xx = x - q * xx;
x = t;
t = yy;
yy = y - q * yy;
y = t;
}
return a;
}
template <typename T> T mod_inverse(T a, T n) {
T x, y, z = 0;
T d = extended_euclid(a, n, x, y);
return (d > 1 ? -1 : mod_neg(x, z, n));
}
// -----------------</Modular Arithmetic>-----------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
void solvethetestcase();
signed main() {
// (UNCOMMENT FOR CIN/COUT) \
FAST_IO
PRECISION(10)
int t = 1;
// (UNCOMMENT FOR MULTIPLE TEST CASES) \
sfl(t);
FOR(testcase, 1, t + 1) {
// (UNCOMMENT FOR CODEJAM) \
printf("Case #%lld: ",testcase);
solvethetestcase();
}
}
int a, b, c;
void solvethetestcase() {
sfl3(a, b, c) if (c >= a and c <= b) {
printf("Yes\n");
return;
}
if (c <= b and c >= a) {
printf("Yes\n");
return;
}
printf("No\n");
} | // --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>--------------------
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
// ---------------</Headers and namespaces>---------------
// -----------------<Defines and typedefs>----------------
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
typedef long long ll;
typedef long double LD;
#define int ll
#define double LD
#define pb push_back
#define mp make_pair
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define remax(a, b) a = max(a, b)
#define remin(a, b) a = min(a, b)
#define all(v) v.begin(), v.end()
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type, vector<type>, greater<type>>
#define ITR ::iterator it
#define WL(t) while (t--)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container, it) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
#define sqr(x) ((x) * (x))
// -----<SCANF>-----
#define sfi(x) scanf("%d", &x);
#define sfi2(x, y) scanf("%d%d", &x, &y);
#define sfi3(x, y, z) scanf("%d%d%d", &x, &y, &z);
#define sfl(x) scanf("%lld", &x);
#define sfl2(x, y) scanf("%lld%lld", &x, &y);
#define sfl3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define sfs(x) scanf("%s", x);
#define sfs2(x, y) scanf("%s%s", x, y);
#define sfs3(x, y, z) scanf("%s%s%s", x, y, z);
// ----</SCANF>-----
// ----<PRINTF>-----
#define pfi(x) printf("%d\n", x);
#define pfi2(x, y) printf("%d %d\n", x, y);
#define pfi3(x, y, z) printf("%d %d %d\n", x, y, z);
#define pfl(x) printf("%lld\n", x);
#define pfl2(x, y) printf("%lld %lld\n", x, y);
#define pfl3(x, y, z) printf("%lld %lld %lld\n", x, y, z);
#define pfs(x) printf("%s\n", x);
#define pfs2(x, y) printf("%s %s\n", x, y);
#define pfs3(x, y, z) printf("%s %s %s\n", x, y, z);
// ----</PRINTF>----
#define FLSH fflush(stdout)
#define fileIO(name) \
freopen(name ".in", "r", stdin); \
freopen(name ".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x);
#define FAST_IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
// ----------------</Defines and typedefs>----------------
// -------------------<Debugging stuff>-------------------
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
// ------------------</Debugging stuff>-------------------
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI = acos(-1);
const int INF = 1000000000;
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
// ------------------------</RNG>-------------------------
// -----------------<Modular Arithmetic>------------------
template <typename T> T gcd(T a, T b) { return (b ? __gcd(a, b) : a); }
template <typename T> T lcm(T a, T b) { return (a * (b / gcd(a, b))); }
int add(int a, int b, int c) {
int res = a + b;
return (res >= c ? res - c : res);
}
int mod_neg(int a, int b, int c) {
int res;
if (abs(a - b) < c)
res = a - b;
else
res = (a - b) % c;
return (res < 0 ? res + c : res);
}
int mul(int a, int b, int c) {
ll res = (ll)a * b;
return (res >= c ? res % c : res);
}
ll mulmod(ll a, ll b, ll m) {
ll q = (ll)(((LD)a * (LD)b) / (LD)m);
ll r = a * b - q * m;
if (r > m)
r %= m;
if (r < 0)
r += m;
return r;
}
template <typename T> T expo(T e, T n) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = x * p;
p = p * p;
n >>= 1;
}
return x;
}
template <typename T> T power(T e, T n, T m) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = mul(x, p, m);
p = mul(p, p, m);
n >>= 1;
}
return x;
}
template <typename T> T extended_euclid(T a, T b, T &x, T &y) {
T xx = 0, yy = 1;
y = 0;
x = 1;
while (b) {
T q = a / b, t = b;
b = a % b;
a = t;
t = xx;
xx = x - q * xx;
x = t;
t = yy;
yy = y - q * yy;
y = t;
}
return a;
}
template <typename T> T mod_inverse(T a, T n) {
T x, y, z = 0;
T d = extended_euclid(a, n, x, y);
return (d > 1 ? -1 : mod_neg(x, z, n));
}
// -----------------</Modular Arithmetic>-----------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
void solvethetestcase();
signed main() {
// (UNCOMMENT FOR CIN/COUT) \
FAST_IO
PRECISION(10)
int t = 1;
// (UNCOMMENT FOR MULTIPLE TEST CASES) \
sfl(t);
FOR(testcase, 1, t + 1) {
// (UNCOMMENT FOR CODEJAM) \
printf("Case #%lld: ",testcase);
solvethetestcase();
}
}
int a, b, c;
void solvethetestcase() {
sfl3(a, b, c) if (c >= a and c <= b) {
printf("Yes\n");
return;
}
if (c >= b and c <= a) {
printf("Yes\n");
return;
}
printf("No\n");
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,410 | 878,411 | u689745846 | cpp |
p03067 | #include <algorithm>
#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;
}
| #include <algorithm>
#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;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,412 | 878,413 | u322960637 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A, B, C;
if ((A - C) * (B - C) < 0) {
cout << "Yes";
} else {
cout << "No";
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A - C) * (B - C) < 0) {
cout << "Yes";
} else {
cout << "No";
}
}
| [] | 878,420 | 878,421 | u214685595 | cpp |
p03067 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A, B, C;
if ((A - C) * (B - C) <= 0) {
cout << "Yes";
} else {
cout << "No";
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A - C) * (B - C) < 0) {
cout << "Yes";
} else {
cout << "No";
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,422 | 878,421 | u214685595 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > a && c < b) {
cout << "YES" << endl;
} else if (c > 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 (c > a && c < b) {
cout << "Yes" << endl;
} else if (c > b && c < a) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,423 | 878,424 | u539842437 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int white[200005], black[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int A, B, C;
cin >> A >> B >> C;
if (min(A, B) <= C and C <= max(A, B))
return cout << "YES", 0;
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int white[200005], black[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int A, B, C;
cin >> A >> B >> C;
if (min(A, B) <= C and C <= max(A, B))
return cout << "Yes", 0;
cout << "No";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 878,425 | 878,426 | u292217769 | cpp |
p03067 | #include <cmath>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
short a, b, c;
cin >> a >> b >> c;
if ((a > b && b > c) || (a < b && b < c)) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <cmath>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
short a, b, c;
cin >> a >> c >> b;
if ((a > b && b > c) || (a < b && b < c)) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"expression.operation.binary.remove"
] | 878,427 | 878,428 | u468506413 | cpp |
p03067 | #include <bits/stdc++.h>
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;
}
} | #include <bits/stdc++.h>
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;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,429 | 878,430 | u850779832 | cpp |
p03067 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define DSORT(c, type) sort(ALL(c), greater<type>())
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define SUM(v) accumulate(ALL(v), 0)
#define AVE(v) SUM(v) / (v).size()
// 入力eと同じ値の要素の数
#define COUNT(v, e) count(ALL(v), e)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a < b) {
int swap = a;
a = b;
b = swap;
}
if (b <= c and c <= a)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define DSORT(c, type) sort(ALL(c), greater<type>())
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define SUM(v) accumulate(ALL(v), 0)
#define AVE(v) SUM(v) / (v).size()
// 入力eと同じ値の要素の数
#define COUNT(v, e) count(ALL(v), e)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a < b) { // a > b
int swap = a;
a = b;
b = swap;
}
if (b <= c and c <= a)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,431 | 878,432 | u952843849 | cpp |
p03067 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
puts((c - a) * (c - b) > 0 ? "Yes" : "No");
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
puts((c - a) * (c - b) < 0 ? "Yes" : "No");
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 878,433 | 878,434 | u244203620 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a < c && c < b) || (b < c && a < c)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
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;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 878,435 | 878,436 | u627431737 | cpp |
p03067 | //
// atcoder.cpp
//
//
///
#include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < N; i++)
using namespace std;
//#include "atcoder.hpp"
long long gcd(long long a, long long b) {
if (a > b)
swap(a, b);
auto r = b % a;
return (r ? gcd(r, a) : a);
}
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A < B)
swap(A, B);
cout << ((A < C) && (C < B) ? "Yes" : "No") << endl;
return 0;
}
| //
// atcoder.cpp
//
//
///
#include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < N; i++)
using namespace std;
//#include "atcoder.hpp"
long long gcd(long long a, long long b) {
if (a > b)
swap(a, b);
auto r = b % a;
return (r ? gcd(r, a) : a);
}
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A > B)
swap(A, B);
cout << ((A < C) && (C < B) ? "Yes" : "No") << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,439 | 878,440 | u766779796 | 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 < C && 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) || (A < C && C < B)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,461 | 878,462 | u085481334 | 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;
}
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 (B < C && C < A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 878,472 | 878,473 | u833295869 | cpp |
p03067 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (max(a, b) < c || min(a, b) > c) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (max(a, b) < c || min(a, b) > c) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,474 | 878,475 | u069627403 | cpp |
p03067 | // #pragma GCC optimize ("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
#define fou(i, a, n) for (int i = a; i < n; i++)
#define fod(i, a, n) for (int i = n - 1; i >= a; i--)
#define rep(n) fou(_, 0, n)
#define tra(a, x) for (auto &a : x)
#define elif (c) else if (c)
#define emb emplace_back
#define pub push_back
#define pob pop_back
#define me min_element
#define Me max_element
#define mp make_pair
#define fi first
#define se second
#define siz(xs) ((int)(xs).size())
#define all(xs) xs.begin(), xs.end()
#define lla(xs) xs.rbegin(), xs.rend()
#define sortup(xs) sort(all(xs))
#define sortdown(xs) sort(lla(xs))
template <class C> void mini(C &a, C b) { a = min(a, b); }
template <class C> void maxi(C &a, C b) { a = max(a, b); }
#define in(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define out(...) _cout(__VA_ARGS__);
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
void _cout() {}
template <class Head, class... Tail> void _cout(Head &&head, Tail &&...tail) {
cout << head << endl;
_cout(forward<Tail>(tail)...);
}
template <class Type> void _cinvec(Type t, int n) {}
template <class Type, class Head, class... Tail>
void _cinvec(Type t, int n, Head &&head, Tail &&...tail) {
rep(n) {
cin >> t;
head.eb(t);
}
_cinvec(t, n, forward<Tail>(tail)...);
}
#define VI vector<int>
#define VD vector<double>
#define VS vector<string>
#define VVI vector<VI>
#define VVD vector<VD>
#define VVS vector<VS>
// #define int int64_t
// #define double long double
// map
// 横並びcout
signed main() {
in(int, a, b, c);
string ans;
if (c != max({a, b, c}) && c != max({a, b, c}))
ans = "Yes";
else
ans = "No";
out(ans);
} | // #pragma GCC optimize ("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
#define fou(i, a, n) for (int i = a; i < n; i++)
#define fod(i, a, n) for (int i = n - 1; i >= a; i--)
#define rep(n) fou(_, 0, n)
#define tra(a, x) for (auto &a : x)
#define elif (c) else if (c)
#define emb emplace_back
#define pub push_back
#define pob pop_back
#define me min_element
#define Me max_element
#define mp make_pair
#define fi first
#define se second
#define siz(xs) ((int)(xs).size())
#define all(xs) xs.begin(), xs.end()
#define lla(xs) xs.rbegin(), xs.rend()
#define sortup(xs) sort(all(xs))
#define sortdown(xs) sort(lla(xs))
template <class C> void mini(C &a, C b) { a = min(a, b); }
template <class C> void maxi(C &a, C b) { a = max(a, b); }
#define in(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define out(...) _cout(__VA_ARGS__);
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
void _cout() {}
template <class Head, class... Tail> void _cout(Head &&head, Tail &&...tail) {
cout << head << endl;
_cout(forward<Tail>(tail)...);
}
template <class Type> void _cinvec(Type t, int n) {}
template <class Type, class Head, class... Tail>
void _cinvec(Type t, int n, Head &&head, Tail &&...tail) {
rep(n) {
cin >> t;
head.eb(t);
}
_cinvec(t, n, forward<Tail>(tail)...);
}
#define VI vector<int>
#define VD vector<double>
#define VS vector<string>
#define VVI vector<VI>
#define VVD vector<VD>
#define VVS vector<VS>
// #define int int64_t
// #define double long double
// map
// 横並びcout
signed main() {
in(int, a, b, c);
string ans;
if (c != max({a, b, c}) && c != min({a, b, c}))
ans = "Yes";
else
ans = "No";
out(ans);
// in(int,N);
// in(string,S);
// in(int,K);
// char c=S[K-1];
// fou(i,0,N){if(S[i]!=c)cout<<'*';else cout<<S[i];}
// cout<<endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 878,479 | 878,480 | u408927978 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (max(a, b) > b && min(a, b) < b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
// your code goes here
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;
}
// your code goes here
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,488 | 878,489 | u053227023 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (max(a, c) > b, min(a, c) < b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
// your code goes here
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;
}
// your code goes here
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,490 | 878,489 | u053227023 | cpp |
p03067 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
//#include <istream>
//#include <sstream>
using namespace std;
int main() {
int A;
int ma;
int mi;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
mi = min(A, B);
ma = max(A, B);
if (mi <= C <= ma) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
//#include <istream>
//#include <sstream>
using namespace std;
int main() {
int A;
int ma;
int mi;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
mi = min(A, B);
ma = max(A, B);
if (mi <= C && C <= ma) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 878,493 | 878,494 | u230139835 | cpp |
p03067 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
string ans;
ans = "No";
if (a < c && c << b) {
ans = "No";
}
if (a > c && c > b) {
ans = "No";
}
cout << ans;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
string ans;
ans = "No";
if (a < c && c < b) {
ans = "Yes";
}
if (a > c && c > b) {
ans = "Yes";
}
cout << ans;
}
| [
"misc.typo",
"control_flow.branch.if.condition.change",
"literal.string.change",
"assignment.value.change"
] | 878,501 | 878,502 | u365928729 | cpp |
p03067 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A < C && C < B || B < C && B < 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 < C && C < B || B < C && C < A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,504 | 878,505 | u692207013 | cpp |
p03067 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A <= C && C <= B || B <= C && B <= 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 < C && C < B || B < C && C < A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,506 | 878,505 | u692207013 | cpp |
p03067 | #include <bits/stdc++.h>
#include <iostream>
// fastIO
#define endl "\n"
// types
#define ll long long
// vectors
#define vec_i std::vec<int>
// vectors operations
#define pb push_back
#define eb emplace_back
#define size(a) ((int)(a.size()))
// useful math
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define abs(a) ((a) >= (0) ? (a) : (-a))
ll gcd(ll a, ll b) {
while (b != 0) {
ll r = a % b;
a = b;
b = r;
}
return a;
}
using namespace std;
int main() {
int a, b, c;
bool flag = false;
cin >> a >> b >> c;
if (a > c and c > b) {
flag = true;
} else if (b > c and c > a) {
flag = true;
}
flag ? cout << "YES" : cout << "NO";
cout << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
// fastIO
#define endl "\n"
// types
#define ll long long
// vectors
#define vec_i std::vec<int>
// vectors operations
#define pb push_back
#define eb emplace_back
#define size(a) ((int)(a.size()))
// useful math
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define abs(a) ((a) >= (0) ? (a) : (-a))
ll gcd(ll a, ll b) {
while (b != 0) {
ll r = a % b;
a = b;
b = r;
}
return a;
}
using namespace std;
int main() {
int a, b, c;
bool flag = false;
cin >> a >> b >> c;
if (a >= c and c >= b) {
flag = true;
} else if (b >= c and c >= a) {
flag = true;
}
flag ? cout << "Yes" : cout << "No";
cout << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 878,507 | 878,508 | u901661743 | cpp |
p03067 | ///বিসমিল্লাহির_রহমানির_রহীম
#include <bits/stdc++.h>
#define pie acos(-1)
#define N 2000005
#define ESP 1e-9
#define pii pair<int, int>
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define nl "\n"
#define MOD 1000000007
#define sp " "
#define CLR(a) memset(a, 0, sizeof(a))
#define SET(a) memset(a, -1, sizeof(a))
#define mk make_pair
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int)(x).size()
using namespace std;
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(10);
cin.tie(nullptr);
cout.tie(nullptr);
// freopen ("output.txt","w",stdout);
// freopen ("input.txt","r",stdin);
int a, b, c;
cin >> a >> b >> c;
if ((b > a && b > c) || (b < a && b < c))
cout << "Yes" << nl;
else
cout << "No" << nl;
return 0;
}
| ///বিসমিল্লাহির_রহমানির_রহীম
#include <bits/stdc++.h>
#define pie acos(-1)
#define N 2000005
#define ESP 1e-9
#define pii pair<int, int>
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define nl "\n"
#define MOD 1000000007
#define sp " "
#define CLR(a) memset(a, 0, sizeof(a))
#define SET(a) memset(a, -1, sizeof(a))
#define mk make_pair
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int)(x).size()
using namespace std;
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(10);
cin.tie(nullptr);
cout.tie(nullptr);
// freopen ("output.txt","w",stdout);
// freopen ("input.txt","r",stdin);
int a, b, c;
cin >> a >> b >> c;
if ((c > a && c < b) || (c < a && b < c))
cout << "Yes" << nl;
else
cout << "No" << nl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 878,509 | 878,510 | u111496108 | 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 >= min(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 (c <= max(a, b) && c >= min(b, a))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 878,511 | 878,512 | u803994812 | 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 >= min(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 (c <= max(a, b) && c >= min(b, a))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,513 | 878,512 | u803994812 | cpp |
p03067 | #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;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
if (a > b) {
if (c <= a && c >= b) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (c >= a && c <= b) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
cin >> a;
} | #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;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
if (a > b) {
if (c <= a && c >= b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
if (c >= a && c <= b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
cin >> a;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 878,516 | 878,517 | u553927381 | cpp |
p03068 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
rep(i, N) {
if (S[i] != S[K])
cout << '*';
else
cout << S[i];
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
rep(i, N) {
if (S[i] != S[K - 1])
cout << '*';
else
cout << S[i];
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 878,524 | 878,525 | u629603666 | cpp |
p03068 |
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int wqwq;
cin >> wqwq;
string x;
cin >> x;
int a;
cin >> a;
int n = x.size();
for (int i = 0; i < n; i++) {
if (x[i] == x[a])
cout << x[a];
else
cout << '*';
}
} | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int wqwq;
cin >> wqwq;
string x;
cin >> x;
int a;
cin >> a;
int n = x.size();
for (int i = 0; i < n; i++) {
if (x[i] == x[a - 1])
cout << x[a - 1];
else
cout << '*';
}
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,526 | 878,527 | u083006500 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
for (int i = 0; i < n; i++) {
if (s[k - 1] == s[i]) {
s[i] = '*';
}
}
cout << s;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
for (int i = 0; i < n; i++) {
if (s[k - 1] != s[i]) {
s[i] = '*';
}
}
cout << s;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,528 | 878,529 | u896301093 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
//入力
template <typename T> istream &operator>>(istream &is, vector<T> &a) {
for (int i = 0; i < a.size(); i++)
is >> a[i];
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
//出力
template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
for (int i = 0; i < a.size(); i++) {
os << a[i] << ((i + 1 != a.size()) ? " " : "");
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
//入出力高速化
struct hishimochi {
hishimochi() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
}
};
hishimochi Hishimochi;
//辺
struct edge {
long long to, cost;
edge(long long t, long long c) : to(t), cost(c) {}
};
struct edge2 {
long long from, to, cost;
edge2(long long f, long long t, long long c) : from(f), to(t), cost(c) {}
};
//型名
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<long long, long long>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vvvl = vector<vector<vector<long long>>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vp = vector<pair<long long, long long>>;
using Lqueue = priority_queue<long long>;
using Squeue = priority_queue<long long, vector<long long>, greater<long long>>;
//定数
const int MOD1 = 1000000007;
const int MOD2 = 998244353;
const long double PI = 3.1415926535897932;
const long long MAXLL = 9223372036854775807;
const long long INF = 2305843009213693951;
const long double eps = 0.000000001;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
//マクロ
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (int _ = 0; _ < (n); _++)
#define rep2(i, n) for (int i = 0; i < (n); i++)
#define rep3(i, s, n) for (long long i = (s); i < (n); i++)
#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define bitrep1(n) for (int _ = 0; _ < (1LL << (n)); _++)
#define bitrep2(i, n) for (int i = 0; i < (1LL << (n)); i++)
#define bitrep3(i, s, n) for (int i = (s); i < (1LL << (n)); i++)
#define bitrep(...) \
overload3(__VA_ARGS__, bitrep3, bitrep2, bitrep1)(__VA_ARGS__)
#define rrep0(n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, s, n) for (long long i = (n - 1); i >= (s); i--)
#define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1, rrep0)(__VA_ARGS__)
#define rbf(a, x) for (auto &a : x)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bitcheck(bit, i) (bit) & (1LL << (i))
#define Maxe(x) *max_element((x).begin(), (x).end())
#define Mine(x) *min_element((x).begin(), (x).end())
#define Sume(x) accumulate((x).begin(), (x).end(), 0LL)
#define Size(x) ((long long)(x).size())
#define Sort(x) sort((x).begin(), (x).end())
#define rSort(x) sort((x).rbegin(), (x).rend())
#define Rev(x) reverse((x).begin(), (x).end())
#define Lin(s) getline(cin, (s))
//省略
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
//関数
void Yes(bool a) { cout << (a ? "Yes" : "No") << endl; }
void YES(bool a) { cout << (a ? "YES" : "NO") << endl; }
long long modpow(long long x, long long n, int m) {
long long r = 1;
while (n > 0) {
if (n & 1)
(r *= x) %= m;
(x *= x) %= m;
n >>= 1;
}
return r;
}
long long Gcd(long long a, long long b) { return b ? Gcd(b, a % b) : a; }
long long Lcm(long long a, long long b) { return a / Gcd(a, b) * b; }
inline long long cutup(long long a, long long b) { return (a + b - 1) / b; }
inline long long popcnt(long long a) { return __builtin_popcountll(a); }
template <class T, class U> auto max(T a, U b) { return a > b ? a : b; }
template <class T, class U> auto min(T a, U b) { return a < b ? a : b; }
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void print(T a) { cout << a << endl; }
template <class t> t mypow(t a, long long b) {
if (b == 0)
return 1;
if (a == 0)
return 0;
t x = 1;
while (b > 0) {
if (b & 1LL)
x *= a;
a *= a;
b >>= 1LL;
}
return x;
}
signed main() {
ll n, k;
string s;
cin >> n >> s >> k;
rep(i, n) {
if (s[i] != s[k])
s[i] = '*';
}
print(s);
} | #include <bits/stdc++.h>
using namespace std;
//入力
template <typename T> istream &operator>>(istream &is, vector<T> &a) {
for (int i = 0; i < a.size(); i++)
is >> a[i];
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
//出力
template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
for (int i = 0; i < a.size(); i++) {
os << a[i] << ((i + 1 != a.size()) ? " " : "");
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
//入出力高速化
struct hishimochi {
hishimochi() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
}
};
hishimochi Hishimochi;
//辺
struct edge {
long long to, cost;
edge(long long t, long long c) : to(t), cost(c) {}
};
struct edge2 {
long long from, to, cost;
edge2(long long f, long long t, long long c) : from(f), to(t), cost(c) {}
};
//型名
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<long long, long long>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vvvl = vector<vector<vector<long long>>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vp = vector<pair<long long, long long>>;
using Lqueue = priority_queue<long long>;
using Squeue = priority_queue<long long, vector<long long>, greater<long long>>;
//定数
const int MOD1 = 1000000007;
const int MOD2 = 998244353;
const long double PI = 3.1415926535897932;
const long long MAXLL = 9223372036854775807;
const long long INF = 2305843009213693951;
const long double eps = 0.000000001;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
//マクロ
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (int _ = 0; _ < (n); _++)
#define rep2(i, n) for (int i = 0; i < (n); i++)
#define rep3(i, s, n) for (long long i = (s); i < (n); i++)
#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define bitrep1(n) for (int _ = 0; _ < (1LL << (n)); _++)
#define bitrep2(i, n) for (int i = 0; i < (1LL << (n)); i++)
#define bitrep3(i, s, n) for (int i = (s); i < (1LL << (n)); i++)
#define bitrep(...) \
overload3(__VA_ARGS__, bitrep3, bitrep2, bitrep1)(__VA_ARGS__)
#define rrep0(n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, s, n) for (long long i = (n - 1); i >= (s); i--)
#define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1, rrep0)(__VA_ARGS__)
#define rbf(a, x) for (auto &a : x)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bitcheck(bit, i) (bit) & (1LL << (i))
#define Maxe(x) *max_element((x).begin(), (x).end())
#define Mine(x) *min_element((x).begin(), (x).end())
#define Sume(x) accumulate((x).begin(), (x).end(), 0LL)
#define Size(x) ((long long)(x).size())
#define Sort(x) sort((x).begin(), (x).end())
#define rSort(x) sort((x).rbegin(), (x).rend())
#define Rev(x) reverse((x).begin(), (x).end())
#define Lin(s) getline(cin, (s))
//省略
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
//関数
void Yes(bool a) { cout << (a ? "Yes" : "No") << endl; }
void YES(bool a) { cout << (a ? "YES" : "NO") << endl; }
long long modpow(long long x, long long n, int m) {
long long r = 1;
while (n > 0) {
if (n & 1)
(r *= x) %= m;
(x *= x) %= m;
n >>= 1;
}
return r;
}
long long Gcd(long long a, long long b) { return b ? Gcd(b, a % b) : a; }
long long Lcm(long long a, long long b) { return a / Gcd(a, b) * b; }
inline long long cutup(long long a, long long b) { return (a + b - 1) / b; }
inline long long popcnt(long long a) { return __builtin_popcountll(a); }
template <class T, class U> auto max(T a, U b) { return a > b ? a : b; }
template <class T, class U> auto min(T a, U b) { return a < b ? a : b; }
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void print(T a) { cout << a << endl; }
template <class t> t mypow(t a, long long b) {
if (b == 0)
return 1;
if (a == 0)
return 0;
t x = 1;
while (b > 0) {
if (b & 1LL)
x *= a;
a *= a;
b >>= 1LL;
}
return x;
}
signed main() {
ll n, k;
string s;
cin >> n >> s >> k;
k--;
rep(i, n) {
if (s[i] != s[k])
s[i] = '*';
}
print(s);
} | [
"expression.unary.arithmetic.add"
] | 878,530 | 878,531 | u190580703 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.