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 |
|---|---|---|---|---|---|---|---|
p03207 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int M = 0, S = 0;
for (int i = 0; i < N; i++) {
int P;
cin >> P;
M += P;
S = max(P, M);
}
int ans = M - (S / 2);
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int M = 0, S = 0;
for (int i = 0; i < N; i++) {
int P;
cin >> P;
M += P;
S = max(P, S);
}
int ans = M - (S / 2);
cout << ans << endl;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 999,125 | 999,126 | u034810328 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0, m = 0, p;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
sum += p;
if (m <= p)
m = p;
}
cout << sum - p / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0, m = 0, p;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
sum += p;
if (m <= p)
m = p;
}
cout << sum - m / 2;
}
| [
"identifier.change",
"io.output.change"
] | 999,140 | 999,141 | u823444917 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s = 0, max = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
s += t;
if (max > t) {
max = t;
}
}
cout << s - max / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, max = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
ans += t;
if (max < t) {
max = t;
}
}
cout << ans - max / 2 << endl;
} | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 999,142 | 999,143 | u647474992 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int maxof(int *p, int N) {
int r = -1000000000;
for (int i = 0; i < N; i++) {
if (r < p[i])
r = p[i];
}
return r;
}
int main() {
int N;
cin >> N;
int p[N];
int i, r = 0;
for (i = 0; i < N; i++)
cin >> p[i];
bool f = true;
for (i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int maxof(int *p, int N) {
int r = -1000000000;
for (int i = 0; i < N; i++) {
if (r < p[i])
r = p[i];
}
return r;
}
int main() {
int N;
cin >> N;
int p[N];
int i, r = 0;
for (i = 0; i < N; i++)
cin >> p[i];
bool f = true;
for (i = 0; i <... | [
"assignment.add"
] | 999,146 | 999,147 | u222965004 | cpp |
p03207 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int n, p[10005];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
sort(p, p + n);
int ans = 0;
for (int i = 0; i <... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int n, p[10005];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
sort(p, p + n);
int ans = 0;
for (int i = 0; i <... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 999,150 | 999,151 | u604928622 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int num;
cin >> num;
int test[num];
for (int i = 0; i < num; i++) {
cin >> test[i];
}
for (int s = 0; s < num - 1; s++) {
for (int t = 1; t < s + 1; t++) {
if (test[t] > test[s]) {
int tmp = test[s];
test[s] = test[t];
... | #include <iostream>
using namespace std;
int main() {
int num;
cin >> num;
int test[num];
for (int i = 0; i < num; i++) {
cin >> test[i];
}
for (int s = 0; s < num - 1; s++) {
for (int t = s + 1; t < num; t++) {
if (test[t] > test[s]) {
int tmp = test[s];
test[s] = test[t];
... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 999,154 | 999,155 | u346887161 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int MAX = 0;
int SUM = 0;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p >= MAX)
MAX == p;
SUM += p;
}
int a = SUM - (MAX / 2);
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int MAX = 0;
int SUM = 0;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p >= MAX)
MAX = p;
SUM += p;
}
int a = SUM - (MAX / 2);
cout << a << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 999,164 | 999,165 | u916256067 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int max_price = 0;
int sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int p;
scanf("%d", &p);
sum += p;
max_price = max(max_price, p);
}
printf("%d", sum - max_price * 0.5);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int max_price = 0;
int sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int p;
scanf("%d", &p);
sum += p;
max_price = max(max_price, p);
}
printf("%d", sum - max_price / 2);
} | [] | 999,172 | 999,173 | u594772990 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int max = 0;
cin >> N;
int tmp;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (max < tmp)
max = tmp;
sum += tmp;
}
cout << sum - (int)(tmp / 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int max = 0;
cin >> N;
int tmp;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (max < tmp)
max = tmp;
sum += tmp;
}
cout << sum - (int)(max / 2) << endl;
}
| [
"identifier.change",
"io.output.change"
] | 999,176 | 999,177 | u651032293 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int max = 0;
cin >> N;
int tmp;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (max < tmp)
max = tmp;
sum += tmp;
}
cout << sum - (tmp / 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int max = 0;
cin >> N;
int tmp;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (max < tmp)
max = tmp;
sum += tmp;
}
cout << sum - (int)(max / 2) << endl;
}
| [
"io.output.change"
] | 999,178 | 999,177 | u651032293 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int max = 0;
cin >> N;
int tmp;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (max < tmp)
max = tmp;
sum += tmp;
}
cout << sum - tmp / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int max = 0;
cin >> N;
int tmp;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (max < tmp)
max = tmp;
sum += tmp;
}
cout << sum - (int)(max / 2) << endl;
}
| [
"io.output.change"
] | 999,179 | 999,177 | u651032293 | cpp |
p03207 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, tmp;
int max_v = 0;
int ans;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (max_v < tmp) {
max_v = tmp;
}
ans += tmp;
}
ans -= max_v / 2;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, tmp;
int max_v = 0;
int ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (max_v < tmp) {
max_v = tmp;
}
ans += tmp;
}
ans -= max_v / 2;
cout << ans << endl;
} | [
"variable_declaration.value.change"
] | 999,182 | 999,183 | u503052349 | cpp |
p03207 | #include <cstdio>
int main() {
int n, i, a, maxn = 0, ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
ans += a;
if (a > maxn)
maxn = a;
}
printf("%d\n", a - maxn / 2);
return 0;
} | #include <cstdio>
int main() {
int n, i, a, maxn = 0, ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
ans += a;
if (a > maxn)
maxn = a;
}
printf("%d\n", ans - maxn / 2);
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 999,196 | 999,197 | u070422134 | cpp |
p03207 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#defin... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#defin... | [
"call.add",
"assignment.change"
] | 999,198 | 999,199 | u549743442 | cpp |
p03207 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, n, m) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define VEC2(x, a,... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, n, m) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define VEC2(x, a,... | [
"expression.operation.binary.remove"
] | 999,206 | 999,207 | u347746039 | cpp |
p03207 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const array<pair<int, int>, 4> fd{make_pair(1, 0), make_pair(-1, 0),
... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const array<pair<int, int>, 4> fd{make_pair(1, 0), make_pair(-1, 0),
... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 999,213 | 999,214 | u317754719 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p_int;
typedef pair<ll, ll> p_ll;
typedef tuple<ll, ll, ll> t3_ll;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p_int;
typedef pair<ll, ll> p_ll;
typedef tuple<ll, ll, ll> t3_ll;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73,... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 999,215 | 999,216 | u764234894 | cpp |
p03207 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int p;
int mx = -1;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
mx = max(mx, p);
sum += p;
}
sum -= (p / 2);
cout << sum << endl;
re... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int p;
int mx = -1;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
mx = max(mx, p);
sum += p;
}
sum -= (mx / 2);
cout << sum << endl;
r... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 999,219 | 999,220 | u326099815 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, n, maxn = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int k;
sum += k;
maxn = max(k, maxn);
}
cout << sum - maxn / 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, n, maxn = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
sum += k;
maxn = max(k, maxn);
}
cout << sum - maxn / 2;
return 0;
}
| [] | 999,230 | 999,231 | u533620702 | cpp |
p03207 | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[15];
int min = 10005, sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] < min)
min = p[i];
sum += p[i];
}
cout << sum - min / 2;
return 0;
} | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[15];
int min = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] > min)
min = p[i];
sum += p[i];
}
cout << sum - min / 2;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 999,235 | 999,236 | u808738521 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); ++(i))
#define repr(i, n) for ((i) = (n); (i) > 0; == (i))
#define FOR(i, j, n) for ((i) = (j); (i) < (n); ++(i))
#define forr(i, j, n) for ((i) = (j); (i) > (n); --(i))
#define debg(a) cout << (a) << endl;
#define INF 9999999
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); ++(i))
#define repr(i, n) for ((i) = (n); (i) > 0; == (i))
#define FOR(i, j, n) for ((i) = (j); (i) < (n); ++(i))
#define forr(i, j, n) for ((i) = (j); (i) > (n); --(i))
#define debg(a) cout << (a) << endl;
#define INF 9999999
#de... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 999,244 | 999,245 | u423624748 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); ++(i))
#define repr(i, n) for ((i) = (n); (i) > 0; == (i))
#define FOR(i, j, n) for ((i) = (j); (i) < (n); ++(i))
#define forr(i, j, n) for ((i) = (j); (i) > (n); --(i))
#define debg(a) cout << (a) << endl;
#define INF 9999999
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); ++(i))
#define repr(i, n) for ((i) = (n); (i) > 0; == (i))
#define FOR(i, j, n) for ((i) = (j); (i) < (n); ++(i))
#define forr(i, j, n) for ((i) = (j); (i) > (n); --(i))
#define debg(a) cout << (a) << endl;
#define INF 9999999
#de... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"literal.number.change",
"variable_declaration.value.change"
] | 999,246 | 999,245 | u423624748 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int n;
double ans = 0;
double max = 0;
double x;
cin >> n;
while (n--) {
cin >> x;
if (x > max)
max = x;
ans += x;
}
ans -= max / 2;
} | #include <iostream>
using namespace std;
int main() {
int n;
double ans = 0;
double max = 0;
double x;
cin >> n;
while (n--) {
cin >> x;
if (x > max)
max = x;
ans += x;
}
ans -= max / 2;
cout << ans;
} | [] | 999,247 | 999,248 | u495514186 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, i;
cin >> n;
long long a[n];
for (i = 0; i < n; ++i)
cin >> a[i];
long long maxm = *max_element(a, a + n);
bool flag = false;
long long tot;
for (i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, i;
cin >> n;
long long a[n];
for (i = 0; i < n; ++i)
cin >> a[i];
long long maxm = *max_element(a, a + n);
bool flag = false;
long long tot = 0;
for (i = 0; i ... | [
"variable_declaration.value.change"
] | 999,253 | 999,254 | u258676780 | cpp |
p03207 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long Int;
int main() {
priority_queue<int> pque;
int n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
pque.push(a);
}
int ans = pque.top();
pque.pop();
ans /= 2;
w... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long Int;
int main() {
priority_queue<int> pque;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
pque.push(a);
}
int ans = pque.top();
pque.pop();
a... | [] | 999,255 | 999,256 | u440213743 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define MOD (int)1e9 + (int)... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define MOD (int)1e9 + (int)... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"assignment.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 999,257 | 999,258 | u310101703 | cpp |
p03207 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utili... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utili... | [
"literal.number.change",
"variable_declaration.value.change"
] | 999,259 | 999,260 | u657901243 | cpp |
p03207 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pl4 = pair<ll, ll>;
using str = string;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define llin(x) ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pl4 = pair<ll, ll>;
using str = string;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define llin(x) ... | [
"identifier.change",
"call.function.change"
] | 999,263 | 999,264 | u614421689 | cpp |
p03207 | #include <algorithm>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (o... | #include <algorithm>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (o... | [] | 999,272 | 999,273 | u789417951 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int n, p[10];
cin >> n;
int max = 100;
int sum;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] > max) {
max = p[i];
}
sum += p[i];
}
cout << sum - max / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, p[10];
cin >> n;
int max = 100;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] > max) {
max = p[i];
}
sum += p[i];
}
cout << sum - max / 2 << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 999,278 | 999,279 | u539485388 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
const int maxn = -0x7f7f7f7f;
int main() {
int n, i, m, sum, a;
scanf("%d", &n);
sum = 0;
m = -maxn;
for (i = 1; i <= n; i++) {
scanf("%d", &a);
if (a > m)
m = a;
sum += a;
}
printf("%d\n", sum - m / 2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 0x7f7f7f7f;
int main() {
int n, i, m, sum, a;
scanf("%d", &n);
sum = 0;
m = -maxn;
for (i = 1; i <= n; i++) {
scanf("%d", &a);
if (a > m)
m = a;
sum += a;
}
printf("%d\n", sum - m / 2);
return 0;
} | [
"expression.operation.unary.arithmetic.remove"
] | 999,304 | 999,305 | u402443922 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, maxn, s;
cin >> n;
int a[n + 5];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > maxn) {
maxn = a[i];
s = i;
}
}
double sum;
for (int i = 0; i < n; i++)
sum += a[i];
sum -= a[s] * 1.0 / 2;
if (a[s] % 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, maxn = 0, s;
cin >> n;
int a[n + 5];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > maxn) {
maxn = a[i];
s = i;
}
}
double sum;
for (int i = 0; i < n; i++)
sum += a[i];
sum -= a[s] * 1.0 / 2;
if (a[s]... | [
"variable_declaration.value.change"
] | 999,309 | 999,310 | u991103125 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, maxn, s;
cin >> n;
int a[n + 5];
for (int i = 1; i < n; i++) {
cin >> a[i];
if (a[i] > maxn) {
maxn = a[i];
s = i;
}
}
double sum;
for (int i = 0; i < n; i++)
sum += a[i];
sum -= a[s] * 1.0 / 2;
if (a[s] % 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, maxn = 0, s;
cin >> n;
int a[n + 5];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > maxn) {
maxn = a[i];
s = i;
}
}
double sum;
for (int i = 0; i < n; i++)
sum += a[i];
sum -= a[s] * 1.0 / 2;
if (a[s]... | [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 999,311 | 999,310 | u991103125 | cpp |
p03207 | #include <algorithm>
#include <iostream>
using namespace std;
signed main() {
int n;
cin >> n;
int p = 0, cnt;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
p = max(p, a);
cnt += a;
}
cout << cnt - p / 2 << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
signed main() {
int n;
cin >> n;
int p = 0, cnt = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
p = max(p, a);
cnt += a;
}
cout << cnt - p / 2 << endl;
} | [
"variable_declaration.value.change"
] | 999,317 | 999,318 | u141968173 | cpp |
p03207 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, cost, sum, max = 0;
vector<int> cost_;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> cost;
if (max < cost)
max = cost;
cost_.push_back(c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, cost, sum, max = 0;
vector<int> cost_;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> cost;
if (max < cost)
max = cost;
cost_.push_back(c... | [
"assignment.change"
] | 999,321 | 999,322 | u643698380 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int date[13] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
// freopen("010.in","w",stdout);
// freopen("008.out","w",stdout);
int n, sum = 0, ans = 0;
cin >> n;
// a=3,b=5;
// cout<<a<<" " <<b;
int a[n + 10];
for (int i = 1; i <= n; i+... | #include <bits/stdc++.h>
using namespace std;
int date[13] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
// freopen("010.in","w",stdout);
// freopen("008.out","w",stdout);
int n, sum = 0, ans = 0;
cin >> n;
// a=3,b=5;
// cout<<a<<" " <<b;
int a[n + 10];
for (int i = 1; i <= n; i+... | [
"expression.operation.binary.add"
] | 999,327 | 999,328 | u207528513 | cpp |
p03207 | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
string replace_with_str(string str, string str_... | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
string replace_with_str(string str, string str_... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.add",
"call.arguments.change"
] | 999,335 | 999,336 | u687044304 | cpp |
p03207 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#includ... | [] | 999,341 | 999,342 | u208430248 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int p[111];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", p + i);
}
sort(p, p + n);
int ans = p[n - 1] / 2;
for (int i = p[n - 2]; i >= 0; i--) {
ans += p[i];
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int p[111];
int main() {
// freopen("input.txt", "r", stdin);
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", p + i);
}
sort(p, p + n);
int ans = p[n - 1] / 2;
for (int i = n - 2; i >= 0; i--) {
ans += p[i];
}
printf("%d\n",... | [
"control_flow.loop.for.initializer.change"
] | 999,363 | 999,364 | u142832918 | cpp |
p03207 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, sum, max;
vector<int> prices;
cin >> N;
max = 0;
for (int i = 0; i < N; i++) {
int price;
cin >> price;
sum = sum + max;
if (max < price) {
max = price;
}
}
sum = sum - max / 2;
cout << sum;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, sum, max;
vector<int> prices;
cin >> N;
sum = 0;
max = 0;
for (int i = 0; i < N; i++) {
int price;
cin >> price;
sum = sum + price;
if (max < price) {
max = price;
}
}
sum = sum - max / 2;
cout <... | [
"assignment.add",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 999,365 | 999,366 | u842388336 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n + 1);
sum -= a[n] / 2;
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a + 1, a + n + 1);
sum -= a[n] / 2;
cout << sum << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 999,376 | 999,377 | u504403442 | cpp |
p03207 | ///*
#include <iostream>
using namespace std;
int main() {
int n, *p;
int i, j;
int money = 0;
cin >> n;
p = new int[n];
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < n - 1; j++) {
if (p[i] > p[i + 1]) {
int tmp = p[j];
p[j] = p[j +... | ///*
#include <iostream>
using namespace std;
int main() {
int n, *p;
int i, j;
int money = 0;
cin >> n;
p = new int[n];
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < n - 1; j++) {
if (p[j] > p[j + 1]) {
int tmp = p[j];
p[j] = p[j +... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 999,402 | 999,403 | u589734885 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a, i) memset(a, i, size... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a, i) memset(a, i, size... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 999,412 | 999,413 | u394634573 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
a = b = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int c;
cin >> c;
a += c;
b = max(b, a);
}
cout << a - b / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
a = b = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int c;
cin >> c;
a += c;
b = max(b, c);
}
cout << a - b / 2 << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 999,418 | 999,419 | u183530284 | cpp |
p03207 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const i... | [] | 999,434 | 999,435 | u192084800 | cpp |
p03207 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, sum;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p.at(i);
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
p.at(0) /= 2;
for (int i = 0; i < N; i++)
sum += p.at(i);
co... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, sum;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p.at(i);
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
sum = 0;
p.at(0) /= 2;
for (int i = 0; i < N; i++)
sum += p.a... | [
"assignment.add"
] | 999,438 | 999,439 | u353464699 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int i;
int n, p, ans = 0, max = 0;
cin >> n;
for (i = 0; i < p; i++) {
cin >> p;
ans += p;
if (p > max)
max = p;
}
ans -= max / 2;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int i;
int n, p, ans = 0, max = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> p;
ans += p;
if (p > max)
max = p;
}
ans -= max / 2;
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 999,440 | 999,441 | u890922829 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int i;
int n, p, ans = 0, max = 0;
cin >> n;
for (i = 0; i < p; i++) {
cin >> p;
ans += p;
if (p > max)
max = p;
}
ans -= p / 2;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int i;
int n, p, ans = 0, max = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> p;
ans += p;
if (p > max)
max = p;
}
ans -= max / 2;
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 999,442 | 999,441 | u890922829 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, max_value = 0, sum = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
max_value = max(p, max_value);
sum += p;
}
cout << sum - max_value / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, max_value = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
max_value = max(p, max_value);
sum += p;
}
cout << sum - max_value / 2 << endl;
}
| [] | 999,443 | 999,444 | u378419207 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, price, max = 0, ans;
cin >> N;
// vector<int> price(N);
for (int i = 0; i < N; ++i) {
// cin >> price.at(i);
cin >> price;
ans += price;
if (max < price)
max = price;
}
ans -= max;
ans += (max / 2);
cout << ans << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, price, max = 0, ans = 0;
cin >> N;
// vector<int> price(N);
for (int i = 0; i < N; ++i) {
// cin >> price.at(i);
cin >> price;
ans += price;
if (max < price)
max = price;
}
ans -= max;
ans += (max / 2);
cout << ans ... | [
"variable_declaration.value.change"
] | 999,445 | 999,446 | u014655172 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end());
int ans = 1000000000;
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, h[i + 2] - h[i]);
}
cout << ans << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end());
int ans = 1000000000;
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, h[i + k - 1] - h[i]);
}
cout << ans << endl;
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 999,454 | 999,455 | u199441105 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 999,460 | 999,461 | u005006157 | cpp |
p03208 | #include <bits/stdc++.h>
#include <regex>
using namespace std;
// type
typedef long long int ll;
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
const ll inf = 1000000001;
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
#define PI 3.14159265358979323846264338327950... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
// type
typedef long long int ll;
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
const ll inf = 1000000001;
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
#define PI 3.14159265358979323846264338327950... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 999,487 | 999,488 | u506464494 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 999,489 | 999,490 | u043125923 | cpp |
p03208 | #include <bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod = 1000000007;
const ll inf = LONG_LONG_MAX;
ll dx4[4] = {1, 0, -1, 0};
ll dy4[4] = {0, -1, 0, 1};
ll dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
ll dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
int ma... | #include <bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod = 1000000007;
const ll inf = LONG_LONG_MAX;
ll dx4[4] = {1, 0, -1, 0};
ll dy4[4] = {0, -1, 0, 1};
ll dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
ll dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
int ma... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 999,506 | 999,507 | u016987091 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#define ll long long
using namespace std;
ll k[100004];
// ll j[100004];
int main() {
ll n;
ll m;
ll y = 0;
ll ans = 1e9;
scanf("%lld%lld", &n, &m);
ll p = m;
for (ll i = 1; i <= n; i++) {
scanf("%lld",... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#define ll long long
using namespace std;
ll k[100004];
int main() {
ll n;
ll m;
ll y = 0;
ll ans = 1e9;
scanf("%lld%lld", &n, &m);
ll p = m;
for (ll i = 1; i <= n; i++) {
scanf("%lld", &k[i]);
}
sort... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 999,512 | 999,513 | u018679195 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int minn = a[n - 1] - a[0];
for (int i = 0; i <= n - k; i++) {
int f = i, b = n - k + i;
minn = min(minn, a[b] - a[f]);
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int minn = a[n - 1] - a[0];
for (int i = 0; i <= n - k; i++) {
int f = i, b = k + i - 1;
minn = min(minn, a[b] - a[f]);
}
cout <... | [
"expression.operation.binary.remove"
] | 999,514 | 999,515 | u018679195 | cpp |
p03208 | #include <bits/stdc++.h>
#define Keep_calmYou_are_still_learning \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); // freopen("out.txt","w",stdout);
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
... | #include <bits/stdc++.h>
#define Keep_calmYou_are_still_learning \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); // freopen("out.txt","w",stdout);
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 999,516 | 999,517 | u353919145 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | [
"expression.operation.binary.add"
] | 999,526 | 999,527 | u946082956 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
int ans = 1e9;
rep(i, n - k) ans = min(ans, h[i + k] - h[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
int ans = 1e9;
rep(i, n - k + 1) ans = min(ans, h[i + k - ... | [
"assignment.change"
] | 999,532 | 999,533 | u422506696 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 100... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 100... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 999,539 | 999,540 | u164181205 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> T(N);
for (int X = 0; X < N; X++) {
cin >> T[X];
}
long long U = 1000000000;
sort(T.begin(), T.end());
for (int X = 0; X < N - K; X++) {
if (T[X + K - 1] - T[X] < U) {
U = T[X + K - 1] - T... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> T(N);
for (int X = 0; X < N; X++) {
cin >> T[X];
}
long long U = 1000000000;
sort(T.begin(), T.end());
for (int X = 0; X <= N - K; X++) {
if (T[X + K - 1] - T[X] < U) {
U = T[X + K - 1] - ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 999,547 | 999,548 | u740002394 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
long long H = 1000000001;
cin >> N >> K;
vector<long long> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
}
sort(vec.begin(), vec.end());
for (int X = 0; X < N; X++) {
if (vec.at(K + X - 1) - vec.at(X) < H) {
H ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
long long H = 1000000001;
cin >> N >> K;
vector<long long> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
}
sort(vec.begin(), vec.end());
for (int X = 0; K + X - 1 < N; X++) {
if (vec.at(K + X - 1) - vec.at(X) < H) {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 999,549 | 999,550 | u740002394 | cpp |
p03208 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"expression.operation.binary.add"
] | 999,557 | 999,558 | u151236434 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | [
"expression.operation.binary.add"
] | 999,575 | 999,576 | u876953939 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | [
"expression.operation.binary.remove"
] | 999,577 | 999,576 | u876953939 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
for (int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
for (int... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change"
] | 999,581 | 999,582 | u998732100 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define fast_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\... | #include <bits/stdc++.h>
using namespace std;
#define fast_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 999,583 | 999,584 | u476305001 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define fast_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\... | #include <bits/stdc++.h>
using namespace std;
#define fast_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 999,585 | 999,584 | u476305001 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end(), greater<int>());
int result = 2147483647;
for (int i = 0; i < (N - K); i++) {
int tmp = h.at(i) - h.at(i + K - 1);
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end(), greater<int>());
int result = 2147483647;
for (int i = 0; i < (N - K + 1); i++) {
int tmp = h.at(i) - h.at(i + K - 1);
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 999,586 | 999,587 | u584185861 | cpp |
p03208 | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end()... | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end()... | [
"control_flow.loop.for.condition.change"
] | 999,588 | 999,589 | u534661831 | cpp |
p03208 | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end()... | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end()... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 999,590 | 999,589 | u534661831 | cpp |
p03208 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
t... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
t... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 999,591 | 999,592 | u622045059 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
ll h[100010];
ll min = 1000000000;
rep(i, n) cin >> h[i];
sort(h, h + n, greater<int>());
// rep(i,n)cout<<h[i]<<endl;
rep(i, n - k + 2) {
ll... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
ll h[100010];
ll min = 2000000000;
rep(i, n) cin >> h[i];
sort(h, h + n, greater<int>());
// rep(i,n)cout<<h[i]<<endl;
rep(i, n - k + 1) {
ll... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 999,612 | 999,613 | u566317458 | cpp |
p03208 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 999,622 | 999,623 | u789199225 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long k;
cin >> k;
vector<long long> arr;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
arr.push_back(a);
}
sort(arr.begin(), arr.end());
long long ans = INT_MAX;
for (long long i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long k;
cin >> k;
vector<long long> arr;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
arr.push_back(a);
}
sort(arr.begin(), arr.end());
long long ans = INT_MAX;
for (long long i = 0; i <... | [
"assignment.change"
] | 999,628 | 999,629 | u616038992 | cpp |
p03208 | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define ll long long
using namespace std;
using P = pair<int, int>;
int main() {
int N, K, h;
cin >> N >> K;
int ans = 1e9;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define ll long long
using namespace std;
using P = pair<int, int>;
int main() {
int N, K, h;
cin >> N >> K;
int ans = 1e9;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"assignment.value.change",
"call.arguments.change",
"assignment.change"
] | 999,641 | 999,642 | u390997234 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#defi... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#defi... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 999,643 | 999,644 | u330518333 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO \
ios_base::... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO \
ios_base::... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.change"
] | 999,660 | 999,661 | u305141544 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
int sa = h.at(k - 1) - h.at(0);
// cout<<h.at(k-1)<<" "<<h.at(0)<<endl;
for (int i = 1; i < n - k; i++) {
// cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
int sa = h.at(k - 1) - h.at(0);
// cout<<h.at(k-1)<<" "<<h.at(0)<<endl;
for (int i = 1; i <= n - k; i++) {
// cout <<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 999,663 | 999,664 | u451171595 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | [
"assignment.change"
] | 999,667 | 999,668 | u900485130 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, k, i, j, l, min1 = 1e16;
cin >> n >> k;
int a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
int dp[n + 1];
dp[0] = 0;
for (i = 1; i <= n; i++)
dp[i] = dp[i - 1] + a[i];
for (i = ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, k, i, j, l, min1 = 1e16;
cin >> n >> k;
int a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
int dp[n + 1];
dp[0] = 0;
for (i = 1; i <= n; i++)
dp[i] = dp[i - 1] + a[i];
for (i = ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"assignment.change"
] | 999,669 | 999,670 | u055115268 | cpp |
p03208 | // This is a very good reframing
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end());
int mini = 1000000000;
for (int i = 0; i + k < n; i++) {
mini = min(mini, h[i + k] - h[i]);
... | // This is a very good reframing
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end());
int mini = 1000000000;
for (int i = 0; i + k - 1 < n; i++) {
mini = min(mini, h[i + k - 1] - ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 999,675 | 999,676 | u004676431 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
vector<int64_t> h(n);
int64_t i;
for (i = 0; i < n; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
int64_t mini = 100000000000;
for (i = 0; i < n - k; i++) {
int64_t a = h.at(i + k) - h.at(i);
mini ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
vector<int64_t> h(n);
int64_t i;
for (i = 0; i < n; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
int64_t mini = 100000000000;
for (i = 0; i < n - k + 1; i++) {
int64_t a = h.at(i + k - 1) - h.at(i);
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 999,704 | 999,705 | u130651752 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
vector<int64_t> h(n);
int64_t i;
for (i = 0; i < n; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
int64_t mini = 100000000000;
for (i = 0; i < n - 2; i++) {
int64_t a = h.at(i + 2) - h.at(i);
mini ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
vector<int64_t> h(n);
int64_t i;
for (i = 0; i < n; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
int64_t mini = 100000000000;
for (i = 0; i < n - k + 1; i++) {
int64_t a = h.at(i + k - 1) - h.at(i);
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one",
"call.arguments.change"
] | 999,706 | 999,705 | u130651752 | cpp |
p03208 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define PI 3.14159265359
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define _GLIBCXX_DEBAC
#include <functional... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define PI 3.14159265359
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define _GLIBCXX_DEBAC
#include <functional... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 999,719 | 999,720 | u545938555 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) \
([&](decltype((x)) container)... | #include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) \
([&](decltype((x)) container)... | [
"expression.operation.binary.add"
] | 999,747 | 999,748 | u802071009 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) \
([&](decltype((x)) container)... | #include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) \
([&](decltype((x)) container)... | [
"expression.operation.binary.add"
] | 999,749 | 999,748 | u802071009 | cpp |
p03208 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
vector<int> d(N);
d[0] = 0;
for (int i = 1; i < N - 1; i++) {
d[i] = d[i - 1... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
vector<int> d(N);
d[0] = 0;
for (int i = 1; i < N; i++) {
d[i] = d[i - 1] + ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 999,750 | 999,751 | u303163217 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int min = 10000000;
sort(h.begin(), h.end());
for (int i = 0; i < n - k - 1; i++) {
int num = h[i + k - 1] - h[i];
if (num < min)
min = num;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
long long min = 1000000000;
sort(h.begin(), h.end());
for (int i = 0; i < n - k + 1; i++) {
int num = h[i + k - 1] - h[i];
if (num < min)
min = n... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 999,754 | 999,753 | u297195722 | cpp |
p03208 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template ... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template ... | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 999,759 | 999,760 | u273928723 | cpp |
p03208 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vecll vector<long long>
#define vecs vector<string>
#define vec2ll vector<vector<long long>>
#define vecbool vector<bool>
#define vecpairll vector<pair<long long, long long>>
#define forll(s, a, b) for (long long s = a; s... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vecll vector<long long>
#define vecs vector<string>
#define vec2ll vector<vector<long long>>
#define vecbool vector<bool>
#define vecpairll vector<pair<long long, long long>>
#define forll(s, a, b) for (long long s = a; s... | [
"expression.operation.binary.add"
] | 999,761 | 999,762 | u586121204 | cpp |
p03208 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vecll vector<long long>
#define vecs vector<string>
#define vec2ll vector<vector<long long>>
#define vecbool vector<bool>
#define vecpairll vector<pair<long long, long long>>
#define forll(s, a, b) for (long long s = a; s... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vecll vector<long long>
#define vecs vector<string>
#define vec2ll vector<vector<long long>>
#define vecbool vector<bool>
#define vecpairll vector<pair<long long, long long>>
#define forll(s, a, b) for (long long s = a; s... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 999,763 | 999,762 | u586121204 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(int a, int b) { return (a < b); }
int main(int argc, char const *argv[]) {
int N, K;
cin >> N >> K;
vector<int> h;
int tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
h.emplace_back(tmp);
}
sort(h.begin(),... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(int a, int b) { return (a < b); }
int main(int argc, char const *argv[]) {
int N, K;
cin >> N >> K;
vector<int> h;
int tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
h.emplace_back(tmp);
}
sort(h.begin(),... | [
"assignment.change"
] | 999,766 | 999,767 | u912952979 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(int a, int b) { return (a < b); }
int main(int argc, char const *argv[]) {
int N, K;
cin >> N >> K;
vector<int> h;
int tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
h.emplace_back(tmp);
}
sort(h.begin(),... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(int a, int b) { return (a < b); }
int main(int argc, char const *argv[]) {
int N, K;
cin >> N >> K;
vector<int> h;
int tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
h.emplace_back(tmp);
}
sort(h.begin(),... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 999,768 | 999,767 | u912952979 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[10000], ans = 2000000000;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, a[n - k - 1] - a[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[100000], ans = 2000000000;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, a[i + k - 1] - a[i]);
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 999,771 | 999,770 | u401900157 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[10000], ans = 100000000;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, a[n - k - 1] - a[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[100000], ans = 2000000000;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, a[i + k - 1] - a[i]);
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 999,772 | 999,770 | u401900157 | cpp |
p03208 | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) ... | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) ... | [
"expression.operation.binary.add"
] | 999,775 | 999,776 | u430494842 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | [
"expression.operation.binary.add"
] | 999,777 | 999,778 | u430494842 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N, K;
cin >> N >> K;
vector<long long> trees(N);
for (int i = 0; i < N; ++i)
cin >> trees[i];
sort(trees.begin(), trees.end());
long long ret = 1000000000;
for (int i = 0; i < N;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N, K;
cin >> N >> K;
vector<long long> trees(N);
for (int i = 0; i < N; ++i)
cin >> trees[i];
sort(trees.begin(), trees.end());
long long ret = 1000000000;
for (int i = 0; i <= N... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 999,795 | 999,796 | u894471318 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.