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 <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define w(x) \
int x; ... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define w(x) \
int x; ... | [
"call.remove"
] | 953,735 | 953,736 | u677650388 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1e18;
const int MX = 2005;
int main() {
ll n;
cin >> n;
ll h[n];
ll dp[INF];
rep(i, n) cin >> h[i];
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1e18;
const int MX = 2005;
int main() {
ll n;
cin >> n;
ll h[n];
ll dp[n + 2];
rep(i, n) cin >> h[i];
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n)... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 953,741 | 953,740 | u226147473 | cpp |
p03160 | #include "bits/stdc++.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
//#define ordered_set tree<ll, null_type,less<ll>,
//rb_tree_tag,tree_order_statistics_node_update>
//#include <boost/math/common_factor.cpp>
using namespace std;
#define fi firs... | #include "bits/stdc++.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
//#define ordered_set tree<ll, null_type,less<ll>,
//rb_tree_tag,tree_order_statistics_node_update>
//#include <boost/math/common_factor.cpp>
using namespace std;
#define fi firs... | [
"call.remove"
] | 953,762 | 953,763 | u526674581 | cpp |
p03160 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,766 | 953,767 | u459105164 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h, dp;
cin >> n;
h.assign(n, 0);
dp.assign(n + 2, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 2] - h[n - 1]);
for (int i = n - 3; i >= 0; i--)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h, dp;
cin >> n;
h.assign(n, 0);
dp.assign(n + 2, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 2] - h[n - 1]);
for (int i = n - 3; i >= 0; i--)... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,768 | 953,769 | u056912761 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h, dp;
cin >> n;
h.assign(n, 0);
dp.assign(n + 2, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 2] - h[n - 1]);
for (int i = n - 3; i >= 0; --i)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h, dp;
cin >> n;
h.assign(n, 0);
dp.assign(n + 2, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 2] - h[n - 1]);
for (int i = n - 3; i >= 0; i--)... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,770 | 953,769 | u056912761 | cpp |
p03160 | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void chmin(int &x, int y) {
if (x > y)
x = y;
}
void core() {
size_t N;
cin >> N;
string hs_str;
std::vector<int> hs(N);
for (size_t i = 0; i < N; ++i) {
cin >> hs_str;
hs[i] = stoi(hs_str);
//... | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void chmin(long &x, long y) {
if (x > y)
x = y;
}
void core() {
size_t N;
cin >> N;
string hs_str;
std::vector<long> hs(N);
for (size_t i = 0; i < N; ++i) {
cin >> hs_str;
hs[i] = stoi(hs_str);
... | [
"variable_declaration.type.primitive.change"
] | 953,771 | 953,772 | u701642989 | cpp |
p03160 | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void chmin(int &x, int y) {
if (x > y)
x = y;
}
void core() {
size_t N;
cin >> N;
string hs_str;
std::vector<int> hs(N);
for (size_t i = 0; i < N; ++i) {
cin >> hs_str;
hs[i] = stoi(hs_str);
//... | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void chmin(long &x, long y) {
if (x > y)
x = y;
}
void core() {
size_t N;
cin >> N;
string hs_str;
std::vector<long> hs(N);
for (size_t i = 0; i < N; ++i) {
cin >> hs_str;
hs[i] = stoi(hs_str);
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 953,773 | 953,772 | u701642989 | cpp |
p03160 | // Justin Choi
#include <bits/stdc++.h>
using namespace std;
string FILENAME = "template";
#define io \
ifstream fin(FILENAME + ".in"); \
ofstream fout(FILENAME + ".out")
#define fwrite(X) fout << X;
#d... | // Justin Choi
#include <bits/stdc++.h>
using namespace std;
string FILENAME = "template";
#define io \
ifstream fin(FILENAME + ".in"); \
ofstream fout(FILENAME + ".out")
#define fwrite(X) fout << X;
#d... | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,774 | 953,775 | u602301110 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int h[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = h[1] - h[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int h[n], dp[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] =
min(dp[i - 1] + abs(h[i] - h[i -... | [
"call.arguments.change",
"call.add"
] | 953,778 | 953,779 | u845907943 | cpp |
p03160 | // g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using ... | // g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 953,782 | 953,783 | u388134182 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 2; i >= 0; i--) {
int mini = INT_MAX;
for (int j = i + 1; j <= i + 2 && j < n; j++) {
mini = min(mini,... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 2; i >= 0; i--) {
int mini = INT_MAX;
for (int j = i + 1; j <= i + 2 && j < n; j++) {
mini = min(mini,... | [
"assignment.change"
] | 953,786 | 953,787 | u690520470 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define vl vector<ll>
#define vpl vector<pair<ll, ll>>
#include <algorithm> //__gcd(a,b)
#include <cmath> //abs
#include <iostream>
int main() {
ll n;
cin >> n;
vl h(n);
r... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define vl vector<ll>
#define vpl vector<pair<ll, ll>>
#include <algorithm> //__gcd(a,b)
#include <cmath> //abs
#include <iostream>
int main() {
ll n;
cin >> n;
vl h(n);
r... | [
"call.add",
"call.arguments.change"
] | 953,788 | 953,789 | u454600293 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll i;
ll h[n];
ll dp[n];
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = (ll)(abs(h[1] - h[0]));
for (i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + (ll)abs(h[i] - h[i - 1]),
d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll i;
ll h[n];
ll dp[n];
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = (ll)(abs(h[1] - h[0]));
for (i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + (ll)abs(h[i] - h[i - 1]),
d... | [
"expression.operation.binary.add"
] | 953,790 | 953,791 | u260870629 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n);
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n);
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 953,794 | 953,795 | u392423112 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n);
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n);
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 953,796 | 953,795 | u392423112 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL... | [] | 953,801 | 953,802 | u731665172 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
for (i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = h[0];
dp[1] = abs(h[0] - h[1]);
for (i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
for (i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i ... | [] | 953,809 | 953,810 | u987273922 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
arr[0] = -1;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
long long int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
arr[0] = -100000;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
long long int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
... | [
"literal.number.change",
"assignment.value.change"
] | 953,813 | 953,814 | u901327149 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
arr[0] = -1;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
arr[0] = -100000;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
long long int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
... | [
"literal.number.change",
"assignment.value.change"
] | 953,815 | 953,814 | u901327149 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll a[n];
ll i;
for (i = 0; i < n; i++)
cin >> a[i];
ll sol[n];
sol[0] = 0;
sol[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++)
sol[i] = min((sol[i - 1] + abs(a[i] - a[i - 1])),
(sol[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll a[n];
ll i;
for (i = 0; i < n; i++)
cin >> a[i];
ll sol[n];
sol[0] = 0;
sol[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++)
sol[i] = min((sol[i - 1] + abs(a[i] - a[i - 1])),
(sol[... | [
"expression.operation.binary.add"
] | 953,822 | 953,823 | u975400222 | cpp |
p03160 |
#include <bits/stdc++.h>
#define zcin(type, a) \
type a; \
cin >> a;
#define zcout(a, sep1, b, sep2) cout << a << sep1 << b << sep2;
#define zfor(i, b, n) for (int i = b; i < n; ++i)
#defin... |
#include <bits/stdc++.h>
#define zcin(type, a) \
type a; \
cin >> a;
#define zcout(a, sep1, b, sep2) cout << a << sep1 << b << sep2;
#define zfor(i, b, n) for (int i = b; i < n; ++i)
#defin... | [
"literal.number.change",
"expression.operation.binary.change"
] | 953,834 | 953,835 | u549103550 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define rep(i, l, n) for (int i = (l); i < n; i++)
#define rep_cs(i, l, n) for (int i = (l); i <= n; i++)
#define rep_d(j, n) for (int j = n; j >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define rep(i, l, n) for (int i = (l); i < n; i++)
#define rep_cs(i, l, n) for (int i = (l); i <= n; i++)
#define rep_d(j, n) for (int j = n; j >... | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 953,842 | 953,843 | u496074393 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a... | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 953,846 | 953,847 | u850140043 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a... | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 953,848 | 953,847 | u850140043 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a... | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 953,849 | 953,850 | u850140043 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k = 2;
cin >> n;
int a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
int start;
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
for (int i = 1; i < n; i++) {
start = i - k;
if ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k = 2;
cin >> n;
int a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
int start;
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
for (int i = 1; i < n; i++) {
start = i - k;
if ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 953,859 | 953,860 | u565840775 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
; \
ios::sync_with_stdio(0); \
cin.tie... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
; \
ios::sync_with_stdio(0); \
cin.tie... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 953,861 | 953,862 | u905457052 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++)
dp[i] = min(abs(arr[i - 1... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++)
dp[i] = min(abs(arr[i - ... | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 953,863 | 953,864 | u365344644 | cpp |
p03160 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
#define PI 3.141592653589793238
#defin... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
#define PI 3.141592653589793238
#defin... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 953,866 | 953,867 | u220428866 | cpp |
p03160 | // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define m... | // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define m... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,868 | 953,869 | u007939655 | cpp |
p03160 | // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define m... | // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define m... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 953,870 | 953,869 | u007939655 | cpp |
p03160 | // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define m... | // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define m... | [
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.chan... | 953,871 | 953,869 | u007939655 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp;
cin >> n;
int dp[n];
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> temp;
v.push_back(temp);
dp[i] = 0;
}
dp[0] = v[0];
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + ab... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp;
cin >> n;
int dp[n];
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> temp;
v.push_back(temp);
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + abs(v... | [] | 953,872 | 953,873 | u137340048 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long data[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> data[n];
}
dp[0] = 0;
dp[1] = abs(data[1] - data[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(a... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long data[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> data[i];
}
dp[0] = 0;
dp[1] = abs(data[1] - data[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(abs(da... | [
"variable_declaration.type.narrow.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 953,875 | 953,876 | u506327015 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n + 1);
dp[1] = abs(h[0] - h[1]);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n + 1);
dp[1] = abs(h[0] - h[1]);
for (int i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,888 | 953,889 | u239409893 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, inf = LONG_MAX;
cin >> n;
vector<int> v(n + 10, inf), p(n + 10);
v[0] = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
v[i + 1] = min(v[i + 1], v[i] + abs(p[i] - p[i + 1]));
v[i + 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, inf = 100000000000000000000;
cin >> n;
vector<int> v(n + 10, inf), p(n + 10);
v[0] = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
v[i + 1] = min(v[i + 1], v[i] + abs(p[i] - p[i + 1]))... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 953,890 | 953,891 | u677464470 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
#define ull unsigned long long
#define pb push_back
#define all(v) ((v).begin()), ((v).end())
#define vi vector<ll>
#define INF 1000000000
#define M ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
int main... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
#define ull unsigned long long
#define pb push_back
#define all(v) ((v).begin()), ((v).end())
#define vi vector<ll>
#define INF 1000000000
#define M ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
int main... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 953,894 | 953,895 | u398912415 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, n, m) for (int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, n, m) for (int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,899 | 953,900 | u802905102 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
if (n == 1) {
cout << "0";
return 0;
}
dp[1] = abs(a[1] - a[0]);
for (int i = 1; i < n; i++) {
dp[i] =
min(dp[i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
if (n == 1) {
cout << "0";
return 0;
}
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,901 | 953,902 | u525349103 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
if (n == 1)
cout << "0";
return 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 1; i < n; i++) {
dp[i] =
min(dp[i - 1] + a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
if (n == 1) {
cout << "0";
return 0;
}
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,903 | 953,902 | u525349103 | cpp |
p03160 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j;
cin >> n;
ll a[n + 1];
ll dp[n + 2];
for (i = 0; i < n + 2; i++)
dp[i] = 1e13;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
a[n] = 0;
dp[0] = 0;
for (i = 0; i < n - 1; i++) {
dp[... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j;
cin >> n;
ll a[n + 1];
ll dp[n + 2];
for (i = 0; i < n + 2; i++)
dp[i] = 1e13;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
a[n] = 0;
dp[0] = 0;
for (i = 0; i < n - 1; i++) {
dp[... | [
"expression.operation.binary.add"
] | 953,904 | 953,905 | u595893956 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, a[100005], dp[100005];
cin >> n;
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 2; i <= n; i++) {
dp[i] =
min(dp... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, a[100005], dp[100005];
cin >> n;
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,908 | 953,909 | u282636125 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int v[100001];
int dp(int i, int a[]) {
if (i == 0) {
v[0] = 0;
return 0;
}
if (i == 1) {
v[1] = (abs(a[0] - a[1]));
return v[1];
}
if (v[i] != -1)
return v[i];
v[i] = min((abs(a[i] - a[i - 1]) + dp(i - 1, a)),
abs(a[i] - a[i... | #include <bits/stdc++.h>
using namespace std;
int v[100001];
int dp(int i, int a[]) {
if (i == 0) {
v[0] = 0;
return 0;
}
if (i == 1) {
v[1] = (abs(a[0] - a[1]));
return v[1];
}
if (v[i] != -1)
return v[i];
v[i] = min((abs(a[i] - a[i - 1]) + dp(i - 1, a)),
abs(a[i] - a[i... | [
"identifier.change",
"function.return_value.change"
] | 953,910 | 953,911 | u209981906 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define MX 100005
int A[MX];
int dp[MX];
int F(int n) {
if (n == 1) {
return dp[n] = 0;
}
if (n == 2) {
return dp[n] = abs(A[2] - A[1]);
}
if (dp[n] != -1)
return dp[n];
return dp[n] = min(F(n - 1) + abs(A[n] - A[n - 1]),
F(n ... | #include <bits/stdc++.h>
using namespace std;
#define MX 100005
int A[MX];
int dp[MX];
int F(int n) {
if (n == 1) {
return dp[n] = 0;
}
if (n == 2) {
return dp[n] = abs(A[2] - A[1]);
}
if (dp[n] != -1)
return dp[n];
return dp[n] = min(F(n - 1) + abs(A[n] - A[n - 1]),
F(n ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,914 | 953,915 | u918656720 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define pb push_back
#define fi first
#define si second
#define mp make_pair
#define f(n) for (ll i = 0; i < n; i++)
#define ff(m) for (ll j = 0; j < m; j++)
#define fr(i, p, n) for (ll i = p; i < n; i++)
#define in insert
ll ... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define pb push_back
#define fi first
#define si second
#define mp make_pair
#define f(n) for (ll i = 0; i < n; i++)
#define ff(m) for (ll j = 0; j < m; j++)
#define fr(i, p, n) for (ll i = p; i < n; i++)
#define in insert
ll ... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 953,916 | 953,917 | u339112743 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define pb push_back
#define fi first
#define si second
#define mp make_pair
#define f(n) for (ll i = 0; i < n; i++)
#define ff(m) for (ll j = 0; j < m; j++)
#define fr(i, p, n) for (ll i = p; i < n; i++)
#define in insert
ll ... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define pb push_back
#define fi first
#define si second
#define mp make_pair
#define f(n) for (ll i = 0; i < n; i++)
#define ff(m) for (ll j = 0; j < m; j++)
#define fr(i, p, n) for (ll i = p; i < n; i++)
#define in insert
ll ... | [
"call.add",
"call.arguments.change"
] | 953,918 | 953,917 | u339112743 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long dp[n];
for (int i = 0; i < n; i++)
dp[i] = 100000;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long dp[n];
for (int i = 0; i < n; i++)
dp[i] = 1000000000000;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
... | [
"literal.number.change",
"assignment.value.change"
] | 953,919 | 953,920 | u877494916 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long dp[100000];
long long h[100000];
for (int i = 0; i < N; ++i) {
cin >> h[i];
dp[i] = 10000;
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2] = mi... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long dp[100000];
long long h[100000];
for (int i = 0; i < N; ++i) {
cin >> h[i];
dp[i] = 10000000000;
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2... | [
"literal.number.change",
"assignment.value.change"
] | 953,925 | 953,926 | u420245204 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long dp[10100];
long long h[10100];
for (int i = 0; i < N; ++i) {
cin >> h[i];
dp[i] = 10000;
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2] = min(... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long dp[100000];
long long h[100000];
for (int i = 0; i < N; ++i) {
cin >> h[i];
dp[i] = 10000000000;
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change"
] | 953,927 | 953,926 | u420245204 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int h[100010];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int dp[100010];
dp[0] = 0;
dp[1] = abs(h[2] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i + 1] - h[i]), dp[i - 2] + a... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int h[100010];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int dp[100010];
dp[0] = 0;
dp[1] = abs(h[2] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i - 1] + abs(h[i + 1] - h[i]),
dp[i ... | [
"assignment.change"
] | 953,931 | 953,932 | u963353562 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int h[100010];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int dp[100010];
dp[0] = 0;
dp[1] = abs(h[2] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i - 1] + abs(h[i + 1] - h[i]),
dp[i ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int h[100010];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int dp[100010];
dp[0] = 0;
dp[1] = abs(h[2] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i - 1] + abs(h[i + 1] - h[i]),
dp[i ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 953,933 | 953,932 | u963353562 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
... | [
"assignment.change"
] | 953,937 | 953,938 | u864171425 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 953,939 | 953,938 | u864171425 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 953,940 | 953,938 | u864171425 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
int N;
... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
int N;
... | [
"variable_declaration.type.widen.change"
] | 953,941 | 953,942 | u821432765 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,945 | 953,946 | u792288167 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#inc... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,949 | 953,950 | u960267905 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
/*おかしい？
void cmin(int x, int y) {
x=min(x, y);
return;
}
*/
int main() {
int N;
int INF = 1000;
cin >> N;
vector<int> h(N);
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
for (int i = 0; i < N; i++) {
d.at(i) = INF;
}
... | #include <bits/stdc++.h>
using namespace std;
/*おかしい？
void cmin(int x, int y) {
x=min(x, y);
return;
}
*/
int main() {
int N;
int INF = 1000000000;
cin >> N;
vector<int> h(N);
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
for (int i = 0; i < N; i++) {
d.at(i) = INF;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 953,951 | 953,952 | u875815230 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] = min((dp[i - 1] + abs(a[i] - a[i - 1])),
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] = min((dp[i - 1] + abs(a[i] - a[i - 1])),
... | [] | 953,961 | 953,962 | u879906354 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define mem(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define mem(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define... | [] | 953,971 | 953,972 | u809929160 | cpp |
p03160 | #include <bits/stdc++.h>
// #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], c[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
c[1] = 0;
// c[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
c[i] = c[i - 1] + abs(a[i] - a[i - 1]);
if (i > 2)
c[... | #include <bits/stdc++.h>
// #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], c[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
c[1] = 0;
// c[2] = abs(a[2] - a[1]);
for (int i = 2; i <= n; i++) {
c[i] = c[i - 1] + abs(a[i] - a[i - 1]);
if (i > 2)
c[... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,973 | 953,974 | u452576480 | cpp |
p03160 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define ll long long int
#define llu unsigned long long int
#define N 100001
using namespace std;
vector<int> dp(N, -1);
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
v[0] = 2 * N... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define ll long long int
#define llu unsigned long long int
#define N 100001
using namespace std;
vector<int> dp(N, -1);
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
v[0] = 2 * N... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,975 | 953,976 | u889144837 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
ll int dp[1000005];
ll int N;
vector<ll int> v;
int fun(int i) {
if (i == N - 1)
return 0;
if (i >= N)
return 0;
if (dp[i + 1] == -1)
dp[i + 1] = fun(i + 1);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
ll int dp[1000005];
ll int N;
vector<ll int> v;
ll int fun(int i) {
if (i == N - 1)
return 0;
if (i >= N)
return 999999999;
if (dp[i + 1] == -1)
dp[i + 1] = fun... | [
"literal.number.change",
"function.return_value.change"
] | 953,977 | 953,978 | u042395367 | cpp |
p03160 | #include <iostream>
using namespace std;
const int INF = 1 << 30;
int N;
int h[100010];
int dp[100010];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[1] = 0;
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[... | #include <iostream>
using namespace std;
const int INF = 1 << 30;
int N;
int h[100010];
int dp[100010];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 953,981 | 953,982 | u047554023 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e5;
int main() {
int n;
cin >> n;
vector<int> h(n), dp(n, INF);
for (int &x : h)
cin >> x;
dp[0] = 0;
for (int i = 0; i < n; ++i) {
if (i + 1 < n) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
}
if (i + 2 <... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> h(n), dp(n, INF);
for (int &x : h)
cin >> x;
dp[0] = 0;
for (int i = 0; i < n; ++i) {
if (i + 1 < n) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
}
if (i + 2 <... | [
"literal.number.change",
"variable_declaration.value.change"
] | 953,983 | 953,984 | u329213964 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;
int dp[100005];
int ans(int i) {
if (i >= n)
return 2e9;
if (i == n - 2)
return abs(v[i] - v[n - 1]);
if (i == n - 3)
return abs(v[i] - v[n - 1]);
int &ret = dp[i];
if (ret != 2e9)
return 2e9;
ret = min(ret, ans(i + 1) + abs... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;
int dp[100005];
int ans(int i) {
if (i >= n)
return 2e9;
if (i == n - 2)
return abs(v[i] - v[n - 1]);
if (i == n - 3)
return abs(v[i] - v[n - 1]);
int &ret = dp[i];
if (ret != 2e9)
return ret;
ret = min(ret, ans(i + 1) + abs... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 953,985 | 953,986 | u349008117 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<i... | #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<i... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,987 | 953,988 | u165709298 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<i... | #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,989 | 953,988 | u165709298 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<i... | #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 953,990 | 953,988 | u165709298 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int n;
vector<int> h(10010);
vector<long long> dp(10010);
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[i + ... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int n;
vector<int> h(100010);
vector<long long> dp(100010);
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[i ... | [
"literal.number.change",
"call.arguments.change"
] | 954,014 | 954,012 | u154645927 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define all(x) x.begin(), x.end()
typedef std::vector<int> vi;
typedef std::vector<vector<int>> vvi;
typedef std::vector<string> vs;
typedef std::vector<bool> vb;
typedef std::pair<int, int> pii;
typedef long long ll;
const int... | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define all(x) x.begin(), x.end()
typedef std::vector<int> vi;
typedef std::vector<vector<int>> vvi;
typedef std::vector<string> vs;
typedef std::vector<bool> vb;
typedef std::pair<int, int> pii;
typedef long long ll;
const int... | [
"call.arguments.add"
] | 954,022 | 954,023 | u705892698 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int h[100005];
int memo[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < 100005; i++) {
memo[i] = 100000;
}
memo[1] = 0;
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
if (i == n - 1) {
memo[i... | #include <bits/stdc++.h>
using namespace std;
int h[100005];
int memo[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < 100005; i++) {
memo[i] = INT_MAX;
}
memo[1] = 0;
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
if (i == n - 1) {
memo[... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 954,026 | 954,027 | u477832992 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define loop(n) for (ll i = 0; i < n; i++)
#define sort(a) sort(a.begin(), a.end())
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
vector<int> h(n);
loop(n) cin >> h[i];
vector<ll> dp(n, 9999999999);
dp[0] = 0;
fo... | #include <bits/stdc++.h>
#define ll long long
#define loop(n) for (ll i = 0; i < n; i++)
#define sort(a) sort(a.begin(), a.end())
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
vector<int> h(n);
loop(n) cin >> h[i];
vector<ll> dp(n, 9999999999);
dp[0] = 0;
fo... | [] | 954,041 | 954,042 | u771319968 | cpp |
p03160 | /*
@author: Charan Sai
*/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | /*
@author: Charan Sai
*/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [] | 954,043 | 954,044 | u895093067 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl "\n"
#define inf 1000000007
//#define for(i, a, b) for(int i=a; i<b; i++)
void solve() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {0};
dp[0] = 0;
dp[1] = arr... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl "\n"
#define inf 1000000007
//#define for(i, a, b) for(int i=a; i<b; i++)
void solve() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {0};
dp[0] = 0;
dp[1] = abs... | [
"call.add",
"call.arguments.change"
] | 954,045 | 954,046 | u515638999 | 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;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(void) {
// infinity //様々な流儀
... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(void) {
// infinity //様々な流儀
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 954,047 | 954,048 | u308885164 | cpp |
p03160 | #include <iostream>
using namespace std;
int climb_dp(int *h, int n) {
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] +=
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int... | #include <iostream>
using namespace std;
int climb_dp(int *h, int n) {
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int ... | [
"assignment.value.change"
] | 954,066 | 954,067 | u917760390 | cpp |
p03160 | #include <bits/stdc++.h>
#define LL long long int
#define LD long double
#define PI 3.14159265358979323846
#define MOD ((LL)1e9 + 7)
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define LL long long int
#define LD long double
#define PI 3.14159265358979323846
#define MOD ((LL)1e9 + 7)
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,068 | 954,069 | u392058778 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define MOD 1000000007
#define ld long double
#define vpll vector<pair<ll, ll>>
#define vll vector<ll>
#define pll pair<ll, ll>
#define pld pair<ll, ld>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define ... | #include <bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define MOD 1000000007
#define ld long double
#define vpll vector<pair<ll, ll>>
#define vll vector<ll>
#define pll pair<ll, ll>
#define pld pair<ll, ld>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define ... | [] | 954,072 | 954,073 | u725001080 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define ll long long
#define ae addEdge
#define mp make_pair
#define vi vector<int>
#define vll vector<long long>
#define si set<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define sortv sort(v.b... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define ll long long
#define ae addEdge
#define mp make_pair
#define vi vector<int>
#define vll vector<long long>
#define si set<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define sortv sort(v.b... | [
"call.add",
"call.arguments.change"
] | 954,074 | 954,075 | u583798468 | cpp |
p03160 | // Standard Stuff
#include <bits/stdc++.h>
using namespace std;
// Macros
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(c) c.begin(), c.end()
// Rename Datatypes
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
// Random
mt19937_64 rng(chrono::st... | // Standard Stuff
#include <bits/stdc++.h>
using namespace std;
// Macros
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(c) c.begin(), c.end()
// Rename Datatypes
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
// Random
mt19937_64 rng(chrono::st... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,076 | 954,077 | u339347910 | cpp |
p03160 | // Standard Stuff
#include <bits/stdc++.h>
using namespace std;
// Macros
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(c) c.begin(), c.end()
// Rename Datatypes
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
// Random
mt19937_64 rng(chrono::st... | // Standard Stuff
#include <bits/stdc++.h>
using namespace std;
// Macros
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(c) c.begin(), c.end()
// Rename Datatypes
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
// Random
mt19937_64 rng(chrono::st... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 954,078 | 954,077 | u339347910 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
int dp[100005] = {0};
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= 2; j++) {
if (i - j >= 0)
dp[i] = min(dp[i],... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
int dp[100005] = {0};
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= 2; j++) {
if (i - j > 0)
dp[i] = min(dp[i], ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 954,079 | 954,080 | u883218614 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int *b = new int[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
b[i] =
min(b[i - 1] + abs(a[i - 1] + a[i]), b[i - 2] + ab... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int *b = new int[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
b[i] =
min(b[i - 1] + abs(a[i - 1] - a[i]), b[i - 2] + ab... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,081 | 954,082 | u883218614 | cpp |
p03160 | #include <iostream>
int abs(int a) { return (a > 0) ? a : -a; }
int main() {
int n;
std::cin >> n;
int a[n], dp[n];
for (int i = 0; i < n; i++)
std::cin >> a[i];
dp[0] = a[0];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 1)
dp[i] = std::min(dp[i], d... | #include <iostream>
int abs(int a) { return (a > 0) ? a : -a; }
int main() {
int n;
std::cin >> n;
int a[n], dp[n];
for (int i = 0; i < n; i++)
std::cin >> a[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 1)
dp[i] = std::min(dp[i], dp[i... | [] | 954,083 | 954,084 | u387880194 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 954,085 | 954,086 | u680707192 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807 / 2;
const int MOD = 1000000007;
const int N_MAX = pow(10, 5);
int main() ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807 / 2;
const int MOD = 1000000007;
const int N_MAX = pow(10, 5);
int main() ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,087 | 954,088 | u680707192 | cpp |
p03160 | #include <bits/stdc++.h>
#define crap \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define endl "\n"
#define int ll
using nam... | #include <bits/stdc++.h>
#define crap \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define endl "\n"
#define int ll
using nam... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 954,093 | 954,094 | u058484297 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define mod 1000000007
#define pi acos(-1.0)
#d... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define mod 1000000007
#define pi acos(-1.0)
#d... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,095 | 954,096 | u965661170 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
ll solve(vector<int> &height, int n) {
vector<ll> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
dp[i] = min(abs(height[i] - height[i - 1])... | /*
author: kartik8800
*/
#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int solve(vector<int> &height, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
else
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,110 | 954,111 | u212789054 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int solve(vector<int> &height, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
dp[i] = min(abs(height[i] - height[i - 1... | /*
author: kartik8800
*/
#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int solve(vector<int> &height, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
else
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,112 | 954,111 | u212789054 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int solve(vector<int> &height, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
dp[i] = min(abs(height[i] - height[i - 1... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int solve(vector<int> &height, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
else
dp[i] = min(abs(height[i] - h... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,112 | 954,113 | u212789054 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = INT_MAX;
}
b[0] = 0;
b[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
b[i] =
min(b[i - 1] + abs(b[i] - b[i - 1]), b[i - 2] + abs(b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = INT_MAX;
}
b[0] = 0;
b[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
b[i] =
min(b[i - 1] + abs(a[i] - a[i - 1]), b[i - 2] + abs(a... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,114 | 954,115 | u072459929 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[n + 1], d[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
a[0] = a[i];
d[0] = 0;
d[1] = 0;
for (j = 2; j <= n; j++) {
d[n] =
min(abs(a[j] - a[j - 1]) + d[j - 1], abs(a[j] - a[j - 2]) + d[j - 2]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[n + 1], d[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
a[0] = a[1];
d[0] = 0;
d[1] = 0;
/*for(j=0;j<=n;j++)
{
cout<<a[j]<<" ";
}*/
for (j = 2; j <= n; j++) {
d[j] =
min(abs(a[j] ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"assignment.variable.change",
"identifier.change"
] | 954,116 | 954,117 | u213550434 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = v[1] - v[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(v[i] - v[i - 2]) + dp[i - 2], abs(v[i] - v[i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(v[i] - v[i - 2]) + dp[i - 2], abs(v[i] - ... | [
"call.add",
"call.arguments.change"
] | 954,127 | 954,128 | u929177784 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int i, j, t, n, m, a, b, c;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = arr[2] - arr[1];
for (int i = 3; i <= n; i++)
dp[i] = min((dp[i - 1] +... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int i, j, t, n, m, a, b, c;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
dp[i] = min((dp[i -... | [
"call.add",
"call.arguments.change"
] | 954,131 | 954,132 | u629410400 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
void fnInput(vector<int> &rvnStage) {
int nStageSiz;
cin >> nStageSiz;
rvnStage.resize(nStageSiz);
for (int &rnStage : rvnStage)
cin >> rnStage;
}
double fnDPCost(const vector<int> &cnrvnStage) {
vector<int> vnDPCost(cnrvnStage.size(), INT_MAX);
vnDPCost[... | #include <bits/stdc++.h>
using namespace std;
void fnInput(vector<int> &rvnStage) {
int nStageSiz;
cin >> nStageSiz;
rvnStage.resize(nStageSiz);
for (int &rnStage : rvnStage)
cin >> rnStage;
}
int fnDPCost(const vector<int> &cnrvnStage) {
vector<int> vnDPCost(cnrvnStage.size(), INT_MAX);
vnDPCost[0] ... | [
"function.return_type.change"
] | 954,136 | 954,137 | u439912527 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t, y = 1;
// cin>>t;
t = 1;
while (t > 0) {
t--;
ll n, i, j, k, flag = 0;
cin >> n;
ll h[n + 1], a[n + 1];
for (i = 1; i <= n; i++) {
cin >> h[i]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t, y = 1;
// cin>>t;
t = 1;
while (t > 0) {
t--;
ll n, i, j, k, flag = 0;
cin >> n;
ll h[n + 1], a[n + 1];
for (i = 1; i <= n; i++) {
cin >> h[i]... | [
"call.add",
"call.arguments.change"
] | 954,138 | 954,139 | u689769413 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.chan... | 954,142 | 954,143 | u281168735 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.