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 |
|---|---|---|---|---|---|---|---|
p02988 | #include <stdio.h>
int main(void) {
int n, i, d = 0;
scanf("%d", &n);
int p[n];
for (i == 0; i < n; i++) {
scanf("%d", &p[i]);
}
for (i == 1; i < n - 1; i++) {
if ((p[i] <= p[i + 1] && p[i] >= p[i - 1]) ||
(p[i] >= p[i + 1] && p[i] <= p[i - 1])) {
d++;
}
}
printf("%d", d);
}
| #include <stdio.h>
int main(void) {
int n, i, d = 0;
scanf("%d", &n);
int p[n];
for (i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
for (i = 1; i < n - 1; i++) {
if ((p[i] <= p[i + 1] && p[i] >= p[i - 1]) ||
(p[i] >= p[i + 1] && p[i] <= p[i - 1])) {
d = d + 1;
}
}
printf("%d", d);
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"assignment.change"
] | 796,342 | 796,343 | u222643545 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int p[N + 10];
int count;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 1; i < N - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1]) {
count++;
} else if (p[i - 1] ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int p[N + 10];
int count = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 1; i < N - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1]) {
count++;
} else if (p[i -... | [
"variable_declaration.value.change"
] | 796,365 | 796,366 | u661461084 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 1; i < n - 1; ++i) {
if (p[i - 1] < p[i] && p[i] < p[i + 1]) {
++cnt;
} else if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
++cnt;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 1; i < n - 1; ++i) {
if (p[i - 1] < p[i] && p[i] < p[i + 1]) {
++cnt;
} else if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
++c... | [
"variable_declaration.value.change"
] | 796,373 | 796,374 | u673281957 | cpp |
p02988 | #include <stdio.h>
#define max(a, b) (a < b ? b : a)
#define min(a, b) (a < b ? a : b)
int main(void) {
int N;
scanf("%d", &N);
int p[20];
for (int i = 0; i < N; i++) {
scanf("%d", p[i]);
}
int cnt = 0;
for (int i = 1; i < N - 1; i++) {
int ma = max(max(p[i - 1], p[i]), p[i + 1]);
int mi =... | #include <stdio.h>
#define max(a, b) (a < b ? b : a)
#define min(a, b) (a < b ? a : b)
int main(void) {
int N;
scanf("%d", &N);
int p[20];
for (int i = 0; i < N; i++) {
scanf("%d", &p[i]);
}
int cnt = 0;
for (int i = 1; i < N - 1; i++) {
int ma = max(max(p[i - 1], p[i]), p[i + 1]);
int mi ... | [
"expression.operation.unary.reference.add"
] | 796,385 | 796,386 | u245335950 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int ans = 0;
for (int i = 1; i <= n - 1; i++)
if ((a[i - 1] < a[i] && a[i + 1] > a[i]) ||
(a[i - 1] > a[i] && a[i + 1] < a[i]))
ans++;
cout << ans <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int ans = 0;
for (int i = 2; i <= n - 1; i++)
if ((a[i - 1] < a[i] && a[i + 1] > a[i]) ||
(a[i - 1] > a[i] && a[i + 1] < a[i]))
ans++;
cout << ans <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 796,394 | 796,395 | u678652070 | cpp |
p02988 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
ll mod = 1e9 + 7;
ll mod2 = 998244353;
const int INF = 1e9;
... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
ll mod = 1e9 + 7;
ll mod2 = 998244353;
const int INF = 1e9;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,400 | 796,401 | u890465662 | cpp |
p02988 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
ll mod = 1e9 + 7;
ll mod2 = 998244353;
const int INF = 1e9;
... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
ll mod = 1e9 + 7;
ll mod2 = 998244353;
const int INF = 1e9;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,402 | 796,401 | u890465662 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
char c[n];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 1; i < n - 1; i++)
if ((c[i] < c[i + 1] && c[i] > c[i - 1]) ||
(c[i] > c[i + 1] && c[i] < c[i - 1]))
ans++;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
int c[n];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 1; i < n - 1; i++)
if ((c[i] < c[i + 1] && c[i] > c[i - 1]) ||
(c[i] > c[i + 1] && c[i] < c[i - 1]))
ans++;
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 796,423 | 796,424 | u550538710 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
char c[n];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 1; i < n - 1; i++)
if ((c[i] <= c[i + 1] && c[i] > c[i - 1]) ||
(c[i] > c[i + 1] && c[i] <= c[i - 1]))
ans++;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
int c[n];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 1; i < n - 1; i++)
if ((c[i] < c[i + 1] && c[i] > c[i - 1]) ||
(c[i] > c[i + 1] && c[i] < c[i - 1]))
ans++;
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,425 | 796,424 | u550538710 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
char c[n];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 1; i < n - 1; i++)
if ((c[i] <= c[i + 1] && c[i] >= c[i - 1]) ||
(c[i] >= c[i + 1] && c[i] <= c[i - 1]))
ans++;
cout << ans;
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
int c[n];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 1; i < n - 1; i++)
if ((c[i] < c[i + 1] && c[i] > c[i - 1]) ||
(c[i] > c[i + 1] && c[i] < c[i - 1]))
ans++;
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,426 | 796,424 | u550538710 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
int P[n];
a = 0;
for (int i = 0; i < n - 1; i++) {
cin >> P[i];
}
for (int i = 1; i < n - 1; i++) {
if ((P[i - 1] < P[i] && P[i] < P[i + 1]) ||
(P[i - 1] > P[i] && P[i] > P[i + 1])) {
a++;
}
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
int P[n];
a = 0;
for (int i = 0; i < n; i++) {
cin >> P[i];
}
for (int i = 1; i < n - 1; i++) {
if ((P[i - 1] < P[i] && P[i] < P[i + 1]) ||
(P[i - 1] > P[i] && P[i] > P[i + 1])) {
a++;
}
}
cout <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 796,429 | 796,430 | u190066528 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
int P[n];
a = 0;
for (int i = 0; i < n - 1; i++) {
cin >> P[i];
}
for (int i = 1; i < n; i++) {
if ((P[i - 1] < P[i] && P[i] < P[i + 1]) ||
(P[i - 1] > P[i] && P[i] > P[i + 1])) {
a++;
}
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
int P[n];
a = 0;
for (int i = 0; i < n; i++) {
cin >> P[i];
}
for (int i = 1; i < n - 1; i++) {
if ((P[i - 1] < P[i] && P[i] < P[i + 1]) ||
(P[i - 1] > P[i] && P[i] > P[i + 1])) {
a++;
}
}
cout <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 796,431 | 796,430 | u190066528 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll a;
vector<ll> arr;
ll count = 0;
arr.resize(a);
for (int x = 0; x < a; x++) {
cin >> arr[x];
}
for (int x = 1; x < (a - 1); x++) {
if (((arr[x] > arr[x - 1]) && (arr[x] < arr[x + 1])) ||
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll a;
cin >> a;
vector<ll> arr;
ll count = 0;
arr.resize(a);
for (int x = 0; x < a; x++) {
cin >> arr[x];
}
for (int x = 1; x < (a - 1); x++) {
if (((arr[x] > arr[x - 1]) && (arr[x] < arr[x ... | [] | 796,435 | 796,436 | u491044700 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int sign(int A) { return (A > 0) - (A < 0); }
int func() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
int p[30] = {0};
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
int count = 0;
for (int i = 0; i < n - 3; i++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int sign(int A) { return (A > 0) - (A < 0); }
int func() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
int p[30] = {0};
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
int count = 0;
for (int i = 0; i < n - 2; i++) {... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 796,443 | 796,444 | u773035128 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 2; i < n - 1; i++) {
vector<int> v;
v.push_back(p[i]);
v.push_back(p[i - 1]);
v.push_back(p[i + 1]);
sort(v.begin(), v.end());
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 1; i < n - 1; i++) {
vector<int> v;
v.push_back(p[i]);
v.push_back(p[i - 1]);
v.push_back(p[i + 1]);
sort(v.begin(), v.end());
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 796,452 | 796,453 | u477329923 | cpp |
p02988 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int i, j;
cin >> j;
int a[j];
for (i = 0; i < j; i++) {
cin >> a[j];
}
int count = 0;
for (i = 1; i < j - 1; i++) {
int c = i - 1;
int d ... |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int i, j;
cin >> j;
int a[j];
for (i = 0; i < j; i++) {
cin >> a[i];
}
int count = 0;
for (i = 1; i < j - 1; i++) {
int c = i - 1;
int ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 796,454 | 796,455 | u308077140 | cpp |
p02988 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
int count = 0;
for (int i = 1; i < n - 1; i++) {
if (vec.at(i) > vec.at(i - 1) && vec.at(i) < vec.at(i + 1)) {
count++;
} else if (vec.at(i)... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
int count = 0;
for (int i = 1; i < n - 1; i++) {
if (vec.at(i) > vec.at(i - 1) && vec.at(i) < vec.at(i + 1)) {
count++;
} else ... | [] | 796,456 | 796,457 | u656568465 | cpp |
p02988 | #include "iostream"
using namespace std;
int main() {
int n;
int ans = 0;
char p[21] = {0};
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
for (int i = 2; i <= n - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1]) {
ans++;
} else if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
... | #include "iostream"
using namespace std;
int main() {
int n;
int ans = 0;
int p[21] = {0};
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
for (int i = 2; i <= n - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1]) {
ans++;
} else if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
... | [
"variable_declaration.type.primitive.change"
] | 796,478 | 796,479 | u362542037 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 20
int n;
char a[MAX_N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int count = 0;
for (int i = 1; i < n - 1; i++) {
if ((a[i - 1] < a[i]) && (a[i] < a[i + 1]) ||
(a[i - 1] > a[i]) && (a[i] > a[i + 1])) {... | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 25
int n;
int a[MAX_N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int count = 0;
for (int i = 1; i < n - 1; i++) {
if (((a[i - 1] < a[i]) && (a[i] < a[i + 1])) ||
((a[i - 1] > a[i]) && (a[i] > a[i + 1]))... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change"
] | 796,483 | 796,484 | u508656894 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 20
int n;
char a[MAX_N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int count = 0;
for (int i = 1; i < n - 1; i++) {
if (((a[i - 1] < a[i]) && (a[i] < a[i + 1])) ||
((a[i - 1] > a[i]) && (a[i] > a[i + 1])... | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 25
int n;
int a[MAX_N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int count = 0;
for (int i = 1; i < n - 1; i++) {
if (((a[i - 1] < a[i]) && (a[i] < a[i + 1])) ||
((a[i - 1] > a[i]) && (a[i] > a[i + 1]))... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.primitive.change"
] | 796,485 | 796,484 | u508656894 | cpp |
p02989 | /************************************/
/* NoobM */
/* File Name : chaa.cpp */
/* Date : 13.07.2020 02:37:00 +06 */
/************************************/
#include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) \... | /************************************/
/* NoobM */
/* File Name : chaa.cpp */
/* Date : 13.07.2020 02:37:00 +06 */
/************************************/
#include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) \... | [
"call.add",
"call.arguments.change"
] | 796,490 | 796,491 | u740401436 | cpp |
p02989 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
sort(a, a + n);
cout << a[n / 3] - a[n... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
sort(a, a + n);
cout << a[n / 2] - a[n... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 796,496 | 796,497 | u534923072 | cpp |
p02989 | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 796,505 | 796,506 | u931901821 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(N);
}
sort(vec.begin(), vec.end());
cout << vec.at(N / 2) - vec.at(N / 2 - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
}
sort(vec.begin(), vec.end());
cout << vec.at(N / 2) - vec.at(N / 2 - 1) << endl;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 796,514 | 796,515 | u740002394 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
if (d[N / 2] == d[N / 2 + 1]) {
cout << 0 << endl;
}
cout << d[N / 2 + 1] - d[N / 2] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
if (d[N / 2] == d[N / 2 + 1]) {
cout << 0 << endl;
} else {
cout << d[N / 2 + 1] - d[N / 2] << endl;
}
} | [
"control_flow.branch.else.add"
] | 796,520 | 796,521 | u991713078 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int med = n / 2;
int ans = a.at(med + 1) - a.at(med);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int med = n / 2;
int ans = a.at(med) - a.at(med - 1);
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 796,534 | 796,535 | u191114518 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> hako(N - 1);
for (int i = 0; i < N; i++) {
cin >> hako[i];
}
sort(hako.begin(), hako.end());
int A = hako[N / 2 - 1];
int B = hako[N / 2];
cout << B - A << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> hako(N);
for (int i = 0; i < N; i++) {
cin >> hako[i];
}
sort(hako.begin(), hako.end());
int A = hako[N / 2 - 1];
int B = hako[N / 2];
cout << B - A << endl;
} | [
"expression.operation.binary.remove"
] | 796,548 | 796,549 | u794933113 | cpp |
p02989 | #include <functional>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n;
cin >> n;
int d[n];
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d, d + n);
int count = n / 2;
int ans = d[count - 1];
cout << ans << endl;
}
| #include <functional>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n;
cin >> n;
int d[n];
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d, d + n);
int count = n / 2;
int ans = d[count] - d[count - 1];
cout << ans << endl;
}
| [
"assignment.change"
] | 796,550 | 796,551 | u880629364 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
int n;
n = N / 2;
if (d.at(n - 1) == d.at(n)) {
cout << 0 << endl;
} else {
cout << d.at(n) - d.at(n - 1) - 1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
int n;
n = N / 2;
if (d.at(n - 1) == d.at(n)) {
cout << 0 << endl;
} else {
cout << d.at(n) - d.at(n - 1) << endl;
}
... | [
"expression.operation.binary.remove"
] | 796,567 | 796,568 | u793154675 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i, a, b) for (int i = (a); i <= (b); i++)
#define CIN \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i, a, b) for (int i = (a); i <= (b); i++)
#define CIN \
ios_base::sync_with_stdio(0); ... | [] | 796,571 | 796,572 | u228456702 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> i;
}
sort(vec.begin(), vec.end());
cout << vec.at(N / 2) - vec.at(N / 2 - 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
cout << vec.at(N / 2) - vec.at(N / 2 - 1) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 796,587 | 796,588 | u187772564 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
N = N / 2;
if (d[N] == d[N - 1]) {
cout << 0 << endl;
} else {
cout << d[N - 1] - d[N] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
N = N / 2;
if (d[N] == d[N - 1]) {
cout << 0 << endl;
} else {
cout << d[N] - d[N - 1] << endl;
}
} | [
"expression.operation.binary.remove"
] | 796,597 | 796,598 | u830770242 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
N = N / 2;
if (d[N] == d[N + 1]) {
cout << 0 << endl;
} else {
cout << d[N + 1] - d[N] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
N = N / 2;
if (d[N] == d[N - 1]) {
cout << 0 << endl;
} else {
cout << d[N] - d[N - 1] << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 796,599 | 796,598 | u830770242 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | [
"expression.operation.binary.remove"
] | 796,600 | 796,601 | u584787460 | cpp |
p02989 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
int sa = 0;
sa = d[n / 2 + 1] - ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
int sa = 0;
sa = d[n / 2] - d[n ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 796,605 | 796,606 | u831954260 | cpp |
p02989 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) (v.begin(), v.end(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) (v.begin(), v.end(... | [
"expression.operation.binary.add"
] | 796,609 | 796,610 | u459105164 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d[(N / 2) + 1] - d[N / 2] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d[(N / 2)] - d[(N / 2) - 1] << endl;
} | [
"expression.operation.binary.remove"
] | 796,611 | 796,612 | u016183710 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int ans = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
for (int i = 0; i <= vec[N]; i++) {
if (vec[N / 2 - 1] < i && vec[N / 2] >= i) {
ans++;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int ans = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
for (int i = 0; i <= vec[N - 1]; i++) {
if (vec[N / 2 - 1] < i && vec[N / 2] >= i) {
ans++;
}
}
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 796,615 | 796,616 | u342075214 | cpp |
p02989 | #include "bits/stdc++.h"
using namespace std;
// template <typename... T> void read(T& ... t){ ((cin >> t), ...); }
// template <typename... T> void write(T ... t){ ((cout << t), ...); }
//#define int long long
#define FAST ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define size(x) (int)x.size()
#define all(x) x.... | #include "bits/stdc++.h"
using namespace std;
// template <typename... T> void read(T& ... t){ ((cin >> t), ...); }
// template <typename... T> void write(T ... t){ ((cout << t), ...); }
//#define int long long
#define FAST ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define size(x) (int)x.size()
#define all(x) x.... | [
"expression.operation.binary.remove"
] | 796,621 | 796,622 | u076290325 | cpp |
p02989 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | [
"expression.operation.binary.remove"
] | 796,625 | 796,626 | u809967037 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll c = a[n / 2] - a[n / 2 - 1];
cout << c;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll c = a[n / 2] - a[n / 2 - 1];
cout << c;
return 0;
}
| [] | 796,627 | 796,628 | u236966848 | cpp |
p02989 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"io.output.newline.add"
] | 796,629 | 796,630 | u545364250 | cpp |
p02989 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | [
"expression.operation.binary.remove"
] | 796,631 | 796,632 | u880221923 | cpp |
p02989 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int d[n];
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d, d + n);
int ind = n / 2;
int ans = d[ind + 1] - d[ind];
cout << ans << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int d[n];
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d, d + n);
int ind = n / 2;
int ans = d[ind] - d[ind - 1];
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 796,633 | 796,634 | u904995051 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | [
"expression.operation.binary.remove"
] | 796,638 | 796,639 | u207310767 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d.at(N / 2 + 1) - d.at(N / 2) + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d.at(N / 2) - d.at(N / 2 - 1) << endl;
} | [
"expression.operation.binary.remove",
"io.output.change",
"call.arguments.change"
] | 796,643 | 796,644 | u583628727 | cpp |
p02989 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0, s;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
for (int i = d[n / 2 - 1]; i <= d[n / 2]; i++) {
... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
for (int i = d[n / 2 - 1]; i < d[n / 2]; i++) {
cn... | [
"variable_declaration.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 796,645 | 796,646 | u854685063 | cpp |
p02989 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int n;
cin >> n;
int d[n];
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d, d + n);
cout << d[n / 2] - d[n / 2 - 1] + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int n;
cin >> n;
int d[n];
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d, d + n);
cout << d[n / 2] - d[n / 2 - 1] << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 796,648 | 796,649 | u201553784 | cpp |
p02989 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef priority_queue... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef priority_queue... | [
"io.output.change"
] | 796,670 | 796,671 | u058597183 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
sort(vec.begin(), vec.end());
cout << vec[n / 2 + 1] - vec[n / 2] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
sort(vec.begin(), vec.end());
cout << vec[n / 2] - vec[n / 2 - 1] << endl;
} | [
"expression.operation.binary.remove"
] | 796,696 | 796,697 | u868580535 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(100010);
for (int i = 0; i < N; ++i) {
cin >> d[i];
}
sort(d.begin(), d.end());
int K = d[d.size() / 2] - d[d.size() / 2 - 1];
cout << K << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; ++i) {
cin >> d[i];
}
sort(d.begin(), d.end());
int K = d[d.size() / 2] - d[d.size() / 2 - 1];
cout << K << endl;
return 0;
} | [
"call.arguments.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 796,698 | 796,699 | u531523517 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
cout << v[n / 2 + 1] - v[n / 2];
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
cout << v[n / 2] - v[n / 2 - 1];
}
| [
"expression.operation.binary.remove"
] | 796,706 | 796,707 | u983711104 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int X;
priority_queue<int> A;
for (int i = 0; i < N; i++) {
cin >> X;
A.push(X);
}
for (int i = 0; i < (N / 2) - 2; i++) {
A.pop();
}
int B, C;
B = A.top();
A.pop();
C = A.top();
cout << B - C;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int X;
priority_queue<int> A;
for (int i = 0; i < N; i++) {
cin >> X;
A.push(X);
}
for (int i = 0; i < (N / 2) - 1; i++) {
A.pop();
}
int B, C;
B = A.top();
A.pop();
C = A.top();
cout << B - C;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 796,710 | 796,711 | u187417007 | cpp |
p02989 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) { cin >> d[i]; }
sort(d.begin(), d.end());
ll right = d[n / 2];
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) { cin >> d[i]; }
sort(d.begin(), d.end());
ll right = d[n / 2];
... | [
"expression.operation.binary.remove"
] | 796,715 | 796,716 | u101048376 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < n; i++) \
;
using ll = long long;
int main() {
int N;
cin >> N;
int a = N / 2;
vector<int> d(N);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < n; i++) \
;
using ll = long long;
int main() {
int N;
cin >> N;
int a = N / 2;
vector<int> d(N);
for (int i ... | [
"control_flow.loop.for.condition.change",
"call.remove",
"control_flow.branch.if.condition.change"
] | 796,723 | 796,724 | u983563612 | cpp |
p02989 | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using na... | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using na... | [
"expression.operation.binary.remove"
] | 796,739 | 796,740 | u081029414 | cpp |
p02989 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define INF 100100100
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i + 1];
sort(d.begin(), d.end());
int k = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define INF 100100100
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
sort(d.begin(), d.end());
int k = d[n ... | [
"expression.operation.binary.remove"
] | 796,741 | 796,742 | u637254885 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (auto &i : a)
cin >> i;
sort(a, a + n);
int m = (n / 2) - 1;
int ans = a[m + 1] - a[m] + 1;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (auto &i : a)
cin >> i;
sort(a, a + n);
int m = (n / 2) - 1;
int ans = a[m + 1] - a[m];
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 796,754 | 796,755 | u652712806 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
int K = 0;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
if (d[N / 2] < d[N / 2 + 1]) {
K = d[N / 2] - d[N / 2 - 1];
}
cout << K << ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
int K = 0;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
if (d[N / 2 - 1] < d[N / 2]) {
K = d[N / 2] - d[N / 2 - 1];
}
cout << K << ... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 796,772 | 796,773 | u652760628 | cpp |
p02989 | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
using pi = pair<lint, lint>;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (auto &i : v)
scanf("%d", &i);
sort(all(v));
printf("%d\n", v[n] - v[n - 1]);
}
| #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
using pi = pair<lint, lint>;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (auto &i : v)
scanf("%d", &i);
sort(all(v));
n /= 2;
printf("%d\n", v[n] - v[n -... | [
"assignment.add"
] | 796,774 | 796,775 | u329802369 | cpp |
p02989 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
sort(p.begin(), p.end());
int ans = 0;
ans = p[n / 2 - 1] - p[n / 2];
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
sort(p.begin(), p.end());
int ans = 0;
ans = p[n / 2] - p[n / 2 - 1];
cout << ans << endl;
}
| [
"assignment.change",
"expression.operation.binary.remove"
] | 796,780 | 796,781 | u147556624 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> D(N);
for (int i = 0; i < N; i++)
cin >> D.at(i);
sort(D.begin(), D.end());
int ans = D.at(N / 2) - D.at(N / 2 - 1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> D(N);
for (int i = 0; i < N; i++)
cin >> D.at(i);
sort(D.begin(), D.end());
int ans = D.at(N / 2) - D.at(N / 2 - 1);
cout << ans << endl;
} | [] | 796,782 | 796,783 | u615258936 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> d(N);
for (int i = 0; i < N; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
int ans = d.at(N / 2) - d.at(N / 2 - 1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
int ans = d.at(N / 2) - d.at(N / 2 - 1);
cout << ans << endl;
} | [] | 796,784 | 796,785 | u615258936 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
#define rep(j, n) for (int i = (int)(j); i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(0, N) cin >> A[i];
sort(A.begin(), A.end());
int ans = A[N / 2 + 1] - A[N / 2];
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(j, n) for (int i = (int)(j); i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(0, N) cin >> A[i];
sort(A.begin(), A.end());
int ans = A[N / 2] - A[N / 2 - 1];
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 796,786 | 796,787 | u347057617 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
cout << a[(N / 2)] << a[(N / 2) - 1] << e... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
cout << a[(N / 2)] - a[(N / 2) - 1] << en... | [
"io.output.change"
] | 796,802 | 796,803 | u833295869 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
cout << a[(N / 2) + 1] - a[N / 2] << endl... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
cout << a[(N / 2)] - a[(N / 2) - 1] << en... | [
"expression.operation.binary.remove"
] | 796,804 | 796,803 | u833295869 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <list>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef list<ll> listl;
typedef string str;
#define min(A, B) min(static_cast<ll>(A), static_cast<ll>(B))
#define max(A, B) max(static_cast... | #include <algorithm>
#include <iostream>
#include <list>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef list<ll> listl;
typedef string str;
#define min(A, B) min(static_cast<ll>(A), static_cast<ll>(B))
#define max(A, B) max(static_cast... | [
"expression.operation.binary.remove"
] | 796,805 | 796,806 | u288035794 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < 100; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
int d = v.size() / 2;
int k = v[d - 1] - v[d];
cout << k;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
int d = v.size() / 2;
int k = v[d] - v[d - 1];
cout << k;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 796,819 | 796,818 | u422389945 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
int main() {
int N;
cin >> N;
vector<int> d(N);
REP(i, N) cin >> d[i];
sort(d.begin(), d.end());
cout << d[N ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
int main() {
int N;
cin >> N;
vector<int> d(N);
REP(i, N) cin >> d[i];
sort(d.begin(), d.end());
cout << d[N ... | [
"expression.operation.binary.remove"
] | 796,826 | 796,827 | u725661271 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
int main() {
int N;
cin >> N;
vector<int> d(N);
REP(i, N) cin >> d[i];
sort(d.begin(), d.end());
cout << d[N ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
int main() {
int N;
cin >> N;
vector<int> d(N);
REP(i, N) cin >> d[i];
sort(d.begin(), d.end());
cout << d[N ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 796,828 | 796,827 | u725661271 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d.at(n / 2 + 1) - d.at(n / 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d.at(n / 2) - d.at(n / 2 - 1) << endl;
}
| [
"expression.operation.binary.remove"
] | 796,829 | 796,830 | u522993719 | cpp |
p02989 | #include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
if (d[n / 2] == d[(n / 2) - 1])
cout << 0;
else
cout << d[n /... | #include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
if (d[n / 2] == d[(n / 2) - 1])
cout << 0;
else
cout << d[n /... | [
"expression.operation.binary.remove"
] | 796,835 | 796,836 | u900688325 | cpp |
p02989 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int asc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int n, i = 0;
cin >> n;
int d[100050];
rep(i, n) cin >> d[i];
qsort(d, n, sizeof(int), asc);
cout << d[(n -... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int asc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int n, i = 0;
cin >> n;
int d[100050];
rep(i, n) cin >> d[i];
qsort(d, n, sizeof(int), asc);
cout << abs(d[... | [
"call.add",
"expression.operation.binary.remove",
"call.arguments.change"
] | 796,850 | 796,851 | u373164102 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
int main(void) {
int n;
cin >> n;
vector<int> d(n);
for (auto &i : d)
... | #include <bits/stdc++.h>
using namespace std;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
int main(void) {
int n;
cin >> n;
vector<int> d(n);
for (auto &i : d)
... | [
"expression.operation.binary.remove",
"call.arguments.add"
] | 796,854 | 796,855 | u720447689 | cpp |
p02989 | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int... | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int... | [
"expression.operation.binary.remove"
] | 796,857 | 796,858 | u395846213 | cpp |
p02989 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> d(n);
rep(i, n) { cin >> d[i]; }
sort(d.begin(), d.end());
long long ans = d[(n / 2) + 1] - d[n / 2];
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> d(n);
rep(i, n) { cin >> d[i]; }
sort(d.begin(), d.end());
long long ans = d[(n / 2)] - d[(n / 2) - 1];
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 796,861 | 796,862 | u631558039 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
if (d[n / 2] == d[n / 2 - 1]) {
cout << 0 << endl;
} else {
cout << d[n / 2] - d[n / 2 - 1] - 1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
if (d[n / 2] == d[n / 2 - 1]) {
cout << 0 << endl;
} else {
cout << d[n / 2] - d[n / 2 - 1] << endl;
}
}
| [
"expression.operation.binary.remove"
] | 796,863 | 796,864 | u103850114 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
if (d[n / 2] == d[n / 2 - 1]) {
cout << 0 << endl;
} else {
cout << d[n / 2 - 1] - d[n / 2] - 1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
if (d[n / 2] == d[n / 2 - 1]) {
cout << 0 << endl;
} else {
cout << d[n / 2] - d[n / 2 - 1] << endl;
}
}
| [
"expression.operation.binary.remove"
] | 796,865 | 796,864 | u103850114 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
cout << vec.at(N / 2 - 1) - vec.at(N / 2);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
cout << vec.at(N / 2) - vec.at(N / 2 - 1);
} | [
"expression.operation.binary.remove"
] | 796,866 | 796,867 | u363369454 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; ++i) {
cin >> d[i];
}
//ソートする
sort(d.begin(), d.end());
//存在しない場合
if ((d[n / 2] - d[n / 2 - 1]) <= 1)
ans = 0;
else {
ans = d[n / 2] - d[n / 2 - 1];
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; ++i) {
cin >> d[i];
}
//ソートする
sort(d.begin(), d.end());
//存在しない場合
if ((d[n / 2] - d[n / 2 - 1]) < 1)
ans = 0;
else {
ans = d[n / 2] - d[n / 2 - 1];
}
cout << a... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,870 | 796,871 | u812874294 | cpp |
p02989 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
int d[100001];
cin >> N;
for (int i = 0; i < N; i++)
cin >> d[i];
sort(d, d + N);
int m = d[N / 2 - 1], l = d[N / 2];
if (l >= m + 2) {
int i = m + 1;
while (i != l + 1) {
cnt++;
i++;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
int d[100001];
cin >> N;
for (int i = 0; i < N; i++)
cin >> d[i];
sort(d, d + N);
int m = d[N / 2 - 1], l = d[N / 2];
if (l > m) {
int i = m + 1;
while (i != l + 1) {
cnt++;
i++;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 796,889 | 796,890 | u661853315 | cpp |
p02989 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
int d[100000];
cin >> N;
for (int i = 0; i < N; i++)
cin >> d[i];
sort(d, d + N);
int m = d[N / 2 - 1], l = d[N / 2];
if (l >= m + 2) {
int i = m + 1;
while (i != l + 1) {
cnt++;
i++;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
int d[100001];
cin >> N;
for (int i = 0; i < N; i++)
cin >> d[i];
sort(d, d + N);
int m = d[N / 2 - 1], l = d[N / 2];
if (l > m) {
int i = m + 1;
while (i != l + 1) {
cnt++;
i++;
}
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 796,891 | 796,890 | u661853315 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | [
"expression.operation.binary.remove"
] | 796,910 | 796,911 | u172929647 | cpp |
p02989 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d[N];
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d, d + N);
if (d[N / 2 - 1] == d[N / 2]) {
cout << 0;
} else {
cout << d[N / 2 - 1] - d[N / 2];
}
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d[N];
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d, d + N);
if (d[N / 2 - 1] == d[N / 2]) {
cout << 0;
} else {
cout << -d[N / 2 - 1] + d[N / 2];
}
}
| [
"expression.operation.unary.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 796,912 | 796,913 | u447485613 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
for (int i = d[(N / 2) - 1]; i <= d[N / 2]; i++) {
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
for (int i = d[(N / 2) - 1] + 1; i <= d[N / 2]; i++) {
ans++;
}
cout << ans << endl;
}
| [
"control_flow.loop.for.initializer.change"
] | 796,924 | 796,925 | u323327162 | cpp |
p02989 | #include <bits/stdc++.h>
#define pb push_back
#define li long long int
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (n % 2 != 0)
cout << 0 << endl;
else
cout << a[n / 2] - a[n / 2 - 1] << en... | #include <bits/stdc++.h>
#define pb push_back
#define li long long int
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (n % 2 != 0)
cout << 0 << endl;
else
cout << a[n / 2] - a[n / 2 - 1] << endl;
... | [
"expression.operation.binary.remove"
] | 796,946 | 796,947 | u968280449 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int d[n];
for (i = 0; i < n; i++) {
cin >> d[i];
}
sort(d, d + n);
cout << d[n / 2 + 1] - d[n / 2];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int d[n];
for (i = 0; i < n; i++) {
cin >> d[i];
}
sort(d, d + n);
cout << d[n / 2] - d[n / 2 - 1];
return 0;
} | [
"expression.operation.binary.remove"
] | 796,950 | 796,951 | u058348416 | cpp |
p02989 | #include <algorithm>
#include <iostream>
int main() {
int n;
std::cin >> n;
int d[n];
for (int i = 0; i < n; i++)
std::cin >> d[i];
std::sort(d, d + n - 1);
int lower, upper;
lower = d[n / 2 - 1];
upper = d[n / 2];
if (lower == upper)
std::cout << 0 << std::endl;
else
std::cout << uppe... | #include <algorithm>
#include <iostream>
int main() {
int n;
std::cin >> n;
int d[n];
for (int i = 0; i < n; i++)
std::cin >> d[i];
std::sort(d, d + n);
int lower, upper;
lower = d[n / 2 - 1];
upper = d[n / 2];
if (lower == upper)
std::cout << 0 << std::endl;
else
std::cout << upper - ... | [
"expression.operation.binary.remove"
] | 796,953 | 796,954 | u408372746 | cpp |
p02989 | #include "bits/stdc++.h"
using namespace std;
int main() {
//ひとまず入力を受け取る
int N;
cin >> N;
int d[100000];
int i = 0;
while (i < N) {
cin >> d[i];
i++;
}
//答えを求める
sort(d, d + N);
cout << d[N / 2] - d[N / 2 - 1] + 1 << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
//ひとまず入力を受け取る
int N;
cin >> N;
int d[100000];
int i = 0;
while (i < N) {
cin >> d[i];
i++;
}
//答えを求める
sort(d, d + N);
cout << d[N / 2] - d[N / 2 - 1] << endl;
} | [
"expression.operation.binary.remove"
] | 796,959 | 796,960 | u422592877 | cpp |
p02989 | #include <bits/stdc++.h>
// Remove below header file if c++ version greater than 14
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long long int
#define pb push_back
#define fastIO ... | #include <bits/stdc++.h>
// Remove below header file if c++ version greater than 14
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long long int
#define pb push_back
#define fastIO ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 796,963 | 796,964 | u059680467 | cpp |
p02989 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
sort(d.begin(), d.end());
int ans;
if (d[n / 2] == d[n / 2 - 1]) {
ans = 0;
} else {
ans = d[n / 2] - d[n / 2 - 1] + 1;
}
cou... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
sort(d.begin(), d.end());
int ans;
if (d[n / 2] == d[n / 2 - 1]) {
ans = 0;
} else {
ans = d[n / 2] - d[n / 2 - 1];
}
cout <<... | [
"expression.operation.binary.remove"
] | 796,965 | 796,966 | u653482689 | cpp |
p02989 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [] | 796,973 | 796,974 | u403813525 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, k;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
if (vec.at(N / 2 - 1) != vec.at(N / 2) &&
vec.at(N / 2 - 1) - vec.at(N / 2) != 1) {... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, k;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
if (vec.at(N / 2 - 1) != vec.at(N / 2) &&
vec.at(N / 2 - 1) - vec.at(N / 2) != 1) {... | [
"expression.operation.binary.remove"
] | 796,979 | 796,980 | u927933718 | cpp |
p02989 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define repd(i, a, b) \
; \
for (int i = (a); i < (... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define repd(i, a, b) \
; \
for (int i = (a); i < (... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 797,004 | 797,005 | u478997153 | cpp |
p02989 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 797,023 | 797,024 | u655810450 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll maxn = 1000 * 1001;
const ll INF = 1e18;
ll x[maxn];
bool mark[maxn];
vector<ll> v[maxn];
ll n, k;
int main() {
cin >> n;
ll a[n];
for (ll i = 1; i < n; i++)
cin >> a[i];
sort(a, a + n);
cout << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll maxn = 1000 * 1001;
const ll INF = 1e18;
ll x[maxn];
bool mark[maxn];
vector<ll> v[maxn];
ll n, k;
int main() {
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
cout << ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 797,035 | 797,036 | u923104962 | cpp |
p02989 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *d = new int[n];
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d, d + n);
int x = d[n / 2], y = d[n / 2 - 1];
cout << y - x << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *d = new int[n];
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d, d + n);
int x = d[n / 2], y = d[n / 2 - 1];
cout << x - y << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 797,042 | 797,043 | u819611746 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
cout << a.at(n / 2 + 1) - a.at(n / 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
cout << a.at(n / 2) - a.at(n / 2 - 1) << endl;
} | [
"expression.operation.binary.remove"
] | 797,049 | 797,050 | u424602097 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int D[N];
for (int i = 0; i < N; i++) {
cin >> D[i];
}
sort(D, D + N);
cout << D[N / 2 - 1] - D[N / 2] << "\n";
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int D[N];
for (int i = 0; i < N; i++) {
cin >> D[i];
}
sort(D, D + N);
cout << D[N / 2] - D[N / 2 - 1] << "\n";
}
| [
"expression.operation.binary.remove"
] | 797,062 | 797,063 | u817845505 | cpp |
p02989 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
ll mod = 1e9 + 7;
ll mod2 = 998244353;
const int INF = 1e9;
... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
ll mod = 1e9 + 7;
ll mod2 = 998244353;
const int INF = 1e9;
... | [
"expression.operation.binary.remove"
] | 797,072 | 797,073 | u890465662 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.