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 |
|---|---|---|---|---|---|---|---|
p03136 | // Created by sz
#include <bits/stdc++.h>
using namespace std;
int N, L[11];
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N;
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L, L + N);
int sum = 0;
for (int i = 0; i < N - 1... | // Created by sz
#include <bits/stdc++.h>
using namespace std;
int N, L[11];
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N;
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L, L + N);
int sum = 0;
for (int i = 0; i < N - 1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,931 | 936,932 | u041075929 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
int l_sum = 0;
int i;
for (i = 0; i < n; i++) {
cin >> l[i];
l_sum += l[i];
}
sort(l.begin(), l.end());
l_sum -= l[n - 1];
cout << (l_sum > l[n - 1] ? "YES" : "NO"... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
int l_sum = 0;
int i;
for (i = 0; i < n; i++) {
cin >> l[i];
l_sum += l[i];
}
sort(l.begin(), l.end());
l_sum -= l[n - 1];
cout << (l_sum > l[n - 1] ? "Yes" : "No"... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,933 | 936,934 | u883104091 | cpp |
p03136 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 936,935 | 936,936 | u937608388 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
for (int i = 0; i < n - 1; i++) {
sum += v[i];
}
if (sum < v[n - 1]) {
cout << "No";
} else {
cout <... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
for (int i = 0; i < n - 1; i++) {
sum += v[i];
}
if (sum <= v[n - 1]) {
cout << "No";
} else {
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,937 | 936,938 | u887066391 | cpp |
p03136 | #include <stdio.h>
int min(int x, int y) { return x < y ? x : y; }
int max(int x, int y) { return x > y ? x : y; }
int n, m, sum;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
m = max(m, x);
sum += x;
}
if (2 * m < sum) {
printf("YES");
} else {
pr... | #include <stdio.h>
int min(int x, int y) { return x < y ? x : y; }
int max(int x, int y) { return x > y ? x : y; }
int n, m, sum;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
m = max(m, x);
sum += x;
}
if (2 * m < sum) {
printf("Yes");
} else {
pr... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 936,939 | 936,940 | u887771535 | cpp |
p03136 | /* Accepted. */
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAXN 200000
int n, s, maxn, cur;
int main() {
// freopen( "input","r",stdin );
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> cur, s += cur, maxn =... | /* Accepted. */
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAXN 200000
int n, s, maxn, cur;
int main() {
// freopen( "input","r",stdin );
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> cur, s += cur, maxn =... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 936,943 | 936,944 | u390140944 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
static ll imin = std::numeric_limits<ll>::min();
static ll imax = std::numeric_limits<ll>::max();
#... | #include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
static ll imin = std::numeric_limits<ll>::min();
static ll imax = std::numeric_limits<ll>::max();
#... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,945 | 936,946 | u068362919 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define vl vector<long long>
using pll = pair<long long, long long>;
#define __ << '\n'
#define _ << ' '
#define all(x) (x).begin(), (x).end()
void error() {
cout << "-1";
exit(0);
}
#define flush fflush(stdout)
int main() {
ios_base::sync_w... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define vl vector<long long>
using pll = pair<long long, long long>;
#define __ << '\n'
#define _ << ' '
#define all(x) (x).begin(), (x).end()
void error() {
cout << "-1";
exit(0);
}
#define flush fflush(stdout)
int main() {
ios_base::sync_w... | [
"control_flow.branch.if.condition.change"
] | 936,947 | 936,948 | u879931038 | cpp |
p03136 | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
type... | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
type... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,951 | 936,952 | u746560455 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a[20];
cin >> N;
for (int i = 0; i != N; i++) {
cin >> a[i];
}
sort(a, a + N);
int b = 0;
for (int i = 0; i != N - 1; i++) {
b += a[i];
}
if (b > a[N]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a[20];
cin >> N;
for (int i = 0; i != N; i++) {
cin >> a[i];
}
sort(a, a + N);
int b = 0;
for (int i = 0; i != N - 1; i++) {
b += a[i];
}
if (b > a[N - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;... | [
"control_flow.branch.if.condition.change"
] | 936,953 | 936,954 | u118875091 | cpp |
p03136 | // By Sho10 aka JuniorMonster
#include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define f first
#define s second
#define pb push_back
#... | // By Sho10 aka JuniorMonster
#include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define f first
#define s second
#define pb push_back
#... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,955 | 936,956 | u794807449 | cpp |
p03136 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define bit_cnt(n) (__builtin_popcountll(n))
#define substr(s, f, t) (s.substr(f - 1, t - f + 1)... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define bit_cnt(n) (__builtin_popcountll(n))
#define substr(s, f, t) (s.substr(f - 1, t - f + 1)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,965 | 936,966 | u905715926 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l.rbegin(), l.rend());
int s = 0;
for (int i = 1; i < n; i++)
s += l[i];
if (l[0] > s)
cout << "Yes";
else
cout... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l.rbegin(), l.rend());
int s = 0;
for (int i = 1; i < n; i++)
s += l[i];
if (l[0] < s)
cout << "Yes";
else
cout... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,969 | 936,970 | u809153881 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l.rbegin(), l.rend());
int s = 0;
for (int i = 1; i < n; i++)
s += l[i];
if (l[0] > s)
cout << "Yes";
else
cout << "No";
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l.rbegin(), l.rend());
int s = 0;
for (int i = 1; i < n; i++)
s += l[i];
if (l[0] < s)
cout << "Yes";
else
cout... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,971 | 936,970 | u809153881 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#de... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#de... | [
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 936,972 | 936,973 | u235155157 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#de... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#de... | [
"call.arguments.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 936,974 | 936,973 | u235155157 | cpp |
p03136 | /*
Look at the star
Look at the shine for U
*/
#include <bits/stdc++.h>
#define ll long long
#define PII pair<int, int>
#define sl(x) scanf("%lld", &x)
using namespace std;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
ll inv(ll b) {
if (b == 1)
return 1;
... | /*
Look at the star
Look at the shine for U
*/
#include <bits/stdc++.h>
#define ll long long
#define PII pair<int, int>
#define sl(x) scanf("%lld", &x)
using namespace std;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
ll inv(ll b) {
if (b == 1)
return 1;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,984 | 936,985 | u568831989 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change",
"control_flow.branch.if.condition.change"
] | 936,999 | 937,000 | u992394626 | cpp |
p03136 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define pb push_back
#define re return
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define pb push_back
#define re return
#define... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 937,003 | 937,004 | u247996218 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
int m = 0, s = 0, n;
cin >> N;
while (N--) {
cin >> n;
s += n;
if (n > m)
m = n;
}
cout << ((m <= s - m) ? "Yes" : "No");
}
| #include <iostream>
using namespace std;
int main() {
int N;
int m = 0, s = 0, n;
cin >> N;
while (N--) {
cin >> n;
s += n;
if (n > m)
m = n;
}
cout << ((m < s - m) ? "Yes" : "No");
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 937,019 | 937,020 | u507693948 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
int m = 0, s = 0, n;
cin >> N;
while (N--) {
cin >> n;
s += n;
if (n > m)
m = n;
}
cout << (m >= s - m) ? "Yes" : "No";
}
| #include <iostream>
using namespace std;
int main() {
int N;
int m = 0, s = 0, n;
cin >> N;
while (N--) {
cin >> n;
s += n;
if (n > m)
m = n;
}
cout << ((m < s - m) ? "Yes" : "No");
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 937,021 | 937,020 | u507693948 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 937,028 | 937,029 | u866107333 | cpp |
p03136 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, child, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i,... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, child, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i,... | [] | 937,030 | 937,031 | u899220667 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
#define all(v) (v).begin(), (v).end()
using namespace std;
int main() {
int no_of_sides;
cin >> no_of_sides;
vector<int> length(no_of_sides);
for (int i = 0; i < no_of_sides; i++)
cin >> length[i];
sort(all(length));
int sum = 0;
for (int... | #include <algorithm>
#include <iostream>
#include <vector>
#define all(v) (v).begin(), (v).end()
using namespace std;
int main() {
int no_of_sides;
cin >> no_of_sides;
vector<int> length(no_of_sides);
for (int i = 0; i < no_of_sides; i++)
cin >> length[i];
sort(all(length));
int sum = 0;
for (int... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 937,032 | 937,033 | u927253988 | cpp |
p03136 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int l[105];
int sum;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &l[i]);
sort(l, l + n);
for (int j = n - 2; j >= 0; j--)
sum += l[j];
if (l[n - 1] < sum)
puts("YES");
else
puts("... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int l[105];
int sum;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &l[i]);
sort(l, l + n);
for (int j = n - 2; j >= 0; j--)
sum += l[j];
if (l[n - 1] < sum)
puts("Yes");
else
puts("... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 937,036 | 937,037 | u128608381 | cpp |
p03136 | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define lb... | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define lb... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,041 | 937,042 | u006069211 | cpp |
p03136 | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define lb... | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define lb... | [
"literal.string.change",
"io.output.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 937,043 | 937,042 | u006069211 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int l[10];
int main(void) {
int n, s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l[i];
s += l[i];
}
sort(l, l + n);
s -= l[n - 1];
if (l[n - 1] > s)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int l[10];
int main(void) {
int n, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
}
sort(l, l + n);
sum -= l[n - 1];
if (l[n - 1] < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change"
] | 937,044 | 937,045 | u734774089 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int l[10];
int main(void) {
int n, s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l[i];
s += l[i];
}
sort(l, l + n);
s -= l[n - 1];
if (l[n - 1] > s)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int l[10];
int main(void) {
int n, s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l[i];
s += l[i];
}
sort(l, l + n);
s -= l[n - 1];
if (l[n - 1] < s)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 937,044 | 937,046 | u734774089 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define REPR(i, s, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define REPR(i, s, ... | [
"literal.string.change",
"io.output.change"
] | 937,055 | 937,056 | u232429509 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[15];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
int sum = 0;
for (int i = 1; i < n; i++)
sum += a[i];
if (sum < a[n])
puts("Yes");
else
puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int n;
int a[15];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
int sum = 0;
for (int i = 1; i < n; i++)
sum += a[i];
if (a[n] < sum)
puts("Yes");
else
puts("No");
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 937,057 | 937,058 | u817240026 | cpp |
p03136 | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int nums[N];
int sum = 0;
int MX = -1;
for (int i = 0; i < N; i++) {
cin >> nums[i];
MX = max(MX, nums[i]);
sum += nums[i];
}
cout << ((MX <= sum - MX) ? "Yes" : "No");
}
| #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int nums[N];
int sum = 0;
int MX = -1;
for (int i = 0; i < N; i++) {
cin >> nums[i];
MX = max(MX, nums[i]);
sum += nums[i];
}
cout << ((MX < sum - MX) ? "Yes" : "No");
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 937,070 | 937,071 | u359856428 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
int main() {
int N;
int L[15] = {};
cin >> N;
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L, L + N);
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L[i];
if (sum < L[N - 1])
cout << "Yes";
els... | #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
int main() {
int N;
int L[15] = {};
cin >> N;
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L, L + N);
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L[i];
if (L[N - 1] < sum)
cout << "Yes";
els... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 937,078 | 937,079 | u021423660 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max = 0;
int sum = 0;
int a[n];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max)
max = a[i];
sum += a[i];
}
if (max >= (sum - max))
cout << "No" << endl;
else
cout << "Yes" << en... | #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max = 0;
int sum = 0;
int a[10];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max)
max = a[i];
sum += a[i];
}
if (max >= (sum - max))
cout << "No" << endl;
else
cout << "Yes" << e... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 937,080 | 937,081 | u638264018 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max = 0;
int sum = 0;
int a[n];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max)
max = a[i];
sum = sum + a[i];
}
if (max >= sum - max)
cout << "No" << endl;
else
cout << "Yes" <<... | #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max = 0;
int sum = 0;
int a[10];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max)
max = a[i];
sum += a[i];
}
if (max >= (sum - max))
cout << "No" << endl;
else
cout << "Yes" << e... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 937,082 | 937,081 | u638264018 | cpp |
p03136 | #include <cstdio>
int main() {
int a, n, m = 0, s = 0;
scanf("%d", &n);
while (n--) {
scanf("%d", &a);
s += a;
if (a > m)
m = a;
}
if (2 * m < s)
printf("YES");
else
printf("NO");
return 0;
}
| #include <cstdio>
int main() {
int a, n, m = 0, s = 0;
scanf("%d", &n);
while (n--) {
scanf("%d", &a);
s += a;
if (a > m)
m = a;
}
if (2 * m < s)
printf("Yes");
else
printf("No");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 937,084 | 937,085 | u030635914 | cpp |
p03136 | #include <iostream>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
ll a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z;
int main() {
cin >> n;
int A[n];
int sum = 0;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
... | #include <iostream>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
ll a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z;
int main() {
cin >> n;
int A[n];
int sum = 0;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
... | [
"assignment.variable.change",
"identifier.change"
] | 937,086 | 937,087 | u789199225 | cpp |
p03136 | #include <bits/stdc++.h>
#define hell 1000000007
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll vector<pair<ll, ll>>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#def... | #include <bits/stdc++.h>
#define hell 1000000007
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll vector<pair<ll, ll>>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#def... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,088 | 937,089 | u493089152 | cpp |
p03136 | #include "bits/stdc++.h"
using namespace std;
void solve() {
int N, sum = 0;
cin >> N;
vector<int> ls(N);
for (int i = 0; i < N; i++) {
cin >> ls[i];
sum += ls[i];
}
sort(ls.begin(), ls.end());
cout << (ls.back() * 2 >= sum ? "Yes" : "No") << endl;
}
int main(void) {
solve();
// cout <<... | #include "bits/stdc++.h"
using namespace std;
void solve() {
int N, sum = 0;
cin >> N;
vector<int> ls(N);
for (int i = 0; i < N; i++) {
cin >> ls[i];
sum += ls[i];
}
sort(ls.begin(), ls.end());
cout << (ls.back() * 2 < sum ? "Yes" : "No") << endl;
}
int main(void) {
solve();
// cout << ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 937,090 | 937,091 | u344412812 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L.push_back(x);
}
std::sort(L.begin(), L.end(), std::greater<int>());
int max = L[0];
L.eras... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L.push_back(x);
}
std::sort(L.begin(), L.end(), std::greater<int>());
int max = L[0];
L.eras... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,094 | 937,095 | u335104842 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int maxL = 0;
for (int i = 0; i < n; i++) {
int L;
cin >> L;
sum += L;
maxL = max(maxL, L);
}
if (maxL < sum - maxL) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int maxL = 0;
for (int i = 0; i < n; i++) {
int L;
cin >> L;
sum += L;
maxL = max(maxL, L);
}
if (maxL < sum - maxL) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,096 | 937,097 | u130466814 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.back() < tmp ? "YES" : "NO");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.back() < tmp ? "Yes" : "No");
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,098 | 937,099 | u565172542 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.at(N - 1) < tmp ? "YES" : "NO");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.back() < tmp ? "Yes" : "No");
} | [
"call.function.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"expression.operation.binary.remove",
"literal.string.change",
"literal.string.case.change"
] | 937,100 | 937,099 | u565172542 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.back() < tmp ? "YES" : "NO");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.at(N - 1) < tmp ? "Yes" : "No");
} | [
"call.function.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change",
"literal.string.case.change"
] | 937,098 | 937,101 | u565172542 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.at(N - 1) < tmp ? "YES" : "NO");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.at(N - 1) < tmp ? "Yes" : "No");
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,100 | 937,101 | u565172542 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
for (int i = 0; i < N - 1; i++) {
L.at(N - 1) -= L.at(i);
}
cout << (L.at(N - 1) < 0 ? "YES" : "NO");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
for (int i = 0; i < N - 1; i++) {
L.at(N - 1) -= L.at(i);
}
cout << (L.at(N - 1) < 0 ? "Yes" : "No");
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,102 | 937,103 | u565172542 | cpp |
p03136 | #include <bits/stdc++.h>
int main() {
int n, sum, max = 0;
std::cin >> n;
for (auto i = 0; i < n; ++i) {
int v;
std::cin >> v;
if (v > max) {
max = v;
}
sum += v;
}
if ((sum - max) > max) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
... | #include <bits/stdc++.h>
int main() {
int n, sum = 0, max = 0;
std::cin >> n;
for (auto i = 0; i < n; ++i) {
int v;
std::cin >> v;
if (v > max) {
max = v;
}
sum += v;
}
if ((sum - max) > max) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
... | [
"variable_declaration.value.change"
] | 937,107 | 937,108 | u696729148 | cpp |
p03136 | #include <bits/stdc++.h>
int main() {
int n, sum, max = 0;
std::cin >> n;
for (auto i = 0; i < n; ++i) {
int v;
std::cin >> v;
if (v > max) {
max = v;
}
sum += v;
}
if ((sum - max) > max) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
... | #include <bits/stdc++.h>
int main() {
int n, sum = 0, max = 0;
std::cin >> n;
for (auto i = 0; i < n; ++i) {
int v;
std::cin >> v;
if (v > max) {
max = v;
}
sum += v;
}
if ((sum - max) > max) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
... | [
"variable_declaration.value.change"
] | 937,109 | 937,108 | u696729148 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, sum, mx;
mx = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; ++i)
cin >> L[i];
for (int i = 0; i < N; ++i)
sum += L[i];
for (int i = 0; i < N; ++i)
mx = max(mx, L[i]);
if (sum > 2 * mx)
cout << "Yes" << end... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, sum, mx;
sum = 0;
mx = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; ++i)
cin >> L[i];
for (int i = 0; i < N; ++i)
sum += L[i];
for (int i = 0; i < N; ++i)
mx = max(mx, L[i]);
if (sum > 2 * mx)
cout << "... | [
"assignment.add"
] | 937,117 | 937,118 | u041282550 | cpp |
p03136 | /*
They turn the lights down low,
In shadows hiding from the world,
Only coming out when it gets cold
The seas part when they hit the floor,
The voices carry on and out the door
And everything you touch turns into gold
Like the angel you are you laugh creating
A lightness in my chest,
Your eyes they penetrate me,
(yo... | /*
They turn the lights down low,
In shadows hiding from the world,
Only coming out when it gets cold
The seas part when they hit the floor,
The voices carry on and out the door
And everything you touch turns into gold
Like the angel you are you laugh creating
A lightness in my chest,
Your eyes they penetrate me,
(yo... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,125 | 937,126 | u806695213 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mxn = 5e5 + 5;
// check for forloop
// intialize variable
// overflow
// go for easy solution
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh() {
ios_base::sync_with_stdio... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mxn = 5e5 + 5;
// check for forloop
// intialize variable
// overflow
// go for easy solution
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh() {
ios_base::sync_with_stdio... | [
"control_flow.loop.condition.change"
] | 937,154 | 937,155 | u577654787 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int x[100000];
int d[100000];
signed main() {
cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> x[i];
if (n >= m) {
puts("0");
return 0;
}
sort(x, x + m);
priority_queue<pair<int, int>> pq;
int sum = 0;
for (int i = 0; i < m - 1; i... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int x[100000];
int d[100000];
signed main() {
cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> x[i];
if (n >= m) {
puts("0");
return 0;
}
sort(x, x + m);
priority_queue<pair<int, int>> pq;
int sum = 0;
for (int i = 0; i < m - 1; i... | [
"literal.number.change",
"control_flow.loop.condition.change",
"assignment.value.change"
] | 937,251 | 937,252 | u934469795 | cpp |
p03137 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main() {
int n, m;
cin >> n >> m;
if (m <= n) {
cout << 0 << endl;
return 0;
}
vector<int... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main() {
int n, m;
cin >> n >> m;
if (m <= n) {
cout << 0 << endl;
return 0;
}
vector<int... | [
"expression.operation.binary.add"
] | 937,253 | 937,254 | u187013893 | cpp |
p03137 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main() {
int n, m;
cin >> n >> m;
if (m <= n) {
cout << 0 << endl;
}
vector<int> x(m);
repi... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main() {
int n, m;
cin >> n >> m;
if (m <= n) {
cout << 0 << endl;
return 0;
}
vector<int... | [
"control_flow.return.add",
"control_flow.return.0.add",
"expression.operation.binary.add"
] | 937,255 | 937,254 | u187013893 | cpp |
p03137 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(_x) _x.begin(), ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(_x) _x.begin(), ... | [
"control_flow.branch.if.condition.change"
] | 937,281 | 937,282 | u128572736 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++... | [] | 937,289 | 937,290 | u338193317 | cpp |
p03137 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
int N, M;
int X[100000];
priority_queue<int> dis;
i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
int N, M;
int X[100000];
priority_queue<int> dis;
i... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,343 | 937,344 | u731886385 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0;
return 0;
}
vector<int> X(M, 0);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> sa(M - 1, 0);
for (int i = 0; i <= M - 1; i++) {
sa[i] = X... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0;
return 0;
}
vector<int> X(M, 0);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> sa(M - 1, 0);
for (int i = 0; i < M - 1; i++) {
sa[i] = X[... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 937,354 | 937,355 | u231455327 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) begin(x), end(x)
#define showall(obj) \
for (auto x : obj) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) begin(x), end(x)
#define showall(obj) \
for (auto x : obj) ... | [
"call.remove"
] | 937,370 | 937,371 | u190761897 | cpp |
p03137 | #include <float.h>
#include <limits.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m;
int *x, *x_diff;
int sum = 0;
scanf("%d%d\n", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
x = (i... | #include <float.h>
#include <limits.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m;
int *x, *x_diff;
int sum = 0;
scanf("%d%d\n", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
x = (i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 937,377 | 937,378 | u870205469 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> PLL;
typedef pair<P, P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P, VECP, greater<P>> PQP;
typedef priority_queue<ll, VECLL, greater<ll>> PQll;
#define rep(i, a, n) for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> PLL;
typedef pair<P, P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P, VECP, greater<P>> PQP;
typedef priority_queue<ll, VECLL, greater<ll>> PQll;
#define rep(i, a, n) for (... | [
"control_flow.branch.if.condition.change"
] | 937,396 | 937,397 | u129134470 | cpp |
p03137 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
signed main() {
l... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
signed main() {
l... | [
"control_flow.branch.if.condition.change"
] | 937,398 | 937,399 | u129134470 | cpp |
p03137 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
} else {
int a[m];
rep(i, m) cin >> a[i];
sort(a, a + m);
int b[m - 1];
rep(i, m - 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
} else {
int a[m];
rep(i, m) cin >> a[i];
sort(a, a + m);
int b[m - 1];
rep(i, m - 1... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 937,425 | 937,426 | u933962236 | cpp |
p03137 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
int a[m];
rep(i, m) cin >> a[i];
sort(a, a + m);
int b[m - 1];
rep(i, m - 1) b[i] = a[i + 1] ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
} else {
int a[m];
rep(i, m) cin >> a[i];
sort(a, a + m);
int b[m - 1];
rep(i, m - 1... | [
"control_flow.branch.else.add",
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 937,427 | 937,426 | u933962236 | cpp |
p03137 | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespac... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespac... | [
"expression.operation.binary.remove"
] | 937,438 | 937,439 | u866535689 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (m == 1) {
cout << "0";
return 0;
}
vector<long long> x(m), a(m - 1);
for (long long i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
for (long long i = m - 2; i >= 0; i--) {
a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (n >= m) {
cout << "0";
return 0;
}
vector<long long> x(m), a(m - 1);
for (long long i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
for (long long i = m - 2; i >= 0; i--) {
a[i... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,450 | 937,451 | u367569703 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1 || m >= n) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<pair<int, int>> dist;
for (int i = 0; i < m; i++) {
cin >> x.at(i);
x.at(i) += 100000;
}
sort(x.begin(), x.end());
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1 || n >= m) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<pair<int, int>> dist;
for (int i = 0; i < m; i++) {
cin >> x.at(i);
x.at(i) += 100000;
}
sort(x.begin(), x.end());
fo... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 937,463 | 937,464 | u191114518 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<pair<int, int>> dist;
for (int i = 0; i < m; i++) {
cin >> x.at(i);
x.at(i) += 100000;
}
sort(x.begin(), x.end());
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1 || n >= m) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<pair<int, int>> dist;
for (int i = 0; i < m; i++) {
cin >> x.at(i);
x.at(i) += 100000;
}
sort(x.begin(), x.end());
fo... | [
"control_flow.branch.if.condition.change"
] | 937,465 | 937,464 | u191114518 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
cout << 0;
int a[m];
for (int i = 0; i < m; i++)
cin >> a[i];
sort(a, a + m);
int d[m - 1];
for (int i = 0; i < m - 1; i++)
d[i] = a[i + 1] - a[i];
sort(d, d + m - 1);
int t = 0;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
cout << 0;
else {
int a[m];
for (int i = 0; i < m; i++)
cin >> a[i];
sort(a, a + m);
int d[m - 1];
for (int i = 0; i < m - 1; i++)
d[i] = a[i + 1] - a[i];
sort(d, d + m - 1);
... | [
"control_flow.branch.else.add"
] | 937,476 | 937,477 | u458748702 | cpp |
p03137 | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
if (n >= m) {
printf("%d", 0);
return 0;
}
vector<int> viCoordinate(m);
for (int i = 0; i < m; i++) {
scanf("%d", &viCoordin... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
if (n >= m) {
printf("%d", 0);
return 0;
}
vector<int> viCoordinate(m);
for (int i = 0; i < m; i++) {
scanf("%d", &viCoordin... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.arithmetic.change"
] | 937,480 | 937,481 | u865858945 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << "0" << endl;
} else {
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X.at(i);
}
sort(X.begin(), X.end());
int a = X.at(M - 1) - X.at(0);
vector<int> Y(M - 1);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << "0" << endl;
} else {
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X.at(i);
}
sort(X.begin(), X.end());
int a = X.at(M - 1) - X.at(0);
vector<int> Y(M - 1);
... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,492 | 937,493 | u442097733 | cpp |
p03137 | #include <stdio.h>
int main(void) {
int n, m, x, f[200001] = {}, i, j, min = 200000, max = 0, k, t = 0, l,
dt[100000], ans = 0;
scanf("%d%d", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
for (i = 0; i < m; i++) {
scanf("%d", &x);
f[x + 100000] = 1;
if (x + 100000 < min)... | #include <stdio.h>
int main(void) {
int n, m, x, f[200001] = {}, i, j, min = 200000, max = 0, k, t = 0, l,
dt[100000], ans = 0;
scanf("%d%d", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
for (i = 0; i < m; i++) {
scanf("%d", &x);
f[x + 100000] = 1;
if (x + 100000 < min)... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 937,494 | 937,495 | u088895504 | cpp |
p03137 | #include <stdio.h>
int main(void) {
int n, m, x, f[200001] = {}, i, j, min = 200000, max = 0, k, t = 0, l,
dt[100000], ans = 0;
scanf("%d%d", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
for (i = 0; i < m; i++) {
scanf("%d", &x);
f[x + 100000] = 1;
if (x + 100000 < min)... | #include <stdio.h>
int main(void) {
int n, m, x, f[200001] = {}, i, j, min = 200000, max = 0, k, t = 0, l,
dt[100000], ans = 0;
scanf("%d%d", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
for (i = 0; i < m; i++) {
scanf("%d", &x);
f[x + 100000] = 1;
if (x + 100000 < min)... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.add"
] | 937,496 | 937,495 | u088895504 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (... | [
"control_flow.return.add",
"control_flow.return.0.add",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 937,497 | 937,498 | u160429264 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(m);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(m);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i+... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 937,499 | 937,500 | u901813121 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(m);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(m);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i+... | [
"call.arguments.add",
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 937,501 | 937,500 | u901813121 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(n);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(m);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i+... | [
"call.add",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.add"
] | 937,502 | 937,500 | u901813121 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, m;
cin >> n >> m;
if (m == 1) { // m==1のとき
cout << 0 << endl;
return 0;
}
vector<int> x(m);
rep(i, m) { cin >> x.at(i); }
sort(x.begin(), x.end());
vector<int> d(m - 1);... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, m;
cin >> n >> m;
if (n >= m) { // n>=mのとき０
cout << 0 << endl;
return 0;
}
vector<int> x(m);
rep(i, m) { cin >> x.at(i); }
sort(x.begin(), x.end());
vector<int> d(m - 1)... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,517 | 937,518 | u690475097 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, cnt = 0;
cin >> n >> m;
if (n >= m)
cout << 0 << endl;
else {
int x[m];
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x, x + m);
int b[m - 1];
for (int i = 0; i < m - 1; i++)
b[i] = x[i + 1] - x[i];
sort... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, cnt = 0;
cin >> n >> m;
if (n >= m)
cout << 0 << endl;
else {
int x[m];
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x, x + m);
int b[m - 1];
for (int i = 0; i < m - 1; i++)
b[i] = x[i + 1] - x[i];
sort... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 937,533 | 937,534 | u298768617 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
} else {
vector<int> vec(M);
for (int i = 0; i < M; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
vector<int> dist(M - 1);
for (int i = 0; i < M - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
} else {
vector<int> vec(M);
for (int i = 0; i < M; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
vector<int> dist(M - 1);
for (int i = 0; i < M - ... | [
"expression.operation.binary.remove"
] | 937,572 | 937,573 | u681084651 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << "0"
<< "\n";
return 0;
}
vector<int> v(M);
for (int i = 0; i < M; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
vector<int> sa(M - 1);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, M;
cin >> N >> M;
if (M == 1 || N >= M) {
cout << "0"
<< "\n";
return 0;
}
vector<int> v(M);
for (int i = 0; i < M; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
vector<int> sa(M - 1);
f... | [
"control_flow.branch.if.condition.change"
] | 937,593 | 937,594 | u086063386 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, m;
cin >> n >> m;
ll a[n];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
if (m <= n) {
// cout<<"if"<<endl;
cout << 0 << endl;
} else {
sort(a, a + m);
vector<ll> v;
for (int i = 1; i < m; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, m;
cin >> n >> m;
ll a[m];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
if (m <= n) {
// cout<<"if"<<endl;
cout << 0 << endl;
} else {
sort(a, a + m);
vector<ll> v;
for (int i = 1; i < m; i++) {
... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 937,605 | 937,606 | u159663513 | cpp |
p03137 | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,696 | 937,697 | u775507068 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, m, ans;
cin >> n >> m;
if (n >= m) {
cout << 0;
return 0;
}
vector<int> x(m), sa(m, 0);
for (i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
for (i = 1; i < m; i++)
sa[i] = x[i] - x[i - 1];
sort(sa.begin(),... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, m, ans;
cin >> n >> m;
if (n >= m) {
cout << 0;
return 0;
}
vector<int> x(m), sa(m, 0);
for (i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
for (i = 1; i < m; i++)
sa[i] = x[i] - x[i - 1];
sort(sa.begin(),... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 937,707 | 937,708 | u251847465 | cpp |
p03137 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | [
"expression.operation.binary.add"
] | 937,715 | 937,716 | u222293734 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<long> X;
cin >> N >> M;
for (int i = 0; i < M; i++) {
long x;
cin >> x;
X.push_back(x);
}
sort(X.begin(), X.end());
vector<long> ivl;
for (int i = 0; i < M - 1; i++) {
ivl.push_back(X[i + 1] - X[i]);
}
sort... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<long> X;
cin >> N >> M;
for (int i = 0; i < M; i++) {
long x;
cin >> x;
X.push_back(x);
}
sort(X.begin(), X.end());
vector<long> ivl;
for (int i = 0; i < M - 1; i++) {
ivl.push_back(X[i + 1] - X[i]);
}
sort... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,778 | 937,779 | u522200796 | cpp |
p03137 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
if (m == 1) {
cout << 0 << endl;
return 0;
}
priority_queue<int> xs;
rep(i, m) {
i... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
if (m == 1 || n >= m) {
cout << 0 << endl;
return 0;
}
priority_queue<int> xs;
rep(i, ... | [
"control_flow.branch.if.condition.change"
] | 937,806 | 937,807 | u783674761 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m, x[100009];
long long int sm = 0;
vector<long long> v1, v2;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x[i];
v1.push_back(x[i]);
}
if (m == 1) {
cout << 0 << endl;
} else {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m, x[100009];
long long int sm = 0;
vector<long long> v1, v2;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x[i];
v1.push_back(x[i]);
}
if (n >= m) {
cout << 0 << endl;
} else {
... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,812 | 937,813 | u112318601 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
if (M <= N) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; ++i) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> L(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
if (M <= N) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; ++i) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> L(... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 937,816 | 937,817 | u774160580 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n > m) {
cout << 0 << endl;
} else {
vector<int> x(m, 0);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
} else {
vector<int> x(m, 0);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i+... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 937,820 | 937,821 | u188117876 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | [
"control_flow.branch.if.condition.change"
] | 937,828 | 937,829 | u058297300 | cpp |
p03137 | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
long long N, M;
std::cin >> N >> M;
if (N >= M) {
std::cout << 0 << std::endl;
return 0;
}
std::vector<long long> X(M);
for (auto &x : X)
std::cin >> x;
std::sort(X.begin(), X.end(... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
long long N, M;
std::cin >> N >> M;
if (N >= M) {
std::cout << 0 << std::endl;
return 0;
}
std::vector<long long> X(M);
for (auto &x : X)
std::cin >> x;
std::sort(X.begin(), X.end(... | [
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 937,884 | 937,885 | u896932701 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
vector<long long int> X(N);
for (auto &i : X)
cin >> i;
sort(X.begin(), X.end());
vector<long long... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
vector<long long int> X(M);
for (auto &i : X)
cin >> i;
sort(X.begin(), X.end());
vector<long long... | [
"variable_declaration.type.widen.change"
] | 937,896 | 937,897 | u382176401 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
int i;
vector<int> x(m);
for (i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
vector<int> a(m);
for (i = 0; i < m - 1; i++) {
a[i] = x[i +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
int i;
vector<int> x(m);
for (i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
vector<int> a(m - 1);
for (i = 0; i < m - 1; i++) {
a[i] = x... | [
"assignment.change"
] | 937,898 | 937,899 | u479790786 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, m;
ci... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, m;
ci... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 937,966 | 937,967 | u342051078 | cpp |
p03137 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
using namespace std;
int main() {
long res;
long N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
long X[100009];
for (int i = 1; i <= M; i++)
cin >> X[i];
sor... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
using namespace std;
int main() {
long res;
long N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
long X[100009];
for (int i = 1; i <= M; i++)
cin >> X[i];
sor... | [
"expression.operation.binary.add"
] | 937,972 | 937,973 | u545674098 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll N, M;
vector<ll> X;
int main(int argc, char const *argv[]) {
cin >> N >> M;
for (int i = 0; i < M; ++i) {
ll x;
cin >> x;
X.emplace_back(x);
}
sort(X.begin(), X.end());
ll ans = 0;
if (N ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll N, M;
vector<ll> X;
int main(int argc, char const *argv[]) {
cin >> N >> M;
for (int i = 0; i < M; ++i) {
ll x;
cin >> x;
X.emplace_back(x);
}
sort(X.begin(), X.end());
ll ans = 0;
if (N ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 937,990 | 937,991 | u391752022 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
long N, M;
vector<long> L;
vector<long> X;
int main() {
scanf("%ld%ld", &N, &M);
long x;
for (int i = 0; i < M; i++) {
scanf("%ld", &x);
X.push_back(x);
}
if (M < N) {
printf("%d\n", 0);
return 0;
}
sort(X.begin(), X.end());
long sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
long N, M;
vector<long> L;
vector<long> X;
int main() {
scanf("%ld%ld", &N, &M);
long x;
for (int i = 0; i < M; i++) {
scanf("%ld", &x);
X.push_back(x);
}
if (M <= N) {
printf("%d\n", 0);
return 0;
}
sort(X.begin(), X.end());
long sum = 0;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 937,992 | 937,993 | u570486288 | cpp |
p03137 |
#include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int m;
scanf("%d", &m);
if (n >= m) {
printf("0\n");
return 0;
}
set<int> a, diff;
for (size_t i = 0; i < m; i++) {
int x;
scanf("%... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int m;
scanf("%d", &m);
if (n >= m) {
printf("0\n");
return 0;
}
set<int> a;
multiset<int> diff;
for (size_t i = 0; i < m; i++) {
int ... | [] | 938,019 | 938,020 | u140640995 | cpp |
p03137 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | [
"identifier.change",
"call.arguments.change"
] | 938,055 | 938,056 | u240509821 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.