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 |
|---|---|---|---|---|---|---|---|
p03032 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int inf = 2e9;
int main() {
cin.tie(0);
ios::sync_wit... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int inf = 2e9;
int main() {
cin.tie(0);
ios::sync_wit... | [
"call.add",
"call.arguments.add"
] | 843,574 | 843,575 | u407614884 | cpp |
p03032 | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | [
"expression.operation.binary.add"
] | 843,578 | 843,579 | u539339654 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; ++i) {
cin >> V[i];
}
long long res = 0;
for (int r = 0; r < K + 1; ++r) {
for (int l = 0; l < K - r + 1; ++l) {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; ++i) {
cin >> V[i];
}
long long res = 0;
for (int r = 0; r < K + 1; ++r) {
for (int l = 0; l < K - r + 1; ++l) {
... | [
"control_flow.loop.for.condition.change"
] | 843,580 | 843,581 | u979452668 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K, V[55];
cin >> N >> K;
rep(i, N) cin >> V[i];
int ans = 0;
for (int L = 0; L < min(K, N); L++) {
for (int R = 0; R < min(K - L, N - L); R++) {
if (L + R == 0)
continue;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K, V[55];
cin >> N >> K;
rep(i, N) cin >> V[i];
int ans = 0;
for (int L = 0; L <= min(K, N); L++) {
for (int R = 0; R <= min(K - L, N - L); R++) {
if (L + R == 0)
contin... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,582 | 843,583 | u730946954 | cpp |
p03032 | #pragma region include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i =... | #pragma region include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i =... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 843,592 | 843,593 | u435935167 | cpp |
p03032 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, K;
cin >> n >> K;
vector<int> a(n);
for (auto &e : a) {
cin >> e;
}
int ans = 0;
for (int k = 1; k <= K; k++) {
... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, K;
cin >> n >> K;
vector<int> a(n);
for (auto &e : a) {
cin >> e;
}
int ans = 0;
for (int k = 1; k <= K; k++) {
... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 843,612 | 843,613 | u882868478 | cpp |
p03032 | #include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
int main() {
int N, K;
cin >> N >> K;
vector<int> D(N);
for (int i = 0; i < N; i++)
... | #include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
int main() {
int N, K;
cin >> N >> K;
vector<int> D(N);
for (int i = 0; i < N; i++)
... | [
"variable_declaration.value.change",
"expression.operation.unary.remove"
] | 843,616 | 843,617 | u326966549 | cpp |
p03032 | #include "algorithm"
#include "iostream"
#include "set"
#include "vector"
using namespace std;
vector<int> v;
int n, k;
int check(int d) {
int best = 0;
for (int l = 0; l <= d; ++l) {
set<int> st;
for (int i = 0; i < l; ++i) {
st.insert(v[i]);
}
int r = d - l;
for (int i = 0; i < r; ++... | #include "algorithm"
#include "iostream"
#include "set"
#include "vector"
using namespace std;
vector<int> v;
int n, k;
int check(int d) {
int best = 0;
for (int l = 0; l <= d; ++l) {
multiset<int> st;
for (int i = 0; i < l; ++i) {
st.insert(v[i]);
}
int r = d - l;
for (int i = 0; i < ... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,623 | 843,624 | u753391427 | cpp |
p03032 | #include "algorithm"
#include "iostream"
#include "set"
#include "vector"
using namespace std;
vector<int> v;
int n, k;
int check(int d) {
int best = 0;
for (int l = 0; l <= d; ++l) {
set<int> st;
for (int i = 0; i < l; ++i) {
st.insert(v[i]);
}
int r = d - l;
for (int i = 0; i < r; ++... | #include "algorithm"
#include "iostream"
#include "set"
#include "vector"
using namespace std;
vector<int> v;
int n, k;
int check(int d) {
int best = 0;
for (int l = 0; l <= d; ++l) {
multiset<int> st;
for (int i = 0; i < l; ++i) {
st.insert(v[i]);
}
int r = d - l;
for (int i = 0; i < ... | [
"variable_declaration.type.change"
] | 843,625 | 843,624 | u753391427 | cpp |
p03032 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
in... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,626 | 843,627 | u194385557 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> V;
for (int i = 0; i < N; ++i) {
int v;
cin >> v;
V.push_back(v);
}
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> V;
for (int i = 0; i < N; ++i) {
int v;
cin >> v;
V.push_back(v);
}
... | [
"call.add",
"call.arguments.change"
] | 843,636 | 843,637 | u740836226 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
vector<int64_t> vs(n);
for (auto &v : vs) {
cin >> v;
}
int64_t ans = -(1LL << 60);
for (int i = 0; i <= n; i++) {
for (int j = 0; i + j <= n; j++) {
if (k < i + j) {
continue;
}
ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
vector<int64_t> vs(n);
for (auto &v : vs) {
cin >> v;
}
int64_t ans = -(1LL << 60);
for (int i = 0; i <= n; i++) {
for (int j = 0; i + j <= n; j++) {
if (k < i + j) {
continue;
}
ve... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 843,642 | 843,643 | u017167684 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int j[100];
int n;
int getAns(int k, int sum, priority_queue<int, vector<int>, greater<int>> q) {
while (k > 0 && q.size() > 0 && q.top() < 0) {
sum -= q.top();
q.pop();
k--;
}
return sum;
}
int moveRight(int k, int sum,
priority_queue<in... | #include <bits/stdc++.h>
using namespace std;
int j[100];
int n;
int getAns(int k, int sum, priority_queue<int, vector<int>, greater<int>> q) {
while (k > 0 && q.size() > 0 && q.top() < 0) {
sum -= q.top();
q.pop();
k--;
}
return sum;
}
int moveRight(int k, int sum,
priority_queue<in... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 843,648 | 843,649 | u219398458 | cpp |
p03032 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#defin... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#defin... | [] | 843,650 | 843,651 | u051493691 | cpp |
p03032 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long l... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long l... | [
"control_flow.loop.for.condition.change"
] | 843,654 | 843,655 | u369508054 | cpp |
p03032 | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i ... | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 843,656 | 843,657 | u712630284 | cpp |
p03032 | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
u... | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
u... | [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.add"
] | 843,664 | 843,665 | u158253287 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
//関数
// main関数
int main() {
//入力
long N, K;
cin >> N >> K;
vector<long> V(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
//計算
long ans = -1000000000000, Ls = 0;
multiset<long> Lm;
for (int L = 0; L <= N; L++) {
if (L > 0) {
Ls += V.a... | #include <bits/stdc++.h>
using namespace std;
//関数
// main関数
int main() {
//入力
long N, K;
cin >> N >> K;
vector<long> V(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
//計算
long ans = -1000000000000, Ls = 0;
multiset<long> Lm;
for (int L = 0; L <= N; L++) {
if (L > 0) {
Ls += V.a... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 843,666 | 843,667 | u968365254 | cpp |
p03032 | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int ans = 0;
for (int l = 0; l < n; l++) {
for (int r = l; r < n; r++) {
int rest_count = k - l - (n - r);
... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int ans = 0;
for (int l = 0; l <= n; l++) {
for (int r = l; r <= n; r++) {
int rest_count = k - l - (n - r);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,672 | 843,673 | u508729896 | cpp |
p03032 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int a[101], b[101];
int main() {
int n, k, i, j, p, q;
int ans = 0;
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= k; i++) {
for (j = 0; j <= i; j++) {
int l = j, r = i - j, cnt = 0, res = 0;
for (p =... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int a[101], b[101];
int main() {
int n, k, i, j, p, q;
int ans = 0;
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= k && i <= n; i++) {
for (j = 0; j <= i; j++) {
int l = j, r = i - j, cnt = 0, res = 0;
... | [
"control_flow.loop.for.condition.change"
] | 843,690 | 843,691 | u327887532 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long mod = 1e9 + 7;
int main(void) {
int n, k;
cin >> n >> k;
vector... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long mod = 1e9 + 7;
int main(void) {
int n, k;
cin >> n >> k;
vector... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 843,694 | 843,695 | u543657872 | cpp |
p03032 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#includ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#includ... | [
"control_flow.branch.if.condition.change"
] | 843,702 | 843,703 | u545022164 | cpp |
p03032 | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | [
"control_flow.branch.if.condition.change",
"call.add",
"expression.operator.change"
] | 843,706 | 843,707 | u578751202 | cpp |
p03032 | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 843,708 | 843,707 | u578751202 | cpp |
p03032 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define ... | [
"expression.operation.binary.add"
] | 843,711 | 843,712 | u973997867 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
signed main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (auto &&u : v)
cin >> u;
int tmp, ans = 0ll;
vector<int> val;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
signed main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (auto &&u : v)
cin >> u;
int tmp, ans = 0ll;
vector<int> val;
... | [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.add"
] | 843,719 | 843,718 | u731175398 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
int ans = 0;
for (int i = 0; i <= k; ++i) {
for (int j = 0; j <= i; ++j) {
vector<int> vv;
for (int l = 0; l < i - j; ++l)
vv.push_back... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
int ans = 0;
for (int i = 0; i <= min(n, k); ++i) {
for (int j = 0; j <= i; ++j) {
vector<int> vv;
for (int l = 0; l < i - j; ++l)
vv.p... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 843,722 | 843,723 | u640800420 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(c) (c).begin(), (c).end()
const int MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int mx = 0;
int limit = min(n, k);
for (int i = 0; i < limit; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(c) (c).begin(), (c).end()
const int MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int mx = 0;
int limit = min(n, k);
for (int i = 0; i <= limit;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 843,726 | 843,727 | u540491484 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = 0;
for (int h = 0; h < n; h++) {
vector<int> u;
for (int i = 0; i < h; i++)
u.push_back(v[i]);
for (int t = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = 0;
for (int h = 0; h < n; h++) {
vector<int> u;
for (int i = 0; i < h; i++)
u.push_back(v[i]);
for (int t = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 843,732 | 843,733 | u754651673 | cpp |
p03032 | #include "bits/stdc++.h"
#define REP(i, a, b) for (int i = (a); i <= (b); ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define FORV(a, A) for (auto &a : A)
using namespace std;
using ll = long long;
int N, K;
int cost(int cl, int cr, int amari, vector<ll> V) {
vector<ll> A(cl + cr);
int n = 0;
f... | #include "bits/stdc++.h"
#define REP(i, a, b) for (int i = (a); i <= (b); ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define FORV(a, A) for (auto &a : A)
using namespace std;
using ll = long long;
int N, K;
int cost(int cl, int cr, int amari, vector<ll> V) {
vector<ll> A(cl + cr);
int n = 0;
f... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 843,734 | 843,735 | u747184036 | cpp |
p03032 | #include <bits/stdc++.h>
#define range(i, l, r) for (int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint ... | #include <bits/stdc++.h>
#define range(i, l, r) for (int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint ... | [
"variable_declaration.type.change"
] | 843,736 | 843,737 | u069838609 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N, K;
int V[51];
vector<int> q;
cin >> N >> K;
for (int i = 0; i < N; i++) {
int V;
cin >> V;
q.push_back(V);
}
int a = min(N, K);
int max = 0;
for (int i = 0; i < a;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N, K;
int V[51];
vector<int> q;
cin >> N >> K;
for (int i = 0; i < N; i++) {
int V;
cin >> V;
q.push_back(V);
}
int a = min(N, K);
int max = 0;
for (int i = 0; i <= a... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,744 | 843,745 | u993229809 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#de... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#de... | [
"expression.operation.binary.add"
] | 843,746 | 843,747 | u430494842 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,751 | 843,752 | u187878098 | cpp |
p03032 | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
in... | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,759 | 843,760 | u320491590 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#de... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#de... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 843,765 | 843,766 | u991974907 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#de... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#de... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 843,767 | 843,766 | u991974907 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <ty... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <ty... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.add",
"call.arguments.add"
] | 843,782 | 843,783 | u745250049 | cpp |
p03032 | #include <bits/stdc++.h>
#include <stdlib.h>
#include <time.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#define pb push_back
#define mp make_pair
#define IOS \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#include <stdlib.h>
#include <time.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#define pb push_back
#define mp make_pair
#define IOS \
ios_base::sync_with_stdio(0); ... | [
"control_flow.branch.if.condition.change"
] | 843,784 | 843,785 | u634201987 | cpp |
p03032 | #include <bits/stdc++.h>
#include <stdlib.h>
#include <time.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#define pb push_back
#define mp make_pair
#define IOS \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#include <stdlib.h>
#include <time.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#define pb push_back
#define mp make_pair
#define IOS \
ios_base::sync_with_stdio(0); ... | [
"control_flow.branch.if.condition.change"
] | 843,786 | 843,787 | u634201987 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 843,790 | 843,789 | u665172861 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 843,792 | 843,789 | u665172861 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
#define pie 3.141592653589793238462... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
#define pie 3.141592653589793238462... | [
"call.arguments.change"
] | 843,793 | 843,794 | u277153875 | cpp |
p03032 | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#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 _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#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 _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | [
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 843,808 | 843,809 | u292813062 | cpp |
p03032 | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#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 _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#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 _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 843,810 | 843,809 | u292813062 | cpp |
p03032 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// const int INF = (1 << 30) - 1;
// const ll LL_INF = (1LL << 6... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// const int INF = (1 << 30) - 1;
// const ll LL_INF = (1LL << 6... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 843,823 | 843,824 | u751964641 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
int main() {
int N, K;
cin >> N >> K;
vi v;
int tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
v.push_back(tmp);
}
vi score;
for (int k = 0; k <= K; k++) {
for (int l = 0;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
int main() {
int N, K;
cin >> N >> K;
vi v;
int tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
v.push_back(tmp);
}
vi score;
for (int k = 0; k <= min(K, N); k++) {
for (in... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 843,825 | 843,826 | u269804060 | cpp |
p03032 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int N, K;
vector<int> V;
int main() {
cin >> N >> K;
for (int i = 0; i < ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int N, K;
vector<int> V;
int main() {
cin >> N >> K;
for (int i = 0; i < ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 843,831 | 843,832 | u450733728 | cpp |
p03032 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector... | [
"expression.operation.binary.remove"
] | 843,848 | 843,849 | u783675879 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites"
] | 843,860 | 843,861 | u833393891 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 843,860 | 843,862 | u833393891 | cpp |
p03032 | /*
C++
encoding:UTF-8
Modified: <26/May/2019 07:23:02 PM>
✪ H4WK3yE乡
Mohd. Farhan Tahir
Indian Institute Of Information Technol... | /*
C++
encoding:UTF-8
Modified: <26/May/2019 07:25:51 PM>
✪ H4WK3yE乡
Mohd. Farhan Tahir
Indian Institute Of Information Technol... | [
"expression.operation.binary.add"
] | 843,865 | 843,866 | u907206514 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<long> V;
for (int i = 0; i < N; i++) {
long v;
cin >> v;
V.push_back(v);
}
for (int i = 0; i < N; i++) {
V.push_back(V[i]);
}
long ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<long> V;
for (int i = 0; i < N; i++) {
long v;
cin >> v;
V.push_back(v);
}
for (int i = 0; i < N; i++) {
V.push_back(V[i]);
}
long ans = 0;
... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 843,876 | 843,877 | u500092662 | cpp |
p03032 |
#include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <string>
using namespace std;
int value[50];
int n;
int k;
long long dopick(int pickup) {
long long maxvalue = 0;
long long valuebox[100];
for (int left = 0; left <= pickup; left++) {
int right = pickup - left;
long ... |
#include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <string>
using namespace std;
int value[50];
int n;
int k;
long long dopick(int pickup) {
long long maxvalue = 0;
long long valuebox[100];
for (int left = 0; left <= pickup; left++) {
int right = pickup - left;
long ... | [
"control_flow.loop.for.condition.change",
"call.arguments.add",
"call.arguments.change"
] | 843,881 | 843,882 | u845284573 | cpp |
p03032 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
deque<int> jdqOrig(n), jdq;
for (auto &j : jdqOrig)
... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
deque<int> jdqOrig(n), jdq;
for (auto &j : jdqOrig)
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,887 | 843,888 | u967138082 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n, K;
cin >> n >> K;
// int a, b, c; cin >> a >> b >> c;
vector<ll> vs;
for (int i = 0; i < n; i++) {
ll v;
cin >> v;
vs.push_back(v);
}
ll maxs = 0;
int mk, mt, mtl;
for (int k = 0; k <= K; k++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n, K;
cin >> n >> K;
// int a, b, c; cin >> a >> b >> c;
vector<ll> vs;
for (int i = 0; i < n; i++) {
ll v;
cin >> v;
vs.push_back(v);
}
ll maxs = 0;
int mk, mt, mtl;
for (int k = 0; k <= K; k++)... | [
"control_flow.loop.for.condition.change"
] | 843,893 | 843,892 | u218356514 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
int odp = 0;
for (int i = 1; i <= k; ++i) {
for (int p = 0; p <= n; ++p) {
for (int... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
int odp = 0;
for (int i = 1; i <= k; ++i) {
for (int p = 0; p <= n; ++p) {
for (int... | [
"identifier.change",
"expression.operation.binary.change"
] | 843,902 | 843,903 | u535773602 | cpp |
p03032 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long int> v;
for (int i = 0; i < n; i++) {
long long int tmp;
cin >> tmp;
v.push_back(tmp);
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long int> v;
for (int i = 0; i < n; i++) {
long long int tmp;
cin >> tmp;
v.push_back(tmp);
}
... | [
"control_flow.loop.for.condition.change"
] | 843,921 | 843,922 | u231458241 | cpp |
p03032 | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,939 | 843,940 | u186294233 | cpp |
p03032 | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"expression.operation.unary.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,941 | 843,940 | u186294233 | cpp |
p03032 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author toshibablack
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author toshibablack
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include ... | [
"expression.operation.binary.remove"
] | 843,942 | 843,943 | u585670083 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> void cmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, cl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> void cmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, cl... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 843,944 | 843,945 | u366644013 | cpp |
p03032 | #include <algorithm>
#include <cstdio>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k, ans = 0;
scanf("%d%d", &n, &k);
vector<int> v(n);
for (int i = 0; i < n; ++i)
scanf("%d", &v.at(i));
for (int l = 0; l <= min(n, k); ++l)
for (int r = 0; r <= min(n, k - l); ++r) {... | #include <algorithm>
#include <cstdio>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k, ans = 0;
scanf("%d%d", &n, &k);
vector<int> v(n);
for (int i = 0; i < n; ++i)
scanf("%d", &v.at(i));
for (int l = 0; l <= min(n, k); ++l)
for (int r = 0; r <= min(n, k) - l; ++r) {... | [
"call.arguments.change"
] | 843,954 | 843,955 | u359025499 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | [
"variable_declaration.type.change"
] | 843,956 | 843,957 | u242679311 | cpp |
p03032 | #include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <i... | #include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <i... | [
"control_flow.branch.if.condition.change"
] | 843,965 | 843,966 | u913008467 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int ans = 0;
int N, K;
cin >> N >> K;
vector<int> V(N);
for (auto &_V : V)
cin >> _V;
for (int hold = 0; hold <= K; hold++) {
int return_num = K - hold;
for (int left = 0; left <= hold; left++) {
int right = hold - left;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int ans = 0;
int N, K;
cin >> N >> K;
vector<int> V(N);
for (auto &_V : V)
cin >> _V;
for (int hold = 0; hold <= min(N, K); hold++) {
int return_num = K - hold;
for (int left = 0; left <= hold; left++) {
int right = hold - le... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 843,968 | 843,969 | u251945221 | cpp |
p03032 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 843,982 | 843,983 | u528720841 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1LL << 60;
for (int a = 0; a <= min(N, K); a++) {
for (int b = 0; b <= min(N, K) - a; b++) {
vector<int> vec;
lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1LL << 60;
for (int a = 0; a <= min(N, K); a++) {
for (int b = 0; b <= min(N, K) - a; b++) {
vector<int> vec;
lo... | [
"expression.unary.arithmetic.add"
] | 843,989 | 843,990 | u904123392 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1LL << 60;
for (int a = 0; a <= min(N, K); a++) {
for (int b = 0; b <= min(N, K) - a; b++) {
vector<int> vec;
lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1LL << 60;
for (int a = 0; a <= min(N, K); a++) {
for (int b = 0; b <= min(N, K) - a; b++) {
vector<int> vec;
lo... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.unary.arithmetic.add"
] | 843,991 | 843,990 | u904123392 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1LL << 60;
for (int a = 0; a <= min(N, K); a++) {
for (int b = 0; b <= min(N, K) - a; b++) {
vector<int> vec;
lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1LL << 60;
for (int a = 0; a <= min(N, K); a++) {
for (int b = 0; b <= min(N, K) - a; b++) {
vector<int> vec;
lo... | [
"expression.unary.arithmetic.add"
] | 843,989 | 843,992 | u904123392 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1LL << 60;
for (int a = 0; a <= min(N, K); a++) {
for (int b = 0; b <= min(N, K) - a; b++) {
vector<int> vec;
lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1LL << 60;
for (int a = 0; a <= min(N, K); a++) {
for (int b = 0; b <= min(N, K) - a; b++) {
vector<int> vec;
lo... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.unary.arithmetic.add"
] | 843,991 | 843,992 | u904123392 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define N 200010
#define ll long long
const ll mod = 1e9 + 7;
int n, k;
int a[55];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
ll ans = 0;
for (int i = 0; i <= min(k, n); i++) {
for (int j = 0; j <= min(k - i, ... | #include <bits/stdc++.h>
using namespace std;
#define N 200010
#define ll long long
const ll mod = 1e9 + 7;
int n, k;
int a[55];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
ll ans = 0;
for (int i = 0; i <= min(k, n); i++) {
for (int j = 0; i + j <= min(k, ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 843,993 | 843,994 | u820628270 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 1000000000
#define MOD 1000000007
typedef... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 1000000000
#define MOD 1000000007
typedef... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 843,995 | 843,996 | u677400065 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef long long int lli;
using namespace std;
typedef pair<int, int> ii;
// #define int long long int
inline void swap(int &a, in... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef long long int lli;
using namespace std;
typedef pair<int, int> ii;
// #define int long long int
inline void swap(int &a, in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,999 | 844,000 | u576106056 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define T true
#define F false
using namespace std;
int main(void) {
int i, l, r, num, k, lim, sum, ans = 0;
cin >> num >> k;
vector<int> d(num);
lim = min(num, k);
for (i = 0; i < num; i++)
scanf("%d", &d[i]);
for (l = 0; l <... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define T true
#define F false
using namespace std;
int main(void) {
int i, l, r, num, k, lim, sum, ans = 0;
cin >> num >> k;
vector<int> d(num);
lim = min(num, k);
for (i = 0; i < num; i++)
scanf("%d", &d[i]);
for (l = 0; l <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 844,004 | 844,005 | u583354994 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n, k, r;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n, k, r;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v... | [
"expression.operation.binary.add"
] | 844,009 | 844,010 | u732502311 | cpp |
p03032 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //__gnu_pbds::gp_hash_table<int, int> table;
// priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int,
// int>>> pq; //min heap
typedef int OwO;
typedef double UwU;
#define int long long
#define double long double
#define INF 1000000... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //__gnu_pbds::gp_hash_table<int, int> table;
// priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int,
// int>>> pq; //min heap
typedef int OwO;
typedef double UwU;
#define int long long
#define double long double
#define INF 1000000... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 844,011 | 844,012 | u769471034 | cpp |
p03032 | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#... | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 844,013 | 844,014 | u713333397 | cpp |
p03032 | // https://atcoder.jp/contests/abc128/tasks/abc128_d
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef priority_queue<int, vector<int>, greater<int>> PQ;
#define INF (1e9)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i,... | // https://atcoder.jp/contests/abc128/tasks/abc128_d
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef priority_queue<int, vector<int>, greater<int>> PQ;
#define INF (1e9)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i,... | [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change"
] | 844,015 | 844,016 | u858107870 | cpp |
p03032 | // https://atcoder.jp/contests/abc128/tasks/abc128_d
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef priority_queue<int, vector<int>, greater<int>> PQ;
#define INF (1e9)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i,... | // https://atcoder.jp/contests/abc128/tasks/abc128_d
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef priority_queue<int, vector<int>, greater<int>> PQ;
#define INF (1e9)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i,... | [
"control_flow.loop.for.condition.change"
] | 844,017 | 844,016 | u858107870 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int add(vector<int> &a) {
int sum = 0;
for (int i = 0; i < (int)a.size(); i++) {
sum += a[i];
}
return sum;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int add(vector<int> &a) {
int sum = 0;
for (int i = 0; i < (int)a.size(); i++) {
sum += a[i];
}
return sum;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 0; i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 844,020 | 844,021 | u711524482 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | [
"expression.operation.binary.remove",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 844,033 | 844,032 | u001566280 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 844,034 | 844,032 | u001566280 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans = 0, tmp, tmp2;
priority_queue<int, vector<int>, greater<int>> desc;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i <= K; i++) {
for (int j = 0; j <= K; j++) {
tmp = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans = 0, tmp, tmp2;
priority_queue<int, vector<int>, greater<int>> desc;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i <= K; i++) {
for (int j = 0; j <= K; j++) {
tmp = 0;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 844,037 | 844,038 | u074306398 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans = 0, tmp, tmp2;
priority_queue<int, vector<int>, greater<int>> desc;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
// for(int i=0; i<=K && i<N; i++){
// for(int j=0; j<=K&& j<N; j++){
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans = 0, tmp, tmp2;
priority_queue<int, vector<int>, greater<int>> desc;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i <= K && i <= N; i++) {
for (int j = 0; j <= K && j <= N; j... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 844,039 | 844,040 | u074306398 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans = 0, tmp, tmp2;
priority_queue<int, vector<int>, greater<int>> desc;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
// for(int i=0; i<=K && i<N; i++){
// for(int j=0; j<=K&& j<N; j++){
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans = 0, tmp, tmp2;
priority_queue<int, vector<int>, greater<int>> desc;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i <= K && i <= N; i++) {
for (int j = 0; j <= K && j <= N; j... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 844,041 | 844,040 | u074306398 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef l... | [
"control_flow.continue.remove",
"control_flow.break.add",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 844,042 | 844,043 | u130834452 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef l... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 844,044 | 844,043 | u130834452 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, k;
vector<ll> v;
int main() {
cin >> n >> k;
v.resize(n);
for (int i = 0; i < n; i++)
scanf("%Ld", &v[i]);
ll res = -(1e18);
for (int i = 0; i <= k; i++) {
for (int j = 0; j <= i; j++) {
vector<ll> getj;
for (int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, k;
vector<ll> v;
int main() {
cin >> n >> k;
v.resize(n);
for (int i = 0; i < n; i++)
scanf("%Ld", &v[i]);
ll res = -(1e18);
for (int i = 0; i <= min(k, n); i++) {
for (int j = 0; j <= i; j++) {
vector<ll> getj;
f... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 844,045 | 844,046 | u877476774 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
int n, k, a[100], ans;
signed main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < min(n, k); i++) {
for (int j = 0; i + j < min(n, k); j++) {
vector<int> v;
in... | #include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
int n, k, a[100], ans;
signed main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i <= min(n, k); i++) {
for (int j = 0; i + j <= min(n, k); j++) {
vector<int> v;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 844,049 | 844,050 | u141968173 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
using namespace std;
void solve(int N, int K, vector<int> v) {
int ans = 0;
for (int l = 0; l < K; l++) {
for (int r = 0; r < K - l; r++) {
if (l + r > N) {
continue;
}
int d = K - l - r;
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
using namespace std;
void solve(int N, int K, vector<int> v) {
int ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if (l + r > N) {
continue;
}
int d = K - l - r;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 844,051 | 844,052 | u910756197 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
using namespace std;
void solve(int N, int K, vector<int> v) {
int ans = 0;
for (int l = 0; l < min(N, K); l++) {
for (int r = 0; r < min(N, K); r++) {
if (l + r > min(N, K)) {
continue;
}
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
using namespace std;
void solve(int N, int K, vector<int> v) {
int ans = 0;
for (int l = 0; l <= min(N, K); l++) {
for (int r = 0; r <= min(N, K); r++) {
if (l + r > min(N, K)) {
continue;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 844,053 | 844,054 | u910756197 | cpp |
p03032 | // D.
#include <algorithm>
#include <iostream>
#include <numeric>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
vector<LL> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
LL ans = 0;
vector<LL> a;
fo... | // D.
#include <algorithm>
#include <iostream>
#include <numeric>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
vector<LL> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
LL ans = 0;
vector<LL> a;
fo... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 844,055 | 844,056 | u586336940 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define inf 0x7ffff... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define inf 0x7ffff... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 844,060 | 844,061 | u742987397 | cpp |
p03032 | //解説参考
//他者コード参考
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
static const int MAX = 50;
using namespace std;
int N, K, ans;
int D[MAX + 2];
int solve() {
for (int a = 0; a <= K && a < N; a++) {
for (int b = 0; a + b < K && a + b < N; b++) {
vector<int> V;
int sum ... | //解説参考
//他者コード参考
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
static const int MAX = 50;
using namespace std;
int N, K, ans;
int D[MAX + 2];
int solve() {
for (int a = 0; a <= K && a <= N; a++) {
for (int b = 0; a + b <= K && a + b <= N; b++) {
vector<int> V;
int s... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 844,068 | 844,069 | u877847737 | cpp |
p03032 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 844,077 | 844,078 | u216772548 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | [
"call.add",
"call.arguments.change"
] | 844,100 | 844,101 | u525288965 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> V(N);
for (auto &v : V)
cin >> v;
ll ans = 0;
for (ll i = 0; i ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> V(N);
for (auto &v : V)
cin >> v;
ll ans = 0;
for (ll i = 0; i ... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 844,107 | 844,108 | u634208461 | cpp |
p03032 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cout << #x << ": " << x << endl
#define repn(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define re... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cout << #x << ": " << x << endl
#define repn(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define re... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 844,111 | 844,112 | u626595726 | cpp |
p03032 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cout << #x << ": " << x << endl
#define repn(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define re... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cout << #x << ": " << x << endl
#define repn(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define re... | [
"variable_declaration.type.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 844,113 | 844,112 | u626595726 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.