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 |
|---|---|---|---|---|---|---|---|
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
int main() {
LL n, k;
cin >> n >> k;
LL a[n];
for (LL i = 0; i < n; i++)
cin >> a[i];
LL dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (LL i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (LL j = i - 1; j >= (i - k); j--... | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
int main() {
LL n, k;
cin >> n >> k;
LL a[n];
for (LL i = 0; i < n; i++)
cin >> a[i];
LL dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (LL i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (LL j = i - 1; j >= (i - k) && j... | [
"control_flow.loop.for.condition.change"
] | 960,427 | 960,428 | u479016132 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_set>
#include <vector>
#define m7 1000000007
#define m9 1000000009
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
using names... | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_set>
#include <vector>
#define m7 1000000007
#define m9 1000000009
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
using names... | [
"assignment.change"
] | 960,429 | 960,430 | u096424346 | cpp |
p03161 | #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 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long int ll;
int main() {
int n, k;
scanf("%d%d", &n, &k);
int... | #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 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long int ll;
int main() {
int n, k;
scanf("%d%d", &n, &k);
int... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 960,463 | 960,464 | u283907492 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define N 100001
#define MAX 1500000000
int ans[N];
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
ans[i] = MAX;
}
ans[0] = 0;
ans[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define N 100001
#define MAX 1500000000
int ans[N];
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
ans[i] = MAX;
}
ans[0] = 0;
ans[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
for (int ... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 960,465 | 960,466 | u243359841 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define MAX 20000000
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef vector<int> vi;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define MAX 20000000000LL
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef vector<int> vi;
typ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"literal.number.type.widen.change"
] | 960,472 | 960,473 | u843250043 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
const int inf = 0x3f3f3f3f;
using namespace std;
int main() {
int n, temp;
cin >> n >> temp;
vector<int> arr(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> arr[i];
vector<int> dp(n + 1, inf);
dp[1] = 0;
dp[2] = arr[2] - arr[1];
for (int i... | #include <algorithm>
#include <iostream>
#include <vector>
const int inf = 0x3f3f3f3f;
using namespace std;
int main() {
int n, temp;
cin >> n >> temp;
vector<int> arr(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> arr[i];
vector<int> dp(n + 1, inf);
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (... | [
"call.add",
"call.arguments.change"
] | 960,474 | 960,475 | u241738997 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define fr(i, a) for (ll i = 0LL; i < a; i++)
#define fab(i, a, b) for (ll i = a; i <= b; i++)
#define fba(i, a, b) for (ll i = b; i >= a; i--)
#define rf(i, a) for (ll i = a; i >= 0; i--)
#define sup \
io... | #include <bits/stdc++.h>
using namespace std;
#define fr(i, a) for (ll i = 0LL; i < a; i++)
#define fab(i, a, b) for (ll i = a; i <= b; i++)
#define fba(i, a, b) for (ll i = b; i >= a; i--)
#define rf(i, a) for (ll i = a; i >= 0; i--)
#define sup \
io... | [
"control_flow.branch.if.condition.change"
] | 960,476 | 960,477 | u124059719 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define lsc(x) scanf("%lld", &x)
#define sc(x) scanf("%d", &x)
#define lpr(x) printf("%lld ", x)
#define ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define lsc(x) scanf("%lld", &x)
#define sc(x) scanf("%d", &x)
#define lpr(x) printf("%lld ", x)
#define ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,478 | 960,479 | u562608561 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
/*inline void fastRead_int(int &x)
{
register int c = getchar_unlocked();
x=0;
int neg = 0;
for(;((c<48 || c>57) && c!='-'); c=getchar_unlocked());
if(c=='-'){
neg = 1;
c = getchar_unlocked();
... | #include <bits/stdc++.h>
using namespace std;
/*inline void fastRead_int(int &x)
{
register int c = getchar_unlocked();
x=0;
int neg = 0;
for(;((c<48 || c>57) && c!='-'); c=getchar_unlocked());
if(c=='-'){
neg = 1;
c = getchar_unlocked();
... | [
"control_flow.loop.for.condition.change"
] | 960,480 | 960,481 | u509559852 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
const long long I... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long I... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,492 | 960,493 | u147556624 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"expression.off_by_one"
] | 960,494 | 960,495 | u147556624 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"expression.off_by_one"
] | 960,496 | 960,495 | u147556624 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i < n; i++) {
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
for (int j =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 960,501 | 960,502 | u402262779 | cpp |
p03161 | // frog2
#include <bits/stdc++.h>
using namespace std;
long long int memo[100005];
long long int h[100005];
long long int n, k;
long long int call(long long int i) {
if (i < 0)
return 0;
if (i == 0) {
return 0;
}
if (memo[i] != -1)
return memo[i];
if (i > 1 && i <= k) {
return abs(h[i] - h[1]... | // frog2
#include <bits/stdc++.h>
using namespace std;
long long int memo[100005];
long long int h[100005];
long long int n, k;
long long int call(long long int i) {
if (i < 0)
return 0;
if (i == 0 || i == 1) {
return 0;
}
if (memo[i] != -1)
return memo[i];
if (i > 1 && i <= k) {
return abs(h... | [
"control_flow.branch.if.condition.change"
] | 960,507 | 960,508 | u537207678 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1000000000
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fs first
#define ss second
inline int Scan() {
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1000000000
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fs first
#define ss second
inline int Scan() {
in... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 960,515 | 960,516 | u157281173 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int ans(vector<int> &v, int n, int i, int k) {
if (i == 0)
return 0;
if (dp[i] != -1)
return dp[i];
int mn = INT_MAX;
for (int j = i - 1; j >= i - k; j--) {
int p = ans(v, n, j, k) + abs(v[j] - v[i]);
mn = min(p, mn);
}
return dp... | #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int ans(vector<int> &v, int n, int i, int k) {
if (i == 0)
return 0;
if (dp[i] != -1)
return dp[i];
int mn = INT_MAX;
for (int j = i - 1; j >= max(0, i - k); j--) {
int p = ans(v, n, j, k) + abs(v[j] - v[i]);
mn = min(p, mn);
}
r... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 960,517 | 960,518 | u649143883 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
lo... | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
lo... | [
"literal.number.change",
"assignment.value.change"
] | 960,519 | 960,520 | u310427537 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
lo... | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
lo... | [
"control_flow.loop.for.condition.change"
] | 960,521 | 960,520 | u310427537 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
lo... | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
lo... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"identifier.change"
] | 960,522 | 960,520 | u310427537 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int dp[N];
int a[N];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i == 1)
continue;
dp[i] = 1e9;
for (int j = i - 1; j >= i - k; j--)
dp[i] = min(dp[i], dp[j] +... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int dp[N];
int a[N];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i == 1)
continue;
dp[i] = 1e9;
for (int j = i - 1; j >= i - k && j >= 1; j--)
dp[i] = min(dp[i... | [
"control_flow.loop.for.condition.change"
] | 960,523 | 960,524 | u874608540 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int d[100020];
int k;
int resi(int h[], int i, int n) {
if (i == n - 1)
return 0;
int min1 = 100020;
for (int j = 1; j <= k; j++) {
if (i + j > n - 1) {
continue;
}
if (d[i + j] == -1) {
d[i + j] = resi(h, i + j, n);
}
min1 = m... | #include <bits/stdc++.h>
using namespace std;
int d[100020];
int k;
int resi(int h[], int i, int n) {
if (i == n - 1)
return 0;
int min1 = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i + j > n - 1) {
continue;
}
if (d[i + j] == -1) {
d[i + j] = resi(h, i + j, n);
}
min1 = ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,529 | 960,528 | u295938193 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int d[100020];
int k;
int resi(int h[], int i, int n) {
if (i == n - 1)
return 0;
int min1 = 10005;
for (int j = 1; j <= k; j++) {
if (i + j > n - 1) {
continue;
}
if (d[i + j] == -1) {
d[i + j] = resi(h, i + j, n);
}
min1 = mi... | #include <bits/stdc++.h>
using namespace std;
int d[100020];
int k;
int resi(int h[], int i, int n) {
if (i == n - 1)
return 0;
int min1 = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i + j > n - 1) {
continue;
}
if (d[i + j] == -1) {
d[i + j] = resi(h, i + j, n);
}
min1 = ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,532 | 960,531 | u013064880 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) cin >> h.at(i);
vector<int> pro(N, 0);
rep(i, N) {
if (i == 0)
continue;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) cin >> h.at(i);
vector<int> pro(N, 0);
rep(i, N) {
if (i == 0)
continue;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 960,533 | 960,534 | u170513117 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int A[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
int B[n];
for (int i = 0; i < n; i++) {
B[i] = INT_MAX;
}
B[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int A[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
int B[n];
for (int i = 0; i < n; i++) {
B[i] = INT_MAX;
}
B[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + ... | [
"identifier.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,543 | 960,544 | u782253358 | cpp |
p03161 | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define EPS 1e-6
#define INF 1000000000
// MAXIMIZAR f(x) == MINIMIZAR -f(x)
#define _ \
ios_base::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0), \
cout.precision... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define EPS 1e-6
#define INF 1000000000
// MAXIMIZAR f(x) == MINIMIZAR -f(x)
#define _ \
ios_base::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0), \
cout.precision... | [
"control_flow.loop.for.condition.change"
] | 960,547 | 960,548 | u077971896 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <utility>
using namespace std;
using ll = long long;
constexpr ll INF = 1000000011;
int main() {
int N, K;
int h[100007] = {};
int dp[100007] = {};
int k;
cin >> N >> K;
fill_n(dp, N + 1, INF);
for (int i = 1; i <= N; i++) {
cin >... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <utility>
using namespace std;
using ll = long long;
constexpr ll INF = 1000000011;
int main() {
int N, K;
int h[100007] = {};
ll dp[100007] = {};
int k;
cin >> N >> K;
fill_n(dp, N + 1, INF);
for (int i = 1; i <= N; i++) {
cin >>... | [
"variable_declaration.type.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 960,552 | 960,553 | u924293285 | cpp |
p03161 | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define mod 1000000007
#define eps 1e-... | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define mod 1000000007
#define eps 1e-... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 960,558 | 960,559 | u016266807 | cpp |
p03161 | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define mod 1000000007
#define eps 1e-... | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define mod 1000000007
#define eps 1e-... | [
"assignment.value.change",
"identifier.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 960,560 | 960,559 | u016266807 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[114514];
signed main() {
int n, k;
cin >> n >> k;
vector<int> h;
h.pb(0);
for (int i = 0; i < n; i++) {
int x;... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[114514];
signed main() {
int n, k;
cin >> n >> k;
vector<int> h;
h.pb(0);
for (int i = 0; i < n; i++) {
int x;... | [
"variable_declaration.value.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,561 | 960,562 | u335590796 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> dp(n, 10000), num(n);
for (int &i : num) {
cin >> i;
}
dp.at(0) = 0;
dp.at(1) = abs(num.at(1) - num.at(0));
for (int i = 2; i < n; ++i) {
for... | #include <iostream>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> dp(n, 1e9), num(n);
for (int &i : num) {
cin >> i;
}
dp.at(0) = 0;
dp.at(1) = abs(num.at(1) - num.at(0));
for (int i = 2; i < n; ++i) {
for (... | [
"literal.number.change",
"call.arguments.change"
] | 960,563 | 960,564 | u161857456 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#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 ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) (... | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#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 ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) (... | [
"expression.operation.binary.remove"
] | 960,565 | 960,566 | u718774863 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#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 ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) (... | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#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 ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) (... | [
"expression.operation.binary.remove"
] | 960,567 | 960,566 | u718774863 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> A, int k) {
int n = A.size();
if (n <= 1)
return 0;
if (n == 2)
return abs(A[0] - A[1]);
int dp[n];
memset(dp, 0, sizeof(dp));
dp[n - 1] = 0;
dp[n - 2] = abs(A[n - 1] - A[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int mini =... | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> A, int k) {
int n = A.size();
if (n <= 1)
return 0;
if (n == 2)
return abs(A[0] - A[1]);
int dp[n];
memset(dp, 0, sizeof(dp));
dp[n - 1] = 0;
dp[n - 2] = abs(A[n - 1] - A[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int mini =... | [
"call.arguments.change"
] | 960,578 | 960,579 | u487934164 | cpp |
p03161 | #undef __STRICT_ANSI__
#include <bits/stdc++.h>
using namespace std;
int pd[100001], n, v[100001], k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> v[i];
pd[1] = 0;
for (int i = 2; i <= n; i++) {
pd[i] = INT_MAX;
for (int j = 1; ... | #undef __STRICT_ANSI__
#include <bits/stdc++.h>
using namespace std;
int pd[100001], n, v[100001], k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> v[i];
pd[1] = 0;
for (int i = 2; i <= n; i++) {
pd[i] = INT_MAX;
for (int j = 1; ... | [
"control_flow.branch.if.add"
] | 960,580 | 960,581 | u909915106 | cpp |
p03161 | #include <bits/stdc++.h>
#define vi vector<int>
#define ll long long
#define pb push_back
#define ii pair<int, int>
#define MAX int(1e5) + 5
#define qi queue<int>
#define si stack<int>
#define mii map<int, int>
#define msi map<string, int>
#define fr first
#define sc second
#define all(x) x.begin(), x.end()
using names... | #include <bits/stdc++.h>
#define vi vector<int>
#define ll long long
#define pb push_back
#define ii pair<int, int>
#define MAX int(1e5) + 5
#define qi queue<int>
#define si stack<int>
#define mii map<int, int>
#define msi map<string, int>
#define fr first
#define sc second
#define all(x) x.begin(), x.end()
using names... | [
"control_flow.loop.for.condition.change"
] | 960,586 | 960,587 | u210781861 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1000000;
for (int j = min(i, k); j > 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1000000000;
for (int j = min(i, k); j >... | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 960,590 | 960,589 | u700279502 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) cin >> h[i];
ll score[n + k];
rep(i, n + k) score[i] = pow(10, 5);
score[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) cin >> h[i];
ll score[n + k];
rep(i, n + k) score[i] = pow(10, 10);
score[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 960,601 | 960,602 | u233107306 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | ... | [
"call.arguments.change"
] | 960,613 | 960,614 | u460103207 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | ... | [
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 960,615 | 960,614 | u460103207 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | ... | [
"call.arguments.change"
] | 960,616 | 960,617 | u460103207 | cpp |
p03161 | // Author - Sumit
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ps push
#define pb push_back
#define INF 100005
#define MOD 1000000007
#define mp make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.b... | // Author - Sumit
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ps push
#define pb push_back
#define INF 1000000005
#define MOD 1000000007
#define mp make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define all(v)... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 960,627 | 960,626 | u734641744 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 0);
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 1; i < N; i++... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 0);
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 1; i < N; i++... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 960,628 | 960,629 | u387888262 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> dp(N, 0);
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 1; i < N; i++) {
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 0);
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 1; i < N; i++... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 960,630 | 960,629 | u387888262 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k;
int f[101000];
int h[101000];
int main() {
scanf("%d%d", &n, &k);
for (int i = k + 1; i <= k + n; i++) {
scanf("%d", &h[i]);
f[i] = 10000;
}
f[k + 1] = 0;
for (int i = k + 2; i <= k + n; i++)
for (int j = 1; j <= k; j++)
if (i - j >=... | #include <bits/stdc++.h>
using namespace std;
int n, k;
int f[101000];
int h[101000];
int main() {
scanf("%d%d", &n, &k);
for (int i = k + 1; i <= k + n; i++) {
scanf("%d", &h[i]);
f[i] = 2e9;
}
f[k + 1] = 0;
for (int i = k + 2; i <= k + n; i++)
for (int j = 1; j <= k; j++)
if (i - j >= k... | [
"literal.number.change",
"assignment.value.change"
] | 960,635 | 960,636 | u402724915 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, k;
cin >> n >> k;
int f[n], h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
f[i] = INT_MAX;
}
f[0] = 0;
f[1] = abs(h[0] - h[1]);
f[2] = f[1] + abs(h[1] - h[2]);
if (k != 1)
f[2] = min(abs(h[0] - h[2]), f[1] + abs(h[1] - h... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, k;
cin >> n >> k;
int f[n], h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
f[i] = INT_MAX;
}
f[0] = 0;
f[1] = abs(h[0] - h[1]);
f[2] = f[1] + abs(h[1] - h[2]);
if (k != 1)
f[2] = min(abs(h[0] - h[2]), f[1] + abs(h[1] - h... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 960,644 | 960,645 | u818660467 | cpp |
p03161 | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
int a[100005], b[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
b[0] = b[1] = 0;
for (int i = 2; i <= n; i++) {
b[i] = INT_MAX;
for (int j = 1; j <= m && j < n; j++) {
b[i] ... | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
int a[100005], b[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
b[0] = b[1] = 0;
for (int i = 2; i <= n; i++) {
b[i] = INT_MAX;
for (int j = 1; j <= m && j != i; j++) {
b[i]... | [
"control_flow.loop.for.condition.change"
] | 960,646 | 960,647 | u798562499 | cpp |
p03161 | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
int a[100005], b[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
b[0] = b[1] = 0;
for (int i = 2; i <= n; i++) {
b[i] = INT_MAX;
for (int j = 1; j <= m && j <= n; j++) {
b[i]... | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
int a[100005], b[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
b[0] = b[1] = 0;
for (int i = 2; i <= n; i++) {
b[i] = INT_MAX;
for (int j = 1; j <= m && j != i; j++) {
b[i]... | [
"control_flow.loop.for.condition.change"
] | 960,648 | 960,647 | u798562499 | cpp |
p03161 | #include <bits/stdc++.h>
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define setDP(arr) memset(arr, -1, sizeof arr)
#define Clear(arr) memset(arr, 0, sizeof arr)
#define li(x) x.size() - 1
#define oo 1000000000
#define inf 1000000000000000000
#define M 1000000007
#define M2 1000000009
#define pii... | #include <bits/stdc++.h>
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define setDP(arr) memset(arr, -1, sizeof arr)
#define Clear(arr) memset(arr, 0, sizeof arr)
#define li(x) x.size() - 1
#define oo 1000000000
#define inf 1000000000000000000
#define M 1000000007
#define M2 1000000009
#define pii... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,655 | 960,656 | u129986190 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int mx = 1000010;
long long a[mx], cost[mx], h[mx], f = 1e18 + 10;
main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cost[1] = 0;
for (int i = 2; i <= n; i++) {
cost[i] = f;
for (int j = k; j >= 1; j--) {
... | #include <bits/stdc++.h>
using namespace std;
const int mx = 1000010;
long long a[mx], cost[mx], h[mx], f = 1e18 + 10;
main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cost[1] = 0;
for (int i = 2; i <= n; i++) {
cost[i] = f;
for (int j = k; j >= 1; j--) {
... | [
"expression.operation.binary.remove"
] | 960,683 | 960,684 | u298620601 | cpp |
p03161 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int k;
int h[100005];
int dp[100005] = {};
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
int minimum = 100000;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int k;
int h[100005];
int dp[100005] = {};
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
int minimum = 1000000000;
for (int j = 1; j <= k; j++) {
if (i - j >... | [
"literal.number.change",
"variable_declaration.value.change"
] | 960,700 | 960,699 | u317976413 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int h[100005] = {};
int dp[100005] = {};
int until;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
until = 1;
for (int i = 2; i < n; i++) {
until = 1;
dp[i] = abs(h[i] - h... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int h[100005] = {};
int dp[100005] = {};
int until;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
until = 1;
for (int i = 2; i < n; i++) {
until = 1;
dp[i] = abs(h[i] - h... | [
"control_flow.branch.if.condition.change"
] | 960,701 | 960,702 | u935028161 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
int k;
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
int k;
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,703 | 960,704 | u809287016 | cpp |
p03161 | // Author - Saikat_7
#include <bits/stdc++.h>
using namespace std;
#define fl(i, a, b) for (int i = a; i < b; i++)
#define trav(i, cont) for (const auto &i : cont)
#define cs(x) cout << x << " "
#define cn(x) cout << x << " " << endl
#define ll long long int
#define endl '\n'
#define pb push_back
#define ff first
#defi... | // Author - Saikat_7
#include <bits/stdc++.h>
using namespace std;
#define fl(i, a, b) for (int i = a; i < b; i++)
#define trav(i, cont) for (const auto &i : cont)
#define cs(x) cout << x << " "
#define cn(x) cout << x << " " << endl
#define ll long long int
#define endl '\n'
#define pb push_back
#define ff first
#defi... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,705 | 960,706 | u426260736 | cpp |
p03161 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
i... | [
"expression.operation.binary.remove"
] | 960,707 | 960,708 | u661738979 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 1000000007
#define mod1 998244353
#define lli long long int
#define plli pair<lli, lli>
#define REP(i, a, b) for (lli i = a; i < b; i++)
#define REPI(i, a, ... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 1000000007
#define mod1 998244353
#define lli long long int
#define plli pair<lli, lli>
#define REP(i, a, b) for (lli i = a; i < b; i++)
#define REPI(i, a, ... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,709 | 960,710 | u194447791 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
... | [
"call.arguments.add",
"call.arguments.change"
] | 960,711 | 960,712 | u298620933 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
... | [
"expression.operation.binary.add"
] | 960,713 | 960,714 | u298620933 | cpp |
p03161 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
long n, a[1000005], f[1000005], k;
int main() {
cin >> n >> k;
for (long i = 1; i <= n; i++)
cin >> a[i];
f[1] = 0;
f[2] = abs(a[1] - a[2]);
for (long i = 3; i <= n; i++) {
f[i] = 99999;
for (long j = 1; j <= k; j++) {... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
long n, a[1000005], f[1000005], k;
int main() {
cin >> n >> k;
for (long i = 1; i <= n; i++)
cin >> a[i];
f[1] = 0;
f[2] = abs(a[1] - a[2]);
for (long i = 3; i <= n; i++) {
f[i] = 9999999999;
for (long j = 1; j <= k; j... | [
"literal.number.change",
"assignment.value.change"
] | 960,717 | 960,716 | u777021364 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll b[n];
for (ll i = 0; i < n; i++)
b[i] = 100000;
b[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = 0; j < k; j++) {
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll b[n];
for (ll i = 0; i < n; i++)
b[i] = 1e9 + 5;
b[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = 0; j < k; j++) {
... | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 960,719 | 960,720 | u330689597 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll b[n];
for (ll i = 0; i < n; i++)
b[i] = 10005;
b[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = 0; j < k; j++) {
if... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll b[n];
for (ll i = 0; i < n; i++)
b[i] = 1e9 + 5;
b[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = 0; j < k; j++) {
... | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 960,721 | 960,720 | u330689597 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long ar[n + 1] = {0};
long long arr[n + 1] = {0};
for (long long i = 1; i <= n; i++) {
cin >> ar[i];
}
// arr[1]=ar[1];
for (long long i = 2; i <= n; i++) {
/*cout<<(abs(ar[i]-ar[i-1])+arr[i-1])<<" ";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long ar[n + 1] = {0};
long long arr[n + 1] = {0};
for (long long i = 1; i <= n; i++) {
cin >> ar[i];
}
// arr[1]=ar[1];
for (long long i = 2; i <= n; i++) {
/*cout<<(abs(ar[i]-ar[i-1])+arr[i-1])<<" ";
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,728 | 960,729 | u951790655 | cpp |
p03161 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define sre... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define sre... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 960,730 | 960,731 | u340293807 | cpp |
p03161 | #include <bits/stdc++.h>
#pragma GCC optimize("-O3")
#define ll long long
const ll inf = 1e9;
const int mod = 1e9 + 7;
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
ll b[100005];
int k, n, a[100005];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
... | #include <bits/stdc++.h>
#pragma GCC optimize("-O3")
#define ll long long
const ll inf = 1e9;
const int mod = 1e9 + 7;
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
ll b[100005];
int k, n, a[100005];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 960,732 | 960,733 | u865920681 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, K;
int h[100005];
int dp[100005];
cin >> n >> K;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int minc = 100000;
for (int k = 1; k <= K; k++) {
if (i - k <= 0)
break... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, K;
int h[100005];
int dp[100005];
cin >> n >> K;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int minc = 10000000000;
for (int k = 1; k <= K; k++) {
if (i - k <= 0)
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 960,736 | 960,737 | u570165549 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mex = 1e5 + 1;
#define ll long long
#define test \
int t; \
cin >> t; ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mex = 1e5 + 1;
#define ll long long
#define test \
int t; \
cin >> t; ... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 960,738 | 960,739 | u468743462 | cpp |
p03161 | #include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
long long n, k, tmp, h[10000000], F[10000000];
int main() {
// freopen("FROG2.INP","r",stdin);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++) {
F[i] = 10E15;
for (int j = 1; j <= k;... | #include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
long long n, k, tmp, h[10000000], F[10000000];
int main() {
// freopen("FROG2.INP","r",stdin);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++) {
F[i] = 10E15;
for (int j = 1; j <= k;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 960,740 | 960,741 | u802278034 | cpp |
p03161 | #include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
long long n, k, tmp, h[10000000], F[10000000];
int main() {
// freopen("FROG2.INP","r",stdin);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++) {
F[i] = 10E15;
for (int j = 1; j <= k;... | #include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
long long n, k, tmp, h[10000000], F[10000000];
int main() {
// freopen("FROG2.INP","r",stdin);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++) {
F[i] = 10E15;
for (int j = 1; j <= k;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,740 | 960,742 | u802278034 | cpp |
p03161 | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPEACH(i, k) for (auto &i : k)
#define all(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
signed main()... | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPEACH(i, k) for (auto &i : k)
#define all(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
signed main()... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 960,745 | 960,746 | u118875091 | cpp |
p03161 | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | [
"expression.operation.binary.remove"
] | 960,759 | 960,760 | u390664767 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define vbi vector<bool>
#define mod 1000000007
#define INF 1000000000
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define sd second
#define ft... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define vbi vector<bool>
#define mod 1000000007
#define INF 1000000000
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define sd second
#define ft... | [
"literal.number.change",
"variable_declaration.value.change"
] | 960,763 | 960,764 | u126288554 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define PI 3.14159265358979323846
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MAX 1000
using namespace std;
... | #include <bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define PI 3.14159265358979323846
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MAX 1000
using namespace std;
... | [
"control_flow.loop.for.condition.change"
] | 960,767 | 960,768 | u492894170 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 5, INF = 3e5 + 5;
int a[Nmax], dp[Nmax];
int N, K;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> K;
for (int i = 1; i <= N; ++i)
cin >> a[i];
memset(dp, INF, sizeof(dp));
dp[1] = a[1];
for (int i = 2; i <= N; ++i)
for... | #include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 5, INF = 2e5 + 5;
int a[Nmax], dp[Nmax];
int N, K;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> K;
for (int i = 1; i <= N; ++i)
cin >> a[i];
memset(dp, INF, sizeof(dp));
dp[1] = a[1];
for (int i = 2; i <= N; ++i)
for... | [
"literal.number.change",
"expression.operation.binary.change"
] | 960,772 | 960,773 | u361594188 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
int k;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
int k;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++) {... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,779 | 960,780 | u881011075 | cpp |
p03161 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forr(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define forin(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define all(a) a.begin(), a.end()
#define pb push_back
#define ... | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forr(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define forin(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define all(a) a.begin(), a.end()
#define pb push_back
#define ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 960,785 | 960,786 | u333759455 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, k;
cin >> n >> k;
int dp[n];
int h[n];
int x;
int mind = 1e4 + 1;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = k; j > 0; j--) {
if (i - j >=... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, k;
cin >> n >> k;
int dp[n];
int h[n];
int x;
int mind = 1e10 + 24;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = k; j > 0; j--) {
if (i - j ... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 960,792 | 960,793 | u402184396 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define MOD ((int)(1e9) + 7)
#define fast \
cin.tie(0); \
cout.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define MOD ((int)(1e9) + 7)
#define fast \
cin.tie(0); \
cout.tie(0); ... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 960,799 | 960,800 | u997979021 | cpp |
p03161 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [
"expression.operation.binary.add"
] | 960,805 | 960,806 | u135572611 | cpp |
p03161 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [
"expression.operation.binary.add"
] | 960,807 | 960,808 | u135572611 | cpp |
p03161 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) reprrev(i, 0, n)
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) reprrev(i, 0, n)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,809 | 960,810 | u135572611 | cpp |
p03161 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) reprrev(i, 0, n)
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) reprrev(i, 0, n)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,811 | 960,810 | u135572611 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(100010, 0);
vector<ll> dp(100010, 1 << 9);
for (int i = 0; i < n; i++) {
cin >> h[i + 1];
}
dp[0] = 0;
dp[1] = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= k; j... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(100010, 0);
vector<ll> dp(100010, 1000000007);
for (int i = 0; i < n; i++) {
cin >> h[i + 1];
}
dp[0] = 0;
dp[1] = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 960,812 | 960,813 | u561186440 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long arr[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> arr[i];
long long dp[n + 1] = {0};
for (int i = 2; i <= n; i++) {
dp[i] = 1000000000000000;
for (int j = i - 1; j >= 0 && j >= (i - k); j--) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long arr[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> arr[i];
long long dp[n + 1] = {0};
for (int i = 2; i <= n; i++) {
dp[i] = 1000000000000000;
for (int j = i - 1; j >= 1 && j >= (i - k); j--) ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,820 | 960,821 | u792088162 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ar[n + 1];
for (ll i = 1; i <= n; i++)
cin >> ar[i];
ll dp[n + 1];
for (ll i = 1; i <= n; i++)
dp[i] = (ll)1e18;
dp[1] = 0;
for (ll i = 2; i <= n; i++) { // cout<... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ar[n + 1];
for (ll i = 1; i <= n; i++)
cin >> ar[i];
ll dp[n + 1];
for (ll i = 1; i <= n; i++)
dp[i] = (ll)1e18;
dp[1] = 0;
for (ll i = 2; i <= n; i++) { // cout<<dp[... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 960,822 | 960,823 | u096117579 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ar[n + 1];
for (ll i = 1; i <= n; i++)
cin >> ar[i];
ll dp[n + 1];
for (ll i = 1; i <= n; i++)
dp[i] = (ll)1e18;
dp[1] = 0;
for (ll i = 2; i <= n; i++) { // cout<<dp[i]<<end... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ar[n + 1];
for (ll i = 1; i <= n; i++)
cin >> ar[i];
ll dp[n + 1];
for (ll i = 1; i <= n; i++)
dp[i] = (ll)1e18;
dp[1] = 0;
for (ll i = 2; i <= n; i++) { // cout<<dp[... | [
"call.add",
"control_flow.loop.for.initializer.change",
"type_conversion.add"
] | 960,824 | 960,823 | u096117579 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) lower_bound(all(v), k) - v.begin()
#define ch... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) lower_bound(all(v), k) - v.begin()
#define ch... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,834 | 960,835 | u422633119 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
//#define int lo... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
//#define int lo... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 960,850 | 960,851 | u535136478 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
//#define int lo... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
//#define int lo... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,852 | 960,851 | u535136478 | cpp |
p03161 | /******************************************************************************
Online C Compiler.
Code, Compile, Run and Debug C program online.
Write your code in this editor and press "Run" button to compile and execute it.
***********************************************... | /******************************************************************************
Online C Compiler.
Code, Compile, Run and Debug C program online.
Write your code in this editor and press "Run" button to compile and execute it.
***********************************************... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 960,853 | 960,854 | u054341054 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = 1e+9;
for (int i = 1; i < min(k, n); i++)
for (int j = 0; j < i; j++)
dp[i] = max(dp[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = 1e+9;
for (int i = 1; i < min(k, n); i++)
for (int j = 0; j < i; j++)
dp[i] = min(dp[i]... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 960,859 | 960,858 | u227478170 | cpp |
p03161 | // PLUS ULTRA
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#... | // PLUS ULTRA
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#... | [] | 960,860 | 960,861 | u141684774 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#define INF 2000000000
using namespace std;
int n, k;
int h[100000];
int dp[100001];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#define INF 2000000000
using namespace std;
int n, k;
int h[100000];
int dp[100001];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i ... | [
"control_flow.loop.for.condition.change"
] | 960,862 | 960,863 | u110996038 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v1(n), v2(n, INT_MAX);
v2[0] = 0;
for (int i = 0; i < n; i++) {
cin >> v1[i];
}
for (int i = 1; i < n; i++) {
int count = 4;
int j = i - 1;
while (j >= 0 && count != 0) {
v2[i] = min(v2[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v1(n), v2(n, INT_MAX);
v2[0] = 0;
for (int i = 0; i < n; i++) {
cin >> v1[i];
}
for (int i = 1; i < n; i++) {
int count = k;
int j = i - 1;
while (j >= 0 && count != 0) {
v2[i] = min(v2[i]... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,878 | 960,879 | u398129514 | cpp |
p03161 | #include <bits/stdc++.h>
#define w while
#define loop(i, l, r) for (int i = l; i < r; i++)
#define ci cin >>
#define co cout <<
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
int dp[n];
loop(i, 0, n) {
ci a[i];... | #include <bits/stdc++.h>
#define w while
#define loop(i, l, r) for (int i = l; i < r; i++)
#define ci cin >>
#define co cout <<
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
int dp[n];
loop(i, 0, n) {
ci a[i];... | [] | 960,882 | 960,883 | u409832451 | cpp |
p03161 | #include <iostream>
#define int long long
using namespace std;
main() {
int a, i, b, j;
cin >> a >> b;
int aa[a + 5], cost[a + 5];
for (i = 0; i < a; i++) {
cin >> aa[i];
cost[i] = 100000;
}
cost[0] = 0;
cost[1] = abs(aa[1] - aa[0]);
for (i = 2; i < a; i++) {
for (j = 1; j <= b; j++) {
... | #include <iostream>
#define int long long
using namespace std;
main() {
int a, i, b, j;
cin >> a >> b;
int aa[a + 5], cost[a + 5];
for (i = 0; i < a; i++) {
cin >> aa[i];
cost[i] = 10000000000000000;
}
cost[0] = 0;
cost[1] = abs(aa[1] - aa[0]);
for (i = 2; i < a; i++) {
for (j = 1; j <= b; j... | [
"literal.number.change",
"assignment.value.change"
] | 960,890 | 960,891 | u910753524 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int arr[n], dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
in... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int arr[n], dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
in... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,901 | 960,902 | u715350216 | cpp |
p03161 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
using namespace std;
int dps(int x, int dp[], int vi[], int arr[], int k) {
if (x <= 0)
return 0;
if (vi[x] == 1)
return dp[x];
vi[x] = 1;
int maxa = pow(10, 8);
for (int l = 1; l < min(x + 1, k + 1); l++) {
maxa = min((... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
using namespace std;
int dps(int x, int dp[], int vi[], int arr[], int k) {
if (x <= 0)
return 0;
if (vi[x] == 1)
return dp[x];
vi[x] = 1;
int maxa = pow(10, 9);
for (int l = 1; l < min(x + 1, k + 1); l++) {
maxa = min(... | [
"literal.number.change",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 960,909 | 960,908 | u086976605 | cpp |
p03161 | #include <bits/stdc++.h>
#define input(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);... | #include <bits/stdc++.h>
#define input(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);... | [
"assignment.value.change"
] | 960,912 | 960,913 | u807795697 | cpp |
p03161 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | [
"call.add",
"call.arguments.add"
] | 960,914 | 960,915 | u240509821 | cpp |
p03161 | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\... | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,916 | 960,917 | u128189308 | cpp |
p03161 | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\... | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,918 | 960,917 | u128189308 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.