problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
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 < ... | #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 < ... | [
"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");
}
}
... | #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");
}
}
... | [
"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" << e... | #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" << e... | [
"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 ... | #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 ... | [
"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 << ... | #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 ... | [
"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... | #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 ... | [
"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++... | #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++... | [
"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_std... | #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_std... | [
"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) fo... | #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) fo... | [
"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) fo... | #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) fo... | [
"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... | #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(... | [
"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 ... | #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 ... | [
"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"
... | #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"
... | [
"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"
... | #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"
... | [
"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)... | #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)... | [
"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, l... | #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, l... | [
"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;
}
ret... | #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;
}
ret... | [
"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>
#i... | #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>
#i... | [
"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,... | #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,... | [
"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 ... | //#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 ... | [
"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[200... | //↓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[200... | [
"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) {... | #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) {... | [
"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"
... | #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"
... | [
"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 BR... | // --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BR... | [
"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 <s... | #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 <s... | [
"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 ... | #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 ... | [
"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 >> ... | //
// 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 >> ... | [
"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... | // #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... | [
"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 ... | #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 ... | [
"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,... | #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,... | [
"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)... | ///বিসমিল্লাহির_রহমানির_রহীম
#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)... | [
"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) {
... | #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) {
... | [
"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;
}
... | #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;
}
... | [
"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.