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 |
|---|---|---|---|---|---|---|---|
p03160 | #include <cmath>
#include <iostream>
const int nax = 1e5 + 5;
int arr[nax];
int dp[nax];
int main() {
std::ios_base::sync_with_stdio(false);
int N;
std::cin >> N;
for (int i = 1; i <= N; i++) {
std::cin >> arr[i];
}
dp[1] = 0;
dp[2] = arr[2] - arr[1];
for (int i = 3; i <= N; i++) {
dp[i] ... | #include <cmath>
#include <iostream>
const int nax = 1e5 + 5;
int arr[nax];
int dp[nax];
int main() {
std::ios_base::sync_with_stdio(false);
int N;
std::cin >> N;
for (int i = 1; i <= N; i++) {
std::cin >> arr[i];
}
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= N; i++) {
d... | [
"call.add",
"call.arguments.change"
] | 952,902 | 952,903 | u958610807 | cpp |
p03160 | #include "bits/stdc++.h"
#define int long long
#define mod 1000000007
#define pf push_forward
#define pb push_back
#define mp make_pair
#define f(i, in, n) for (i = in; i < n; ++i)
#define scant \
int t; ... | #include "bits/stdc++.h"
#define int long long
#define mod 1000000007
#define pf push_forward
#define pb push_back
#define mp make_pair
#define f(i, in, n) for (i = in; i < n; ++i)
#define scant \
int t; ... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,908 | 952,909 | u167428133 | cpp |
p03160 | #include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#define int long long
using namespace std;
int N, a[100005];
int dp[100005];
int function(int init) {
if (init == (N - 1))
return 0;
if (init >= N)
return INT_MAX;
if (dp[init != -1])
return dp[init];
int left = abs(a[init... |
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#define int long long
using namespace std;
int N, a[100005];
int dp[100005];
int function(int init) {
if (init == (N - 1))
return 0;
if (init >= N)
return INT_MAX;
if (dp[init] != -1)
return dp[init];
int left = abs(a[ini... | [
"control_flow.branch.if.condition.change"
] | 952,912 | 952,913 | u519284699 | cpp |
p03160 | #include <iostream>
#include <vector>
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(nullptr)
using namespace std;
signed main() {
FAST_IO;
int n;
cin >> n;
int jumps[n];
vector<int> dp(n,
0); // dp[i] : Minimum cost for the frog to reach position i.
for (int i = 0; i < n; i++... | #include <iostream>
#include <vector>
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(nullptr)
using namespace std;
signed main() {
FAST_IO;
int n;
cin >> n;
int jumps[n];
vector<int> dp(n,
0); // dp[i] : Minimum cost for the frog to reach position i.
for (int i = 0; i < n; i++... | [
"expression.operation.binary.add"
] | 952,916 | 952,917 | u835705414 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long kazu = 0;
cin >> kazu;
vector<long long> h(kazu);
for (long long i = 0; i <= kazu - 1; i++) {
cin >> h[i];
}
vector<long long> dp(kazu);
for (lon... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long kazu = 0;
cin >> kazu;
vector<long long> h(kazu);
for (long long i = 0; i <= kazu - 1; i++) {
cin >> h[i];
}
vector<long long> dp(kazu);
for (lon... | [
"literal.number.change",
"assignment.value.change"
] | 952,922 | 952,923 | u567906952 | cpp |
p03160 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | [
"call.add",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 952,927 | 952,928 | u984864378 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,936 | 952,937 | u216545111 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
int arr[n + 1];
int dp[n + 1];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i < n + 1; i++) {
int a = abs(arr[i] - arr[i - 1]) + dp[i - 1]... | #include <iostream>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
int arr[n + 1];
int dp[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> arr[i];
}
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i < n + 1; i++) {
int a = abs(arr[i] - arr[i - 1]) + dp[i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 952,816 | 952,817 | u219630513 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int recur(int *arr, int n, int *dp) {
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 2; i <= n; i++) {
int a = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int b = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(a, b);
}
return dp[n];
}
int main()... | #include <bits/stdc++.h>
using namespace std;
int recur(int *arr, int n, int *dp) {
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
int a = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int b = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(a, b);
}
return dp[n];
}
int main()... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,820 | 952,821 | u345177558 | cpp |
p03160 | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 952,827 | 952,828 | u935370883 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 952,944 | 952,945 | u253606204 | cpp |
p03160 | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> stones(n, 0);
vector<int> dp; // = new int[n];
int tmp = 0;
for (auto i : stones) {
cin >> i;
} // stones.push_back(tmp);}
dp.push_back(0);
dp.push_back(abs(stones[1] - stones[0])... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> stones(n, 0);
vector<int> dp; // = new int[n];
int tmp = 0;
for (int &i : stones) {
cin >> i;
} // stones.push_back(tmp);}
dp.push_back(0);
dp.push_back(abs(stones[1] - stones[0])... | [] | 952,946 | 952,947 | u309984532 | cpp |
p03160 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int *stones = new int[n];
int *dp = new int[n];
if (n >= 1)
cin >> stones[0];
if (n >= 2)
cin >> stones[1];
dp[0] = 0;
dp[1] = abs(stones[1] - stones[2]);
for (int i = 2; i < n; i++) {
cin >> stones[i]... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int *stones = new int[n];
int *dp = new int[n];
if (n >= 1)
cin >> stones[0];
if (n >= 2)
cin >> stones[1];
dp[0] = 0;
dp[1] = abs(stones[1] - stones[0]);
for (int i = 2; i < n; i++) {
cin >> stones[i]... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,948 | 952,949 | u309984532 | cpp |
p03160 | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
ll dp[100];
ll arr[100] = {0};
int n = 0;
ll solve(int i) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll op1, op2;
op1 = abs(arr[i] - arr[i + 1]) + solve(i + 1);
... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
ll dp[100009];
ll arr[100009] = {0};
int n = 0;
ll solve(int i) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll op1, op2;
op1 = abs(arr[i] - arr[i + 1]) + solve(i +... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 952,950 | 952,951 | u252634084 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 55;
int x[MAX];
int dp[100000 + 55];
int n;
int cho1 = 0;
int cho2 = 0;
int solve(int i) {
// cout<<'1'<<" "<<cho1<<" "<<x[i]<<" "<<i<<" "<<last<<endl;
if (i == n) {
r... | #include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 55;
int x[MAX];
int dp[100000 + 55];
int n;
int cho1 = 0;
int cho2 = 0;
int solve(int i) {
// cout<<'1'<<" "<<cho1<<" "<<x[i]<<" "<<i<<" "<<last<<endl;
if (i == n) {
r... | [
"assignment.value.change"
] | 952,952 | 952,953 | u886159995 | cpp |
p03160 | /*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll int64_t
#define f first
#define s second
#define fastio \
ios_base::sync_with_stdio(false)... | /*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll int64_t
#define f first
#define s second
#define fastio \
ios_base::sync_with_stdio(false)... | [
"call.remove"
] | 952,956 | 952,957 | u953269735 | cpp |
p03160 | /*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll int64_t
#define f first
#define s second
#define fastio \
ios_base::sync_with_stdio(false)... | /*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll int64_t
#define f first
#define s second
#define fastio \
ios_base::sync_with_stdio(false)... | [
"call.remove",
"literal.number.change",
"call.arguments.change"
] | 952,959 | 952,957 | u953269735 | cpp |
p03160 | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 952,975 | 952,976 | u340424586 | cpp |
p03160 | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 952,977 | 952,976 | u340424586 | cpp |
p03160 | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | [
"variable_declaration.type.change"
] | 952,975 | 952,978 | u340424586 | cpp |
p03160 | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 952,977 | 952,978 | u340424586 | cpp |
p03160 |
#include <bits/stdc++.h>
using namespace std;
long long m = 1000000007;
#define boost \
ios::sync_with_stdio(0); \
cin.tie(0); \
... |
#include <bits/stdc++.h>
using namespace std;
long long m = 1000000007;
#define boost \
ios::sync_with_stdio(0); \
cin.tie(0); \
... | [] | 952,988 | 952,989 | u000032488 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define forf(i, a, b, c) for (int i = a; i < b; i = i + c)
#define forb(i, a, b, c) for (int i = a; i >= b; i = i - c)
typedef long long ll;
using namespac... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define forf(i, a, b, c) for (int i = a; i < b; i = i + c)
#define forb(i, a, b, c) for (int i = a; i >= b; i = i - c)
typedef long long ll;
using namespac... | [
"call.arguments.change"
] | 952,993 | 952,994 | u874100196 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl "\n"
#define mod 1000000007
#define INF 1e18
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define IOS ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl "\n"
#define mod 1000000007
#define INF 1e18
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define IOS ... | [
"call.remove"
] | 952,995 | 952,996 | u870088166 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)(b); ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)(b); ... | [
"call.add",
"call.arguments.change"
] | 952,997 | 952,998 | u330169562 | cpp |
p03160 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(var) \
do { \
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(var) \
do { \
... | [
"expression.operation.binary.remove"
] | 953,003 | 953,004 | u215692812 | cpp |
p03160 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
const int INT_LARGE = 1.0e+9 + 7;
template <class T> inline bool chmin(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
int main() {
// Input
int numArray;
std::cin >> numArray;
asser... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
const int INT_LARGE = 1.0e+9 + 7;
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
int main() {
// Input
int numArray;
std::cin >> numArray;
asser... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 953,005 | 953,006 | u875972329 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> height(n);
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<ll> dp(n + 1);
dp[0] = 0x3f3f3f3f;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(abs(height[i] - height[i -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> height(n + 1);
for (int i = 1; i <= n; i++) {
cin >> height[i];
}
vector<ll> dp(n);
dp[0] = 0x3f3f3f3f;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(abs(height[i] - height[i ... | [
"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",
"expression.operation.binary.remove"
] | 953,007 | 953,008 | u239240712 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, i;
cin >> n;
long A[n + 1];
A[0] = 0;
for (i = 1; i <= n; i++)
cin >> A[i];
long long dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(A[1] - A[0]);
for (i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(A[i] - A[i - 1]),... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, i;
cin >> n;
long A[n + 1];
A[0] = 0;
for (i = 1; i <= n; i++)
cin >> A[i];
long long dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(A[2] - A[1]);
for (i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(A[i] - A[i - 1]),... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,009 | 953,010 | u467785978 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int INF... | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int INF... | [
"literal.string.change",
"call.arguments.change"
] | 953,013 | 953,014 | u804919951 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 100005
int n;
int s[nn];
int solve() {
int dp[n + 1] = {0};
dp[1] = 0;
dp[2] = abs(s[2] - s[1]);
dp[3] = min(abs(s[3] - s[1]), abs(s[2] - s[3]) + dp[2]);
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
int x = abs(s[i] - s... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 100005
int n;
int s[nn];
int solve() {
int dp[n + 1] = {0};
dp[1] = 0;
dp[2] = abs(s[2] - s[1]);
dp[3] = min(abs(s[3] - s[1]), abs(s[2] - s[3]) + dp[2]);
for (int i = 4; i <= n; i++) {
dp[i] = INT_MAX;
int x = abs(s[i] - s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 953,023 | 953,024 | u093748998 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 100005
int n;
int s[nn];
int solve() {
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(s[2] - s[1]);
dp[3] = min(abs(s[3] - s[1]), abs(s[2] - s[3]) + dp[2]);
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
int x = abs(s[i] - s[i - 1... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 100005
int n;
int s[nn];
int solve() {
int dp[n + 1] = {0};
dp[1] = 0;
dp[2] = abs(s[2] - s[1]);
dp[3] = min(abs(s[3] - s[1]), abs(s[2] - s[3]) + dp[2]);
for (int i = 4; i <= n; i++) {
dp[i] = INT_MAX;
int x = abs(s[i] - s... | [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change"
] | 953,025 | 953,024 | u093748998 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> h(n), best(n);
for (i = 0; i < n; ++i)
cin >> h[i];
best[0] = 0;
best[1] = abs(h[i] - h[i - 1]);
for (i = 2; i < n; ++i)
best[i] = min(best[i - 1] + abs(h[i] - h[i - 1]),
best[i - 2] + abs(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> h(n), best(n);
for (i = 0; i < n; ++i)
cin >> h[i];
best[0] = 0;
best[1] = abs(h[1] - h[0]);
for (i = 2; i < n; ++i)
best[i] = min(best[i - 1] + abs(h[i] - h[i - 1]),
best[i - 2] + abs(h[i]... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 953,032 | 953,033 | u625237702 | cpp |
p03160 | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end... | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end... | [
"call.remove"
] | 953,036 | 953,037 | u491084584 | cpp |
p03160 | #include <bits/stdc++.h>
int res[100001];
using namespace std;
int fun1(int val[], int n) {
if (n <= 1)
return 0;
if (res[n] != -1)
return res[n];
return res[n] = min(abs(val[n] - val[n - 1]) + fun1(val, n - 1),
abs(val[n] - val[n - 2]) + fun1(val, n - 2));
}
int fun2(int val[],... | #include <bits/stdc++.h>
int res[100001];
using namespace std;
int fun1(int val[], int n) {
if (n <= 1)
return 0;
if (res[n] != -1)
return res[n];
return res[n] = min(abs(val[n] - val[n - 1]) + fun1(val, n - 1),
abs(val[n] - val[n - 2]) + fun1(val, n - 2));
}
int fun2(int val[],... | [
"variable_declaration.value.change"
] | 953,038 | 953,039 | u253385799 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define cases \
int t; \
cin >> t; \
wh... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define cases \
int t; \
cin >> t; \
wh... | [
"assignment.value.change",
"identifier.change"
] | 953,051 | 953,052 | u919641591 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> x(n), dp(n, INT_MAX);
int i = 0;
for (; i < n; i++)
cin >> x[i];
dp[0] = x[0];
for (i = 0; i <= n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + a... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> x(n), dp(n, INT_MAX);
int i = 0;
for (; i < n; i++)
cin >> x[i];
dp[0] = 0;
for (i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(x... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 953,055 | 953,056 | u259468819 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int i, a, b;
int dp[n];
for (i = 0; i < n; i += 2) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++)
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int i, a, b;
int dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++)
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] ... | [] | 953,057 | 953,058 | u259468819 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define VI vector<ll>
#define lf(i, a, b) for (ll i = a; i <= b; i++)
const ll mod = 1e9 + 7;
double pi = 2 * acos(0.0);
#define FASTIO \
ios_base::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define VI vector<ll>
#define lf(i, a, b) for (ll i = a; i <= b; i++)
const ll mod = 1e9 + 7;
double pi = 2 * acos(0.0);
#define FASTIO \
ios_base::sync_with_stdio(... | [] | 953,061 | 953,062 | u953086535 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll inf = 100100;
vector<ll> dp(100001, inf);
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(i, n... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll inf = 1001001001;
vector<ll> dp(100001, inf);
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 953,063 | 953,064 | u814715203 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const int inf = 100100;
vector<int> dp(100001, inf);
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll inf = 1001001001;
vector<ll> dp(100001, inf);
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 953,065 | 953,064 | u814715203 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const int inf = 100100;
vector<int> dp(10001, inf);
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(i,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll inf = 1001001001;
vector<ll> dp(100001, inf);
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 953,066 | 953,064 | u814715203 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define pb push_back
#define F first
#define S second
#define vi vector<int>
#define pi pair<int, int>
#define PI 3.14159265
#define all(x) x.begin(), x.end()
#define er(n) cout <... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define pb push_back
#define F first
#define S second
#define vi vector<int>
#define pi pair<int, int>
#define PI 3.14159265
#define all(x) x.begin(), x.end()
#define er(n) cout <... | [
"call.remove"
] | 953,069 | 953,070 | u420799504 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define rad(X) cout << (X) << endl
#define ASH(X) cout << (X) << " "
#define debug(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define rad(X) cout << (X) << endl
#define ASH(X) cout << (X) << " "
#define debug(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x <... | [
"call.add",
"call.arguments.change"
] | 953,075 | 953,076 | u877043923 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define rad(X) cout << (X) << endl
#define ASH(X) cout << (X) << " "
#define debug(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define rad(X) cout << (X) << endl
#define ASH(X) cout << (X) << " "
#define debug(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x <... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.add",
"call.arguments.change"
] | 953,077 | 953,076 | u877043923 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define MOD 998244353
#define endL << '\n'
#define ii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define ... | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define MOD 998244353
#define endL << '\n'
#define ii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define ... | [] | 953,078 | 953,079 | u511624091 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
const int INF = 1e9;
#define ll long long
#define int ll
#define fast ... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
const int INF = 1e9;
#define ll long long
#define int ll
#define fast ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,080 | 953,081 | u556783345 | cpp |
p03160 | #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[1000000], d[1000000];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[... | #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[1000000], d[1000000];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[... | [
"call.arguments.change"
] | 953,097 | 953,098 | u045623470 | cpp |
p03160 | #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[100000], d[100000];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[i ... | #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[1000000], d[1000000];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 953,099 | 953,098 | u045623470 | cpp |
p03160 | #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[mx], d[mx + 1];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[i + 1]... | #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[1000000], d[1000000];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"call.arguments.change"
] | 953,100 | 953,098 | u045623470 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
input_from_file;
// int t; cin>>t;
// while(t--){
ll n;
cin >> n;
vector<... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
// input_from_file;
// int t; cin>>t;
// while(t--){
ll n;
cin >> n;
vect... | [] | 953,104 | 953,105 | u066630187 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n + 1];
int i;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> dp(n + 1, 0);... | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n + 1];
int i;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> dp(n + 1, 0);... | [
"call.add",
"call.arguments.change"
] | 953,108 | 953,109 | u071917297 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n + 1];
int i;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> dp(n + 1, 0);... | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n + 1];
int i;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> dp(n + 1, 0);... | [
"call.add",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,111 | 953,109 | u071917297 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,117 | 953,118 | u366581326 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
dp[0] = 0;
dp[1] = v[1] - v[0];
for (i = 1; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(v[i] - ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
dp[0] = 0;
dp[1] = v[1] - v[0];
for (i = 1; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(v[i] - ... | [
"variable_access.subscript.index.change",
"io.output.change"
] | 953,124 | 953,125 | u990210936 | cpp |
p03160 | #define ll long long int
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<ll> dp(n);
dp[0] = h[0];
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
... | #define ll long long int
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<ll> dp(n);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
d... | [] | 953,126 | 953,127 | u243508227 | cpp |
p03160 | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO ... | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 953,134 | 953,135 | u850655153 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
int main() {
lli n, i;
lli dp[10001];
dp[0] = 0;
dp[1] = 0;
cin >> n;
lli a[n + 1];
for (i = 1; i < +n; i++) {
cin >> a[i];
}
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
dp[i] =
min(abs(a[i] - a[i - 2]) ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
int main() {
lli n, i;
lli dp[100001];
dp[0] = 0;
dp[1] = 0;
cin >> n;
lli a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
dp[i] =
min(abs(a[i] - a[i - 2])... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.remove"
] | 953,138 | 953,137 | u696946433 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change"
] | 953,139 | 953,140 | u011716617 | cpp |
p03160 | #include <bits/stdc++.h>
#include <unistd.h>
#define pb push_back
#define ll long long
#define inf 1e9
using namespace std;
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >>... | #include <bits/stdc++.h>
#include <unistd.h>
#define pb push_back
#define ll long long
#define inf 1e9
using namespace std;
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >>... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,141 | 953,142 | u213252033 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e5;
int main() {
int n;
cin >> n;
vector<int> dp(n, INF), h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + ... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> dp(n, INF), h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 953,143 | 953,144 | u897669423 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int arr[100009], n;
ll dp[100009][3];
ll f(int from, int to) {
if (to > n)
return 0;
if (from >= n)
return 0;
if (from == n - 1) {
dp[from][2] = 0;
return dp[from][to] = abs(arr[n] - arr[n - 1]);
}
if (dp[from][to] != -1)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int arr[100009], n;
ll dp[100009][3];
ll f(int from, int to) {
if (to > n)
return 0;
if (from >= n)
return 0;
if (from == n - 1) {
dp[from][2] = 0;
return dp[from][to] = abs(arr[n] - arr[n - 1]);
}
if (dp[from][to] != -1)
... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 953,150 | 953,151 | u123067340 | cpp |
p03160 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"call.add",
"call.arguments.change"
] | 953,152 | 953,153 | u441400811 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0;
int dp[n + 2];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i - 2] - a[i]), dp[i - 1] +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0;
int dp[n + 2];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i - 2] - a[i]), dp[i - 1] + ab... | [] | 953,157 | 953,158 | u125284404 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int, in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int, in... | [
"call.add",
"call.arguments.change"
] | 953,159 | 953,160 | u603136669 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog(int n, int dp[], int a[]) {
dp[1] = a[1] - a[0];
for (int i = 2; i < n; i++) {
int o1, o2;
o1 = dp[i - 1] + abs(a[i] - a[i - 1]);
o2 = dp[i - 2] + abs(a[i] - a[i - 2]);
dp[i] = min(o1, o2);
}
return dp[n - 1];
}
int main() {
int n;
cin... | #include <bits/stdc++.h>
using namespace std;
int frog(int n, int dp[], int a[]) {
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int o1, o2;
o1 = dp[i - 1] + abs(a[i] - a[i - 1]);
o2 = dp[i - 2] + abs(a[i] - a[i - 2]);
dp[i] = min(o1, o2);
}
return dp[n - 1];
}
int main() {
int n;
... | [
"call.add",
"call.arguments.change"
] | 953,161 | 953,162 | u375225030 | cpp |
p03160 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std::chrono;
using namespace std;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define ll long long
bool isPowerOfTwo(ll x) {
/* First x in the below expression is for the case when x is 0 */
return x && (!(x & (x - 1)));
}
bool SameS... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std::chrono;
using namespace std;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define ll long long
bool isPowerOfTwo(ll x) {
/* First x in the below expression is for the case when x is 0 */
return x && (!(x & (x - 1)));
}
bool SameS... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 953,166 | 953,167 | u811138966 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[(unsigned int)1e5];
int h[(unsigned int)1e5];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= 2; j++)
dp[i] ... | #include <bits/stdc++.h>
using namespace std;
int dp[(unsigned int)1e5];
int h[(unsigned int)1e5];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= 2; j++)
dp[i] ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,180 | 953,181 | u491100219 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long a[n];
a[0] = 0;
if (n >= 2) {
a[1] = min(0, abs(h[1] - h[0]));
}
for (int i = 2; i < n; i++) {
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long a[n];
a[0] = 0;
if (n >= 2) {
a[1] = max(0, abs(h[1] - h[0]));
}
for (int i = 2; i < n; i++) {
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 953,189 | 953,190 | u794275880 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long a[n];
a[0] = 0;
if (n >= 2) {
a[1] = min(h[1], abs(h[1] - h[0]));
}
for (int i = 2; i < n; i++) {
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long a[n];
a[0] = 0;
if (n >= 2) {
a[1] = max(0, abs(h[1] - h[0]));
}
for (int i = 2; i < n; i++) {
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 953,191 | 953,190 | u794275880 | 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 dp[n];
dp[0] = 0;
dp[1] = arr[1] - arr[0];
for (int i = 2; i < n; i++) {
dp[i] = min((dp[i - 1] + abs(arr[i] - arr[i - 1])),
(dp[i - 2] + abs(... | #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 dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min((dp[i - 1] + abs(arr[i] - arr[i - 1])),
(dp[i - 2] +... | [
"call.add",
"call.arguments.change"
] | 953,194 | 953,195 | u551087770 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
typedef long long int ll;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
#define pb(a) push_back(a)
#def... | #include <bits/stdc++.h>
using namespace std;
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
typedef long long int ll;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
#define pb(a) push_back(a)
#def... | [
"call.remove"
] | 953,196 | 953,197 | u071936511 | cpp |
p03160 | #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;
}
const long long INF = 1LL << 60;
int N;
long long h[1000010];
long long dp[1000010];
long long rec(int i) {
if (dp[i] < INF)
return dp[i];
if (i ... | #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;
}
const long long INF = 1LL << 60;
int N;
long long h[1000010];
long long dp[1000010];
long long rec(int i) {
if (dp[i] < INF)
return dp[i];
if (i ... | [
"control_flow.branch.if.add"
] | 953,198 | 953,199 | u020480485 | cpp |
p03160 | #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;
}
const long long INF = 1LL << 60;
int N;
long long h[1000010];
long long dp[1000010];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++)
c... | #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;
}
const long long INF = 1LL << 60;
int N;
long long h[1000010];
long long dp[1000010];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++)
c... | [
"control_flow.branch.if.add"
] | 953,201 | 953,202 | u020480485 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10;
int a[N], mem[N], n;
int dp(int i) {
if (i > n - 1)
return 2e9;
if (i == n - 1)
return 0;
if (mem[i] != -1)
return mem[i];
int ans = 2e9;
for (int j = 1; j <= 3; j++) {
ans = min(ans, abs(a[i] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10;
int a[N], mem[N], n;
int dp(int i) {
if (i > n - 1)
return 2e9;
if (i == n - 1)
return 0;
if (mem[i] != -1)
return mem[i];
int ans = 2e9;
for (int j = 1; j <= 2; j++) {
ans = min(ans, abs(a[i] ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 953,207 | 953,208 | u027405444 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> h(n + 5, INT_MAX);
rep(i, n) cin >> h[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
rep(i, n) {
dp[i + 1] = min(dp[i] + abs(h[i] - h[i + 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
int main() {
int n;
cin >> n;
// 桁あふれ処理めんどいので、+5くらい余計にとっておく
vector<int> h(n + 5, INT_MAX);
rep(i, n) cin >> h[i];
// 桁あふれ処理めんどいので、+5くらい余計にとっておく
vector<int> dp(n + 5, INT_MAX);
// 最... | [
"assignment.change"
] | 953,215 | 953,216 | u200509145 | cpp |
p03160 | #include <iostream>
#define mxn 100010
using namespace std;
int ar[mxn], dp[mxn];
// return minim cost to reach at n
int go(int n) {
if (n == 1)
return 0;
if (n == 2)
return abs(ar[2] - ar[1]);
if (dp[n] != -1)
return dp[n];
int cost1 = go(n - 1) + abs(ar[n] - ar[n - 1]);
int cost2 = go(n - 2)... | #include <iostream>
#define mxn 100010
using namespace std;
int ar[mxn], dp[mxn];
// return minim cost to reach at n
int go(int n) {
if (n == 1)
return 0;
if (n == 2)
return abs(ar[2] - ar[1]);
if (dp[n] != -1)
return dp[n];
int cost1 = go(n - 1) + abs(ar[n] - ar[n - 1]);
int cost2 = go(n - 2)... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,219 | 953,220 | u907329403 | cpp |
p03160 | #include <bits/stdc++.h>
#define mxn (int)1e5 + 10
using namespace std;
int ar[mxn], dp[mxn];
int solve(int n) {
if (n == 1)
return 0;
if (n == 2)
return abs(ar[1] - ar[0]);
if (dp[n] != -1)
return dp[n];
int s1 = solve(n - 1);
int s2 = solve(n - 2);
return dp[n] = min(s1 + abs(ar[n] - ar[n... | #include <bits/stdc++.h>
#define mxn (int)1e5 + 10
using namespace std;
int ar[mxn], dp[mxn];
int solve(int n) {
if (n == 0)
return 0;
if (n == 1)
return abs(ar[1] - ar[0]);
if (dp[n] != -1)
return dp[n];
int s1 = solve(n - 1);
int s2 = solve(n - 2);
return dp[n] = min(s1 + abs(ar[n] - ar[n... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 953,221 | 953,222 | u907329403 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
vector<int> h(N + 1);
for (int i = 0; i < N; ++i)
cin >> h[i + 1];
vector<int> dp(N + 5, (int)1e9 + (int)1e5);
dp[0] = dp[1] = 0;
for (int i = 2; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
vector<int> h(N + 1);
for (int i = 0; i < N; ++i)
cin >> h[i + 1];
vector<int> dp(N + 5, (int)1e9 + (int)1e5);
dp[0] = dp[1] = 0;
for (int i = 2; ... | [
"control_flow.branch.if.add"
] | 953,228 | 953,229 | u384800486 | cpp |
p03160 | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long... | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,230 | 953,231 | u586345737 | cpp |
p03160 | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long... | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 953,232 | 953,231 | u586345737 | cpp |
p03160 | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long... | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,233 | 953,234 | u586345737 | cpp |
p03160 | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long... | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.return.add"
] | 953,235 | 953,234 | u586345737 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
... | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
... | [
"expression.operation.binary.add"
] | 953,238 | 953,239 | u161386534 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
... | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 953,240 | 953,239 | u161386534 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
... | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,241 | 953,239 | u161386534 | cpp |
p03160 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
long dp[N];
for (int i = 0; i < N; i++) {
if (i == 0) {
dp[i] = 0;
continue;
}
if (i == 1) {
dp[i] = abs(h[i] - h[i - 1])... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
long dp[N];
for (int i = 0; i < N; i++) {
if (i == 0) {
dp[i] = 0;
continue;
}
if (i == 1) {
dp[i] = abs(h[i] - h[i - 1]... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,242 | 953,243 | u568877271 | cpp |
p03160 | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | [
"call.add",
"call.arguments.change"
] | 953,244 | 953,245 | u759162415 | cpp |
p03160 | // This is the Property of Rishabh Agarwal
#include <bits/stdc++.h>
#define F first
#define S second
#define MAX 10000003
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
ll power(ll a, ll b) {
if (b == 0) {
return 1;
}
ll temp = power(a, b / 2) % mod;
if (b % 2 == 0) {
return (te... | // This is the Property of Rishabh Agarwal
#include <bits/stdc++.h>
#define F first
#define S second
#define MAX 10000003
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
ll power(ll a, ll b) {
if (b == 0) {
return 1;
}
ll temp = power(a, b / 2) % mod;
if (b % 2 == 0) {
return (te... | [
"call.add",
"call.arguments.change"
] | 953,252 | 953,253 | u783950415 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int tt, n, x, i, j, d, s, t, flag = 0, f;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> tt;
d = 0;
cin >> n;
vector<int> a(n), b(n);
for (i = 0; i < n; i++) {
cin >> b[i];
}
a[0] = 0;
a[1] = abs(b[1] - b[0]);
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int tt, n, x, i, j, d, s, t, flag = 0, f;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
d = 0;
cin >> n;
vector<int> a(n), b(n);
for (i = 0; i < n; i++) {
cin >> b[i];
}
a[0] = 0;
a[1] = abs(b[1] - b[0]);
for (i = 2; i < n... | [] | 953,254 | 953,255 | u844738948 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
#include <algorithm>
#define str(a) to_string(a)
#define int long long
#define pb push_back
#define mp make_pair
#define SORT(c) sort(c.begin(), c.end())
#define max_heap priority_queue<int>
#define min_heap priority_queue<int, vector<int>, greater<int>>
#defi... | #include <iostream>
#include <vector>
using namespace std;
#include <algorithm>
#define str(a) to_string(a)
#define int long long
#define pb push_back
#define mp make_pair
#define SORT(c) sort(c.begin(), c.end())
#define max_heap priority_queue<int>
#define min_heap priority_queue<int, vector<int>, greater<int>>
#defi... | [
"variable_declaration.value.change"
] | 953,256 | 953,257 | u314266101 | cpp |
p03160 | #include <bits/stdc++.h>
#define CFOR(i, str) for (int i = 0; (str)[i] != '\0'; (i)++)
#define FOR(i, s, r) for (int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegin(), v.rend())
#define v... | #include <bits/stdc++.h>
#define CFOR(i, str) for (int i = 0; (str)[i] != '\0'; (i)++)
#define FOR(i, s, r) for (int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegin(), v.rend())
#define v... | [
"expression.operation.binary.add"
] | 953,271 | 953,270 | u537818901 | cpp |
p03160 | #include <bits/stdc++.h>
#define CFOR(i, str) for (int i = 0; (str)[i] != '\0'; (i)++)
#define FOR(i, s, r) for (int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegin(), v.rend())
#define v... | #include <bits/stdc++.h>
#define CFOR(i, str) for (int i = 0; (str)[i] != '\0'; (i)++)
#define FOR(i, s, r) for (int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegin(), v.rend())
#define v... | [] | 953,272 | 953,270 | u537818901 | cpp |
p03160 | // Inbornhandsome
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)... | // Inbornhandsome
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)... | [] | 953,275 | 953,276 | u621231159 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define max 100007
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
vector<long long> dp(n, max);
dp[0] = 0;
for (long long i = 0; i < n; i++)
cin >> a[i];
for (long long i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
#define max 1e9 + 7
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
vector<long long> dp(n, max);
dp[0] = 0;
for (long long i = 0; i < n; i++)
cin >> a[i];
for (long long i = 0; i <... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 953,280 | 953,281 | u244398177 | cpp |
p03160 | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;... | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;... | [
"call.remove"
] | 953,282 | 953,283 | u745008216 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const ll inf = 1e18;
ll h[maxn];
ll DP[maxn];
int N;
ll dis(int i, int j) { return abs(h[i] - h[j]); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const ll inf = 1e18;
ll h[maxn];
ll DP[maxn];
int N;
ll dis(int i, int j) { return abs(h[i] - h[j]); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 953,284 | 953,285 | u813077255 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const ll inf = 1e18;
ll h[maxn];
ll DP[maxn];
int N;
ll dis(int i, int j) { return abs(h[i] - h[j]); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const ll inf = 1e18;
ll h[maxn];
ll DP[maxn];
int N;
ll dis(int i, int j) { return abs(h[i] - h[j]); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 953,286 | 953,285 | u813077255 | cpp |
p03160 | #include <climits>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n] = {0};
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {0};
dp[0] = 0;
dp[1] = abs(dp[0] - dp[1]);
for (int i = 2; i < n; i++) {
int min1 = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int m... | #include <climits>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n] = {0};
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {0};
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
int min1 = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,297 | 953,298 | u492789403 | cpp |
p03160 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int cost[N], height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
if (i == 0)
cost[i] = 0;
else
cost[i] = 2147483627;
}
for (int i = 0; i < N; i++) {
if (i + 1 < N)
cost[i + 1]... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int cost[N], height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
if (i == 0)
cost[i] = 0;
else
cost[i] = 2147483627;
}
for (int i = 0; i < N; i++) {
if (i + 1 < N)
cost[i + 1]... | [
"expression.operation.binary.remove"
] | 953,301 | 953,302 | u002439051 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.