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 <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> minCost(n);
minCost[0] = 0;
minCost[1] = abs(height[0] - height[1]);
for (int i = 2; i < n; i++) {
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> minCost(n);
minCost[0] = 0;
minCost[1] = abs(height[0] - height[1]);
for (int i = 2; i < n; i++) {
... | [
"control_flow.loop.for.condition.change"
] | 957,053 | 957,054 | u812439155 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v[i] = a;
}
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k and... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v[i] = a;
}
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k and... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 957,059 | 957,060 | u600929585 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int j[N], dp[N];
for (int i = 0; i < N; i++) {
cin >> j[i];
}
memset(dp, 1000000000, sizeof(dp));
dp[0] = 0;
// dp[1]=abs(j[1]-j[0]);
// int ind,val;
for (int i = 1; i < N; i++) {
for (int r = 1; r <= min(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int j[N], dp[N];
for (int i = 0; i < N; i++) {
cin >> j[i];
}
memset(dp, 1000000, sizeof(dp));
dp[0] = 0;
// dp[1]=abs(j[1]-j[0]);
// int ind,val;
for (int i = 1; i < N; i++) {
for (int r = 1; r <= min(i, K... | [
"literal.number.change",
"call.arguments.change"
] | 957,063 | 957,064 | u760654905 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
dp[0] = 0;
for (int i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= max(0, i - k); j--) {
dp[i] = min(dp[i], dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= max(0, i - k); j--) {
dp[i] = min(dp[i], dp... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,066 | 957,067 | u036426043 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef pair<int, int> ii;
typedef long long ll;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define mod2 998244353
#define ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef pair<int, int> ii;
typedef long long ll;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define mod2 998244353
#define ... | [
"literal.number.change",
"assignment.value.change"
] | 957,068 | 957,069 | u988261213 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1] = {0};
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--)
dp[i] = min(dp[j] + abs(h[i] ... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 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[j] + abs(h[i] ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,081 | 957,082 | u960146998 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> in(n);
for (int i = 0; i < n; i++)
cin >> in[i];
vector<int> dp(n, 1e5 + 7);
dp[0] = 0;
for (int i = 1; i < n; i++)
for (int t = (i - k >= 0 ? i - k : 0); t < i; t++)
dp[i] = min(dp[t] + abs(in[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> in(n);
for (int i = 0; i < n; i++)
cin >> in[i];
vector<int> dp(n, 2e9 + 7);
dp[0] = 0;
for (int i = 1; i < n; i++)
for (int t = (i - k >= 0 ? i - k : 0); t < i; t++)
dp[i] = min(dp[t] + abs(in[... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,091 | 957,092 | u578026104 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll arr[n];
ll dp[n];
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
for (ll i = k; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k && i - j >= 0; j++)
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll arr[n];
ll dp[n];
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
for (ll i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k && i - j >= 0; j++)
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 957,093 | 957,094 | u893023964 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
const string ddd = "Debug\n";
#define de_ar(arr, n) \
for (int i = 0; i < n; i++) \
cout ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
const string ddd = "Debug\n";
#define de_ar(arr, n) \
for (int i = 0; i < n; i++) \
cout ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,098 | 957,099 | u366464757 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long a[n + 1];
for (long i = 1; i <= n; i++)
cin >> a[i];
long long ans[n + 1];
ans[0] = 0;
ans[1] = 0;
for (long i = 2; i <= n; i++) {
ans[i] = INT_MAX;
for (long j = i - 1; j >= 0 and j >= (... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long a[n + 1];
for (long i = 1; i <= n; i++)
cin >> a[i];
long long ans[n + 1];
ans[0] = 0;
ans[1] = 0;
for (long i = 2; i <= n; i++) {
ans[i] = INT_MAX;
for (long j = i - 1; j >= 1 and j >= (... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,102 | 957,103 | u050539031 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | [] | 957,104 | 957,105 | u828388155 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> v, int k) {
vector<int> a(v.size(), 10001);
a[0] = 0;
for (int i = 1; i < v.size(); i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
a[i] = min(abs(v[i] - v[i - j]) + a[i - j], a[i]);
else
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> v, int k) {
vector<int> a(v.size(), INT_MAX);
a[0] = 0;
for (int i = 1; i < v.size(); i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
a[i] = min(abs(v[i] - v[i - j]) + a[i - j], a[i]);
else
break;
}
}... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 957,106 | 957,107 | u635291249 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> v, int k) {
vector<int> a(v.size(), 10001);
a[0] = 0;
for (int i = 1; i < v.size(); i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
a[i] = min(abs(v[i] - v[i - 1]) + a[i - 1], a[i]);
else
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> v, int k) {
vector<int> a(v.size(), INT_MAX);
a[0] = 0;
for (int i = 1; i < v.size(); i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
a[i] = min(abs(v[i] - v[i - j]) + a[i - j], a[i]);
else
break;
}
}... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 957,108 | 957,107 | u635291249 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int *dp = new int[n]; // dp[i]はi番目の足場までの最小コスト
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]);
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int *dp = new int[n]; // dp[i]はi番目の足場までの最小コスト
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]);
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,109 | 957,110 | u110383054 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int *dp = new int[n]; // dp[i]はi番目の足場までの最小コスト
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]);
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int *dp = new int[n]; // dp[i]はi番目の足場までの最小コスト
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]);
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 957,111 | 957,110 | u110383054 | cpp |
p03161 | #include <bits/stdc++.h>
#include <set>
#include <vector>
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#... | #include <bits/stdc++.h>
#include <set>
#include <vector>
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 957,118 | 957,119 | u755542082 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j = 0;
cin >> n >> k;
int A[n], dp[n];
for (i = 0; i < n; i++)
cin >> A[i];
if (k >= n)
cout << abs(A[0] - A[n - 1]) << endl;
else {
for (i = 0; i <= k; i++)
dp[i] = abs(A[i] - A[0]);
for (i = k + 1; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j = 0;
cin >> n >> k;
int A[n], dp[n];
for (i = 0; i < n; i++)
cin >> A[i];
if (k >= n)
cout << abs(A[0] - A[n - 1]) << endl;
else {
for (i = 0; i <= k; i++)
dp[i] = abs(A[i] - A[0]);
for (i = k + 1; i < n; i+... | [
"literal.number.change",
"variable_declaration.value.change"
] | 957,120 | 957,121 | u028218659 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j = 0;
cin >> n >> k;
int A[n], dp[n];
for (i = 0; i < n; i++)
cin >> A[i];
if (k >= n)
cout << abs(A[0] - A[n - 1]) << endl;
else {
for (i = 0; i < k; i++)
dp[i] = abs(A[i] - A[0]);
for (i = k; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j = 0;
cin >> n >> k;
int A[n], dp[n];
for (i = 0; i < n; i++)
cin >> A[i];
if (k >= n)
cout << abs(A[0] - A[n - 1]) << endl;
else {
for (i = 0; i <= k; i++)
dp[i] = abs(A[i] - A[0]);
for (i = k + 1; i < n; i+... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.initializer.change",
"assignment.change",
"literal.number.change",
"variable_declaration.value.change"
] | 957,122 | 957,121 | u028218659 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb(a) push_back(a)
#define vi vector<int>
#define loop(i, n) for (int i = 1; i <= n; i++)
#define loop0(i, n) for (int i = 0; i < n; i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%d", i)
long long int n, k, h[100001], dp[100001];
long long int solve(... | #include <bits/stdc++.h>
using namespace std;
#define pb(a) push_back(a)
#define vi vector<int>
#define loop(i, n) for (int i = 1; i <= n; i++)
#define loop0(i, n) for (int i = 0; i < n; i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%d", i)
long long int n, k, h[100001], dp[100001];
long long int solve(... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 957,133 | 957,134 | u449959834 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
retur... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,139 | 957,136 | u058106405 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
retur... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,139 | 957,144 | u058106405 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
retur... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,139 | 957,145 | u058106405 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<long long> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= max(0, i - k); j++) {
dp[i] = min(dp[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
vector<long long> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
// for(int i=0; i<n; i++) cout<<arr[i]<<" ";
// cout<<endl;
vector<long long> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 1; i < n; i++) {
... | [] | 957,157 | 957,158 | u081697951 | cpp |
p03161 | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int dp[100005];
int frog(int a[], int n, int k) {
for (int i = 2; i <= n; i++) {
dp[i] = 1e9;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--)
dp[i] = min(dp[i], abs(a[i] - a[j]) + dp[j]);
}
return dp[n];
}
int main() {
... | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int dp[100005];
int frog(int a[], int n, int k) {
for (int i = 2; i <= n; i++) {
dp[i] = 1e9;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--)
dp[i] = min(dp[i], abs(a[i] - a[j]) + dp[j]);
}
return dp[n];
}
int main() {
... | [
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 957,167 | 957,168 | u320938106 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define sorted(a_1) sort(a_1.begin(), a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(), a_1.rend())
#define t1(a_1) cout << a_1 << endl;
#define t2(a_1) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define sorted(a_1) sort(a_1.begin(), a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(), a_1.rend())
#define t1(a_1) cout << a_1 << endl;
#define t2(a_1) ... | [
"control_flow.loop.for.condition.change"
] | 957,173 | 957,174 | u806983635 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define po2(z) 1 << (ll)z
#define fr(i, x, n) for (ll i = (ll)(x); i < (ll)(n); ++i)
#define rf(i, x, n) for (ll i = (ll)(x); i >= (ll)(n); --i)
#define modinv(x) powah(x, mod - 2)
#define ncr(n, r) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define po2(z) 1 << (ll)z
#define fr(i, x, n) for (ll i = (ll)(x); i < (ll)(n); ++i)
#define rf(i, x, n) for (ll i = (ll)(x); i >= (ll)(n); --i)
#define modinv(x) powah(x, mod - 2)
#define ncr(n, r) ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 957,177 | 957,178 | u600948506 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int N = 100050;
int dp[N];
int n, arr[N];
int rec(int pos) {
if (pos == n + 1)
return 0;
int &ret = dp[pos];
if (ret != -1)
return ret;
ret = 1e9;
ret = min(ret, abs(arr[pos] - arr[pos + 1]) + rec(pos + 1));
if (pos + 2 <= n)
ret = min(ret, a... | #include <bits/stdc++.h>
using namespace std;
const int N = 100050;
int dp[N];
int n, arr[N];
int rec(int pos) {
if (pos == n)
return 0;
int &ret = dp[pos];
if (ret != -1)
return ret;
ret = 1e9;
ret = min(ret, abs(arr[pos] - arr[pos + 1]) + rec(pos + 1));
if (pos + 2 <= n)
ret = min(ret, abs(a... | [
"expression.operation.binary.remove"
] | 957,179 | 957,181 | u560514115 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[100'000 + 5]; /// dp[i] = min cost to get from 0 to i
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> input(n);
for (int i = 0; i < n; i++)
cin >> input[i];
dp[0] = 0;
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
int dp[100'000 + 5]; /// dp[i] = min cost to get from 0 to i
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> input(n);
for (int i = 0; i < n; i++)
cin >> input[i];
dp[0] = 0;
for (int i = 1; ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,180 | 957,182 | u829999461 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> as(n, 0);
for (auto &a : as)
cin >> a;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(as[1] - as[0]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> as(n, 0);
for (auto &a : as)
cin >> a;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(as[1] - as[0]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,186 | 957,187 | u067151927 | cpp |
p03160 | #include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> dp(n, 114514), num(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i... | #include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> dp(n, 1145141919), num(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(... | [
"literal.number.change",
"call.arguments.change"
] | 957,191 | 957,192 | u952437626 | cpp |
p03160 | #include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n, 114514), num(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1],... | #include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> dp(n, 1145141919), num(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"call.arguments.change"
] | 957,194 | 957,192 | u952437626 | cpp |
p03161 | #include <bits/stdc++.h>
#define filename "frog"
#define int long long
#define oo 1e9
#define N 25
using namespace std;
int n, k;
int f[N], a[N];
void open() {
// freopen(filename".inp","r",stdin) ;
// freopen(filename".out","w",stdout) ;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void readin(... | #include <bits/stdc++.h>
#define filename "frog"
#define int long long
#define oo 1e9
#define N 200005
using namespace std;
int n, k;
int f[N], a[N];
void open() {
// freopen(filename".inp","r",stdin) ;
// freopen(filename".out","w",stdout) ;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void rea... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 957,193 | 957,195 | u416328102 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(0);
ll n, i;
cin >> n;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
if (n == 2)
cout << abs(a[1] - a[0]) << "\n";
else {
ll dp[n];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(0);
ll n, i;
cin >> n;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
if (n == 2)
cout << abs(a[1] - a[0]) << "\n";
else {
ll dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (... | [] | 957,196 | 957,198 | u319435722 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
static int dp[1000000000];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 2]... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
int dp[1000000];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i... | [
"variable_declaration.specifier.remove",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 957,200 | 957,202 | u863044225 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | [
"call.arguments.add"
] | 957,448 | 957,449 | u838391700 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | [
"call.arguments.add"
] | 957,450 | 957,449 | u838391700 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
int dp[1000000000];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 2] + abs(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
int dp[1000000];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 957,203 | 957,202 | u863044225 | cpp |
p03161 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | [
"assignment.change"
] | 957,210 | 957,214 | u608773191 | cpp |
p03161 | // https://atcoder.jp/contests/dp/tasks/dp_a
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vb vector<bool>
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll, ll>
#define MOD 1000000007
#define MAX_TIME 1e9
#define nl "\n"
#define sp " "
#define gcd __g... | // https://atcoder.jp/contests/dp/tasks/dp_a
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vb vector<bool>
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll, ll>
#define MOD 1000000007
#define MAX_TIME 1e9
#define nl "\n"
#define sp " "
#define gcd __g... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 957,453 | 957,454 | u317884892 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[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++) {
i... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[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++) {
i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,218 | 957,220 | u629532292 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n);
int pos = a[0];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i])... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n);
int pos = a[0];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i])... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,222 | 957,224 | u339560028 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int niz[MAXN], DP[MAXN], n;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> niz[i];
DP[0] = 0;
DP[1] = abs(niz[0] - niz[1]);
for (int i = 1; i < n; i++) {
DP[i] = min(DP[i - 1] + abs(niz[i - 1] - niz[i]),
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int niz[MAXN], DP[MAXN], n;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> niz[i];
DP[0] = 0;
DP[1] = abs(niz[0] - niz[1]);
for (int i = 2; i < n; i++) {
DP[i] = min(DP[i - 1] + abs(niz[i - 1] - niz[i]),
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,209 | 957,211 | u185583625 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n);
int pos = a[0];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i])... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n);
int pos = a[0];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i])... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 957,226 | 957,224 | u339560028 | cpp |
p03161 | /* C program for Merge Sort */
#include <bits/stdc++.h>
using namespace std;
int dp[100001];
int a[100001];
int n;
int k;
long long int mod = 1000000007;
int max_q(int i) {
// cout<<"Function enters"<<endl;
if (i >= n - 1) {
return 0;
}
int m = INT_MAX;
if (dp[i] != -1) {
return dp[i];
}
for (int... | #include <bits/stdc++.h>
using namespace std;
int dp[100001];
int a[100001];
int n;
int k;
long long int mod = 1000000007;
int max_q(int i) {
// cout<<"Function enters"<<endl;
if (i >= n - 1) {
return 0;
}
int m = INT_MAX;
if (dp[i] != -1) {
return dp[i];
}
for (int j = 1; j <= min(k, n - 1 - i);... | [
"control_flow.loop.for.condition.change"
] | 957,460 | 957,461 | u395649803 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int stones[101];
int steps[101];
int main() {
int N, K;
scanf("%d %d", &N, &K);
int pos = 0;
for (int i = 0; i < N; ++i) {
int stone;
scanf("%d", &stone);
if (i == 0) {
steps[pos] = 0;
stones[pos] = stone;
} else {
int m = 10000000... | #include <bits/stdc++.h>
using namespace std;
int stones[101];
int steps[101];
int main() {
int N, K;
scanf("%d %d", &N, &K);
int pos = 0;
for (int i = 0; i < N; ++i) {
int stone;
scanf("%d", &stone);
if (i == 0) {
steps[pos] = 0;
stones[pos] = stone;
} else {
int m = 0x7FFFFF... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 957,464 | 957,465 | u803403788 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[N], dd[N] = {};
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
dd[0] = 0;
dd[1] = abs(arr[0] - arr[1]);
for (int... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[N], dd[N] = {};
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
dd[0] = 0;
dd[1] = abs(arr[0] - arr[1]);
for (int... | [
"assignment.change"
] | 957,227 | 957,229 | u566755496 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + (abs(h[i] - h[i - 1]));
if (i > 1)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i -... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + (abs(h[i] - h[i - 1]));
if (i > 1)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i -... | [
"expression.operation.binary.add"
] | 957,231 | 957,233 | u573738515 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int stones[101];
int steps[101];
int main() {
int N, K;
scanf("%d %d", &N, &K);
int pos = 0;
for (int i = 0; i < N; ++i) {
int stone;
scanf("%d", &stone);
if (i == 0) {
steps[pos] = 0;
stones[pos] = stone;
} else {
int m = 10001;
... | #include <bits/stdc++.h>
using namespace std;
int stones[101];
int steps[101];
int main() {
int N, K;
scanf("%d %d", &N, &K);
int pos = 0;
for (int i = 0; i < N; ++i) {
int stone;
scanf("%d", &stone);
if (i == 0) {
steps[pos] = 0;
stones[pos] = stone;
} else {
int m = 0x7FFFFF... | [
"literal.number.change",
"variable_declaration.value.change"
] | 957,466 | 957,465 | u803403788 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + (abs(h[i] - h[i - 1]));
if (i > 2)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i -... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + (abs(h[i] - h[i - 1]));
if (i > 1)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i -... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 957,235 | 957,233 | u573738515 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, n) cin >> h[i + 1];
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, n) cin >> h[i + 1];
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <=... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,468 | 957,469 | u016334391 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int nxx = 1e5 + 5;
int arr[nxx], dp[nxx];
int n;
int main() {
cin >> n;
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof(dp));
int min1 = 2e5 + 5;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
int c = 0;
for... | #include <bits/stdc++.h>
using namespace std;
const int nxx = 1e5 + 5;
int arr[nxx], dp[nxx];
int n;
int main() {
cin >> n;
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof(dp));
int min1 = 1e6 + 5;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
int c = 0;
for... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 957,252 | 957,246 | u690116847 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, n) cin >> h[i + 1];
h[0] = h[1];
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, n) cin >> h[i + 1];
h[0] = h[1];
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
for (... | [
"literal.number.change",
"assignment.value.change"
] | 957,470 | 957,471 | u016334391 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int nxx = 1e5 + 5;
int arr[nxx], dp[nxx];
int n;
int main() {
cin >> n;
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof(dp));
int min1 = 1e5 + 5;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
int c = 0;
for... | #include <bits/stdc++.h>
using namespace std;
const int nxx = 1e5 + 5;
int arr[nxx], dp[nxx];
int n;
int main() {
cin >> n;
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof(dp));
int min1 = 1e6 + 5;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
int c = 0;
for... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 957,254 | 957,246 | u690116847 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define M_PIl 3.141592653589793238462643383279502884L /* pi */
const ll M = 1e9 + 7;
const int MaxM = 100005;
void... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define M_PIl 3.141592653589793238462643383279502884L /* pi */
const ll M = 1e9 + 7;
const int MaxM = 100005;
void... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 957,474 | 957,475 | u485924641 | cpp |
p03160 | /*
TASK: nocows
LANG: C++14
*/
#include "bits/stdc++.h"
typedef long long ll;
typedef long double ld;
using namespace std;
#define finish(x) return cout << x, 0;
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
const string USCAO_TAG = "nocow... | /*
TASK: nocows
LANG: C++14
*/
#include "bits/stdc++.h"
typedef long long ll;
typedef long double ld;
using namespace std;
#define finish(x) return cout << x, 0;
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
const string USCAO_TAG = "nocow... | [
"control_flow.loop.for.condition.change"
] | 957,259 | 957,261 | u557558723 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update> ordered_set; #define os_find(k)
find_by_order(k) #define os_ord... | #include <bits/stdc++.h>
using namespace std;
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update> ordered_set; #define os_find(k)
find_by_order(k) #define os_ord... | [
"literal.number.change",
"variable_declaration.value.change"
] | 957,265 | 957,264 | u595525271 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1e9
int main(void) {
int N;
cin >> N;
vector<int> h(N + 2);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(N + 2, 10000);
dp[0] = 0;
for (int i = 0; i < N; i++) {
if (dp[i + 1] > dp[i] + abs(h[i] - h[i + 1]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1e9
int main(void) {
int N;
cin >> N;
vector<ll> h(N + 2);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N + 2, INF);
dp[0] = 0;
for (int i = 0; i < N; i++) {
if (dp[i + 1] > dp[i] + abs(h[i] - h[i + 1])) {... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 957,274 | 957,276 | u511344501 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
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 <... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
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 <... | [
"call.add",
"call.arguments.change"
] | 957,476 | 957,477 | u509516894 | 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];
if (n == 0 || n == 1)
cout << 0 << endl;
else {
int dp[n + 1];
dp[0] = 1, dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++... | #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];
if (n == 0 || n == 1)
cout << 0 << endl;
else {
int dp[n + 1];
dp[0] = 1, dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"expression.operation.binary.remove"
] | 957,267 | 957,269 | u733347296 | cpp |
p03160 | #include <iostream>
#include <stdlib.h>
using namespace std;
long long n, h[100005], dp[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(dp[2] - dp[1]);
for (int i = 2; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - ... | #include <iostream>
#include <stdlib.h>
using namespace std;
long long n, h[100005], dp[100005];
int main() {
cin >> n;
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++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,282 | 957,284 | u749027673 | cpp |
p03160 | #include <iostream>
#include <stdlib.h>
using namespace std;
int n, h[100005], dp[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(dp[2] - dp[1]);
for (int i = 2; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + a... | #include <iostream>
#include <stdlib.h>
using namespace std;
long long n, h[100005], dp[100005];
int main() {
cin >> n;
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++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.chan... | 957,286 | 957,284 | u749027673 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define inf 0x3f3f3f3f
int v[100100];
int memo[100100];
int n;
int go(int i) {
if (i == n - 1)
return 0;
if (memo[i] != -1)
return memo[i];
int ans = 1 << 30;
if (i + 1 <= n - 1)
ans = min(ans, go(i + 1) + abs(v[i + 1] - v[i]));
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define inf 0x3f3f3f3f
int v[100100];
int memo[100100];
int n;
int go(int i) {
if (i == n - 1)
return 0;
if (memo[i] != -1)
return memo[i];
int ans = 1 << 30;
if (i + 1 <= n - 1)
ans = min(ans, go(i + 1) + abs(v[i + 1] - v[i]));
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,288 | 957,290 | u975517333 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], dp[100010], k;
long long Abs(long long u) {
if (u > 0)
return u;
else
return u * (-1);
}
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
dp[1] = 0;
for (int i = 2; i <= n; i++) ... | #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], dp[100010], k;
long long Abs(long long u) {
if (u > 0)
return u;
else
return u * (-1);
}
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
dp[1] = 0;
for (int i = 2; i <= n; i++) ... | [
"assignment.value.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,272 | 957,273 | u530967084 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m) for (int i = 0; i < m; i++)
#define FOR(i, n, m) for (int i = n; i < m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 998244353
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define ll long long int
#define P pair<ll, ll>
int... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m) for (int i = 0; i < m; i++)
#define FOR(i, n, m) for (int i = n; i < m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 998244353
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define ll long long int
#define P pair<ll, ll>
int... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,296 | 957,298 | u773548422 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], dp[100010], k;
long long Abs(long long u) {
if (u > 0)
return u;
else
return u * (-1);
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = LONG_LO... | #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], dp[100010], k;
long long Abs(long long u) {
if (u > 0)
return u;
else
return u * (-1);
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = LONG_LO... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,275 | 957,277 | u530967084 | cpp |
p03161 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | [
"control_flow.branch.if.add"
] | 957,482 | 957,483 | u089668660 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans[n];
ans[0] = h[0];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
int mi = INT_MAX;
int a = k;
int j =... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans[n];
ans[0] = 0;
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
int mi = INT_MAX;
int a = k;
int j = i ... | [] | 957,279 | 957,281 | u145819223 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.ti... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,283 | 957,285 | u718624899 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[100001];
int n;
ll dp[100001];
ll cal(int i) {
if (i > n)
return 0;
if (dp[i] != -1)
return dp[i];
ll ans;
if (i + 1 <= n)
ans = (cal(i + 1) + abs(a[i] - a[i + 1]));
if (i + 2 <= n)
ans = min(ans, cal(i + 2) + abs(a[i] - a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[100001];
int n;
ll dp[100001];
ll cal(int i) {
if (i >= n)
return 0;
if (dp[i] != -1)
return dp[i];
ll ans;
if (i + 1 <= n)
ans = (cal(i + 1) + abs(a[i] - a[i + 1]));
if (i + 2 <= n)
ans = min(ans, cal(i + 2) + abs(a[i] - ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 957,312 | 957,310 | u845300227 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int absdiff(int a, int b) { return (abs(a - b)); }
int main() {
int n, k;
cin >> n >> k;
vector<int> height;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
height.push_back(temp);
}
vector<int> cost(n, 0);
cost[1] = abs(height[1] - height[... | #include <bits/stdc++.h>
using namespace std;
int absdiff(int a, int b) { return (abs(a - b)); }
int main() {
int n, k;
cin >> n >> k;
vector<int> height;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
height.push_back(temp);
}
vector<int> cost(n, 0);
cost[1] = abs(height[1] - height[... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,488 | 957,489 | u664656294 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.ti... | [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.type.widen.change"
] | 957,287 | 957,285 | u718624899 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 100000007);
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2;... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 100000007);
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2;... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,289 | 957,291 | u150155436 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ll dp[100000];
void solve() {
int n, k;
cin >> n >> k;
vector<int> vi;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
vi.push_back(a);
}
dp[0] = 0;
dp[1] = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ll dp[100000];
void solve() {
int n, k;
cin >> n >> k;
vector<int> vi;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
vi.push_back(a);
}
dp[0] = 0;
dp[1] = ... | [
"call.add",
"call.arguments.change"
] | 957,293 | 957,295 | u812603485 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,297 | 957,299 | u900229905 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define intl long long
int main() {
intl n, k;
cin >> n >> k;
intl a[n + 1];
for (intl i = 0; i < n; i++) {
cin >> a[i];
}
intl dp[n + 1];
dp[0] = 0;
for (intl i = 1; i < n; i++) {
int t = 1;
int m = INT_MAX;
int x = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define intl long long
int main() {
intl n, k;
cin >> n >> k;
intl a[n + 1];
for (intl i = 0; i < n; i++) {
cin >> a[i];
}
intl dp[n + 1];
dp[0] = 0;
for (intl i = 1; i < n; i++) {
int t = 1;
int m = INT_MAX;
int x = 0;
... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 957,301 | 957,303 | u025753638 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
// DEFINE
#define flash \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#defi... | #include <bits/stdc++.h>
using namespace std;
// DEFINE
#define flash \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#defi... | [
"literal.number.change",
"call.arguments.change"
] | 957,317 | 957,318 | u032450626 | cpp |
p03161 | /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad... | /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 957,320 | 957,321 | u232873057 | cpp |
p03161 | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1e9;
for (int j = 1; j <= k; j++) {
... | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1e9;
for (int j = 1; j <= k; j++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,324 | 957,326 | u332946309 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int solve(int N, vector<int> &heights, vector<int> &dp, int K) {
if (N <= 1 or K == 0)
return 0;
if (N == 2 and K >= 1)
return dp[N] = abs(heights[0] - heights[1]);
if (dp[N] != -1)
return dp[N];
int ans = INT_MAX;
for (int i = 2; i <= K; i++) {
if... | #include <bits/stdc++.h>
using namespace std;
int solve(int N, vector<int> &heights, vector<int> &dp, int K) {
if (N <= 1 or K == 0)
return 0;
if (N == 2 and K >= 1)
return dp[N] = abs(heights[0] - heights[1]);
if (dp[N] != -1)
return dp[N];
int ans = INT_MAX;
for (int i = 1; i <= K; i++) {
if... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 957,333 | 957,335 | u828200886 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
ll dp[10000005];
ll h[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
dp[i] = 1e5;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0])... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
ll dp[10000005];
ll h[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
dp[i] = 1e13;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]... | [
"literal.number.change",
"assignment.value.change"
] | 957,341 | 957,339 | u077051605 | 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] = {0};
for (int i = 0; i < n; i++) {
int val = INT_MAX;
for (int j = i - 1; j >= 0 && i - j <= k; j--) {
val = min(val, abs(arr[i] - arr[j... | #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] = {0};
for (int i = 0; i < n; i++) {
int val = INT_MAX;
for (int j = i - 1; j >= 0 && i - j <= k; j--) {
val = min(val, dp[j] + abs(arr[i]... | [
"assignment.change"
] | 957,349 | 957,351 | u707252821 | cpp |
p03161 | #include <bits/stdc++.h>
#define N 100005
#define M 10000000000
#define endl "\n"
using namespace std;
int m, k;
int h[N];
long long MAX = 0;
int dp[N];
int minCost(int n) {
if (n == 0)
return 0;
if (dp[n] != -1)
return dp[n];
int option = MAX + 1;
for (int i = n - 1; i >= max(0, n - k); --i) {... | #include <bits/stdc++.h>
#define N 100005
#define M 10000000000
#define endl "\n"
using namespace std;
int m, k;
int h[N];
long long MAX = 0;
int dp[N];
int minCost(int n) {
if (n == 0)
return 0;
if (dp[n] != -1)
return dp[n];
int option = 1000000001;
for (int i = n - 1; i >= max(0, n - k); --i... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 957,361 | 957,363 | u377265926 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define mod 1000000007
#define inf 1e18
ll mod(ll x) {
if (x < 0)
return -x;
else
return x;
}
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll h[n] = {0};
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
ll dp[n] = {0};
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define mod 1000000007
#define inf 1e18
ll mod(ll x) {
if (x < 0)
return -x;
else
return x;
}
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll h[n] = {0};
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
ll dp[n] = {0};
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,365 | 957,367 | u012310435 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define inf 1001001
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dp[n];
for (int i = 0; i < n; ++i) {
dp[i] = inf;
}
dp[0] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= k && i - ... | #include <bits/stdc++.h>
using namespace std;
#define inf 10010011111
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dp[n];
for (int i = 0; i < n; ++i) {
dp[i] = inf;
}
dp[0] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= k && ... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 957,386 | 957,383 | u321492259 | cpp |
p03160 | // @author - Puneet
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vll vector<ll>
#define vvll vector<vll>
#define vld vector<ld>
#define vvld vector<vld>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define mp make_pair
#define pb push_back
#define MOD 1000000007
#define endl "\n"... | // @author - Puneet
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vll vector<ll>
#define vvll vector<vll>
#define vld vector<ld>
#define vvld vector<vld>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define mp make_pair
#define pb push_back
#define MOD 1000000007
#define endl "\n"... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,314 | 957,319 | u645183672 | cpp |
p03161 | // organize and stay in moment
// Abhinav - IIITA
// I love you Disha
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
int prime[100005], arr[100005], pre[100005];
void seive() {
prime[0] = prime[1] = 1;
for (int i = 2; i < 100005; ++i) {
if (prime[i] == 0)
for (i... | // organize and stay in moment
// Abhinav - IIITA
// I love you Disha
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
int prime[100005], arr[100005], pre[100005];
void seive() {
prime[0] = prime[1] = 1;
for (int i = 2; i < 100005; ++i) {
if (prime[i] == 0)
for (i... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,490 | 957,491 | u587202199 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"control_flow.loop.for.condition.change"
] | 957,388 | 957,389 | u127202585 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int DN = 1e5 + 5;
int n, a[DN], dp[DN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 3)
dp[i] = min(dp[i], dp[i - 2] + abs(a[i] - a[i - 2]));
... | #include <bits/stdc++.h>
using namespace std;
const int DN = 1e5 + 5;
int n, a[DN], dp[DN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 2)
dp[i] = min(dp[i], dp[i - 2] + abs(a[i] - a[i - 2]));
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,322 | 957,323 | u186612405 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <s... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 957,325 | 957,329 | u185034753 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
ll gcd(ll ina, ll inb) {
if (ina == 0)
return inb;
if (inb == 0)
return ina;
if (ina == inb)
return ina;
if (ina > inb)
return gcd(ina - inb, inb);
return gcd(ina, inb - ina);
}
l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
ll gcd(ll ina, ll inb) {
if (ina == 0)
return inb;
if (inb == 0)
return ina;
if (ina == inb)
return ina;
if (ina > inb)
return gcd(ina - inb, inb);
return gcd(ina, inb - ina);
}
l... | [
"call.add",
"call.arguments.add"
] | 957,391 | 957,393 | u281567669 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> dp(n, 999);
for (int i = 0; i < n; i++) {
int ele;
cin >> ele;
v[i] = ele;
}
dp[1] = abs(v[0] - v[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> dp(n, 0);
for (int i = 0; i < n; i++) {
int ele;
cin >> ele;
v[i] = ele;
}
dp[1] = abs(v[0] - v[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1... | [
"literal.number.change",
"call.arguments.change"
] | 957,332 | 957,334 | u745631549 | cpp |
p03161 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define m... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define m... | [
"literal.number.change",
"assignment.value.change"
] | 957,395 | 957,397 | u751311751 | cpp |
p03161 | #include <bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
#define pb push_back
#define mod 1000000007
#define pll pair<long long, long long>
using namespace std;
long long power(long long a, long long b) {
long long ans = 1;
while (b > 0) {
if (b & 1) {
a... | #include <bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
#define pb push_back
#define mod 1000000007
#define pll pair<long long, long long>
using namespace std;
long long power(long long a, long long b) {
long long ans = 1;
while (b > 0) {
if (b & 1) {
a... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,495 | 957,496 | u828869971 | cpp |
p03161 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define m... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define m... | [
"literal.number.change",
"assignment.value.change"
] | 957,399 | 957,397 | u751311751 | cpp |
p03161 | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#d... | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#d... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,401 | 957,403 | u597607006 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[n];
min_jumps[0] = 0;
min_jumps[1] = abs(arr[0] - arr[1]);
for (int i = 1; i < n; i++) {
min_jumps[i] = INT_MAX;
// cout << min_jumps[i] << " " ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[n];
min_jumps[0] = 0;
min_jumps[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
min_jumps[i] = INT_MAX;
// cout << min_jumps[i] << " " ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,346 | 957,348 | u010432749 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[n];
min_jumps[0] = 0;
min_jumps[1] = abs(arr[0] - arr[1]);
for (int i = 1; i < n; i++) {
min_jumps[i] = INT_MAX;
// cout << min_jumps[i] << " " ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[n];
min_jumps[0] = 0;
min_jumps[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
min_jumps[i] = INT_MAX;
// cout << min_jumps[i] << " " ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,350 | 957,348 | u010432749 | cpp |
p03161 | //
// Created by Harshit on 20-08-2020.
//
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> H(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> H[i + 1];
}
vector<int> res(n + 1, INT_MAX);
res[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j ... | //
// Created by Harshit on 20-08-2020.
//
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> H(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> H[i + 1];
}
vector<int> res(n + 1, INT_MAX);
res[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; i ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operation.binary.change"
] | 957,407 | 957,409 | u241916882 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define forn(i, x, y) for (int i = x; i < y; ++i)
#define fornr(i, x, y) for (long long i = x; i >= y; --i)
#define testcase ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define forn(i, x, y) for (int i = x; i < y; ++i)
#define fornr(i, x, y) for (long long i = x; i >= y; --i)
#define testcase ... | [] | 957,411 | 957,412 | u561062659 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
int arr[100001];
int dp[100001];
int solve(int cur) {
if (dp[cur] != -1)
return dp[cur];
if (cur == 1)
return dp[cur] = 0;
int mina = 1e9;
for (int x = 1; x <= k; x++) {
if (cur - k >= 1) {
int temp = abs(arr[cur] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
int arr[100001];
int dp[100001];
int solve(int cur) {
if (dp[cur] != -1)
return dp[cur];
if (cur == 1)
return dp[cur] = 0;
int mina = 1e9;
for (int x = 1; x <= k; x++) {
if (cur - x >= 1) {
int temp = abs(arr[cur] ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 957,504 | 957,505 | u974135483 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.