problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03135 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int t, x;
cin >> t >> x;
cout << fixed << setprecision(10) << t / x << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
double t, x;
cin >> t >> x;
cout << fixed << setprecision(10) << t / x << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 935,108 | 935,109 | u054652697 | cpp |
p03135 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << x / t << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 935,110 | 935,111 | u223160139 | cpp |
p03135 | #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;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
static const int giga = pow(10, 9);
// double pi = 3.141592653589793238463;
int main(void) {
double t, x;
cin >> t >> x;
cout << setprecision(6) << x / t << endl;
return 0;
} | #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;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
static const int giga = pow(10, 9);
// double pi = 3.141592653589793238463;
int main(void) {
double t, x;
cin >> t >> x;
cout << setprecision(6) << t / x << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 935,114 | 935,115 | u746560455 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int t, x;
cin >> t >> x;
cout << (double)t / x << endl;
return 0;
} | [
"type_conversion.add"
] | 935,116 | 935,117 | u175948183 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int x, t;
cin >> t >> x;
cout << t / x;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double x, t;
cin >> t >> x;
cout << t / x;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 935,120 | 935,121 | u730043482 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int x, t;
cin >> t >> x;
cout << t * x;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double x, t;
cin >> t >> x;
cout << t / x;
return 0;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 935,122 | 935,121 | u730043482 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int T, X;
cin >> T >> X;
cout << (double)(T / X);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
double T, X;
cin >> T >> X;
cout << T / X;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 935,125 | 935,126 | u809278162 | cpp |
p03135 | #include <cstdio>
int t, x;
double d;
void solve() { d = t / x; }
int main() {
scanf("%d", &t);
scanf("%d", &x);
solve();
printf("%lf\n", d);
return 0;
}
| #include <cstdio>
double t, x;
double d;
void solve() { d = t / x; }
int main() {
scanf("%lf", &t);
scanf("%lf", &x);
solve();
printf("%lf\n", d);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change"
] | 935,127 | 935,128 | u343066621 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int x, t;
int main() {
cin >> t >> x;
cout << t / x << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
double x, t;
int main() {
cin >> t >> x;
cout << t / x << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 935,129 | 935,130 | u577926181 | cpp |
p03135 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int i = k; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define vi vector<int>
#define vii vector<vector<int>>
#define mii map<int, int>
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define ALL(a) (a).begin(), (a).end()
#define pb push_back
//#define int ll
typedef long long ll;
const int md = 1000000007;
const int INF = 1 << 30;
using namespace std;
string yn(bool x) { return x ? "Yes" : "No"; }
int main() {
int t, x;
cin >> t >> x;
double ans = t / x;
printf("%.6f", ans);
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int i = k; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define vi vector<int>
#define vii vector<vector<int>>
#define mii map<int, int>
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define ALL(a) (a).begin(), (a).end()
#define pb push_back
//#define int ll
typedef long long ll;
const int md = 1000000007;
const int INF = 1 << 30;
using namespace std;
string yn(bool x) { return x ? "Yes" : "No"; }
int main() {
double t, x;
cin >> t >> x;
double ans = t / x;
printf("%.6f\n", ans);
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 935,140 | 935,141 | u381585104 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
double a;
cin >> t >> x;
a = x / t;
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
double a;
cin >> t >> x;
a = t / x;
cout << a << endl;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 935,142 | 935,143 | u634802494 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
double a;
cin >> t >> x;
a = x / t;
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
double a;
cin >> t >> x;
a = t / x;
cout << a << endl;
}
| [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove",
"assignment.change"
] | 935,144 | 935,143 | u634802494 | cpp |
p03135 | #include <iostream>
int main() {
int T, X = 0;
std::cin >> T >> X;
std::cout << T / X;
return 0;
} | #include <iostream>
int main() {
double T, X = 0;
std::cin >> T >> X;
std::cout << T / X;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 935,149 | 935,150 | u798514691 | cpp |
p03135 | #include <iomanip>
#include <iostream>
using namespace std;
int X;
int T;
double t;
int main() {
cin >> X >> T;
t = X / T;
cout << fixed << setprecision(10) << t << endl;
}
| #include <iomanip>
#include <iostream>
using namespace std;
int X;
double T;
double t;
int main() {
cin >> X >> T;
t = X / T;
cout << fixed << setprecision(10) << t << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 935,151 | 935,152 | u268314747 | cpp |
p03135 | #include <iomanip>
#include <iostream>
using namespace std;
int X;
int T;
double t;
int main() {
cin >> X >> T;
t = X / T;
cout << setprecision(10) << t << endl;
}
| #include <iomanip>
#include <iostream>
using namespace std;
int X;
double T;
double t;
int main() {
cin >> X >> T;
t = X / T;
cout << fixed << setprecision(10) << t << endl;
}
| [
"variable_declaration.type.primitive.change",
"io.output.change"
] | 935,153 | 935,152 | u268314747 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T;
int X;
cin >> T >> X;
cout << T / X << endl;
} | #include <iostream>
using namespace std;
int main() {
double T;
double X;
cin >> T >> X;
cout << T / X << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 935,156 | 935,157 | u123724799 | cpp |
p03135 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int main() {
int T;
int X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int main() {
double T;
double X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 935,164 | 935,165 | u635329504 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int s, t;
cin >> s >> t;
cout << double(s / t) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int s, t;
cin >> s >> t;
cout << double(s) / double(t) << endl;
return 0;
} | [
"call.arguments.change",
"call.add"
] | 935,170 | 935,171 | u190234543 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int s, t;
cin >> s >> t;
cout << float(s / t) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int s, t;
cin >> s >> t;
cout << double(s) / double(t) << endl;
return 0;
} | [
"call.function.change",
"io.output.change",
"call.arguments.change",
"call.add"
] | 935,172 | 935,171 | u190234543 | cpp |
p03135 | #include <bits/stdc++.h>
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
double answer;
answer = m / n;
cout << answer << endl;
} | #include <bits/stdc++.h>
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
double m, n;
cin >> m >> n;
double answer;
answer = m / n;
cout << answer << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 935,186 | 935,187 | u132284673 | cpp |
p03135 | #include <bits/stdc++.h>
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
double answer;
answer = m / n;
cout << answer << endl;
} | #include <bits/stdc++.h>
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
double m, n;
cin >> m >> n;
double answer;
answer = m / n;
cout << answer << endl;
} | [
"variable_declaration.type.primitive.change"
] | 935,186 | 935,188 | u132284673 | cpp |
p03135 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
cout << a / b << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
double a, b;
cin >> a >> b;
cout << a / b << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 935,189 | 935,190 | u776194115 | cpp |
p03135 | #include <stdio.h>
int main(void) {
int a, b;
double time;
scanf("%d", &a);
scanf("%d", &b);
time = a / b;
printf("%lf\n", time);
return 0;
} | #include <stdio.h>
int main(void) {
float a, b;
float time;
scanf("%f", &a);
scanf("%f", &b);
time = a / b;
printf("%f", time);
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.remove"
] | 935,193 | 935,194 | u180133008 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
double ans;
cin >> T >> X;
ans = T / X;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int T, X;
double ans;
cin >> T >> X;
ans = T * 10000 / X;
cout << ans / 10000 << endl;
}
| [
"assignment.change"
] | 935,195 | 935,196 | u041282550 | cpp |
p03135 | #include <iostream>
using namespace std;
int main(void) {
int T, X;
cin >> T >> X;
double A;
A = T / X;
cout << A << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
double T, X;
cin >> T >> X;
double A;
A = T / X;
cout << A << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 935,213 | 935,214 | u813840685 | cpp |
p03135 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int T, X;
cin >> T >> X;
double t = T / X;
cout << t << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
double T, X;
cin >> T >> X;
double t = T / X;
cout << t << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 935,215 | 935,216 | u551373727 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
printf("%f\n", x / y);
} | #include <iostream>
using namespace std;
int main() {
double x, y;
cin >> x >> y;
printf("%f\n", x / y);
} | [
"variable_declaration.type.primitive.change"
] | 935,219 | 935,220 | u454087021 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
printf("%f|n", x / y);
} | #include <iostream>
using namespace std;
int main() {
double x, y;
cin >> x >> y;
printf("%f\n", x / y);
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 935,221 | 935,220 | u454087021 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
int main() {
int t, x;
std::cin >> t >> x;
std::cout << t / x << std::endl;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
int main() {
double t, x;
std::cin >> t >> x;
std::cout << t / x << std::endl;
} | [
"variable_declaration.type.primitive.change"
] | 935,224 | 935,225 | u953553082 | cpp |
p03135 | #include "bits/stdc++.h"
using namespace std;
int main() {
int t, x;
double ans;
cin >> t >> x;
ans = t / x;
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int t, x;
double ans;
cin >> t >> x;
ans = ((double)t) / x;
cout << ans << endl;
return 0;
} | [] | 935,226 | 935,227 | u217511406 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T;
cin >> X;
cout << T / X << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T;
cin >> X;
cout << T / X << endl;
} | [
"variable_declaration.type.primitive.change"
] | 935,228 | 935,229 | u068896454 | cpp |
p03135 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
int ans = T / X;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 935,230 | 935,231 | u240031669 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e+17;
const ll MODcdf = 998244353;
int main() {
ll a, b;
cin >> a >> b;
cout << a / b << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e+17;
const ll MODcdf = 998244353;
int main() {
double a, b;
cin >> a >> b;
cout << a / b << endl;
} | [
"variable_declaration.type.change"
] | 935,232 | 935,233 | u119345557 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e+17;
const ll MODcdf = 998244353;
int main() {
ll a, b;
cin >> a >> b;
cout << a * b << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e+17;
const ll MODcdf = 998244353;
int main() {
double a, b;
cin >> a >> b;
cout << a / b << endl;
} | [
"variable_declaration.type.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 935,234 | 935,233 | u119345557 | cpp |
p03135 | #include <iostream>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
double x, y;
cin >> x >> y;
float ans = y / x;
cout << ans << endl;
} | #include <iostream>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
double x, y;
cin >> x >> y;
float ans = x / y;
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 935,237 | 935,238 | u483156389 | cpp |
p03135 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
float t, x;
cin >> t >> x;
cout << fixed << setprecision(10) << t * x << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
float t, x;
cin >> t >> x;
cout << fixed << setprecision(10) << t / x << '\n';
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 935,242 | 935,243 | u009579822 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int T, X;
cin >> T >> X;
cout << sqrt(T / X) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
}
| [
"variable_declaration.type.primitive.change",
"call.remove",
"call.arguments.change"
] | 935,246 | 935,247 | u319234342 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 935,248 | 935,247 | u319234342 | cpp |
p03135 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
#define ANS(ans) cout << (ans) << endl;
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
typedef vector<int> VI;
typedef pair<int, int> P;
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
struct MyStruct {
int idx, a, b, pl;
};
bool comp(const MyStruct &s, const MyStruct &t) {
if (s.pl != t.pl)
return s.pl > t.pl; // 降順
return s.idx < t.idx;
}
int main() {
int t, x;
cin >> t >> x;
double ans;
ans = t / x;
ANS(ans);
return 0;
}
| // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
#define ANS(ans) cout << (ans) << endl;
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
typedef vector<int> VI;
typedef pair<int, int> P;
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
struct MyStruct {
int idx, a, b, pl;
};
bool comp(const MyStruct &s, const MyStruct &t) {
if (s.pl != t.pl)
return s.pl > t.pl; // 降順
return s.idx < t.idx;
}
int main() {
int t, x;
cin >> t >> x;
double ans;
ans = t * 1.0 / x;
ANS(ans);
return 0;
}
| [
"assignment.change"
] | 935,254 | 935,255 | u922018373 | cpp |
p03135 | #include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b;
cout << a / b << endl;
}
| #include <iostream>
using namespace std;
int main()
{
float a, b, c;
cin >> a >> b;
cout << a / b << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 935,258 | 935,259 | u791146764 | cpp |
p03135 | #include <stdio.h>
int main() {
double a, b;
while (scanf("%lf%lf", &a, &b) != EOF) {
printf("%.10llf\n", a / b);
}
return 0;
} | #include <stdio.h>
int main() {
double a, b;
while (scanf("%lf%lf", &a, &b) != EOF) {
printf("%.10lf\n", a / b);
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 935,260 | 935,261 | u073500051 | cpp |
p03135 | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main(void) {
float T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 935,262 | 935,263 | u760391419 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T;
int X;
cin >> T >> X;
cout << T / X << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double T;
double X;
cin >> T >> X;
cout << T / X << endl;
} | [
"variable_declaration.type.primitive.change"
] | 935,266 | 935,267 | u036531287 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << (double)T / X;
} | [
"type_conversion.add"
] | 935,280 | 935,281 | u565172542 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
long double x, t;
cin >> x >> t;
cout << setprecision(15) << (t / x) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long double x, t;
cin >> t >> x;
cout << setprecision(15) << (t / x) << endl;
} | [
"expression.operation.binary.remove"
] | 935,282 | 935,283 | u196875870 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T;
int X;
cin >> T >> X;
double A;
A = T / X;
cout << A << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double T;
double X;
cin >> T >> X;
double A;
A = T / X;
cout << A << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 935,297 | 935,298 | u554990639 | cpp |
p03135 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int x, t;
cin >> t >> x;
float tim = float(x) / float(t);
cout << tim;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int x, t;
cin >> t >> x;
float tim = float(t) / float(x);
cout << tim;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 935,299 | 935,300 | u387480576 | cpp |
p03135 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
float A, B, C, D, E, F;
string S, Sa, Sb, Sc;
long long int V[100000];
long long int X[100000];
typedef pair<double, int> Pi;
Pi N[100000] = {};
int main() {
cin >> A >> B;
cout << B / A << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
float A, B, C, D, E, F;
string S, Sa, Sb, Sc;
long long int V[100000];
long long int X[100000];
typedef pair<double, int> Pi;
Pi N[100000] = {};
int main() {
cin >> A >> B;
cout << A / B << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 935,308 | 935,309 | u109792330 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t, x;
double s;
cin >> t >> x;
s = t / x;
cout << s << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double t, x;
double s;
cin >> t >> x;
s = t / x;
cout << s << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 935,312 | 935,313 | u896807328 | cpp |
p03135 | #include <iostream>
#include <stdio.h>
int main() {
int T, X;
scanf("%d %d", T, X);
std::cout << T / X << std::endl;
}
| #include <iostream>
#include <stdio.h>
int main() {
float T, X;
scanf("%f %f", &T, &X);
std::cout << T / X << std::endl;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"expression.operation.unary.reference.add"
] | 935,314 | 935,315 | u761353760 | cpp |
p03135 | #include <stdio.h>
int main() {
double t = 0;
double x = 0;
double a = 0;
scanf("%f %f", &t, &x);
printf("%f", t / x);
} | #include <stdio.h>
int main() {
double t = 0;
double x = 0;
double a = 0;
scanf("%lf %lf", &t, &x);
printf("%lf", (double)t / x);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 935,318 | 935,319 | u824293895 | cpp |
p03135 | #include <iostream>
int main() {
int T, X;
std::cin >> T >> X;
std::cout << T / X << std::endl;
return 0;
} | #include <iostream>
int main() {
double T, X;
std::cin >> T >> X;
std::cout << T / X << std::endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 935,322 | 935,323 | u892351900 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double A = T / X;
cout << A << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double A = T / X;
cout << A << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 935,324 | 935,325 | u916256067 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
int A = T / X;
cout << A << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double A = T / X;
cout << A << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 935,326 | 935,325 | u916256067 | cpp |
p03135 | #include "bits/stdc++.h"
using namespace std;
int main() {
int T, X;
double B;
cin >> T;
cin >> X;
B = T / X;
cout << B;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
double T, X;
double B;
cin >> T >> X;
B = T / X;
cout << B;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 935,327 | 935,328 | u541156409 | cpp |
p03135 | #include "bits/stdc++.h"
using namespace std;
int main() {
int T, X;
double B;
cin >> T >> X;
B = T / X;
cout << B;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
double T, X;
double B;
cin >> T >> X;
B = T / X;
cout << B;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 935,329 | 935,328 | u541156409 | cpp |
p03135 | #include "bits/stdc++.h"
using namespace std;
int main() {
int T, X;
double B;
cin >> T >> X;
B = X * T;
cout << B;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
double T, X;
double B;
cin >> T >> X;
B = T / X;
cout << B;
return 0;
} | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove",
"assignment.change"
] | 935,330 | 935,328 | u541156409 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t, x;
double dt, dx;
cin >> t;
cin >> x;
dt = t;
dx = x;
cout << (t / x) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int t, x;
double dt, dx;
cin >> t;
cin >> x;
dt = t;
dx = x;
cout << (dt / dx) << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 935,331 | 935,332 | u275747032 | cpp |
p03136 | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
sort(a.begin(), a.end());
int sum = 0;
rep(i, n - 1) { sum += a.at(i); }
if (sum > a.at(n)) {
cout << "Yes";
} else {
"No";
}
} | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
sort(a.begin(), a.end());
int sum = 0;
rep(i, n - 1) { sum += a.at(i); }
if (sum > a.at(n - 1)) {
cout << "Yes";
} else {
cout << "No";
}
} | [
"control_flow.branch.if.condition.change",
"io.output.change"
] | 935,352 | 935,353 | u921532128 | cpp |
p03136 | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
sort(a.begin(), a.end());
int sum = 0;
rep(i, n - 1) { sum += a.at(i); }
if (sum > a.at(n - 1)) {
cout << "Yes";
} else {
"No";
}
} | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
sort(a.begin(), a.end());
int sum = 0;
rep(i, n - 1) { sum += a.at(i); }
if (sum > a.at(n - 1)) {
cout << "Yes";
} else {
cout << "No";
}
} | [
"io.output.change"
] | 935,354 | 935,353 | u921532128 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
multiset<int> L;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L.insert(x);
}
int longest = *L.rbegin();
L.erase(*L.rbegin());
int other_sum = accumulate(L.begin(), L.end(), 0);
if (other_sum > longest) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
multiset<int> L;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L.insert(x);
}
int longest = *L.rbegin();
L.erase(L.find(*L.rbegin()));
int other_sum = accumulate(L.begin(), L.end(), 0);
if (other_sum > longest) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"call.arguments.add",
"call.arguments.change"
] | 935,355 | 935,356 | u180824420 | cpp |
p03136 | #include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; ++i)
cin >> L[i];
int MAX = 0;
int sum = 0;
for (int i = 0; i < N; ++i) {
MAX = max(MAX, L[i]);
sum += L[i];
}
if (MAX > sum - MAX)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; ++i)
cin >> L[i];
int MAX = 0;
int sum = 0;
for (int i = 0; i < N; ++i) {
MAX = max(MAX, L[i]);
sum += L[i];
}
if (MAX < sum - MAX)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,362 | 935,363 | u108484707 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int cnt = 0;
int goukei = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
cnt = max(cnt, L);
goukei += L;
}
if (cnt < goukei) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int cnt = 0;
int goukei = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
cnt = max(cnt, L);
goukei += L;
}
if (cnt < goukei - cnt) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,404 | 935,405 | u237390401 | 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 sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += l.at(i);
}
if (sum < l.at(n - 1)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #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 sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += l.at(i);
}
if (sum > l.at(n - 1)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,406 | 935,407 | u231354686 | 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 mx = *max_element(A.begin(), A.end());
int sum = accumulate(A.begin(), A.end(), 0L);
cout << ((mx > sum - mx) ? "Yes" : "No") << "\n";
} | #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 mx = *max_element(A.begin(), A.end());
int sum = accumulate(A.begin(), A.end(), 0L);
cout << ((mx < sum - mx) ? "Yes" : "No") << "\n";
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 935,412 | 935,413 | u045289115 | 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);
}
int sum = 0;
for (int i = 0; i < n; ++i) {
sum += l.at(i);
}
sort(l.begin(), l.end());
int max = l.at(n - 1);
if (sum > max)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #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);
}
int sum = 0;
for (int i = 0; i < n; ++i) {
sum += l.at(i);
}
sort(l.begin(), l.end());
int max = l.at(n - 1);
if (sum - max > max)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 935,414 | 935,415 | u864785784 | cpp |
p03136 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> L;
int max = -1;
int idx = 0;
cin >> N;
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
if (L[i] > max) {
max = L[i];
idx = i;
}
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (i == idx) {
continue;
}
sum += L[i];
}
if (sum > max) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> L;
int max = -1;
int idx = 0;
cin >> N;
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
if (L[i] > max) {
max = L[i];
idx = i;
}
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (i == idx) {
continue;
}
sum += L[i];
}
if (sum > max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,428 | 935,429 | u211355761 | cpp |
p03136 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> L;
int max = 1;
int idx = 0;
cin >> N;
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
if (L[i] > max) {
max = L[i];
idx = i;
}
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (i == idx) {
continue;
}
sum += L[i];
}
if (sum > max) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> L;
int max = -1;
int idx = 0;
cin >> N;
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
if (L[i] > max) {
max = L[i];
idx = i;
}
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (i == idx) {
continue;
}
sum += L[i];
}
if (sum > max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"expression.operation.unary.arithmetic.add",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,430 | 935,429 | u211355761 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ll = long long;
using ld = long double;
using d = double;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
ll sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += a[i];
}
if (a[n] < sum)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ll = long long;
using ld = long double;
using d = double;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
ll sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += a[i];
}
if (a[n - 1] < sum)
cout << "Yes";
else
cout << "No";
} | [
"control_flow.branch.if.condition.change"
] | 935,445 | 935,446 | u476305001 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n, max = 0, sum = 0;
cin >> n;
int a;
for (int i = 0; i < n; ++i) {
cin >> a;
sum += a;
max = (a > max) ? a : max;
}
if (max < (sum - max)) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, max = 0, sum = 0;
cin >> n;
int a;
for (int i = 0; i < n; ++i) {
cin >> a;
sum += a;
max = (a > max) ? a : max;
}
if (max < (sum - max)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,447 | 935,448 | u079243139 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l[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" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l[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" << endl;
else
cout << "No" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,451 | 935,452 | u528258842 | cpp |
p03136 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N, 1);
int sum = 0;
for (int i = 0; i < N; i++) {
int n;
cin >> n;
L.at(i) = n;
sum += L.at(i);
}
int j = 0;
for (int i = 0; i < N; i++) {
if (L.at(i) >= (sum - L.at(i))) {
j += 1;
}
}
if (j > 0) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N, 1);
int sum = 0;
for (int i = 0; i < N; i++) {
int n;
cin >> n;
L.at(i) = n;
sum += L.at(i);
}
int j = 0;
for (int i = 0; i < N; i++) {
if (L.at(i) >= (sum - L.at(i))) {
j += 1;
}
}
if (j > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,453 | 935,454 | u718535592 | cpp |
p03136 | #include <bits/stdc++.h>
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
using namespace std;
long long maxv = 1e9;
int main() {
int N;
cin >> N;
int A;
int maxi = INT_MIN;
int total;
for (int i = 0; i < N; i++) {
cin >> A;
total += A;
if (A > maxi) {
maxi = A;
}
}
if (total - maxi > maxi) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
using namespace std;
long long maxv = 1e9;
int main() {
int N;
cin >> N;
int A;
int maxi = INT_MIN;
int total = 0;
for (int i = 0; i < N; i++) {
cin >> A;
total += A;
if (A > maxi) {
maxi = A;
}
}
if (total - maxi > maxi) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"variable_declaration.value.change"
] | 935,455 | 935,456 | u747032676 | cpp |
p03136 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
int main() {
int n;
int lm = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
sum += l;
lm = max(lm, l);
}
if (lm * 2 < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
int main() {
int n;
cin >> n;
int lm = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
sum += l;
lm = max(lm, l);
}
if (lm * 2 < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [] | 935,457 | 935,458 | u156778176 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define Z class
// OTHER
// xの二乗を返す (関数テンプレート版)
template <typename T> T square(T x) { return x * x; }
template <class T> T GCD(T a, T b) {
T r;
while (a)
r = b, b = a, a = r % a;
return b;
}
template <class T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
// loop
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
// vector
#define ALL(x) x.begin(), x.end()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end()); // erase same elements
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
// input
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T> void MACRO_VAR_Scan(T &t) { std::cin >> t; }
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &...rest) {
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
// output
template <typename T> void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A> void pr(A a) {
cout << a;
ln;
}
template <Z A, Z B> void pr(A a, B b) { cout << a << ' '; }
double ans = 0;
bool check = 0;
bool boo = 0;
string s, t;
int N = 3;
vector<int> v(N);
double a, b, c, d, n, m, k = 0;
int x = 0, y = 0;
int sum;
char ch;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * *
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * * cout << (conditon ? (result: == 1 ): (==0)) << endl; <- output
// result of if long long 型が表せる値の上限はおよそ 9 × 10＾18 です．
int main() {
INIT;
cin >> n;
rep(i, n) {
cin >> a;
sum += a;
m = max(a, m);
}
pr(sum - m > m ? Yes() : No());
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define Z class
// OTHER
// xの二乗を返す (関数テンプレート版)
template <typename T> T square(T x) { return x * x; }
template <class T> T GCD(T a, T b) {
T r;
while (a)
r = b, b = a, a = r % a;
return b;
}
template <class T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
// loop
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
// vector
#define ALL(x) x.begin(), x.end()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end()); // erase same elements
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
// input
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T> void MACRO_VAR_Scan(T &t) { std::cin >> t; }
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &...rest) {
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
// output
template <typename T> void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A> void pr(A a) {
cout << a;
ln;
}
template <Z A, Z B> void pr(A a, B b) { cout << a << ' '; }
double ans = 0;
bool check = 0;
bool boo = 0;
string s, t;
int N = 3;
vector<int> v(N);
double a, b, c, d, n, m, k = 0;
int x = 0, y = 0;
int sum;
char ch;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * *
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * * cout << (conditon ? (result: == 1 ): (==0)) << endl; <- output
// result of if long long 型が表せる値の上限はおよそ 9 × 10＾18 です．
int main() {
INIT;
cin >> n;
rep(i, n) {
cin >> a;
sum += a;
m = max(a, m);
}
if (sum - m > m)
Yes();
else
No();
return 0;
}
| [
"call.arguments.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 935,464 | 935,465 | u506464494 | cpp |
p03136 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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 sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += vec[i];
}
bool res = false;
if (sum >= vec[N - 1]) {
res = true;
}
if (res) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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 sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += vec[i];
}
bool res = false;
if (sum > vec[N - 1]) {
res = true;
}
if (res) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,479 | 935,480 | u838276016 | cpp |
p03136 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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 sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += vec[i];
}
bool res = true;
if (sum >= vec[N - 1]) {
res = false;
}
if (res) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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 sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += vec[i];
}
bool res = false;
if (sum > vec[N - 1]) {
res = true;
}
if (res) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"misc.opposites",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 935,481 | 935,480 | u838276016 | cpp |
p03136 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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 sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += vec[i];
}
bool res = true;
if (sum >= vec[N - 1]) {
res = false;
}
if (res) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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 sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += vec[i];
}
bool res = false;
if (sum > vec[N - 1]) {
res = true;
}
if (res) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"misc.opposites",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 935,482 | 935,480 | u838276016 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
for (int j = 0; j < N - 1; j++) {
X += vec[j];
}
if (X > vec[N]) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
for (int j = 0; j < N - 1; j++) {
X += vec[j];
}
if (X > vec[N - 1]) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 935,483 | 935,484 | u187772564 | cpp |
p03136 | #include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main() {
ll n, a, Max = -1, sum = 0;
cin >> n;
rep(i, n) {
cin >> a;
sum += a;
Max = max(a, Max);
}
if (sum - Max < Max)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main() {
ll n, a, Max = -1, sum = 0;
cin >> n;
rep(i, n) {
cin >> a;
sum += a;
Max = max(a, Max);
}
if (sum - Max > Max)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,485 | 935,486 | u236585484 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
int longest_L = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
longest_L = max(longest_L, L[i]);
}
if (3 * longest_L < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
int longest_L = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
longest_L = max(longest_L, L[i]);
}
if (2 * longest_L < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 935,503 | 935,504 | u260525363 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n, l, s = 0, m = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> l;
s += l;
m = max(m, l);
}
if (m <= s - m) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, l, s = 0, m = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> l;
s += l;
m = max(m, l);
}
if (m < s - m) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,505 | 935,506 | u529371621 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n, l, s = 0, m = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> l;
s += l;
m = max(m, s);
}
if (m <= s - m) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, l, s = 0, m = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> l;
s += l;
m = max(m, l);
}
if (m < s - m) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,507 | 935,506 | u529371621 | cpp |
p03136 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(all(l));
int restsum = 0;
for (int i = 1; i < n; i++) {
restsum += l[i];
}
if (l[0] < restsum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
//昇順でソート
sort(all(l));
int restsum = 0;
for (int i = 0; i < n - 1; i++) {
restsum += l[i];
}
if (l[n - 1] < restsum) {
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... | 935,508 | 935,509 | u412057008 | cpp |
p03136 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
#define double long long
using namespace std;
signed main() {
int N;
cin >> N;
int A;
bool X = false;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(L.begin(), L.end());
reverse(L.begin(), L.end());
for (int i = 1; i < N; i++) {
A += L[i];
if (L[0] > A) {
X = true;
}
}
if (X == true) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
#define double long long
using namespace std;
signed main() {
int N;
cin >> N;
int A = 0;
bool X = false;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(L.begin(), L.end());
reverse(L.begin(), L.end());
for (int i = 1; i < N; i++) {
A += L[i];
if (L[0] < A) {
X = true;
}
}
if (X == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 935,510 | 935,511 | u580593895 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int mx = 0;
int sm = 0;
for (int i = 0; i < n; ++i) {
int buf;
cin >> buf;
sm += buf;
mx = max(mx, buf);
}
if (mx > sm - mx) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int mx = 0;
int sm = 0;
for (int i = 0; i < n; ++i) {
int buf;
cin >> buf;
sm += buf;
mx = max(mx, buf);
}
if (mx < sm - mx) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,522 | 935,523 | u313043608 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
#define F first
#define S second
const double PI = acos(-1);
// fixed<<setprecision(11)<<
int main() {
int n;
cin >> n;
vector<int> L(n);
rep(i, n) cin >> L[i];
sort(L.begin(), L.end());
int sum = 0;
rep(i, n - 1) sum += L[i];
if (L[n] < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
#define F first
#define S second
const double PI = acos(-1);
// fixed<<setprecision(11)<<
int main() {
int n;
cin >> n;
vector<int> L(n);
rep(i, n) cin >> L[i];
sort(L.begin(), L.end());
int sum = 0;
rep(i, n - 1) sum += L[i];
if (L[n - 1] < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 935,526 | 935,527 | u884476319 | cpp |
p03136 | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j, k
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(), a.end())
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗*/ ll llpow(ll x, ll n) {
ll i, ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*階乗*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) / fact(r) / fact(n - r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
double ans = 0;
llfor; ///////////////////////////////////////////////////////////
int main() {
ll n;
sc(n);
vector<ll> l;
ll a;
rep(i, 0, n) {
sc(a);
push(l, a);
}
sort(l);
ll sum = 0;
rep(i, 0, n - 1) {
sum += l[i];
// cout<<sum<<" "<<l[i]<<endl;
}
if (sum > l[n])
py;
else
pn;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j, k
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(), a.end())
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗*/ ll llpow(ll x, ll n) {
ll i, ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*階乗*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) / fact(r) / fact(n - r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
double ans = 0;
llfor; ///////////////////////////////////////////////////////////
int main() {
ll n;
sc(n);
vector<ll> l;
ll a;
rep(i, 0, n) {
sc(a);
push(l, a);
}
sort(l);
ll sum = 0;
rep(i, 0, n - 1) {
sum += l[i];
// cout<<sum<<" "<<l[i]<<" "<<l[n-1]<<endl;
}
if (sum > l[n - 1])
py;
else
pn;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 935,540 | 935,541 | u006717664 | cpp |
p03136 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
int main() {
int N;
vector<int> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
int A = 0;
for (int i = 0; i < N - 1; i++) {
A += S.at(i);
}
if (A > S.at(N - 1))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
int A = 0;
for (int i = 0; i < N - 1; i++) {
A += S.at(i);
}
if (A > S.at(N - 1))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [] | 935,542 | 935,543 | u083447997 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
#define int64 long long
using namespace std;
int main() {
int64 nn, tmp, sum = 0;
cin >> nn;
vector<int64> ll(nn);
for (int64 ii = 0; ii < nn; ii++) {
cin >> tmp;
ll[ii] = tmp;
sum += tmp;
}
sort(ll.begin(), ll.end());
sum -= ll[nn - 1];
if (sum >= ll[nn - 1]) {
puts("No");
} else {
puts("Yes");
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
#define int64 long long
using namespace std;
int main() {
int64 nn, tmp, sum = 0;
cin >> nn;
vector<int64> ll(nn);
for (int64 ii = 0; ii < nn; ii++) {
cin >> tmp;
ll[ii] = tmp;
sum += tmp;
}
sort(ll.begin(), ll.end());
sum -= ll[nn - 1];
if (sum > ll[nn - 1]) {
puts("Yes");
} else {
puts("No");
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 935,544 | 935,545 | u834987206 | cpp |
p03136 | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
int main() {
int N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
long ans = 0;
for (int i = 0; i < N - 1; i++) {
ans += L.at(i);
}
if (L.at(N - 1) < ans)
cout << "Yes";
else
cout << "No";
}
| #include <bits/stdc++.h>
#include <cmath>
#include <stdio.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());
long ans = 0;
for (int i = 0; i < N - 1; i++) {
ans += L.at(i);
}
if (L.at(N - 1) < ans)
cout << "Yes";
else
cout << "No";
}
| [] | 935,548 | 935,549 | u125669112 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9 + 7;
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
// int dx[4] = {0,1,0,-1}, dy[4] = {-1,0,1,0};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll digitsum(ll a) {
ll x = 0;
while (a > 0) {
x += a % 10;
a /= 10;
}
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, max = 0, sum = 0;
cin >> n;
rep(i, n) {
int tmp;
cin >> tmp;
if (tmp > max)
max = tmp;
sum = sum + tmp;
}
if (max >= (sum - max))
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9 + 7;
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
// int dx[4] = {0,1,0,-1}, dy[4] = {-1,0,1,0};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll digitsum(ll a) {
ll x = 0;
while (a > 0) {
x += a % 10;
a /= 10;
}
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, max = 0, sum = 0;
cin >> n;
rep(i, n) {
int tmp;
cin >> tmp;
if (tmp > max)
max = tmp;
sum = sum + tmp;
}
if (max >= (sum - max))
cout << "No" << endl;
else
cout << "Yes" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,552 | 935,553 | u166736517 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1000000007;
template <class T> void print(const T &t) { cout << t << endl; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll n;
cin >> n;
vi l(n);
ll sum = 0;
rep(i, n) {
cin >> l[i];
sum += l[i];
}
sort(all(l));
sum -= l[n - 1];
if (l[n - 1] > sum) {
print("Yes");
} else {
print("No");
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1000000007;
template <class T> void print(const T &t) { cout << t << endl; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll n;
cin >> n;
vi l(n);
ll sum = 0;
rep(i, n) {
cin >> l[i];
sum += l[i];
}
sort(all(l));
sum -= l[n - 1];
if (l[n - 1] < sum) {
print("Yes");
} else {
print("No");
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,556 | 935,557 | u201304522 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int mx = 0, sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
mx = max(mx, a);
}
if (mx < sum - mx)
puts("Yes");
else
puts("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int mx = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
mx = max(mx, a);
}
if (mx < sum - mx)
puts("Yes");
else
puts("No");
return 0;
}
| [] | 935,562 | 935,563 | u385825353 | 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[i];
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int a = 0;
for (int i = 1; i < N; i++) {
a += A[i];
}
if (a > A[0]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int a = 0;
for (int i = 1; i < N; i++) {
a += A[i];
}
if (a > A[0]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [] | 935,564 | 935,565 | u896053584 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
int main() {
ll n;
cin >> n;
vec l(n);
for (ll i = 0; i < n; i++) {
cin >> l[i];
}
sort(l.rbegin(), l.rend());
ll sum = 0;
for (ll i = 1; i < n; i++) {
sum += l[i];
}
if (sum < l[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
int main() {
ll n;
cin >> n;
vec l(n);
for (ll i = 0; i < n; i++) {
cin >> l[i];
}
sort(l.rbegin(), l.rend());
ll sum = 0;
for (ll i = 1; i < n; i++) {
sum += l[i];
}
if (sum > l[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,568 | 935,569 | u718758485 | cpp |
p03136 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
int sum;
int tmp;
int l;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < v.size(); i++) {
cin >> l;
v.at(i) = l;
}
sum = accumulate(v.begin(), v.end(), 0);
tmp = *max_element(v.begin(), v.end());
if (tmp > sum - tmp) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
int sum;
int tmp;
int l;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < v.size(); i++) {
cin >> l;
v.at(i) = l;
}
sum = accumulate(v.begin(), v.end(), 0);
tmp = *max_element(v.begin(), v.end());
if (tmp >= sum - tmp) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,570 | 935,571 | u549383771 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n;
cin >> n;
vl l(n);
rep(i, n) { cin >> l[i]; }
sort(l.begin(), l.end());
ll sum = 0;
rep(i, n - 1) { sum += l[i]; }
if (sum > l[n]) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n;
cin >> n;
vl l(n);
rep(i, n) { cin >> l[i]; }
sort(l.begin(), l.end());
ll sum = 0;
rep(i, n - 1) { sum += l[i]; }
if (sum > l[n - 1]) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 935,572 | 935,573 | u328811800 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
int main() {
int n, l, sum = 0, mx = 0;
cin >> n;
rep(i, n) {
cin >> l;
sum += l;
mx = max(mx, l);
}
if (sum < mx * 2) {
cout << "No";
} else {
cout << "Yes";
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
int main() {
int n, l, sum = 0, mx = 0;
cin >> n;
rep(i, n) {
cin >> l;
sum += l;
mx = max(mx, l);
}
if (sum <= mx * 2) {
cout << "No";
} else {
cout << "Yes";
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,574 | 935,575 | u983711104 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
int main() {
int n, l, sum = 0, mx = 0;
cin >> n;
rep(i, n) {
cin >> l;
sum += l;
mx = max(mx, l);
}
if (sum < mx * 2) {
cout << "Yes";
} else {
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
int main() {
int n, l, sum = 0, mx = 0;
cin >> n;
rep(i, n) {
cin >> l;
sum += l;
mx = max(mx, l);
}
if (sum <= mx * 2) {
cout << "No";
} else {
cout << "Yes";
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 935,576 | 935,575 | u983711104 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.