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>
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define show(x) c... | #include <bits/stdc++.h>
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define show(x) c... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 960,921 | 960,922 | u494714436 | cpp |
p03161 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 960,927 | 960,928 | u786837146 | cpp |
p03161 | /*BINH :))*/
#include <bits/stdc++.h>
#include <queue>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long llu;
#define IO \
ios_base::sync_with_stdio(false); \
ci... | /*BINH :))*/
#include <bits/stdc++.h>
#include <queue>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long llu;
#define IO \
ios_base::sync_with_stdio(false); \
ci... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,936 | 960,937 | u858980719 | cpp |
p03161 | #include <bits/stdc++.h>
#define N 100010
#define pb push_back
#define fi first
#define se second
#define si size()
#define ll long long
#define mp make_pair
#define iter ::iterator
#define all(v) v.begin(), v.end()
#define pp pop_back
#define mapiter map<int, int>::iterator
#define forn(i, n) for (int i = 0; i < n; ++... | #include <bits/stdc++.h>
#define N 100010
#define pb push_back
#define fi first
#define se second
#define si size()
#define ll long long
#define mp make_pair
#define iter ::iterator
#define all(v) v.begin(), v.end()
#define pp pop_back
#define mapiter map<int, int>::iterator
#define forn(i, n) for (int i = 0; i < n; ++... | [
"control_flow.loop.for.condition.change"
] | 960,951 | 960,950 | u930689495 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
int DP[N];
DP[0] = 0;
DP[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; ++i) {
int tmp = 100000;
for (int j = 1; j <= ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
int DP[N];
DP[0] = 0;
DP[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; ++i) {
long tmp = 1e9;
for (int j = 1; j <= mi... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 960,952 | 960,953 | u860546679 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
int dp[N];
dp[0] = 0;
for (int i = 1; i < N; ++i) {
if (i < K) {
dp[i] = 100000;
for (int j = 0; j < i; ++j) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long h[N];
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
long dp[N];
dp[0] = 0;
for (int i = 1; i < N; ++i) {
if (i < K) {
// cout<<i<<endl;
dp[i] = 1000000000;
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change"
] | 960,957 | 960,955 | u860546679 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 960,961 | 960,962 | u342051078 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
int main() {
int N, K, tmp, min_cost;
cin >> N >> K;
vector<int> h(N), dp(N, 0);
rep(i, N) cin >> h[i];
dp[1] = abs(h[1] - h[0]);
rep2(i, 2, N) {
min_cost = 9... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
int main() {
int N, K, tmp, min_cost;
cin >> N >> K;
vector<int> h(N), dp(N, 0);
rep(i, N) cin >> h[i];
dp[1] = abs(h[1] - h[0]);
rep2(i, 2, N) {
min_cost = 9... | [
"call.arguments.change"
] | 960,973 | 960,974 | u463775490 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N], dp[N];
dp[0] = 0;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 1; i < N; i++) {
dp[i] = 2000000000;
for (int j = 1; j < min(K, i + 1); j++)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N], dp[N];
dp[0] = 0;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 1; i < N; i++) {
dp[i] = 2000000000;
for (int j = 1; j <= min(K, i); j++)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 960,975 | 960,976 | u820224016 | cpp |
p03161 | #include <iostream>
using namespace std;
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int ze(int a) {
if (a > 0)
return a;
else
return -a;
}
int main() {
int N, K;
cin >> N >> K;
K = min(N, K);
int h[100004];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int cos... | #include <iostream>
using namespace std;
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int ze(int a) {
if (a > 0)
return a;
else
return -a;
}
int main() {
int N, K;
cin >> N >> K;
K = min(N, K);
int h[100004];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int cos... | [
"literal.number.change",
"assignment.value.change",
"variable_declaration.type.widen.change",
"variable_declaration.value.change"
] | 960,981 | 960,978 | u058186113 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define io \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define io \
ios_base::sync_with_stdio(false); ... | [
"literal.number.change",
"call.arguments.change"
] | 960,984 | 960,985 | u194186470 | cpp |
p03161 | #include <bits/stdc++.h>
#include <stdio.h>
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define ll long long int
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
using namespace std;
int main() {
ll n, k, sum = 0;
cin >> n >> k;
ll v[n], dp[n];
f(i, 0, n) cin >... | #include <bits/stdc++.h>
#include <stdio.h>
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define ll long long int
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
using namespace std;
int main() {
ll n, k, sum = 0;
cin >> n >> k;
ll v[n], dp[n];
f(i, 0, n) cin >... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,988 | 960,989 | u080477196 | cpp |
p03161 | #include <bits/stdc++.h>
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 long INF = 1LL << 60;
int main... | #include <bits/stdc++.h>
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 long INF = 1LL << 60;
int main... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,990 | 960,991 | u128837995 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n >> k;
vector<int> stone(n);
for (int i = 0; i < n; i++)
cin >> stone[i];
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++)
for (int j = i + 1; j <= i + k; j++)
dp[j] = min(d... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n >> k;
vector<int> stone(n);
for (int i = 0; i < n; i++)
cin >> stone[i];
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++)
for (int j = i + 1; j <= i + k; j++)
if (j < n)
... | [
"control_flow.branch.if.add"
] | 961,011 | 961,012 | u353919145 | cpp |
p03161 | ////////////////////////////////////
/// Please Give Me AC!!! ///
////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define forin(in) \
for (int i = 0; i < (int)in.siz... | ////////////////////////////////////
/// Please Give Me AC!!! ///
////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define forin(in) \
for (int i = 0; i < (int)in.siz... | [
"assignment.change"
] | 961,013 | 961,014 | u060116081 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog1(int N, int a[]) {
int dp[N + 1];
dp[0] = 0;
dp[1] = a[0];
dp[2] = abs(a[1] - a[0]);
dp[3] = min(dp[2] + abs(a[2] - a[1]), abs(a[2] - a[0]));
for (int i = 3; i < N; i++) {
dp[i + 1] =
min(dp[i] + abs(a[i] - a[i - 1]), dp[i - 1] + abs(a[i] ... | #include <bits/stdc++.h>
using namespace std;
int frog1(int N, int a[]) {
int dp[N + 1];
dp[0] = 0;
dp[1] = a[0];
dp[2] = abs(a[1] - a[0]);
dp[3] = min(dp[2] + abs(a[2] - a[1]), abs(a[2] - a[0]));
for (int i = 3; i < N; i++) {
dp[i + 1] =
min(dp[i] + abs(a[i] - a[i - 1]), dp[i - 1] + abs(a[i] ... | [
"assignment.value.change",
"identifier.change"
] | 961,015 | 961,016 | u810232576 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
ll n, k;
using namespace std;
int main() {
cin >> n >> k;
int arr[n];
int memo[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
memo[i] = 10000;
memo[0] = 0;
// memo[1]=abs(arr[0]-arr[1]);//Queda rebundante. Sigue siendo 1... | #include <bits/stdc++.h>
#define ll long long int
ll n, k;
using namespace std;
int main() {
cin >> n >> k;
int arr[n];
int memo[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
memo[i] = INT_MAX;
memo[0] = 0;
// memo[1]=abs(arr[0]-arr[1]);//Queda rebundante. Sigue siendo... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 961,024 | 961,025 | u863370423 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int m = 110000;
int a, b, c[m], d[m];
int main() {
scanf("%d%d", &a, &b);
for (int i = 0; i < a; i++)
scanf("%d", &c[i]);
memset(d, 0x3f, sizeof(d)), d[1] = 0;
for (int i = 1; i < a; i++)
for (int j = 0; j < i && j <= b; j++)
d[i] = min(d[i], d[i... | #include <bits/stdc++.h>
using namespace std;
const int m = 110000;
int a, b, c[m], d[m];
int main() {
scanf("%d%d", &a, &b);
for (int i = 1; i <= a; i++)
scanf("%d", &c[i]);
memset(d, 0x3f, sizeof(d)), d[1] = 0;
for (int i = 2; i <= a; i++)
for (int j = 1; j < i && j <= b; j++)
d[i] = min(d[i], d... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,027 | 961,028 | u863370423 | cpp |
p03161 | #include <algorithm>
#include <iostream>
using namespace std;
const int inf = 0x3f3f3f3f;
int h[100100];
int dp[100100];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
int least = inf;
for ... | #include <algorithm>
#include <iostream>
using namespace std;
const int inf = 0x3f3f3f3f;
int h[100100];
int dp[100100];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
int least = inf;
for ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 961,029 | 961,030 | u863370423 | cpp |
p03161 | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// ifstream fin("test.in");
// #define int_max 0x3f3f3f3f
// #define int_min -0x3f3f3f3f
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> heights(n + 1, 0);
vector<long long int> dp(n + 1, 0);
long long int ... | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// ifstream fin("test.in");
// #define int_max 0x3f3f3f3f
// #define int_min -0x3f3f3f3f
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> heights(n + 1, 0);
vector<long long int> dp(n + 1, 0);
long long int ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,031 | 961,032 | u504583153 | cpp |
p03161 | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// ifstream fin("test.in");
// #define int_max 0x3f3f3f3f
// #define int_min -0x3f3f3f3f
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> heights(n + 1, 0);
vector<long long int> dp(n + 1, 0);
long long int ... | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// ifstream fin("test.in");
// #define int_max 0x3f3f3f3f
// #define int_min -0x3f3f3f3f
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> heights(n + 1, 0);
vector<long long int> dp(n + 1, 0);
long long int ... | [
"control_flow.loop.for.condition.change"
] | 961,033 | 961,032 | u504583153 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define pf printf
#d... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define pf printf
#d... | [
"control_flow.loop.for.condition.change"
] | 961,036 | 961,037 | u089230684 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define isLeap(x) ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define FAST ios_base::sync_with_stdio(0), cin.tie(0)
#define LCM(a, b) (a / __gcd(a, b)) * b;
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
#define fr(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define isLeap(x) ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define FAST ios_base::sync_with_stdio(0), cin.tie(0)
#define LCM(a, b) (a / __gcd(a, b)) * b;
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
#define fr(... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 961,042 | 961,043 | u088630768 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, i, j;
cin >> N >> K;
vector<int> h(N), dp(N, 10001);
for (i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (i = 1; i < N; i++) {
for (j = 1; j <= i && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i -... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, i, j;
cin >> N >> K;
vector<int> h(N), dp(N, 1e9 + 1);
for (i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (i = 1; i < N; i++) {
for (j = 1; j <= i && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i... | [
"literal.number.change",
"call.arguments.change"
] | 961,047 | 961,048 | u257920432 | cpp |
p03161 | /*
It’s Always Darkest Before the Dawn
This Time is that Darkness in you Life
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define pii pair<int, int>
#define a... | /*
It’s Always Darkest Before the Dawn
This Time is that Darkness in you Life
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define pii pair<int, int>
#define a... | [
"assignment.change"
] | 961,049 | 961,050 | u092237508 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repab(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define pb push_back
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repab(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define pb push_back
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 961,051 | 961,052 | u707315894 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int num, k, a[100005];
int dp[100005];
const int oo = 1e8 + 7;
int Min(int a, int b) {
if (a > b)
return b;
else
return a;
}
main() {
cin >> num >> k;
for (int i = 1; i <= num; ++i) {
cin >> a[i];
dp[i] = oo;
}
dp[1] = ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int num, k, a[100005];
int dp[100005];
const int oo = 1e9 + 7;
int Min(int a, int b) {
if (a > b)
return b;
else
return a;
}
main() {
cin >> num >> k;
for (int i = 1; i <= num; ++i) {
cin >> a[i];
dp[i] = oo;
}
dp[1] = ... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,064 | 961,063 | u630088972 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f;
ll dp[10000005];
ll a[10000005];
int main() {
int n, k;
cin >> n >> k;
memset(dp, INF, sizeof(dp));
for (int i ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f;
ll dp[10000005];
ll a[10000005];
int main() {
int n, k;
cin >> n >> k;
memset(dp, INF, sizeof(dp));
for (int i ... | [
"control_flow.branch.if.add"
] | 961,076 | 961,077 | u816631826 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define Me3za() \
ios_base::sync_with_stdio(0); \
cout.tie(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define Me3za() \
ios_base::sync_with_stdio(0); \
cout.tie(0); \
cin.tie(0); ... | [
"control_flow.loop.for.condition.change"
] | 961,078 | 961,079 | u816631826 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int n, k;
int a[200000];
int dp[200000];
int main() {
int i, j;
scanf("%d %d", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
dp[1] = 0;
for (i = 2; i <= n; i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int n, k;
int a[200000];
int dp[200000];
int main() {
int i, j;
scanf("%d %d", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
dp[1] = 0;
for (i = 2; i <= n; i... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 961,080 | 961,081 | u816631826 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog2(int *s, int n, int k) {
int dp[100005];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= 0 && (i - j) <= k; j--) {
dp[i] = min(dp[i], abs(s[i] - s[j]) + dp[j]);
}
}
return dp[n];
}
int main() {
int... | #include <bits/stdc++.h>
using namespace std;
int frog2(int *s, int n, int k) {
int dp[100005];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--) {
dp[i] = min(dp[i], abs(s[i] - s[j]) + dp[j]);
}
}
return dp[n];
}
int main() {
int... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,082 | 961,083 | u843286945 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namesp... | #include <bits/stdc++.h>
#define ll long long int
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namesp... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,094 | 961,093 | u546186505 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namesp... | #include <bits/stdc++.h>
#define ll long long int
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namesp... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,095 | 961,093 | u546186505 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int minima(int i, int a[], int h[], int k) {
int arr[k];
int min = abs(h[i - 1] - h[i]) + a[i - 1];
for (int j = 0; j < k; ++j) {
arr[j] = abs(h[i - j - 1] - h[i]) + a[i - j - 1];
if (arr[j] < min)
min = arr[j];
}
return min;
}
in... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int minima(int i, int a[], int h[], int k) {
int arr[k];
int min = abs(h[i - 1] - h[i]) + a[i - 1];
for (int j = 0; j < k; ++j) {
arr[j] = abs(h[i - j - 1] - h[i]) + a[i - j - 1];
if (arr[j] < min)
min = arr[j];
}
return min;
}
in... | [
"control_flow.loop.for.condition.change"
] | 961,098 | 961,099 | u026731686 | cpp |
p03161 | // Frog-1
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define N (ll)(1e7 + 5)
#define mod (ll)(1e9 + 7)
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> dp(n), v(n);
for (auto &x : v)
cin >> x;
dp[1] = abs(v[1] - v[0]);
for... | // Frog-1
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define N (ll)(1e7 + 5)
#define mod (ll)(1e9 + 7)
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> dp(n), v(n);
for (auto &x : v)
cin >> x;
dp[1] = abs(v[1] - v[0]);
for... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 961,103 | 961,104 | u355900184 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
vector<int> dp(N);
vector<int> h(N);
for (long long int i = 0; i < N; i++) {
cin >> h.at(i);
}
dp.at(0) = 0;
for (long long int i = 1; i < N; i++) {
for (long long int m = 1; m <= K; m++) {
if (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
vector<int> dp(N, 2e9);
vector<int> h(N);
for (long long int i = 0; i < N; i++) {
cin >> h.at(i);
}
dp.at(0) = 0;
for (long long int i = 1; i < N; i++) {
for (long long int m = 1; m <= K; m++) {
... | [
"call.arguments.add"
] | 961,110 | 961,111 | u120586196 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, i, k;
cin >> n >> k;
vector<long long int> h(n);
for (i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long int> cost(n);
cost[n - 1] = 0;
cost[n - 2] = a... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, i, k;
cin >> n >> k;
vector<long long int> h(n);
for (i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long int> cost(n);
cost[n - 1] = 0;
cost[n - 2] = a... | [
"control_flow.loop.for.condition.change"
] | 961,112 | 961,113 | u158748314 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll h[N];
for (ll i = 0; i < N; i++) {
cin >> h[i];
}
ll dp[N];
dp[0] = 0;
for (ll i = 1; i < N; i++) {
ll temp = i - 1;
ll minm = abs(h[i] - h[i - 1]) + h[i - 1];
while (temp >= 0 &&... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll h[N];
for (ll i = 0; i < N; i++) {
cin >> h[i];
}
ll dp[N];
dp[0] = 0;
for (ll i = 1; i < N; i++) {
ll temp = i - 1;
ll minm = abs(h[i] - h[i - 1]) + dp[i - 1];
while (temp >= 0 &... | [
"identifier.change",
"expression.operation.binary.change"
] | 961,118 | 961,119 | u874861811 | cpp |
p03161 | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <stack>
#include <string.h>
#include <string>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1 << 30);
int main() {
int n, k, h[110000];
cin >> n >> k;
f... | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <stack>
#include <string.h>
#include <string>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1 << 30);
int main() {
int n, k, h[110000];
cin >> n >> k;
f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,132 | 961,133 | u337018543 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll IMF = 1LL << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll IMF = 1LL << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,140 | 961,141 | u109191542 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
const ll M = 1000000007;
//------------------------------------------//
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
rep(i, N) cin >> h[i];
vector<ll> dp(N + 1, M);
dp[0] = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
const ll M = 1000000007;
//------------------------------------------//
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(100010);
rep(i, N) cin >> h[i];
vector<ll> dp(100010, M);
dp[0] ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 961,144 | 961,143 | u392973556 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n];
int height[n];
for (int i = 0; i < n; i++)
cin >> height[i];
dp[0] = 0;
dp[1] = abs(height[1] - height[0]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(height[i] - height[i - 1]);
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n];
int height[n];
for (int i = 0; i < n; i++)
cin >> height[i];
dp[0] = 0;
dp[1] = abs(height[1] - height[0]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(height[i] - height[i - 1]);
in... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 961,156 | 961,157 | u771595024 | cpp |
p03161 | // Frog 1.cpp : Defines the entry point for the console application.
//
//#include "stdafx.h"
#include <iostream>
using namespace std;
const int G = 1000 * 100 + 10;
int a[G];
long long dp[G];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long m;
dp[1] = abs(a... | // Frog 1.cpp : Defines the entry point for the console application.
//
//#include "stdafx.h"
#include <iostream>
using namespace std;
const int G = 1000 * 100 + 10;
int a[G];
long long dp[G];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long m;
dp[1] = abs(a... | [
"literal.number.change",
"assignment.value.change"
] | 961,158 | 961,159 | u091155617 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < n; i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = b - 1; i >= int(a); i--)
int main() {
int N, K;
cin >> N... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < n; i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = b - 1; i >= int(a); i--)
int main() {
int N, K;
cin >> N... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,171 | 961,172 | u811542492 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < n; i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = b - 1; i >= int(a); i--)
int main() {
int N, K;
cin >> N... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < n; i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = b - 1; i >= int(a); i--)
int main() {
int N, K;
cin >> N... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,173 | 961,172 | u811542492 | cpp |
p03161 | #include <bits/stdc++.h>
const int INF = 1e5 + 7;
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 dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int check = 0;
dp[i] = INF;
if (i - k < 0)
c... | #include <bits/stdc++.h>
const int INF = 1e9 + 5;
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 dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int check;
dp[i] = INF;
if (i - k < 0)
check... | [
"literal.number.change",
"expression.operation.binary.change"
] | 961,174 | 961,175 | u631895856 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int h[100001];
int dp[100001];
int main() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; ++i) {
int k_max = min(i - 1, K);
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int h[100001];
int dp[100001];
int main() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; ++i) {
int k_max = min(i - 1, K);
... | [
"literal.number.change",
"assignment.value.change"
] | 961,178 | 961,179 | u673928159 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 961,182 | 961,183 | u146209432 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)... | [] | 961,184 | 961,183 | u146209432 | cpp |
p03161 | #include <bits/stdc++.h>
#define FOR0(i, n) for (int i = 0; i < n; i++)
#define FOR(i, j, n) for (int i = j; i < n; i++)
// #define ll long long
// bool isEven(ll n) {return (n%2!=0)?false:true;}
using namespace std;
// atcoder - dp
// b
int a[100005], dp[100005];
int n, k;
int main() {
std::ios::sync_with_stdio... | #include <bits/stdc++.h>
#define FOR0(i, n) for (int i = 0; i < n; i++)
#define FOR(i, j, n) for (int i = j; i < n; i++)
// #define ll long long
// bool isEven(ll n) {return (n%2!=0)?false:true;}
using namespace std;
// atcoder - dp
// b
int a[100005], dp[100005];
int n, k;
int main() {
std::ios::sync_with_stdio... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,185 | 961,186 | u533931256 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
for (i = 1; i < n; i++) {
dp[i] = INT_MAX;
}
for (i = 0; i < n; i++) {
for (j = i + 1; j <= i + k; j++) {
dp[j] = min(d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
for (i = 1; i < n; i++) {
dp[i] = INT_MAX;
}
for (i = 0; i < n; i++) {
for (j = i + 1; j <= i + k; j++) {
if (j < n)
... | [
"control_flow.branch.if.add"
] | 961,187 | 961,188 | u157945820 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 961,195 | 961,196 | u710527399 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); ... | [
"misc.opposites",
"control_flow.loop.condition.change",
"expression.operator.compare.change"
] | 961,197 | 961,196 | u710527399 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.add"
] | 961,198 | 961,199 | u962241803 | cpp |
p03161 | #include <cmath>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
int cost[n + 1];
for (int i = 1; i < n + 1; ++i) {
cin >> h[i];
cost[i] = INT16_MAX;
}
cost[1] = 0;
for (int i = 2; i <= n; ++i) {
for (int... | #include <cmath>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
int cost[n + 1];
for (int i = 1; i < n + 1; ++i) {
cin >> h[i];
cost[i] = INT32_MAX;
}
cost[1] = 0;
for (int i = 2; i <= n; ++i) {
for (int... | [
"assignment.value.change",
"identifier.change"
] | 961,200 | 961,201 | u650152779 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
t = 1;
// cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
int arr[n];
long long int dp[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
dp[i] = LONG_MAX;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
t = 1;
// cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
int arr[n];
long long int dp[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
dp[i] = LONG_MAX;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 961,202 | 961,203 | u357433883 | cpp |
p03161 | // aarsh01rsh@gmail.com
// Aarsh Sharma
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char ch) {
string s(1, ch);
return '\'' + s + '\'';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "... | // aarsh01rsh@gmail.com
// Aarsh Sharma
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char ch) {
string s(1, ch);
return '\'' + s + '\'';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 961,205 | 961,206 | u065893594 | cpp |
p03161 | // kartikay26
#include <bits/stdc++.h>
using namespace std;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#de... | // kartikay26
#include <bits/stdc++.h>
using namespace std;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#de... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,207 | 961,208 | u948698894 | cpp |
p03161 | // kartikay26
#include <bits/stdc++.h>
using namespace std;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#de... | // kartikay26
#include <bits/stdc++.h>
using namespace std;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#de... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",... | 961,209 | 961,208 | u948698894 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define pq priority_queue
#define pb push_back
#define mp make_pair
int root(int dsu[], int x) {
while (dsu[x] != x) {
dsu[x] = dsu[dsu[x]];
x = dsu[x];
}
return x;
}
void init(int dsu[], int n) {
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define pq priority_queue
#define pb push_back
#define mp make_pair
int root(int dsu[], int x) {
while (dsu[x] != x) {
dsu[x] = dsu[dsu[x]];
x = dsu[x];
}
return x;
}
void init(int dsu[], int n) {
for (int ... | [
"literal.number.change",
"assignment.value.change"
] | 961,212 | 961,213 | u092951662 | cpp |
p03161 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h> //算術演算子
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
// #include <bits/stdc++.h>
using namespace... | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h> //算術演算子
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
// #include <bits/stdc++.h>
using namespace... | [
"literal.number.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 961,214 | 961,215 | u966508131 | cpp |
p03161 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(... | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(... | [
"expression.operation.binary.add"
] | 961,216 | 961,217 | u966508131 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs... | [] | 961,218 | 961,219 | u474674098 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7, N = 1e5 + 10;
#define pb push_back
#define f first
#define s second
int n, a[N], dp[N], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0, dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i... | #include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7, N = 1e5 + 10;
#define pb push_back
#define f first
#define s second
int n, a[N], dp[N], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0, dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i... | [
"control_flow.loop.for.condition.change"
] | 961,220 | 961,221 | u459121100 | cpp |
p03161 | #include <climits>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int m[n + 1];
int mi;
m[0] = 0;
m[1] = 0;
m[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
int j;
if (n - k >... | #include <climits>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int m[n + 1];
int mi;
m[0] = 0;
m[1] = 0;
m[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
int j;
if (i - k >... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 961,226 | 961,227 | u952656223 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
vect... | [
"control_flow.loop.for.condition.change"
] | 961,228 | 961,229 | u423624748 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
vect... | [
"control_flow.loop.for.condition.change"
] | 961,230 | 961,229 | u423624748 | cpp |
p03161 | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int h[100005], dp[100005], n, k;
int go(int idx) {
// cout << idx << endl;
if (idx == n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ans = 1e9 + 7;
for (int j = 1; j <= k; j++) {
if (idx + j < n) {
ans = min(ans, go(i... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int h[100005], dp[100005], n, k;
int go(int idx) {
// cout << idx << endl;
if (idx == n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ans = 1e9 + 7;
for (int j = 1; j <= k; j++) {
if (idx + j < n) {
ans = min(ans, go(i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,233 | 961,234 | u214622286 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | [
"literal.number.change",
"assignment.value.change"
] | 961,235 | 961,236 | u834901453 | cpp |
p03161 | #include <bits/stdc++.h>
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 long INF = 1LL << 60;
long long h... | #include <bits/stdc++.h>
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 long INF = 1LL << 60;
long long h... | [
"expression.operation.binary.add"
] | 961,237 | 961,238 | u000598325 | cpp |
p03161 | #include <bits/stdc++.h>
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 long INF = 1LL << 60;
long long h... | #include <bits/stdc++.h>
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 long INF = 1LL << 60;
long long h... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,239 | 961,238 | u000598325 | cpp |
p03161 | #include <bits/stdc++.h>
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 long INF = 1LL << 60;
long long h... | #include <bits/stdc++.h>
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 long INF = 1LL << 60;
long long h... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,240 | 961,238 | u000598325 | cpp |
p03161 | #include <bits/stdc++.h>
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 long INF = 1LL << 60;
long long h... | #include <bits/stdc++.h>
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 long INF = 1LL << 60;
long long h... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,241 | 961,238 | u000598325 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n;
int k;
long long arr[100001];
long long dp[100001];
long long bus(int x) {
if (x == n - 1)
return 0;
if (dp[x] != -1)
return dp[x];
dp[x] = abs(arr[x] - arr[x + 1]) + bus(x + 1);
for (int i = 2; i <= k; i++) {
if ((x + i) == n - 1)
break;
... | #include <bits/stdc++.h>
using namespace std;
int n;
int k;
long long arr[100001];
long long dp[100001];
long long bus(int x) {
if (x >= n - 1)
return 0;
if (dp[x] != -1)
return dp[x];
dp[x] = abs(arr[x] - arr[x + 1]) + bus(x + 1);
for (int i = 2; i <= k; i++) {
if ((x + i) > n - 1)
break;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,258 | 961,259 | u552126476 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> v... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> v... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,260 | 961,261 | u639297580 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> v... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> v... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,262 | 961,261 | u639297580 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> v... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> v... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,263 | 961,261 | u639297580 | cpp |
p03161 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.function.change",
"call.arguments.add"
] | 961,272 | 961,273 | u365512540 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
co... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
co... | [
"control_flow.loop.for.condition.change"
] | 961,274 | 961,275 | u179256264 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> cost(N, 0);
cost[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
int res = INT_MAX;
for (int k = 1; k <= K and i - k <= 0; k++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> cost(N, 0);
cost[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
int res = INT_MAX;
for (int k = 1; k <= K and i - k >= 0; k++) ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,276 | 961,277 | u275188852 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define input freopen("/Users/shahadat/Desktop/input.txt", "r", stdin)
int const MOD = 1e9 + 7;
using namespace std;
int dp[100010], num[100010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num... | #include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define input freopen("/Users/shahadat/Desktop/input.txt", "r", stdin)
int const MOD = 1e9 + 7;
using namespace std;
int dp[200010], num[200010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 961,278 | 961,279 | u411270124 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define input freopen("/Users/shahadat/Desktop/input.txt", "r", stdin)
int const MOD = 1e9 + 7;
using namespace std;
int dp[100010], num[100010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num... | #include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define input freopen("/Users/shahadat/Desktop/input.txt", "r", stdin)
int const MOD = 1e9 + 7;
using namespace std;
int dp[200010], num[200010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 961,280 | 961,279 | u411270124 | cpp |
p03161 |
///╔══╗
///╚╗╔╝
///╔╝╚(¯`v´¯)
///╚══╝`.¸.´farzin
#include <bits/stdc++.h>
#define int int64_t
#define pb push_back
#define ibsws ios_base::sync_with_stdio
#define gcd __gcd
#define s second
#define f first
typedef std::pair<int, int> pii;
using namespace std;
const int N = 1e5 + 1e2;
int n, dp[N], h[N], k;
int32_... |
///╔══╗
///╚╗╔╝
///╔╝╚(¯`v´¯)
///╚══╝`.¸.´farzin
#include <bits/stdc++.h>
#define int int64_t
#define pb push_back
#define ibsws ios_base::sync_with_stdio
#define gcd __gcd
#define s second
#define f first
typedef std::pair<int, int> pii;
using namespace std;
const int N = 1e5 + 1e2;
int n, dp[N], h[N], k;
int32_... | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 961,281 | 961,282 | u624848802 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> v, b;
for (long long int i = 0; i < n; i++) {
long long int p;
cin >> p;
v.push_back(p);
}
long long int count = 0, cnt = 0, a = 0;
b.push_back(0);
for (long long int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> v, b;
for (long long int i = 0; i < n; i++) {
long long int p;
cin >> p;
v.push_back(p);
}
long long int count = 0, cnt = 0, a = 0;
b.push_back(0);
for (long long int i = 1; i... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,300 | 961,301 | u483145617 | cpp |
p03161 | // boom diggy diggy boom boom
/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
*/
#include <bits/stdc++.h>
#define ull unsigned long long int
#define fast \
ios_base::sync_with_stdio(false); ... | // boom diggy diggy boom boom
/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
*/
#include <bits/stdc++.h>
#define ull unsigned long long int
#define fast \
ios_base::sync_with_stdio(false); ... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 961,307 | 961,308 | u513144254 | cpp |
p03161 | #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];
vector<int> dp(n, INT_MIN);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i - j >= 0) {
dp[i] = min(dp[i - j] ... | #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];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i - j >= 0) {
dp[i] = min(dp[i - j] ... | [] | 961,313 | 961,314 | u400267362 | 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[100000];
for (int i = 0; i < 100000; i++)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = 1... | #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[100000];
for (int i = 0; i < 100000; i++)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = 1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,315 | 961,316 | u504035134 | cpp |
p03161 | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define INF 1000000000
#de... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define INF 1000000000
#de... | [
"control_flow.loop.for.condition.change"
] | 961,324 | 961,325 | u290693410 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[100001];
int h[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int mini = INT_MAX;
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
mini = INT_MAX;
for ... | #include <bits/stdc++.h>
using namespace std;
int dp[100001];
int h[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int mini = INT_MAX;
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
mini = INT_MAX;
for ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,330 | 961,331 | u167245821 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, temp;
cin >> n >> k;
long long int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
long long int dp[n + 1], ind = 0;
dp[1] = 0;
for (long long int i = 2; i <= n; i++) {
temp = LONG_MAX;
for (long long int j = m... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, temp;
cin >> n >> k;
long long int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
long long int dp[n + 1], ind = 1;
dp[1] = 0;
for (long long int i = 2; i <= n; i++) {
temp = LONG_MAX;
for (long long int j = m... | [
"literal.number.change",
"variable_declaration.value.change"
] | 961,332 | 961,333 | u547420959 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT_MAX), v(n, 0);
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(v[i] - v[j]));
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT_MAX), v(n, 0);
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k && j < n; j++) {
dp[j] = min(dp[j], dp[i] + abs(v[i] - v[j... | [
"control_flow.loop.for.condition.change"
] | 961,337 | 961,338 | u314035582 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT_MAX), v(n, 0);
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(v[i] - v[j]));
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT_MAX), v(n, 0);
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(... | [
"control_flow.branch.if.add"
] | 961,337 | 961,339 | u314035582 | cpp |
p03161 | #include <bits/stdc++.h>
#define f0(i, a, b) for (int i = a; i <= b; ++i)
#define f1(i, a, b) for (int i = a; i >= b; --i)
#define DEBUG(x) cerr << #x << " = " << x << endl
#define X first
#define Y second
using namespace std;
const long long base = 1e9 + 7;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef pair<... | #include <bits/stdc++.h>
#define f0(i, a, b) for (int i = a; i <= b; ++i)
#define f1(i, a, b) for (int i = a; i >= b; --i)
#define DEBUG(x) cerr << #x << " = " << x << endl
#define X first
#define Y second
using namespace std;
const long long base = 1e9 + 7;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef pair<... | [
"expression.operation.binary.remove"
] | 961,344 | 961,345 | u316398243 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, tmp;
cin >> n >> k;
deque<int> input(k), ans(k);
cin >> input[0];
if (k > n) {
k = n - 1;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
ans[0] = 0;
for (int i = 1; i < k; i++) {
cin >> input[i];
int mn = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, tmp;
cin >> n >> k;
deque<int> input(k), ans(k);
cin >> input[0];
if (k > n) {
k = n;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
ans[0] = 0;
for (int i = 1; i < k; i++) {
cin >> input[i];
int mn = INT_... | [
"expression.operation.binary.remove"
] | 961,352 | 961,353 | u564531070 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, t;
cin >> n >> k;
vector<int> input(n, 0);
vector<int> score(n, 0);
for (int i = 0; i < n; i++) {
cin >> t;
input[i] = t;
}
for (int i = 1; i < k; i++) {
t = INT_MAX;
for (int j = 1; j <= i; j++) {
t = min(t, a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, t;
cin >> n >> k;
vector<int> input(n, 0);
vector<int> score(n, 0);
for (int i = 0; i < n; i++) {
cin >> t;
input[i] = t;
}
for (int i = 1; i < k && i < n; i++) {
t = INT_MAX;
for (int j = 1; j <= i; j++) {
t =... | [
"control_flow.loop.for.condition.change"
] | 961,354 | 961,355 | u564531070 | cpp |
p03161 | #include <bits/stdtr1c++.h>
// typedef __int128 int128;
// typedef __float128 float128;
using namespace std;
using namespace rel_ops;
typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef vector<pt> pol;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<ld>... | #include <bits/stdtr1c++.h>
// typedef __int128 int128;
// typedef __float128 float128;
using namespace std;
using namespace rel_ops;
typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef vector<pt> pol;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<ld>... | [
"control_flow.loop.for.condition.change"
] | 961,360 | 961,361 | u317474337 | cpp |
p03161 | #include <stdio.h>
#define MAX (100000)
#define ABS(NUM) ((NUM > 0) ? (NUM) : ((-1) * (NUM)))
#define MIN(NUM1, NUM2) ((NUM1 > NUM2) ? (NUM2) : (NUM1))
int main(void) {
int n, k, h[MAX] = {};
int i, j;
int step[MAX] = {};
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++)
scanf("%d", &h[i]);
for (i = ... | #include <stdio.h>
#define MAX (100000)
#define ABS(NUM) ((NUM > 0) ? (NUM) : ((-1) * (NUM)))
#define MIN(NUM1, NUM2) ((NUM1 > NUM2) ? (NUM2) : (NUM1))
int main(void) {
int n, k, h[MAX] = {};
int i, j;
int step[MAX] = {};
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++)
scanf("%d", &h[i]);
for (i = ... | [
"literal.number.change",
"assignment.value.change"
] | 961,364 | 961,365 | u490101632 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,366 | 961,367 | u129652323 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("frog.txt","r", stdin);
ll n, net, sum, k;
cin >> n >> k;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n + 1];
dp[0] = 0;
dp[1] = dp[0] + abs(a... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("frog.txt","r", stdin);
ll n, net, sum, k;
cin >> n >> k;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n + 1];
dp[0] = 0;
dp[1] = dp[0] + abs(a... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,368 | 961,369 | u504873850 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 200000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
io... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 200000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
io... | [] | 961,374 | 961,375 | u883546077 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.