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 |
|---|---|---|---|---|---|---|---|
p03137 | #include <bits/stdc++.h>
using namespace std;
#define step(i, s, n, d) for (int i = s; i < n; i += d)
#define FOR(i, s, n) step(i, s, n, 1)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
typedef pair<int, int> P;
int main() {
ll N, M;
cin >> N >> M;
ll x[M], sa[M], res = 0;
rep(i, M) { cin >> x[i]; }
if... | #include <bits/stdc++.h>
using namespace std;
#define step(i, s, n, d) for (int i = s; i < n; i += d)
#define FOR(i, s, n) step(i, s, n, 1)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
typedef pair<int, int> P;
int main() {
ll N, M;
cin >> N >> M;
ll x[M], sa[M], res = 0;
rep(i, M) { cin >> x[i]; }
if... | [
"expression.operation.binary.add"
] | 938,119 | 938,120 | u136468939 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X, dis_X;
for (int i = 0; i < M; i++) {
int element;
cin >> element;
X.push_back(element);
}
if (M == 1) {
cout << 0 << endl;
} else if (N > M) {
cout << 0... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X, dis_X;
for (int i = 0; i < M; i++) {
int element;
cin >> element;
X.push_back(element);
}
if (M == 1) {
cout << 0 << endl;
} else if (N >= M) {
cout << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,145 | 938,146 | u168139048 | cpp |
p03137 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define LARGE 1000000000
#define MOD 100000
int N, M, sum;
int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define LARGE 1000000000
#define MOD 100000
int N, M, sum;
int ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,155 | 938,156 | u657512990 | cpp |
p03137 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x[110000];
int sa[110000];
int min = 0;
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (n >= m)
cout << 0 << endl;
else {
sort(x... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x[110000];
int sa[110000];
int min = 0;
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (n >= m)
cout << 0 << endl;
else {
sort(x... | [] | 938,174 | 938,175 | u850894780 | cpp |
p03137 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 2000000000
#define REP(i, b, n) for (int i = (b); i <... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 2000000000
#define REP(i, b, n) for (int i = (b); i <... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 938,186 | 938,185 | u576712004 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
int X[100000];
int d[100000];
int res = 0;
cin >> N;
cin >> M;
if (N >= M) {
cout << 0;
return 0;
}
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M - 1);
for (int i = 0; i < M - 1; i++) {
d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
int X[100000];
int d[100000];
int res = 0;
cin >> N;
cin >> M;
if (N >= M) {
cout << 0;
return 0;
}
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
for (int i = 0; i < M - 1; i++) {
d[i] ... | [
"expression.operation.binary.remove"
] | 938,207 | 938,208 | u173749724 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> dist(M - 1);
for (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> dist(M - 1);
for (... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 938,217 | 938,218 | u727099903 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
//#define READ_NUMBER(i) scanf("%d",i)
int main() {
int N, M;
cin >> N >> M;
int array[M];
int array_d[M - 1];
int Ans = 0;
if (N >= M) {
cout << "0" << endl;
} else {
for (int i = 0; i < M; i++) {
cin >> array[i];
}
std::sort(array, ar... | #include <bits/stdc++.h>
using namespace std;
//#define READ_NUMBER(i) scanf("%d",i)
int main() {
int N, M;
cin >> N >> M;
int array[M];
int array_d[M - 1];
int Ans = 0;
if (N >= M) {
cout << "0" << endl;
} else {
for (int i = 0; i < M; i++) {
cin >> array[i];
}
std::sort(array, ar... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 938,221 | 938,222 | u796853866 | cpp |
p03137 | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <memory>
#include <sstream>
#include <string>
#include <vector>
#include <limits.h>
using namespace std;
class Hoge {
public:
int add(int a, int b);
static void ABC117B();
static void ABC117C();
static int ABC117C_sub_ans1(int n, int m,... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <memory>
#include <sstream>
#include <string>
#include <vector>
#include <limits.h>
using namespace std;
class Hoge {
public:
int add(int a, int b);
static void ABC117B();
static void ABC117C();
static int ABC117C_sub_ans1(int n, int m,... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 938,248 | 938,249 | u864329440 | cpp |
p03137 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N <= M) {
cout << 0 << endl;
} else {
int X[M];
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
int L[M];
L[0] = 0;
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
} else {
int X[M];
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
int L[M];
L[0] = 0;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,276 | 938,277 | u650243369 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[m];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
if (n >= m) {
cout << 0;
return 0;
}
sort(a, a + n);
int b[m - 1];
for (int i = 0; i < m - 1; i++) {
b[i] = abs(a[i + 1] - a[i]);
}
sort(b,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[m];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
if (n >= m) {
cout << 0;
return 0;
}
sort(a, a + m);
int b[m - 1];
for (int i = 0; i < m - 1; i++) {
b[i] = abs(a[i + 1] - a[i]);
}
sort(b,... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 938,322 | 938,323 | u586143466 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (... | #include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,332 | 938,333 | u229842440 | cpp |
p03137 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int M;
cin >> M;
if (M <= N) {
cout << 0 << endl;
return 0;
}
int *X = new int[M];
int *diff = new int[M - 1];
int sum = 0;
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
fo... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int M;
cin >> M;
if (M <= N) {
cout << 0 << endl;
return 0;
}
int *X = new int[M];
int *diff = new int[M - 1];
int sum = 0;
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
fo... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 938,334 | 938,335 | u007462477 | cpp |
p03137 | /* Accepted. */
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAXN 100006
int n, m;
int X[MAXN], d[MAXN], S;
int main() {
// freopen( "input","r",stdin );
cin >> m >> n;
if (m <= n)
return puts("0"), 0;
for ... | /* Accepted. */
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAXN 100006
int n, m;
int X[MAXN], d[MAXN], S;
int main() {
// freopen( "input","r",stdin );
cin >> m >> n;
if (n <= m)
return puts("0"), 0;
for ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 938,340 | 938,341 | u390140944 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << 1 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> sub;
... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (M <= N) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> sub;
... | [
"literal.number.change",
"io.output.change"
] | 938,354 | 938,355 | u341347211 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
int sum = 0;
for (int i = 0; i < n - 1; ++i)
sum += a[i];
if (sum < a[n - 1])
cout << "No" << endl;
else
cout << "Yes" << endl;... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
int sum = 0;
for (int i = 0; i < n - 1; ++i)
sum += a[i];
if (sum > a[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 938,423 | 938,424 | u146240825 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
int sum = 0;
for (int i = 0; i < n - 1; ++i)
sum += a[i];
if (sum < a[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
int sum = 0;
for (int i = 0; i < n - 1; ++i)
sum += a[i];
if (sum > a[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,425 | 938,424 | u146240825 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
long long sum = 0;
for (int i = 0; i < n - 1; ++i)
sum += a[i];
if (sum < a[n - 1])
cout << "No" << endl;
else
cout << "Y... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
long long sum = 0;
for (int i = 0; i < n - 1; ++i)
sum += a[i];
if (sum <= a[n - 1])
cout << "No" << endl;
else
cout << "... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,426 | 938,427 | u146240825 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
int sum = 0;
for (int i = 0; i < n - 1; ++i)
sum += a[i];
if (sum < a[n - 1])
cout << "No" << endl;
else
cout << "Yes" << endl;... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
long long sum = 0;
for (int i = 0; i < n - 1; ++i)
sum += a[i];
if (sum <= a[n - 1])
cout << "No" << endl;
else
cout << "... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,423 | 938,427 | u146240825 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 938,428 | 938,429 | u640323045 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 938,430 | 938,429 | u640323045 | cpp |
p03136 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int maxx = 0;
while (n--) {
int x;
cin >> x;
sum += x;
maxx = max(maxx, x);
}
if (sum - maxx < maxx) {
cout << "Yes";
} else ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int maxx = 0;
while (n--) {
int x;
cin >> x;
sum += x;
maxx = max(maxx, x);
}
if (sum - maxx > maxx) {
cout << "Yes";
} else ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,431 | 938,432 | u428618452 | cpp |
p03136 | #include <iostream>
int main() {
int N;
std::cin >> N;
int maxL = 0;
int sum = 0;
for (int i = 0; i < N; ++i) {
int L;
std::cin >> L;
maxL = std::max(maxL, L);
sum += L;
}
std::cout << ((sum - maxL > maxL) ? "YES" : "NO") << std::endl;
} | #include <iostream>
int main() {
int N;
std::cin >> N;
int maxL = 0;
int sum = 0;
for (int i = 0; i < N; ++i) {
int L;
std::cin >> L;
maxL = std::max(maxL, L);
sum += L;
}
std::cout << ((sum - maxL > maxL) ? "Yes" : "No") << std::endl;
} | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 938,442 | 938,443 | u264304509 | cpp |
p03136 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 938,448 | 938,449 | u419390395 | cpp |
p03136 | #define __USE_MINGW_ANSI_STDIO 0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
/// 各桁の和
int sumdigit(int x) {
int sum = 0;... | #define __USE_MINGW_ANSI_STDIO 0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
/// 各桁の和
int sumdigit(int x) {
int sum = 0;... | [
"control_flow.branch.if.condition.change"
] | 938,457 | 938,458 | u403848488 | cpp |
p03136 | #include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, t = 0, z = 0;
int l[10];
cin >> n;
if (n >= 3) {
rep {
cin >> l[i];
if (l[i] >= l[i - 1] && i > 0)
t = i;
}
... | #include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, t = 0, z = 0;
int l[10];
cin >> n;
if (n >= 3) {
rep {
cin >> l[i];
if (l[i] >= l[t] && i > 0)
t = i;
}
r... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 938,463 | 938,464 | u767622317 | cpp |
p03136 | #include <algorithm>
#include <cstdio>
using namespace std;
int a[10 + 5];
int main() {
int n;
scanf("%d", &n);
int sum = 0;
int maxn = -1;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
maxn = max(a[i], maxn);
}
if (sum > 2 * maxn)
puts("YES");
else
puts("NO");
r... | #include <algorithm>
#include <cstdio>
using namespace std;
int a[10 + 5];
int main() {
int n;
scanf("%d", &n);
int sum = 0;
int maxn = -1;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
maxn = max(a[i], maxn);
}
if (sum > 2 * maxn)
printf("Yes");
else
printf("No");... | [
"identifier.change",
"call.function.change",
"io.output.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 938,467 | 938,468 | u855248478 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n, l, maxl, all;
int i;
cin >> n;
maxl = 0;
all = 0;
for (i = 0; i < n; i++) {
cin >> l;
if (maxl < l) {
maxl = l;
} else {
all += l;
}
}
if (maxl < all) {
cout << "Yes" << endl;
} else {
cout << "No" << ... | #include <iostream>
using namespace std;
int main() {
int n, l, maxl, all;
int i;
cin >> n;
maxl = 0;
all = 0;
for (i = 0; i < n; i++) {
cin >> l;
if (maxl < l) {
all += maxl;
maxl = l;
} else {
all += l;
}
}
if (maxl < all) {
cout << "Yes" << endl;
} else {
... | [
"assignment.add"
] | 938,469 | 938,470 | u275747032 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int l[10];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int max = l[0];
int sumx = l[0];
for (int i = 1; i < n; i++) {
if (l[i] > max) {
max = l[i];
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int l[10];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int max = l[0];
int sumx = l[0];
for (int i = 1; i < n; i++) {
if (l[i] > max) {
max = l[i];
}
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,475 | 938,476 | u209767598 | cpp |
p03136 | #include <stdio.h>
int main() {
int n = 0;
int l[100] = {0};
int i;
int a = 0;
int sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &l[i]);
if (a > l[i]) {
a = l[i];
}
sum += l[i];
}
sum = sum - a;
if (a < sum) {
printf("Yes");
} else if (a >= sum) {
... | #include <stdio.h>
int main() {
int n = 0;
int l[100] = {0};
int i;
int a = 0;
int sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &l[i]);
if (a < l[i]) {
a = l[i];
}
sum += l[i];
}
sum = sum - a;
if (a < sum) {
printf("Yes");
} else if (a >= sum) {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,481 | 938,482 | u824293895 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n, l[10], max = 0, p, sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
for (int i = 0; i < n; i++) {
if (l[i] > max) {
max = l[i];
p = i;
}
}
l[p] = 0;
for (int i = 0; i < n; i++)
sum += l[i];
if (max > s... | #include <iostream>
using namespace std;
int main() {
int n, l[10], max = 0, p, sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
for (int i = 0; i < n; i++) {
if (l[i] > max) {
max = l[i];
p = i;
}
}
l[p] = 0;
for (int i = 0; i < n; i++)
sum += l[i];
if (max >= ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,483 | 938,484 | u717982428 | cpp |
p03136 | #include <iostream>
using namespace std;
int main(void) {
int N, L, M, S;
cin >> N >> L;
M = L;
S = L;
for (int i = 1; i <= N; i++) {
cin >> L;
S = S + L;
if (L > M) {
M = L;
}
}
S = S - M;
if (S > M) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
re... | #include <iostream>
using namespace std;
int main(void) {
int N, L, M, S;
cin >> N >> L;
M = L;
S = L;
for (int i = 1; i < N; i++) {
cin >> L;
S = S + L;
if (L > M) {
M = L;
}
}
S = S - M;
if (S > M) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
ret... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 938,488 | 938,489 | u813840685 | cpp |
p03136 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, sum = 0, maxa;
int s[10];
cin >> a;
for (int i = 0; i < a; i++)
cin >> s[i];
maxa = 0;
for (int i = 0; i < a; i++)
if (s[i] > s[maxa])
maxa = i;
for (int i = 0; i < a; i++)
if (i != maxa)
sum += s[i... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, sum = 0, maxa;
int s[10];
cin >> a;
for (int i = 0; i < a; i++)
cin >> s[i];
maxa = 0;
for (int i = 0; i < a; i++)
if (s[i] > s[maxa])
maxa = i;
for (int i = 0; i < a; i++)
if (i != maxa)
sum += s[i... | [
"control_flow.branch.if.condition.change"
] | 938,490 | 938,491 | u587326496 | 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);
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum += vec.at(i);
}
sort(vec.begin(), vec.end());
if (vec.at(N) * 2 < sum) {
cout << "Yes" << end... | #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);
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum += vec.at(i);
}
sort(vec.begin(), vec.end());
if (vec.at(N - 1) * 2 < sum) {
cout << "Yes" <<... | [
"control_flow.branch.if.condition.change"
] | 938,494 | 938,495 | u068896454 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n - 1];
int x;
x = 0;
int s;
for (int i = 0; i <= n - 1; ++i) {
cin >> a[i];
}
for (int i = 0; i <= n - 1; ++i) {
x = max(a[i], x);
s = s + a[i];
}
if (s > 2 * x) {
cout << "Yes" <... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n - 1];
int x;
x = 0;
int s;
s = 0;
for (int i = 0; i <= n - 1; ++i) {
cin >> a[i];
}
for (int i = 0; i <= n - 1; ++i) {
x = max(a[i], x);
s = s + a[i];
}
if (s > 2 * x) {
cout <... | [
"assignment.add"
] | 938,498 | 938,499 | u229603190 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main(void) {
int N = 0;
int a[11];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> v(begin(a), end(a));
sort(v.begin(), v.end());
int sum = 0;
int Longest = v[N - 1];
fo... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main(void) {
int N = 0;
int a[11];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> v(begin(a), a + N);
sort(v.begin(), v.end());
int sum = 0;
int Longest = v[N - 1];
for... | [
"call.arguments.change"
] | 938,502 | 938,503 | u969108099 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, a[100], i = 0;
cin >> t;
while (i < t) {
cin >> a[i];
i++;
}
int m = 0, s = 0, f = 0;
for (i = 0; i < t; i++) {
s = 0;
for (m = 0; m < i; m++) {
s = s + a[m];
}
for (m = (i + 1); m < t; m++) {
s = s + a[m];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, a[100], i = 0;
cin >> t;
while (i < t) {
cin >> a[i];
i++;
}
int m = 0, s = 0, f = 0;
for (i = 0; i < t; i++) {
s = 0;
for (m = 0; m < i; m++) {
s = s + a[m];
}
for (m = (i + 1); m < t; m++) {
s = s + a[m];... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,504 | 938,505 | u114412537 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, a[100], i = 0;
cin >> t;
while (i < t) {
cin >> a[t];
i++;
}
int m = 0, s = 0, f = 0;
for (i = 0; i < t; i++) {
s = 0;
for (m = 0; m < i; m++) {
s = s + a[m];
}
for (m = (i + 1); m < t; m++) {
s = s + a[m];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, a[100], i = 0;
cin >> t;
while (i < t) {
cin >> a[i];
i++;
}
int m = 0, s = 0, f = 0;
for (i = 0; i < t; i++) {
s = 0;
for (m = 0; m < i; m++) {
s = s + a[m];
}
for (m = (i + 1); m < t; m++) {
s = s + a[m];... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,506 | 938,505 | u114412537 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, a[100], i = 0;
cin >> t;
while (i < t) {
cin >> a[t];
i++;
}
int m = 0, s = 0, f = 0;
for (i = 0; i < t; i++) {
s = 0;
for (m = 0; m < i; m++) {
s = s + a[i];
}
for (m = (i + 1); m < t; m++) {
s = s + a[i];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, a[100], i = 0;
cin >> t;
while (i < t) {
cin >> a[i];
i++;
}
int m = 0, s = 0, f = 0;
for (i = 0; i < t; i++) {
s = 0;
for (m = 0; m < i; m++) {
s = s + a[m];
}
for (m = (i + 1); m < t; m++) {
s = s + a[m];... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,507 | 938,505 | u114412537 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0, N = 0;
string res = "NO";
cin >> N;
vector<int> C(N);
for (int i = 0; i < N; i++) {
cin >> C.at(i);
}
sort(C.begin(), C.end());
a = C.at(N - 1);
for (int i = 0; i < N - 1; i++) {
b = b + C.at(i);
}
if (a < b) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0, N = 0;
string res = "No";
cin >> N;
vector<int> C(N);
for (int i = 0; i < N; i++) {
cin >> C.at(i);
}
sort(C.begin(), C.end());
a = C.at(N - 1);
for (int i = 0; i < N - 1; i++) {
b = b + C.at(i);
}
if (a < b) {
... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 938,512 | 938,513 | u228108760 | 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 result = 0;
for (int i = 0; i < N - 2; i++) {
result += vec.at(i);
}
if (result > vec.at(N - 1)) {
cout... | #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 result = 0;
for (int i = 0; i < N - 1; i++) {
result += vec.at(i);
}
if (result > vec.at(N - 1)) {
cout... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 938,520 | 938,521 | u705362558 | 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 result = 0;
for (int i = 0; i < N - 1; i++) {
result += vec.at(i);
}
if (result > vec.at(N)) {
cout << ... | #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 result = 0;
for (int i = 0; i < N - 1; i++) {
result += vec.at(i);
}
if (result > vec.at(N - 1)) {
cout... | [
"control_flow.branch.if.condition.change"
] | 938,522 | 938,521 | u705362558 | cpp |
p03136 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9
#define MOD 1000000007
#define l... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9
#define MOD 1000000007
#define l... | [
"literal.string.change",
"io.output.change"
] | 938,523 | 938,524 | u388552482 | cpp |
p03136 | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> L;
cin >> N;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L.push_back(x);
}
int max = 0;
for (int i = 0; i < N; i++) {
if (L[i] > max) {
max = L[i];
}
}
int sum... |
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> L;
cin >> N;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L.push_back(x);
}
int max = 0;
for (int i = 0; i < N; i++) {
if (L[i] > max) {
max = L[i];
}
}
int su... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 938,525 | 938,526 | u679866004 | cpp |
p03136 | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
int L[n], i;
for (i = 0; i < n; i++) {
scanf("%d", &L[i]);
}
int j, k = 0, l;
j = L[0];
for (i = 0; i < n; i++) {
if (j < L[i]) {
j = L[i];
}
}
for (i = 0; i < n; i++) {
k = k + L[i];
}
if (j < k - j) {
put... | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
int L[n], i;
for (i = 0; i < n; i++) {
scanf("%d", &L[i]);
}
int j, k = 0, l;
j = L[0];
for (i = 0; i < n; i++) {
if (j < L[i]) {
j = L[i];
}
}
for (i = 0; i < n; i++) {
k = k + L[i];
}
if (j < k - j) {
put... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 938,532 | 938,533 | u368279380 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int l[101];
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
int max = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
if (max < l[i])
max = l[i];
s... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int l[101];
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
int max = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
if (max < l[i])
max = l[i];
s... | [
"control_flow.branch.if.condition.change"
] | 938,534 | 938,535 | u477651929 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int l[101];
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
int max = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
if (max < l[i])
max = l[i];
s... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int l[101];
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
int max = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
if (max < l[i])
max = l[i];
s... | [
"control_flow.branch.if.condition.change"
] | 938,536 | 938,535 | u477651929 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int l[N];
for (int i = 0; i < N; i++) {
cin >> l[i];
}
int max = l[0];
int sum = 0;
for (int i = 0; i < N; i++) {
if (max < l[i]) {
max = l[i];
}
sum += l[i];
}
sum -= max;
if (max < sum) {
cout << "Y... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int l[N];
for (int i = 0; i < N; i++) {
cin >> l[i];
}
int max = l[0];
int sum = 0;
for (int i = 0; i < N; i++) {
if (max < l[i]) {
max = l[i];
}
sum += l[i];
}
sum -= max;
if (max < sum) {
cout << "Y... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 938,539 | 938,540 | u227379863 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define _CRT_SECURE_NO_WARNINGS
#define ll long long
#define ld long double
using namespace std;
ll a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y,... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define _CRT_SECURE_NO_WARNINGS
#define ll long long
#define ld long double
using namespace std;
ll a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y,... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 938,541 | 938,542 | u261607462 | cpp |
p03136 | #include <bits/stdc++.h>
#define int long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int, int>
using namespace std;
signed main() {
int n, a = 0, b, ma = 0;
cin >> n;
f(i, n) {
cin >> b;
a += b;
ma = max(ma, b);
}
if (a >... | #include <bits/stdc++.h>
#define int long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int, int>
using namespace std;
signed main() {
int n, a = 0, b, ma = 0;
cin >> n;
f(i, n) {
cin >> b;
a += b;
ma = max(ma, b);
}
if (a >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,545 | 938,546 | u259210975 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int n, l[15];
int a, b, sum;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> l[i];
sum += l[i];
if (a < l[i]) {
a = l[i];
b = i;
}
}
sum -= a;
if (a < sum) {
cout << "YES";
} else
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, l[15];
int a, b, sum;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> l[i];
sum += l[i];
if (a < l[i]) {
a = l[i];
b = i;
}
}
sum -= a;
if (a < sum) {
cout << "Yes";
} else
cout << "No";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 938,551 | 938,552 | u030226344 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int n, l[15];
int a, b, sum;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> l[i];
sum += l[i];
if (a < l[i]) {
a = l[i];
b = i;
}
}
sum -= a;
if (a < sum) {
cout << "YES\n";
} else
cout << "NO\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, l[15];
int a, b, sum;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> l[i];
sum += l[i];
if (a < l[i]) {
a = l[i];
b = i;
}
}
sum -= a;
if (a < sum) {
cout << "Yes";
} else
cout << "No";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 938,553 | 938,552 | u030226344 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 938,554 | 938,555 | u096883693 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i, ma, sum;
cin >> n;
ma = -1;
for (i = 0; i < n; i++) {
cin >> x;
ma = max(ma, x);
sum += (x);
}
if (ma < sum - ma)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i, ma, sum = 0;
cin >> n;
ma = -1;
for (i = 0; i < n; i++) {
cin >> x;
ma = max(ma, x);
sum += (x);
}
if (ma < sum - ma)
cout << "Yes";
else
cout << "No";
}
| [
"variable_declaration.value.change"
] | 938,562 | 938,563 | u960410816 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
const int Max = 1e6 + 5;
typedef long long ll;
ll sum;
int a[Max];
int main() {
int n, m;
while (~scanf("%d", &n)) {
sum = 0;
for (int i = 0; i < n; i++)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
const int Max = 1e6 + 5;
typedef long long ll;
ll sum;
int a[Max];
int main() {
int n, m;
while (~scanf("%d", &n)) {
sum = 0;
for (int i = 0; i < n; i++)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 938,566 | 938,567 | u560140313 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
int a[N], n;
int main() {
cin >> n;
int sum = 0;
for (int i = 1; i <= n; ++i)
cin >> a[i], sum += a[i];
for (int i = 1; i <= n; ++i)
if (a[i] > sum - a[i]) {
puts("No");
return 0;
}
puts("Yes");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
int a[N], n;
int main() {
cin >> n;
int sum = 0;
for (int i = 1; i <= n; ++i)
cin >> a[i], sum += a[i];
for (int i = 1; i <= n; ++i)
if (a[i] >= sum - a[i]) {
puts("No");
return 0;
}
puts("Yes");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,568 | 938,569 | u424683247 | 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] < 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" << en... | [
"control_flow.branch.if.condition.change"
] | 938,583 | 938,584 | u911147723 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define mod ((ull)1e9 + 7)
#define MAX ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define mod ((ull)1e9 + 7)
#define MAX ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,585 | 938,586 | u348670055 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long llong;
int main() {
int N, L[11], max_index = 0;
cin >> N;
for (int i = 0; i < N; ++i) {... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long llong;
int main() {
int N, L[11], max_index = 0;
cin >> N;
for (int i = 0; i < N; ++i) {... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 938,591 | 938,592 | u571053945 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<int> p;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
auto hoge = min_element(p.begin(), p.end());
int sum = accumulate(p.begi... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<int> p;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
auto hoge = max_element(p.begin(), p.end());
int sum = accumulate(p.begi... | [
"identifier.change",
"call.function.change"
] | 938,593 | 938,594 | u229579906 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n;
int maxnum = 0;
int sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int tmp;
cin >> tmp;
maxnum = max(maxnum, tmp);
sum += tmp;
}
if (sum - maxnum >= maxnum)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
int maxnum = 0;
int sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int tmp;
cin >> tmp;
maxnum = max(maxnum, tmp);
sum += tmp;
}
if (sum - maxnum > maxnum)
cout << "Yes";
else
cout << "No";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,595 | 938,596 | u536406706 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int a, b[100], c = 0, d;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
d += b[i];
if (c < b[i]) {
c = b[i];
}
}
if (c < d - c) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b[10], c = 0, d = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
d += b[i];
if (c < b[i]) {
c = b[i];
}
}
if (c < d - c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 938,599 | 938,598 | u805131136 | cpp |
p03136 | #include <stdio.h>
using namespace std;
int main() {
int n, l[100];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &l[i]);
}
int max = 0, sum = 0;
for (int i = 0; i < n; i++) {
if (max < l[i])
max = l[i];
sum += l[i];
}
// printf("%d",sum);
printf("%s\n", (sum - max < m... | #include <stdio.h>
using namespace std;
int main() {
int n, l[100];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &l[i]);
}
int max = 0, sum = 0;
for (int i = 0; i < n; i++) {
if (max < l[i])
max = l[i];
sum += l[i];
}
// printf("%d",sum);
printf("%s\n", (sum - max > m... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 938,603 | 938,604 | u906738968 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int sum;
int longest = 0;
for (int i = 0; i < N; ++i) {
int tmp;
cin >> tmp;
sum += tmp;
if (tmp > longest)
longest = tmp;
}
sum -= longest;
if (longest < sum)
cout << "Yes" << endl;
else
cout << "... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
int longest = 0;
for (int i = 0; i < N; ++i) {
int tmp;
cin >> tmp;
sum += tmp;
if (tmp > longest)
longest = tmp;
}
sum -= longest;
if (longest < sum)
cout << "Yes" << endl;
else
cout ... | [
"variable_declaration.value.change"
] | 938,605 | 938,606 | u067267922 | cpp |
p03136 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n, sum = 0;
cin >> ... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n, sum = 0;
cin >> ... | [
"assignment.change"
] | 938,613 | 938,614 | u327242197 | cpp |
p03136 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb emplace_back
#define INF (1e9 + 1)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(al... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb emplace_back
#define INF (1e9 + 1)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(al... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,622 | 938,623 | u864550097 | cpp |
p03137 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#defin... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#defin... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 938,647 | 938,648 | u679071005 | cpp |
p03137 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int X[M];
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N >= M) {
cout << 0;
} else {
sort(X, X + M);
/*
int flag=1;
int tmp=0;
while(flag==1){
flag=0;
for(int... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int X[M];
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N >= M) {
cout << 0;
} else {
sort(X, X + M);
/*
int flag=1;
int tmp=0;
while(flag==1){
flag=0;
for(int... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 938,649 | 938,650 | u842388336 | cpp |
p03137 | #include <stdio.h>
int N, M;
int X[100000], D[99999];
void merge_sort(int *a, int n) {
if (n == 1)
return;
int m = n / 2;
merge_sort(a, m);
merge_sort(a + m, n - m);
static int a_[100000];
for (int i = 0; i < n; i++) {
a_[i] = a[i];
}
int i = 0;
int j = m;
int k = 0;
while (i < m || j < ... | #include <stdio.h>
int N, M;
int X[100000], D[99999];
void merge_sort(int *a, int n) {
if (n <= 1)
return;
int m = n / 2;
merge_sort(a, m);
merge_sort(a + m, n - m);
static int a_[100000];
for (int i = 0; i < n; i++) {
a_[i] = a[i];
}
int i = 0;
int j = m;
int k = 0;
while (i < m || j < ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,692 | 938,693 | u006493569 | cpp |
p03137 | #include "bits/stdc++.h"
using namespace std;
void solve() {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << 0 << endl;
return;
}
vector<int> xs(M), ds(M - 1);
for (int i = 0; i < M; i++) {
cin >> xs[i];
}
sort(xs.begin(), xs.end());
for (int i = 0; i < M - 1; i++) {
ds[i] = xs[i... | #include "bits/stdc++.h"
using namespace std;
void solve() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return;
}
vector<long> xs(M), ds(M - 1);
for (int i = 0; i < M; i++) {
cin >> xs[i];
}
sort(xs.begin(), xs.end());
for (int i = 0; i < M - 1; i++) {
ds[i] = xs[... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"variable_declaration.type.primitive.change"
] | 938,722 | 938,723 | u344412812 | cpp |
p03137 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> diff;
int main() {
cin.tie(0);... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> diff;
int main() {
cin.tie(0);... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 938,762 | 938,763 | u269981094 | cpp |
p03137 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#include <... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#include <... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 938,781 | 938,782 | u318857467 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
// 入力
int N, M;
cin >> N >> M;
ll x[M];
for (int i = 0; i < M;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
// 入力
int N, M;
cin >> N >> M;
ll x[M];
for (int i = 0; i < M;... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 938,795 | 938,796 | u063020782 | cpp |
p03137 | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define debugos cout
#define debug(v) \
{ \
printf("L%d %s > ", __LINE__, #v... | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define debugos cout
#define debug(v) \
{ \
printf("L%d %s > ", __LINE__, #v... | [
"expression.operation.binary.add"
] | 938,799 | 938,800 | u079330987 | cpp |
p03138 | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define all(x) x.begin(), x.end()
#define trav(i, a) for (auto &i : a)
inline int in() {
int x;
scanf("%lld", &x);
return x;
}
int dp[60][2]... | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define all(x) x.begin(), x.end()
#define trav(i, a) for (auto &i : a)
inline int in() {
int x;
scanf("%lld", &x);
return x;
}
int dp[60][2]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 938,813 | 938,814 | u875407613 | cpp |
p03138 | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 938,815 | 938,816 | u224756887 | cpp |
p03138 | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 938,817 | 938,818 | u224756887 | cpp |
p03138 | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 938,821 | 938,820 | u224756887 | cpp |
p03138 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 938,826 | 938,827 | u596311864 | cpp |
p03138 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 938,828 | 938,827 | u596311864 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> cn... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> cn... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 938,848 | 938,849 | u048945791 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
//拡張ユークリッドの互除法
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
//拡張ユークリッドの互除法
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a... | [
"identifier.change"
] | 938,850 | 938,851 | u579165340 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define repr(i, n) for (int i{n}; i-- > 0;)
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector bitcnt(60, 0);
rep(i, n) rep(j, 60) if (a[i] >> j &... | #include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define repr(i, n) for (int i{n}; i-- > 0;)
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector bitcnt(60, 0);
rep(i, n) rep(j, 60) if (a[i] >> j &... | [
"call.arguments.change"
] | 938,852 | 938,853 | u423624748 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define repr(i, n) for (int i{n}; i-- > 0;)
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector bitcnt(60, 0);
rep(i, n) rep(j, 60) if (a[i] >> j &... | #include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define repr(i, n) for (int i{n}; i-- > 0;)
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector bitcnt(60, 0);
rep(i, n) rep(j, 60) if (a[i] >> j &... | [
"expression.operator.compare.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 938,854 | 938,853 | u423624748 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
signed main() {
i64 n, k;
cin >> n >> k;
vector<i64> a(n);
for (auto &ai : a)
cin >> ai;
i64 res = 0;
for (int i = 62; i >= 0; --i) {
if (res | (1LL << i) > k)
continue;
int cnt = 0;
for (auto &ai : a)
cn... | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
signed main() {
i64 n, k;
cin >> n >> k;
vector<i64> a(n);
for (auto &ai : a)
cin >> ai;
i64 res = 0;
for (int i = 62; i >= 0; --i) {
if ((res | (1LL << i)) > k)
continue;
int cnt = 0;
for (auto &ai : a)
... | [
"control_flow.branch.if.condition.change"
] | 938,855 | 938,856 | u423624748 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,865 | 938,866 | u190018920 | cpp |
p03138 | // 嘘解法
// 4 8
// 0 0 8 8
// とかで嘘の答え出す
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
co... | // 嘘解法
// 4 8
// 0 0 8 8
// とかで嘘の答え出す
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
co... | [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 938,870 | 938,871 | u680707192 | cpp |
p03138 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, s, e) for (ll i = s; i >= e; i--)
#define reps(i, s, e) for (ll i = s; i <= e; i++)
#define inf 1e18
#define all(v) v.begin(), v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, s, e) for (ll i = s; i >= e; i--)
#define reps(i, s, e) for (ll i = s; i <= e; i++)
#define inf 1e18
#define all(v) v.begin(), v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 938,879 | 938,880 | u026620445 | cpp |
p03138 | /*
vrrtll==???>;::::~~~~~~......`.`````````````````````...-?777!_.._?7u,~~~::::;>>??=lllttrrzu
rtll==??>>;::::~~~~......`.``````````````````
..J77!`````````...`..._T,~~~~:::;;>??==lttrrv
tll=??>>;:::~~~~......``````````````````..J7^ ` `` ` ``
.,```````...._4,.~~~::;;>>?===lttr l=???>;;::~~~......`````HTSu,.`` `..J7! ... | /*
vrrtll==???>;::::~~~~~~......`.`````````````````````...-?777!_.._?7u,~~~::::;>>??=lllttrrzu
rtll==??>>;::::~~~~......`.``````````````````
..J77!`````````...`..._T,~~~~:::;;>??==lttrrv
tll=??>>;:::~~~~......``````````````````..J7^ ` `` ` ``
.,```````...._4,.~~~::;;>>?===lttr l=???>;;::~~~......`````HTSu,.`` `..J7! ... | [
"control_flow.branch.if.condition.change"
] | 938,886 | 938,887 | u373958718 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | [
"control_flow.branch.if.condition.change"
] | 938,890 | 938,891 | u617380180 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll xorsum(ll x, vector<ll> &a) {
ll sum = 0;
for (ll i : a) {
sum += x ^ i;
}
return sum;
}
ll countBits(ll bit, vector<ll> &a) {
ll count = 0;
for (ll i : a)
if ((1ll << bit) & i)
count++;
return count;
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll xorsum(ll x, vector<ll> &a) {
ll sum = 0;
// cout << x << '\t' << bitset<8>(x) << endl;
for (ll i : a) {
sum += x ^ i;
// cout << i << '\t' << bitset<8>(i) << endl;
}
// cout << "---" << endl;
// cout << sum << '\t' << bitset<8>(... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,892 | 938,893 | u777068250 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | [
"control_flow.branch.if.condition.change",
"literal.number.type.widen.change"
] | 938,896 | 938,897 | u508571192 | cpp |
p03138 | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define W(x, y) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << y;
#else
#define W(x, y)
#endif
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vii vector<pii>
#define vl vector<ll>
#define vll vector<pll>
#de... | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define W(x, y) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << y;
#else
#define W(x, y)
#endif
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vii vector<pii>
#define vl vector<ll>
#define vll vector<pll>
#de... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"literal.number.type.widen.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,898 | 938,899 | u218547786 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)
#define rFOR(i, a, n) for (int(i) = (n)-1; (i) >= (a); (i)--)
#define erFOR(i, a, n) fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)
#define rFOR(i, a, n) for (int(i) = (n)-1; (i) >= (a); (i)--)
#define erFOR(i, a, n) fo... | [
"call.arguments.change"
] | 938,900 | 938,901 | u863044225 | cpp |
p03138 | #include <bits/stdc++.h>
#define err(args...) \
{}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream &operator>>(istre... | #include <bits/stdc++.h>
#define err(args...) \
{}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream &operator>>(istre... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,904 | 938,905 | u957513998 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define MAX 510000
#define rep(i, n) for (ll i = 0; i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define MAX 510000
#define rep(i, n) for (ll i = 0; i... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 938,914 | 938,915 | u242679311 | cpp |
p03138 | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
int main() {
// std::ifstream i... | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
int main() {
// std::ifstream i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 938,916 | 938,917 | u485731913 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,920 | 938,921 | u330661451 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change"
] | 938,922 | 938,923 | u096883693 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
// #undef LOCAL
#ifdef LOCAL
#include "../lib/dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const ll MAX = 1e12;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
// #undef LOCAL
#ifdef LOCAL
#include "../lib/dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const ll MAX = 1e12;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | [] | 938,924 | 938,925 | u147305315 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.