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 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
}
int maxLength = *max_element(L.begin(), L.end());
if (maxLength < sum)
cout << "Yes... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
}
int maxLength = *max_element(L.begin(), L.end());
if (maxLength < sum - maxLength)
... | [
"control_flow.branch.if.condition.change"
] | 935,944 | 935,945 | u835561357 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i <= n; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
int sum = 0;
rep(i, 0, N) {
cin >> L[i];
sum += L[i];
}
string ans;
int ML = *max_element(L.begin(), L.end());
if (ML < sum - ML)
ans = "Yes";
... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
int sum = 0;
rep(i, 0, N) {
cin >> L[i];
sum += L[i];
}
string ans;
int ML = *max_element(L.begin(), L.end());
if (ML < sum - ML)
ans = "Yes";
... | [
"expression.operator.compare.change",
"preprocessor.define.value.change"
] | 935,946 | 935,947 | u726060136 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,950 | 935,951 | u460819600 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,952 | 935,951 | u460819600 | cpp |
p03136 | /* Don't try to hack it :|
_/﹋\_
(҂`_´)
<,︻╦╤─҉- - - - - - - - - - - - - - -
_/﹋\_
*/
//@ROMENE7
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define ulli unsig... | /* Don't try to hack it :|
_/﹋\_
(҂`_´)
<,︻╦╤─҉- - - - - - - - - - - - - - -
_/﹋\_
*/
//@ROMENE7
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define ulli unsig... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,953 | 935,954 | u717006190 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mod 1000000007
int main() {
int N;
vector<int> P(N);
rep(i, N) cin >> P[i];
sort(P.begin(), P.end(... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mod 1000000007
int main() {
int N;
cin >> N;
vector<int> P(N);
rep(i, N) cin >> P[i];
sort(P.beg... | [] | 935,960 | 935,961 | u539675863 | cpp |
p03136 | #include <bits/stdc++.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
int x = 0;
for (int... | #include <bits/stdc++.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
int x = 0;
for (int... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,964 | 935,965 | u011036596 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int MX, sum;
MX = sum = 0;
while (n--) {
int aux;
cin >> aux;
sum += aux;
MX = max(MX, aux);
}
cout << ((sum > MX) ? "Yes" : "No") << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int MX, sum;
MX = sum = 0;
while (n--) {
int aux;
cin >> aux;
sum += aux;
MX = max(MX, aux);
}
cout << ((sum - MX > MX) ? "Yes" : "No") << "\n";
} | [
"expression.operation.binary.add"
] | 935,972 | 935,973 | u520703236 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define mod 1000000007
#define endl '\n'
#define fast \
ios_base::sync_with_stdio(false); \
c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define mod 1000000007
#define endl '\n'
#define fast \
ios_base::sync_with_stdio(false); \
c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,974 | 935,975 | u015580732 | cpp |
p03136 | #include <bits/stdc++.h>
#define re(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
re(i, N) { cin >> L[i]; }
int max = 0;
re(i, N) {
if (L[i] > max)
max = L[i];
}
int sum = 0;
re(i, N) { sum += L[i]; }
if (max > sum - max)
cout << "No" <<... | #include <bits/stdc++.h>
#define re(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
re(i, N) { cin >> L[i]; }
int max = 0;
re(i, N) {
if (L[i] > max)
max = L[i];
}
int sum = 0;
re(i, N) { sum += L[i]; }
if (max >= (sum - max))
cout << "No"... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,976 | 935,977 | u917518913 | cpp |
p03136 | #include <bits/stdc++.h>
#define re(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
re(i, N) { cin >> L[i]; }
int max = 0;
re(i, N) {
if (L[i] > max)
max = L[i];
}
int sum = 0;
re(i, N) { sum += L[i]; }
if (max > sum)
cout << "No" << endl;... | #include <bits/stdc++.h>
#define re(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
re(i, N) { cin >> L[i]; }
int max = 0;
re(i, N) {
if (L[i] > max)
max = L[i];
}
int sum = 0;
re(i, N) { sum += L[i]; }
if (max >= (sum - max))
cout << "No"... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,978 | 935,977 | u917518913 | cpp |
p03136 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//#define int long long
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//#define int long long
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | [
"variable_declaration.value.change"
] | 935,981 | 935,982 | u615258936 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) { cin >> l[i]; }
int big = *max_element(ALL(l));
int sum;
rep(i, n) { sum += l[i]; }
if (big < sum - big) {
cout ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) { cin >> l[i]; }
int big = *max_element(ALL(l));
int sum = 0;
rep(i, n) { sum += l[i]; }
if (big < sum - big) {
c... | [
"variable_declaration.value.change"
] | 935,986 | 935,987 | u479032944 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) { cin >> l[i]; }
int big = *max_element(ALL(l));
int sum;
rep(i, n) { sum += l[i]; }
if (big < sum - big) {
cout ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) { cin >> l[i]; }
int big = *max_element(ALL(l));
int sum = 0;
rep(i, n) { sum += l[i]; }
if (big < sum - big) {
c... | [
"variable_declaration.value.change"
] | 935,988 | 935,987 | u479032944 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int max = 0;
int all = 0;
int N;
cin >> N;
int A[100];
for (int i = 1; i < N + 1; i++) {
cin >> A[i];
if (max < A[i])
max = A[i];
all = all + A[i];
}
if (max < all - max)
cout << "Yes";
else
cout << "No" << all << max;
... | #include <iostream>
using namespace std;
int main() {
int max = 0;
int all = 0;
int N;
cin >> N;
int A[100];
for (int i = 1; i < N + 1; i++) {
cin >> A[i];
if (max < A[i])
max = A[i];
all = all + A[i];
}
if (max < all - max)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"expression.operation.binary.remove"
] | 935,991 | 935,992 | u644568158 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum += A.at(i);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (sum < 2 * A.at(i)) {
ans += 1;
}
}
if (ans >= 1) {
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum += A.at(i);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (sum <= 2 * A.at(i)) {
ans += 1;
}
}
if (ans >= 1) {
cou... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,008 | 936,009 | u383166010 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int count = 0;
int N, dog = -1;
cin >> N;
vector<int> L(N);
rep(i, N) { cin >> L[i]; }
rep(i, N) {
if (L[i] > dog) {
dog = L[i];
}
count += L[i];
}
if (count > dog) {
co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int count = 0;
int N, dog = -1;
cin >> N;
vector<int> L(N);
rep(i, N) { cin >> L[i]; }
rep(i, N) {
if (L[i] > dog) {
dog = L[i];
}
count += L[i];
}
if (count - dog > dog) {
... | [
"control_flow.branch.if.condition.change"
] | 936,010 | 936,011 | u573537453 | cpp |
p03136 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,019 | 936,020 | u820341516 | cpp |
p03136 | // shara's here
#include <bits/stdc++.h>
using namespace std;
typedef int q;
typedef double w;
typedef string s;
typedef long long ll;
int main() {
q x;
cin >> x;
q a[x];
q sum = 0;
q maxi = INT_MIN;
for (int i = 0; i < x; i++) {
cin >> a[i];
sum += a[i];
maxi = max({maxi, a[i]});
}
sum -= m... | // shara's here
#include <bits/stdc++.h>
using namespace std;
typedef int q;
typedef double w;
typedef string s;
typedef long long ll;
int main() {
q x;
cin >> x;
q a[x];
q sum = 0;
q maxi = INT_MIN;
for (int i = 0; i < x; i++) {
cin >> a[i];
sum += a[i];
maxi = max({maxi, a[i]});
}
sum -= m... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,025 | 936,026 | u470490204 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int maxx = 0;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
if (l > maxx)
maxx = l;
sum += l;
}
if (maxx < sum)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int maxx = 0;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
if (l > maxx)
maxx = l;
sum += l;
}
if (maxx < sum - maxx)
cout << "Yes";
else
cout << "No";
} | [
"control_flow.branch.if.condition.change"
] | 936,027 | 936,028 | u901813121 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> v;
int i, x;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
int c = 0;
sort(v.begin(), v.end());
for (i = 0; i < n - 1; i++)
c += v[i];
if (v[n - 1] < c)
cout << "Yes";
else
cout << "No";
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
int i, x;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
int c = 0;
sort(v.begin(), v.end());
for (i = 0; i < n - 1; i++)
c += v[i];
if (v[n - 1] < c)
cout << "Yes";
else
cout << "... | [] | 936,031 | 936,032 | u621527413 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, sum(0);
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
}
sort(L.begin(), L.end());
if (sum - L[N - 1] > L[N - 1])
cout << "Yes" << endl;
else
cout << "No" << endl... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, sum(0);
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
}
sort(L.begin(), L.end());
if (sum - L[N - 1] > L[N - 1])
cout << "Yes" << endl;
else
cout << ... | [] | 936,042 | 936,043 | u456658814 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
ans += a.at(i);
}
sort(a.begin(), a.end());
ans -= 2 * a.at(n - 1);
if (ans > a.at(n - 1)) {
cout << "Yes" << endl;
} else {
cout << "No... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
ans += a.at(i);
}
sort(a.begin(), a.end());
ans -= a.at(n - 1);
if (ans > a.at(n - 1)) {
cout << "Yes" << endl;
} else {
cout << "No" <<... | [
"expression.operation.binary.remove"
] | 936,044 | 936,045 | u442754977 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int p[100];
vector<int> q;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
q.push_back(p[i]);
}
sort(q.rbegin(), q.rend());
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int p[100];
vector<int> q;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
q.push_back(p[i]);
}
sort(q.rbegin(), q.rend());
for (int i = 1; i < n; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 936,046 | 936,047 | u929298675 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; ++i) {
cin >> L[i];
sum += L[i];
}
for (int i = 0; i < N; ++i) {
if (L[i] * 2 >= sum) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum;
cin >> N;
sum = 0;
vector<int> L(N);
for (int i = 0; i < N; ++i) {
cin >> L[i];
sum += L[i];
}
for (int i = 0; i < N; ++i) {
if (L[i] * 2 >= sum) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << e... | [
"assignment.add"
] | 936,048 | 936,049 | u023958502 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
int m = -1;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
m = max(m, l[i]);
sum += l[i];
}
if (2 * m > sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
int m = -1;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
m = max(m, l[i]);
sum += l[i];
}
if (2 * m < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,050 | 936,051 | u882039496 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
int le;
int max = 0;
int sum = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> le;
sum += le;
if (le > max) {
max = le;
}
}
if (max * 2 < le - max) {
cout << "Yes" << endl;
} else
cout << "No" << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
int le;
int max = 0;
int sum = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> le;
sum += le;
if (le > max) {
max = le;
}
}
if (max < sum - max) {
cout << "Yes" << endl;
} else
cout << "No" << endl... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 936,066 | 936,067 | u806399854 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
int le;
int max = 0;
int sum = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> le;
sum += le;
if (le > max) {
max = le;
}
}
if (max < le - max) {
cout << "Yes" << endl;
} else
cout << "No" << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
int le;
int max = 0;
int sum = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> le;
sum += le;
if (le > max) {
max = le;
}
}
if (max < sum - max) {
cout << "Yes" << endl;
} else
cout << "No" << endl... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 936,068 | 936,067 | u806399854 | cpp |
p03136 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int sum = 0, maxi = 0;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
sum += data.at(i);
maxi = max(maxi, data.at(i));
}
if (sum / 2 > maxi) {
cout << "Yes" << endl;
} el... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
double sum = 0;
int maxi = 0;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
sum += data.at(i);
maxi = max(maxi, data.at(i));
}
if (sum / 2 > maxi) {
cout << "Yes" << end... | [
"variable_declaration.type.primitive.change"
] | 936,069 | 936,070 | u356754940 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int L[n];
for (i = 0; i < n; i++)
cin >> L[i];
sort(L, L + n);
int sum = 0;
for (i = 0; i < n - 1; i++) {
sum += L[i];
}
if (sum < L[n - 1])
cout << "No";
else
cout << "Yes";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int L[n];
for (i = 0; i < n; i++)
cin >> L[i];
sort(L, L + n);
int sum = 0;
for (i = 0; i < n - 1; i++) {
sum += L[i];
}
if (sum <= L[n - 1])
cout << "No";
else
cout << "Yes";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,078 | 936,079 | u952130512 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int L[n];
for (i = 0; i < n; i++)
cin >> L[i];
sort(L, L + n);
int sum = 0;
for (i = 0; i < n - 1; i++) {
sum += L[i];
}
if (sum < L[n - 1])
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int L[n];
for (i = 0; i < n; i++)
cin >> L[i];
sort(L, L + n);
int sum = 0;
for (i = 0; i < n - 1; i++) {
sum += L[i];
}
if (sum <= L[n - 1])
cout << "No";
else
cout << "Yes";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 936,080 | 936,079 | u952130512 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
/* ちゃんと考えて実装して問題なくACできた時嬉しいよ！！ */
int main(void) {
int n;
cin >> n;
vector<int> l;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
l.push_back(x);
}
sort(l.begin(), l.end());
int lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
/* ちゃんと考えて実装して問題なくACできた時嬉しいよ！！ */
int main(void) {
int n;
cin >> n;
vector<int> l;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
l.push_back(x);
}
sort(l.begin(), l.end());
int lo... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 936,083 | 936,084 | u900688325 | cpp |
p03136 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define rep(i, n, m) for (ll i = (n); i < (m); i++)
using ll = long long int;
int main(void) {
int n;
if (!scanf("%d", &n))
return 0;
std::vector<int> vec(n, 0);
int sum = 0;
int max = 0;
rep(i, 0, n) {
int input;
if (... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define rep(i, n, m) for (ll i = (n); i < (m); i++)
using ll = long long int;
int main(void) {
int n;
if (!scanf("%d", &n))
return 0;
std::vector<int> vec(n, 0);
int sum = 0;
int max = 0;
rep(i, 0, n) {
int input;
if (... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,091 | 936,092 | u624645160 | cpp |
p03136 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <sta... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <sta... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,096 | 936,097 | u193604609 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum;
sum = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
sum += vec.at(i);
}
if (sum < vec.at(N - 1)) {
cout << "Yes" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum;
sum = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
sum += vec.at(i);
}
if (sum > vec.at(N - 1)) {
cout << "Yes" <<... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,100 | 936,101 | u344525140 | cpp |
p03136 | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue> //priority_queue<型名> 変数：優先度付きキュー 最大値の探索が早い... | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue> //priority_queue<型名> 変数：優先度付きキュー 最大値の探索が早い... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,102 | 936,103 | u667375816 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int sum = 0;
int m = 0;
for (int i = 0; i < n; i++) {
sum += a.at(i);
m = max(m, a.at(i));
}
if (sum - m < m) {
cout << "Yes" << endl;
} e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int sum = 0;
int m = 0;
for (int i = 0; i < n; i++) {
sum += a.at(i);
m = max(m, a.at(i));
}
if (sum - m > m) {
cout << "Yes" << endl;
} e... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,144 | 936,145 | u522993719 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long mod = 1e9 + 7;
typedef long long ll;
int main() {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long mod = 1e9 + 7;
typedef long long ll;
int main() {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 936,146 | 936,147 | u969617556 | cpp |
p03136 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, l... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, l... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,153 | 936,154 | u422558819 | cpp |
p03136 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vu;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vu;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,157 | 936,158 | u519883882 | cpp |
p03136 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v(n);
r(i, n) {
cin >> v.at(i);
sum += v.at(i);
}
sort(v.begin(), v.end());
if (v.at(n - 1) > (sum - v.at(n - 1)))
cout << "Yes" << endl;
else
cou... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v(n);
r(i, n) {
cin >> v.at(i);
sum += v.at(i);
}
sort(v.begin(), v.end());
if (v.at(n - 1) < (sum - v.at(n - 1)))
cout << "Yes" << endl;
else
cou... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,162 | 936,163 | u192280767 | cpp |
p03136 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | [
"call.arguments.add"
] | 936,167 | 936,168 | u174404613 | cpp |
p03136 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | [
"call.arguments.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,169 | 936,168 | u174404613 | cpp |
p03136 | /*Shivam Bhalla */
/* f2016941@pilani.bits-pilani.ac.in */
#include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#inc... | /*Shivam Bhalla */
/* f2016941@pilani.bits-pilani.ac.in */
#include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#inc... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 936,195 | 936,196 | u395652671 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
struct lamp {
int p;
int k;
int *s;
};
const long long mod = 1e9 + 7;
int main() {
int n, sum, max;
sum = 0;
max = 0;
int *l;
cin >> n;
l = new int[n];
for (int i = 0; i < n; i++... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
struct lamp {
int p;
int k;
int *s;
};
const long long mod = 1e9 + 7;
int main() {
int n, sum, max;
sum = 0;
max = 0;
int *l;
cin >> n;
l = new int[n];
for (int i = 0; i < n; i++... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,197 | 936,198 | u020230257 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
struct lamp {
int p;
int k;
int *s;
};
const long long mod = 1e9 + 7;
int main() {
int n, sum, max;
max = 0;
int *l;
cin >> n;
l = new int[n];
for (int i = 0; i < n; i++) {
cin... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
struct lamp {
int p;
int k;
int *s;
};
const long long mod = 1e9 + 7;
int main() {
int n, sum, max;
sum = 0;
max = 0;
int *l;
cin >> n;
l = new int[n];
for (int i = 0; i < n; i++... | [
"assignment.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,199 | 936,198 | u020230257 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
struct lamp {
int p;
int k;
int *s;
};
const long long mod = 1e9 + 7;
int main() {
int n, sum, max;
max = 0;
int *l;
cin >> n;
l = new int[n];
for (int i = 0; i < n; i++) {
cin... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
struct lamp {
int p;
int k;
int *s;
};
const long long mod = 1e9 + 7;
int main() {
int n, sum, max;
sum = 0;
max = 0;
int *l;
cin >> n;
l = new int[n];
for (int i = 0; i < n; i++... | [
"assignment.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,201 | 936,198 | u020230257 | cpp |
p03136 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,214 | 936,215 | u926242698 | cpp |
p03136 | #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
... | [] | 936,216 | 936,217 | u775507068 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
int main() {
int N;
cin >> N;
vector<int> L(N);
rep(i, 0, N) { cin >> L[i]; }... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
int main() {
int N;
cin >> N;
vector<int> L(N);
rep(i, 0, N) { cin >> L[i]; }... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,229 | 936,230 | u987594251 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
int arr[n + 10], mx = 0;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
mx = max(mx, arr[i]);
sum += arr[i];
}
sum -= mx;
// cout<<mx<<" "<<sum<<endl;
if (sum - mx > 0)
cout << "Y... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
int arr[n + 10], mx = 0;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
mx = max(mx, arr[i]);
sum += arr[i];
}
sum -= mx;
// cout<<mx<<" "<<sum<<endl;
if (sum - mx > 0)
cout << "Y... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,237 | 936,238 | u425436575 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x, sum = 0, mx = 0;
for (int i = 0; i < n; i++) {
cin >> x;
sum += x;
mx = max(x, mx);
}
int ans = sum - mx;
if (ans > mx) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x, sum = 0, mx = 0;
for (int i = 0; i < n; i++) {
cin >> x;
sum += x;
mx = max(x, mx);
}
int ans = sum - mx;
if (ans > mx) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,239 | 936,240 | u145429281 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> all(N);
for (int i = 0; i < N; i++) {
cin >> all.at(i);
}
int wa = 0;
int big = 0;
for (int i = 0; i < N - 1; i++) {
if (all.at(i) > big)
big = all.at(i);
}
for (int i = 0; i < N - 1; i++) {
wa... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> all(N);
for (int i = 0; i < N; i++) {
cin >> all.at(i);
}
int wa = 0;
int big = 0;
for (int i = 0; i < N; i++) {
if (all.at(i) > big)
big = all.at(i);
}
for (int i = 0; i < N; i++) {
wa += all.... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 936,246 | 936,247 | u495881622 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> all(N);
for (int i = 0; i < N; i++) {
cin >> all.at(i);
}
int wa = 0;
int big = 0;
for (int i = 0; i < N - 1; i++) {
if (all.at(i) > big)
big = all.at(i);
}
for (int i = 0; i < N - 1; i++) {
wa... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> all(N);
for (int i = 0; i < N; i++) {
cin >> all.at(i);
}
int wa = 0;
int big = 0;
for (int i = 0; i < N; i++) {
if (all.at(i) > big)
big = all.at(i);
}
for (int i = 0; i < N; i++) {
wa += all.... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,248 | 936,247 | u495881622 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> all(100);
for (int i = 0; i < N; i++) {
cin >> all.at(i);
}
int wa = 0;
int big = 0;
for (int i = 0; i < N; i++) {
if (all.at(i) > big)
big = all.at(i);
}
for (int i = 0; i < N; i++) {
wa += al... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> all(N);
for (int i = 0; i < N; i++) {
cin >> all.at(i);
}
int wa = 0;
int big = 0;
for (int i = 0; i < N; i++) {
if (all.at(i) > big)
big = all.at(i);
}
for (int i = 0; i < N; i++) {
wa += all.... | [
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,249 | 936,247 | u495881622 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, sum;
cin >> N;
vector<int> length(N);
for (i = 0; i < N; i++) {
cin >> length.at(i);
}
sort(length.begin(), length.end());
for (i = 0; i < N - 1; i++) {
sum += length.at(i);
}
if (length.at(N - 1) < sum) {
cout << "Yes" ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, sum;
sum = 0;
cin >> N;
vector<int> length(N);
for (i = 0; i < N; i++) {
cin >> length.at(i);
}
sort(length.begin(), length.end());
for (i = 0; i < N - 1; i++) {
sum += length.at(i);
}
if (length.at(N - 1) < sum) {
cou... | [
"assignment.add"
] | 936,252 | 936,253 | u018807058 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> MY(N);
for (int i = 0; i < N; i++) {
cin >> MY.at(i);
}
sort(MY.begin(), MY.end());
int k = 0;
for (int i = 0; i < N - 1; i++) {
k += MY.at(i);
}
if (k > MY.at(N)) {
cout << "Yes" << endl;
} else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> MY(N);
for (int i = 0; i < N; i++) {
cin >> MY.at(i);
}
sort(MY.begin(), MY.end());
int k = 0;
for (int i = 0; i < N - 1; i++) {
k += MY.at(i);
}
if (k > MY.at(N - 1)) {
cout << "Yes" << endl;
} el... | [
"control_flow.branch.if.condition.change"
] | 936,255 | 936,256 | u983062344 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n;
int l[1000];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l, l + n);
int k = 0;
for (int i = 0; i < n - 1; i++)
k += l[i];
cout << (k > l[n - 1] ? "YES" : "NO") << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n;
int l[1000];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l, l + n);
int k = 0;
for (int i = 0; i < n - 1; i++)
k += l[i];
cout << (k > l[n - 1] ? "Yes" : "No") << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,257 | 936,258 | u742504115 | cpp |
p03136 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
typedef long long Int;
int main() {
Int N = 0;
cin >> N;
vector<Int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(L.begin(),... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
typedef long long Int;
int main() {
Int N = 0;
cin >> N;
vector<Int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(L.begin(),... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,268 | 936,269 | u477204532 | cpp |
p03136 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
typedef long long Int;
int main() {
Int N = 0;
cin >> N;
vector<Int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(L.begin(),... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
typedef long long Int;
int main() {
Int N = 0;
cin >> N;
vector<Int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(L.begin(),... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,270 | 936,269 | u477204532 | cpp |
p03136 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
typedef long long Int;
int main() {
Int N = 0;
cin >> N;
vector<Int> L;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(L.begin(), L.... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
typedef long long Int;
int main() {
Int N = 0;
cin >> N;
vector<Int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(L.begin(),... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,271 | 936,269 | u477204532 | cpp |
p03136 | #include <iostream>
#include <string>
using namespace std;
int main() {
int l[20] = {};
int n;
cin >> n;
int max, sum = 0;
max = -10000;
for (int i = 0; i < n; i++) {
cin >> l[i];
if (max < l[i]) {
max = l[i];
}
sum = sum + l[i];
}
sum = sum - max;
if (sum < max) {
cout << "... | #include <iostream>
#include <string>
using namespace std;
int main() {
int l[20] = {};
int n;
cin >> n;
int max, sum = 0;
max = -10000;
for (int i = 0; i < n; i++) {
cin >> l[i];
if (max < l[i]) {
max = l[i];
}
sum = sum + l[i];
}
sum = sum - max;
if (sum <= max) {
cout << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,276 | 936,277 | u077051605 | cpp |
p03136 | #include <stdio.h>
using namespace std;
int N;
int length[10];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &length[i]);
}
int maxLength = 0;
for (int i = 0; i < N; i++) {
if (maxLength < length[i])
maxLength = length[i];
}
int sum = 0;
for (int i = 0; i ... | #include <stdio.h>
using namespace std;
int N;
int length[10];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &length[i]);
}
int maxLength = 0;
for (int i = 0; i < N; i++) {
if (maxLength < length[i])
maxLength = length[i];
}
int sum = 0;
for (int i = 0; i ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 936,281 | 936,282 | u093453891 | cpp |
p03136 | #include <stdio.h>
using namespace std;
int N;
int length[10];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &length[i]);
}
int maxLength = 0;
for (int i = 0; i < N; i++) {
if (maxLength < length[i])
maxLength = length[i];
}
int sum = 0;
for (int i = 0; i ... | #include <stdio.h>
using namespace std;
int N;
int length[10];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &length[i]);
}
int maxLength = 0;
for (int i = 0; i < N; i++) {
if (maxLength < length[i])
maxLength = length[i];
}
int sum = 0;
for (int i = 0; i ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 936,284 | 936,282 | u093453891 | cpp |
p03136 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#def... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#def... | [] | 936,285 | 936,286 | u767543103 | cpp |
p03136 | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, l[15], sum = 0, max;
cin ... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, l[15], sum = 0, max;
cin ... | [
"assignment.add"
] | 936,289 | 936,290 | u373164102 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, sum = 0;
cin >> N;
vector<int> vec;
vec.resize(N);
for (int t = 0; t < N; t++)
cin >> vec[t];
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 2; i++) {
sum += vec[i];
}
cout << (vec[N - 1] < sum ? "Yes" : "No");
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, sum = 0;
cin >> N;
vector<int> vec;
vec.resize(N);
for (int t = 0; t < N; t++)
cin >> vec[t];
sort(vec.begin(), vec.end());
for (int i = 0; i <= N - 2; i++) {
sum += vec[i];
}
cout << (vec[N - 1] < sum ? "Yes" : "No");
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 936,293 | 936,294 | u174509352 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0, b = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
if (l[i] > a)
a = l[i];
else
b += l[i];
}
if (b > a)
cout << "Yes";
else
cout << "No";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0, b = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
if (l[i] > a)
a = l[i];
b += l[i];
}
if (b - a > a)
cout << "Yes";
else
cout << "No";
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.if.condition.change"
] | 936,298 | 936,299 | u249546633 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, i, ans, L, max, sum;
ans = 0;
max = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> L;
sum += L;
if (max < L)
max = L;
}
ans = sum - max;
if (max < ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, i, ans, L, max, sum;
ans = 0;
max = 0;
sum = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> L;
sum += L;
if (max < L)
max = L;
}
ans = sum - max;
if (max < ans)
cout << "Yes" << endl;
else
cout << "No" << ... | [
"assignment.add"
] | 936,302 | 936,303 | u060965067 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int check(int sum, int edge) {
if (edge < sum - edge)
return 1; //できれば1
return 0;
}
int main() {
int n = 0... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int check(int sum, int edge) {
if (edge < sum - edge)
return 1; //できれば1
return 0;
}
int main() {
int n = 0... | [
"call.arguments.change",
"call.arguments.add"
] | 936,305 | 936,306 | u554988565 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], max = 0, keep = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (max < a[i]) {
max = a[i];
keep = i;
}
}
if (sum / 2 <= a[keep]) {
cout << "No";
} else {
cout << "Ye... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], max = 0, keep = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (max < a[i]) {
max = a[i];
keep = i;
}
}
if (sum - a[keep] <= a[keep]) {
cout << "No";
} else {
cout ... | [
"control_flow.branch.if.condition.change"
] | 936,307 | 936,308 | u554988565 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += vec.at(i);
}
if (sum < vec.at(N - 1)) {
cout << "Yes"... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += vec.at(i);
}
if (sum > vec.at(N - 1)) {
cout << "Yes"... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,313 | 936,314 | u895393304 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int vec[n];
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec, vec + n);
int max = vec[n - 1];
int sum = 0;
for (int i = 0; i < n; i++) {
sum = +vec[i];
}
if (max < sum) {
cout << "Yes" << endl;
} e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int vec[n];
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec, vec + n);
int max = vec[n - 1];
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum = sum + vec[i];
}
if (max < sum) {
cout << "Yes" << e... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 936,322 | 936,323 | u800100718 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int vec[n];
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec, vec + n);
int max = vec[n - 1];
int sum = 0;
for (int i = 0; i < n; i++) {
sum = +vec[i];
}
if (max > sum) {
cout << "Yes" << endl;
} e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int vec[n];
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec, vec + n);
int max = vec[n - 1];
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum = sum + vec[i];
}
if (max < sum) {
cout << "Yes" << e... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 936,324 | 936,323 | u800100718 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int vec[n];
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec, vec + n);
int max = vec[n - 1];
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum = +vec[i];
}
if (max > sum) {
cout << "Yes" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int vec[n];
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec, vec + n);
int max = vec[n - 1];
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum = sum + vec[i];
}
if (max < sum) {
cout << "Yes" << e... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 936,325 | 936,323 | u800100718 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<int> l(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
sort(l.begin(), l.end());
for (int i = 0; i < N - 1; i++) {
sum += l[i];
}
if (l[N] < sum)
cout << "Yes" << endl;
else
cout << "N... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<int> l(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
sort(l.begin(), l.end());
for (int i = 0; i < N - 1; i++) {
sum += l[i];
}
if (l[N - 1] < sum)
cout << "Yes" << endl;
else
cout <... | [
"control_flow.branch.if.condition.change"
] | 936,330 | 936,331 | u593555034 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
int s = 0;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && a[j] < v) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = v;
}
... | #include <iostream>
using namespace std;
int main() {
int N;
int s = 0;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && a[j] < v) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = v;
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 936,332 | 936,333 | u169639579 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, N, M, K;
int sum = 0;
int t = 0;
string s, s1;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
for (int i = 0; i < N; i++) {
t = max(t, L.at(i));
sum += L.at(i);
if (t == L.at(i))
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, N, M, K;
int sum = 0;
int t = 0;
string s, s1;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
for (int i = 0; i < N; i++) {
t = max(t, L.at(i));
sum += L.at(i);
if (t == L.at(i))
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,336 | 936,337 | u715253965 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, MAX = 0, sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> L;
sum += L;
MAX = max(MAX, L);
}
if (MAX > (sum - MAX))
cout << "Yes" << endl;
else
cout << "No" << endl;
// cout << ans <<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, MAX = 0, sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> L;
sum += L;
MAX = max(MAX, L);
}
if (MAX < (sum - MAX))
cout << "Yes" << endl;
else
cout << "No" << endl;
// cout << ans <<endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,345 | 936,346 | u355424600 | cpp |
p03136 | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a... | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,347 | 936,348 | u103799157 | cpp |
p03136 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int max = 0;
int l = 0;
int total;
for (int i = 0; i < n; i++) {
cin >> l;
if (max < l) {
max = l;
}
total += l;
}
cout << (total > max * 2 ? "Yes" : "No") << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int max = 0;
int l = 0;
int total = 0;
for (int i = 0; i < n; i++) {
cin >> l;
if (max < l) {
max = l;
}
total += l;
}
cout << (total > max * 2 ? "Yes" : "No") << endl;
} | [
"variable_declaration.value.change"
] | 936,353 | 936,354 | u130834452 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < L.size(); i++) {
cin >> L.at(i);
}
int sum = 0;
int max = 0;
for (int i = 0; i < N; i++) {
if (max <= L.at(i)) {
max = L.at(i);
sum += L.at(i);
} else {
sum... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < L.size(); i++) {
cin >> L.at(i);
}
int sum = 0;
int max = 0;
for (int i = 0; i < N; i++) {
if (max <= L.at(i)) {
max = L.at(i);
sum += L.at(i);
} else {
sum... | [] | 936,355 | 936,356 | u096717230 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
std::sort(L, L + N);
int part_sum = 0;
for (int i = 0; i < N - 1; i++) {
part_sum += L[i];
}
if (part_sum > ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
std::sort(L, L + N);
int part_sum = 0;
for (int i = 0; i < N - 1; i++) {
part_sum += L[i];
}
if (part_sum > ... | [
"control_flow.branch.if.condition.change"
] | 936,357 | 936,358 | u791220701 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a, b, c;
cin >> N;
b = 0;
c = 0;
for (int i = 0; i < N; i++) {
cin >> a;
if (a > b) {
b = a;
} else {
c += a;
}
}
if (c > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a, b, c;
cin >> N;
b = 0;
c = 0;
for (int i = 0; i < N; i++) {
cin >> a;
if (a > b) {
b = a;
}
c += a;
}
if (c - b > b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 936,361 | 936,362 | u167226536 | cpp |
p03136 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int sum = 0;
for (int i = ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int sum = 0;
for (int i = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,365 | 936,366 | u090629957 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0, sum = 0;
for (int i = 0; i < N - 1; i++) {
int L[i];
cin >> L[i];
sum = L[i] + sum;
ans = max(ans, L[i]);
}
if (ans < sum - ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0, sum = 0;
for (int i = 0; i < N; i++) {
int L[i];
cin >> L[i];
sum = L[i] + sum;
ans = max(ans, L[i]);
}
if (ans < sum - ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 936,367 | 936,368 | u389766217 | cpp |
p03136 | #include <bits/stdc++.h>
typedef long long LL;
#define PB push_back
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.PB(x);
}
sort(a.begin(), a.end());
LL s = 0;
for (int i = 0; i < n - 1; i++) {
s += a[i];
}
if (s... | #include <bits/stdc++.h>
typedef long long LL;
#define PB push_back
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.PB(x);
}
sort(a.begin(), a.end());
LL s = 0;
for (int i = 0; i < n - 1; i++) {
s += a[i];
}
if (s... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,374 | 936,375 | u123638189 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int x;
int sum = 0;
int mn = 0;
while (n--) {
cin >> x;
mn = max(x, mn);
sum += x;
}
if (sum - mn > mn)
cout << "YES\n";
else
cout << "NO\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int x;
int sum = 0;
int mn = 0;
while (n--) {
cin >> x;
mn = max(x, mn);
sum += x;
}
if (sum - mn > mn)
cout << "Yes\n";
else
cout << "No\n";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,376 | 936,377 | u488963488 | cpp |
p03136 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
int sum = 0;
int max = 0;
for (auto &x : l) {
cin >> x;
sum += x;
if (max < x)
max = x;
}
if (sum - max > max) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
int sum = 0;
int max = 0;
for (auto &x : l) {
cin >> x;
sum += x;
if (max < x)
max = x;
}
if (sum - max > max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,380 | 936,381 | u342703951 | cpp |
p03136 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, s;
s = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++)
s += a[i];
if (a[n] < s)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int n, s;
s = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++)
s += a[i];
if (a[n - 1] < s)
cout << "Yes" << endl;
else
cout << "No" << endl;
... | [
"control_flow.branch.if.condition.change"
] | 936,382 | 936,383 | u627143908 | cpp |
p03136 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, s;
s = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
sort(a.begin(), a.end());
for (int i = 1; i < n; i++)
s += a[i];
if (a[0] < s)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int n, s;
s = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++)
s += a[i];
if (a[n - 1] < s)
cout << "Yes" << endl;
else
cout << "No" << endl;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flo... | 936,384 | 936,383 | u627143908 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
int max = 0;
int sum = 0;
int L[100];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int j = 0; j < N; j++) {
if (max < L[j]) {
max = L[j];
}
}
for (int k = 0; k < N; k++) {
sum += L[k] - max;
}
if (... | #include <iostream>
using namespace std;
int main() {
int N;
int max = 0;
int sum = 0;
int L[100];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int j = 0; j < N; j++) {
if (max < L[j]) {
max = L[j];
}
}
for (int k = 0; k < N; k++) {
sum += L[k];
}
sum = sum ... | [
"assignment.change"
] | 936,391 | 936,392 | u215633752 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0, sum = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
}
for (int i = 0; i < n; i++) {
a = max(l.at(i), a);
}
for (int i = 0; i < n; i++) {
sum += l.at(i);
}
if (a > sum - a) {
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0, sum = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
}
for (int i = 0; i < n; i++) {
a = max(l.at(i), a);
}
for (int i = 0; i < n; i++) {
sum += l.at(i);
}
if (a < sum - a) {
cout... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,393 | 936,394 | u370447425 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int L_max = 0;
int total = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
L_max = max(L, L_max);
total += L;
}
if (L_max < total)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int L_max = 0;
int total = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
L_max = max(L, L_max);
total += L;
}
if (L_max < total - L_max)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 936,395 | 936,396 | u876404872 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)n); i++)
#define rep1(i, n) for (int i = 1; i <= ((int)n); i++)
typedef long long ll;
int l[15];
int n;
int main() {
while (cin >> n) {
ll sum = 0;
rep(i, n) {
cin >> l[i];
sum += l[i];
}
sort(l, l +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)n); i++)
#define rep1(i, n) for (int i = 1; i <= ((int)n); i++)
typedef long long ll;
int l[15];
int n;
int main() {
while (cin >> n) {
ll sum = 0;
rep(i, n) {
cin >> l[i];
sum += l[i];
}
sort(l, l +... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,397 | 936,398 | u856205835 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> L(n);
int su = 0;
for (int i = 0; i < n; i++) {
cin >> L[i];
su += L[i];
}
sort(L.begin(), L.end());
if (2 * L[n] < su) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> L(n);
int su = 0;
for (int i = 0; i < n; i++) {
cin >> L[i];
su += L[i];
}
sort(L.begin(), L.end());
if (2 * L[n - 1] < su) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 936,410 | 936,411 | u676496404 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> num(N);
int cnt = 0;
for (int i = 0; i < N; i++) {
cin >> num.at(i);
cnt += num.at(i);
}
int maximum = num.at(0);
for (int j = 0; j < N - 1; j++) {
if (num.at(j) < num.at(j + 1)) {
maximum = num.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> num(N);
int cnt = 0;
for (int i = 0; i < N; i++) {
cin >> num.at(i);
cnt += num.at(i);
}
int maximum = num.at(0);
for (int j = 0; j < N - 1; j++) {
if (maximum < num.at(j + 1)) {
maximum = num.at(... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.remove"
] | 936,414 | 936,415 | u495461806 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
int a = 0;
for (int i = 0; i < N - 2; i++) {
a += vec[i];
}
if (vec[N - 1] < a) {
cout << "Yes" << endl;
} e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
int a = 0;
for (int i = 0; i < N - 1; i++) {
a += vec[i];
}
if (vec[N - 1] < a) {
cout << "Yes" << endl;
} e... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 936,416 | 936,417 | u437695457 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
int a = 0;
for (int i = 0; i < N - 1; i++) {
a += vec[i];
}
if (vec[N] < a) {
cout << "Yes" << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
int a = 0;
for (int i = 0; i < N - 1; i++) {
a += vec[i];
}
if (vec[N - 1] < a) {
cout << "Yes" << endl;
} e... | [
"control_flow.branch.if.condition.change"
] | 936,418 | 936,417 | u437695457 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int add = 0;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end(), greater<int>());
for (int i = 1; i < N; i++) {
add += L.at(i);
}
cout << ((L.at(0) >= add) ? "NO" : "YES") <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int add = 0;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end(), greater<int>());
for (int i = 1; i < N; i++) {
add += L.at(i);
}
cout << ((L.at(0) >= add) ? "No" : "Yes") <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,422 | 936,423 | u912048901 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.