problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
ll arr[n + 1];
arr[0] = 0;
for (int i = 1; i <= n; i++)
cin >> arr[i];
ll 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] = 10000000000;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
ll arr[n + 1];
arr[0] = 0;
for (int i = 1; i <= n; i++)
cin >> arr[i];
ll 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] = 100000000000... | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 962,283 | 962,284 | u885151856 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int N, a, K;
vector<int> v, rez;
int main() {
cin >> N >> K;
rez.insert(rez.begin(), N, 10001);
for (int i = 0; i < N; i++) {
cin >> a;
v.push_back(a);
}
int br;
rez[0] = 0;
for (int i = 1; i < N; i++) {
br = i;
for (int j = i - 1; j >= 0 && ... | #include <bits/stdc++.h>
using namespace std;
int N, a, K;
vector<int> v, rez;
int main() {
cin >> N >> K;
rez.insert(rez.begin(), N, 1000000005);
for (int i = 0; i < N; i++) {
cin >> a;
v.push_back(a);
}
int br;
rez[0] = 0;
for (int i = 1; i < N; i++) {
br = i;
for (int j = i - 1; j >= ... | [
"literal.number.change",
"call.arguments.change"
] | 962,287 | 962,288 | u717974610 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int h[1000000];
int main() {
int N, K;
cin >> N >> K;
cin >> h[1];
for (int i = 2; i <= N; i++) {
cin >> h[i];
dp[i] = INT_MAX;
for (int j = i - 1, cnt = 1; j >= 0 && cnt <= K; j--, cnt++) {
dp[i] = min(dp[i], dp[j] + abs(h[i] -... | #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int h[1000000];
int main() {
int N, K;
cin >> N >> K;
cin >> h[1];
for (int i = 2; i <= N; i++) {
cin >> h[i];
dp[i] = INT_MAX;
for (int j = i - 1, cnt = 1; j >= 1 && cnt <= K; j--, cnt++) {
dp[i] = min(dp[i], dp[j] + abs(h[i] -... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 962,289 | 962,290 | u937063359 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define lli long long int
#define pb push_back
#define mp make_pair
#define fo(i, n) for (i = 0; i < (n); i++)
#define endl "\n"
#define mod 1000000007
long long int i, j;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
lli n,... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define lli long long int
#define pb push_back
#define mp make_pair
#define fo(i, n) for (i = 0; i < (n); i++)
#define endl "\n"
#define mod 1000000007
long long int i, j;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
lli n,... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,295 | 962,296 | u221917024 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll solve(ll i, ll k, ll a[], ll n, vector<ll> &dp) {
if (dp[i] != -1) {
return dp[i];
}
ll c = LONG_LONG_MAX;
for (ll j = 1; j <= k; j++) {
if (i < n - j) {
c = min(c, abs(a[i] - a[i + 1]) + solve(i + 1, k, a, n, dp));
}
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll solve(ll i, ll k, ll a[], ll n, vector<ll> &dp) {
if (dp[i] != -1) {
return dp[i];
}
ll c = LONG_LONG_MAX;
for (ll j = 1; j <= k; j++) {
if (i < n - j) {
c = min(c, abs(a[i] - a[i + j]) + solve(i + j, k, a, n, dp));
}
}
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,297 | 962,298 | u785762524 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sc(n) scanf("%d", &n)
#define scl(n) scanf("%lld", &n)
#define pr(n) printf("%d", n)
#define prl(n) printf("%lld", n)
#define nl printf("\n")
#define fast_io ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sc(n) scanf("%d", &n)
#define scl(n) scanf("%lld", &n)
#define pr(n) printf("%d", n)
#define prl(n) printf("%lld", n)
#define nl printf("\n")
#define fast_io ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 962,299 | 962,300 | u630567900 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
int main() {
LL n, k;
LL h[100000];
LL c[100000];
cin >> n >> k;
for (LL i = 0; i < n; i++) {
cin >> ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
int main() {
LL n, k;
LL h[100000];
LL c[100000];
cin >> n >> k;
for (LL i = 0; i < n; i++) {
cin >> ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 962,305 | 962,306 | u649423108 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int inf = 1e9 + 10;
int n, k, h[N];
int f[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = n - 1; i >= 1; i--) {
f[i] = inf;
for (int j = 1; j <= min(n - i, k); j++)
f[i] = min(... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int inf = 1e9 + 10;
int n, k, h[N];
int f[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = n - 1; i >= 1; i--) {
f[i] = inf;
for (int j = 1; j <= min(n - i, k); j++)
f[i] = min(... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,310 | 962,311 | u596976719 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.ti... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 962,318 | 962,319 | u889914341 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
... | [
"assignment.value.change",
"identifier.change"
] | 962,320 | 962,321 | u826345451 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
int h[100000];
long long d[100000];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
memset(d, 0, 100000);
for (int i = 1; i < n; i++) {
long long w = d[i - 1] + abs(h... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
int h[100000];
long long d[100000];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
memset(d, 0, 100000);
for (int i = 1; i < n; i++) {
long long w = d[i - 1] + abs(h... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 962,325 | 962,326 | u597243424 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
long long int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i < k)
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
long long int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i < k)
for (int ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.cond... | 962,329 | 962,330 | u696394763 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int N, K, h[100000 + 5], Cost[100000 + 5] = {0};
int select_k(int i, int K) {
int cost = 100000;
for (int k = 1; k <= K; k++)
cost = min(cost, abs(h[i] - h[i - k]) + Cost[i - k]);
return cost;
}
void solve() {
Cost[1] = 0;
Cost[2] = abs(h[2] - ... | #include <cmath>
#include <iostream>
using namespace std;
int N, K, h[100000 + 5], Cost[100000 + 5] = {0};
int select_k(int i, int K) {
int cost = 10000000000;
for (int k = 1; k <= K; k++)
cost = min(cost, abs(h[i] - h[i - k]) + Cost[i - k]);
return cost;
}
void solve() {
Cost[1] = 0;
Cost[2] = abs(h[... | [
"literal.number.change",
"variable_declaration.value.change"
] | 962,333 | 962,334 | u718394671 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int N, K, h[100000 + 5], Cost[100000 + 5] = {0};
int select_k(int i, int K) {
int cost = 100000;
for (int k = 0; k < K; k++)
cost = min(cost, abs(h[i] - h[i - k]) + Cost[i - k]);
return cost;
}
void solve() {
Cost[1] = 0;
Cost[2] = abs(h[2] - h... | #include <cmath>
#include <iostream>
using namespace std;
int N, K, h[100000 + 5], Cost[100000 + 5] = {0};
int select_k(int i, int K) {
int cost = 10000000000;
for (int k = 1; k <= K; k++)
cost = min(cost, abs(h[i] - h[i - k]) + Cost[i - k]);
return cost;
}
void solve() {
Cost[1] = 0;
Cost[2] = abs(h[... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 962,335 | 962,334 | u718394671 | cpp |
p03161 | #include <iostream>
using namespace std;
const int maxN = 100000;
const int64_t inf = (1LL << 50);
int h[maxN];
int64_t dp[maxN];
int main() {
int n, k;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
fill(dp, dp + n, inf);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - k; ... | #include <iostream>
using namespace std;
const int maxN = 100000;
const int64_t inf = (1LL << 50);
int h[maxN];
int64_t dp[maxN];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
fill(dp, dp + n, inf);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i ... | [
"expression.operation.binary.add"
] | 962,336 | 962,337 | u602850810 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define f(n) for (ll i = 0; i < n; i++)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define f(n) for (ll i = 0; i < n; i++)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define ... | [
"control_flow.loop.for.initializer.change",
"call.remove",
"call.arguments.change"
] | 962,338 | 962,339 | u192404631 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
//#define int ll
int n, k, h[100001], dp[100001];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
//#define int ll
int n, k, h[100001], dp[100001];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
co... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,344 | 962,345 | u192208612 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k, d... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k, d... | [
"literal.number.change",
"assignment.value.change"
] | 962,346 | 962,347 | u635992896 | cpp |
p03161 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | [
"literal.number.change",
"variable_declaration.value.change"
] | 962,350 | 962,351 | u757738907 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int Maxn = 110000;
int n, h[Maxn], f[Maxn], k;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
memset(f, 0x3f, sizeof(f)), f[1] = 0;
for (int i = 2; i <= n; i++)
for... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int Maxn = 110000;
int n, h[Maxn], f[Maxn], k;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
memset(f, 0x3f, sizeof(f)), f[1] = 0;
for (int i = 2; i <= n; i++)
for... | [
"assignment.change"
] | 962,358 | 962,359 | u360800499 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
long long n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1ll << 60);
for (int i = 2; i <= n... | #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
long long n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1ll << 60);
for (int i = 2; i <= n... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,360 | 962,361 | u505087895 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
long long n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1 << 60);
for (int i = 2; i <= n; ... | #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
long long n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1ll << 60);
for (int i = 2; i <= n... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,362 | 962,361 | u505087895 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
int n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1 << 30);
for (int i = 2; i <= n; i++) {... | #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
long long n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1ll << 60);
for (int i = 2; i <= n... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change"
] | 962,364 | 962,361 | u505087895 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define forall(i, j, n) for (int i = j; i < n; i++)
#define all(c) c.begin(), c.end()
#define tr(container, it) \
for (__typeof(container.begin()) it = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define forall(i, j, n) for (int i = j; i < n; i++)
#define all(c) c.begin(), c.end()
#define tr(container, it) \
for (__typeof(container.begin()) it = ... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 962,365 | 962,366 | u289277024 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX = 1e5 + 6;
const int INF = 1e19 + 8;
int n, k;
int h[MAX], dp[MAX];
signed main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
for (int i = 2; i < MAX; i++) {
dp[i] = INF;
}
for (int i = 2; i <= n; i... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX = 1e5 + 6;
const int INF = 1e19 + 8;
int n, k;
int h[MAX], dp[MAX];
signed main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
for (int i = 2; i < MAX; i++) {
dp[i] = INF;
}
for (int i = 2; i <= n; i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,369 | 962,370 | u161997524 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define MP make_pair
#define all(o) (o).begin(), (o).end()
#define mset(m, v) memset(m, v, sizeof(m))
#define fr(i, n) for (lli i = 0; i < n; ++i)
#define rep(i, a, b) for (lli i = a; i <= b; ++i)
#define per(i, a, b)... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define MP make_pair
#define all(o) (o).begin(), (o).end()
#define mset(m, v) memset(m, v, sizeof(m))
#define fr(i, n) for (lli i = 0; i < n; ++i)
#define rep(i, a, b) for (lli i = a; i <= b; ++i)
#define per(i, a, b)... | [
"expression.operation.binary.add",
"variable_declaration.array_dimensions.change"
] | 962,373 | 962,374 | u473487547 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define otp(n) cout << n;
#define ct(n) cout << n << endl;
#define cts(n) cout << n << " ";
#define cte cout << endl;
#define ctv(v) rep(i, (v).size()) ct(v[i])
#define rep(i, n) for (int i = 0; i < n; i++)
#define r... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define otp(n) cout << n;
#define ct(n) cout << n << endl;
#define cts(n) cout << n << " ";
#define cte cout << endl;
#define ctv(v) rep(i, (v).size()) ct(v[i])
#define rep(i, n) for (int i = 0; i < n; i++)
#define r... | [
"literal.number.change",
"assignment.value.change"
] | 962,375 | 962,376 | u721367699 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 100005
#define MAX_H 10000
int main() {
ll N, K;
int h[MAX];
int cost[MAX];
scanf("%lld", &N);
scanf("%lld", &K);
for (ll i = 0; i < N; i++) {
int k;
scanf("%d", &k);
h[i] = k;
}
cost[0] = 0;
for (ll i = 1; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 100005
#define MAX_H 10000 * 1000000
int main() {
ll N, K;
int h[MAX];
ll cost[MAX];
scanf("%lld", &N);
scanf("%lld", &K);
for (ll i = 0; i < N; i++) {
int k;
scanf("%d", &k);
h[i] = k;
}
cost[0] = 0;
for (l... | [
"variable_declaration.type.change"
] | 962,396 | 962,395 | u297590902 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int A[100002];
int F[100002];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> A[i];
}
F[1] = 0;
F[2] = (int)abs(A[2] - A[1]);
for (int i = 3; i <= n; ++i) {
int min = F[i - 1] + abs(A[i] - A[i - 1]);
for (... | #include <cmath>
#include <iostream>
using namespace std;
int A[100002];
int F[100002];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> A[i];
}
F[1] = 0;
F[2] = (int)abs(A[2] - A[1]);
for (int i = 3; i <= n; ++i) {
int min = F[i - 1] + abs(A[i] - A[i - 1]);
for (... | [
"literal.number.change",
"call.arguments.change"
] | 962,409 | 962,410 | u722318795 | cpp |
p03161 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <immintrin.h>
#include <iomanip>
#include <iostream>
#include <list>... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <immintrin.h>
#include <iomanip>
#include <iostream>
#include <list>... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,413 | 962,414 | u301704561 | cpp |
p03161 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namesp... | [] | 962,421 | 962,422 | u841802158 | cpp |
p03161 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 31;
int main() {
int n, k;
cin >> n >> k;
int h[100000];
f... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 31;
int main() {
int n, k;
cin >> n >> k;
int h[100000];
f... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,425 | 962,426 | u999803454 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
ll mi = INT_MAX;
for (ll j = 1; j <= k; j++) {
if (i >= j... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
ll mi = INT_MAX;
for (ll j = 1; j <= k; j++) {
if (i > j)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,427 | 962,428 | u962242502 | cpp |
p03161 | #include <iostream>
#define INF 1000000000
using namespace std;
int intAbs(int x) {
if (x < 0)
return x * -1;
return x;
}
int solve(int pos, int N, int DP[], int stones[], int K = 2) {
if (DP[pos] != INF)
return DP[pos];
int ret = INF;
if (pos > N)
return INF;
if (N == (pos + 1))
return 0;... | #include <iostream>
#define INF 1000000000
using namespace std;
int intAbs(int x) {
if (x < 0)
return x * -1;
return x;
}
int solve(int pos, int N, int DP[], int stones[], int K = 2) {
if (DP[pos] != INF)
return DP[pos];
int ret = INF;
if (pos > N)
return INF;
if (N == (pos + 1))
return 0;... | [
"call.arguments.add"
] | 962,429 | 962,430 | u981186088 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int dp[100010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
int cnt = k;
dp[i] = 2e9;
for (int j = i - 1; j >= 0, cnt--; j--)
dp[i] = min(dp... | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int dp[100010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
int cnt = k;
dp[i] = 2e9;
for (int j = i - 1; j >= 0 && cnt--; j--)
dp[i] = min(... | [
"control_flow.loop.for.condition.change"
] | 962,433 | 962,434 | u552706598 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 962,435 | 962,436 | u794707792 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
typedef pair<int, int>... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
typedef pair<int, int>... | [
"expression.operation.binary.remove"
] | 962,437 | 962,438 | u601825761 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int vis[n];
long long dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> vis[i];
}
for (int i = 1; i < n; i++) {
dp[i] = 100000;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int vis[n];
long long dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> vis[i];
}
for (int i = 1; i < n; i++) {
dp[i] = 1000000000000;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
... | [
"literal.number.change",
"assignment.value.change"
] | 962,439 | 962,440 | u684203905 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int vis[n];
int dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> vis[i];
}
for (int i = 1; i < n; i++) {
dp[i] = 100000;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
conti... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int vis[n];
long long dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> vis[i];
}
for (int i = 1; i < n; i++) {
dp[i] = 1000000000000;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 962,441 | 962,440 | u684203905 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#de... | #include <algorithm>
#include <iostream>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#de... | [
"assignment.value.change",
"identifier.change"
] | 962,442 | 962,443 | u915276406 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#de... | #include <algorithm>
#include <iostream>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#de... | [
"assignment.value.change",
"identifier.change",
"io.output.newline.add"
] | 962,444 | 962,443 | u915276406 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N, K;
long long h[100010];
// DPテーブル
long long dp[100010];
int main() {
cin >> N >> K... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N, K;
long long h[100010];
// DPテーブル
long long dp[100010];
int main() {
cin >> N >> K... | [
"expression.operation.binary.remove"
] | 962,445 | 962,446 | u627981695 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N, K;
long long h[100010];
// DPテーブル
long long dp[100010];
int main() {
cin >> N >> K... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N, K;
long long h[100010];
// DPテーブル
long long dp[100010];
int main() {
cin >> N >> K... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 962,447 | 962,446 | u627981695 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> answer(n, INT_MAX);
answer[0] = 0;
if (n > 1) {
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> answer(n, INT_MAX);
answer[0] = 0;
if (n > 1) {
for (int... | [
"assignment.change"
] | 962,454 | 962,455 | u667099228 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[1000010], ar[1000100], n, k;
ll frog(ll i) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
ll &kk = dp[i];
ll l = 0, a = 0, f = 1;
kk = frog(i + 1) + abs(ar[i] - ar[i + 1]);
for (ll j = 2; j <= k; j++) {
if (j + i <=... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[1000010], ar[1000100], n, k;
ll frog(ll i) {
if (i == n)
return 0LL;
if (dp[i] != -1)
return dp[i];
ll &kk = dp[i];
ll l = 0, a = 0, f = 1;
kk = frog(i + 1) + abs(ar[i] - ar[i + 1]);
for (ll j = 2; j <= k; j++) {
if (j + i ... | [
"literal.number.type.widen.change"
] | 962,462 | 962,463 | u939340226 | cpp |
p03161 | #include <bits/stdc++.h>
#include <utility>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fore(i, init, n) for (int i = init; i <= n; i++)
#define pb(a) push_back(a)
#define mk(a, b) make_pai... | #include <bits/stdc++.h>
#include <utility>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fore(i, init, n) for (int i = init; i <= n; i++)
#define pb(a) push_back(a)
#define mk(a, b) make_pai... | [
"literal.number.change",
"assignment.value.change"
] | 962,466 | 962,467 | u244125528 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <iostream>
#define mp make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
const int MAXN = 1e5 + 7;
template <typename T> inline T read() {
T res = 0, flag = 1;
char in =... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <iostream>
#define mp make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
const int MAXN = 1e5 + 7;
template <typename T> inline T read() {
T res = 0, flag = 1;
char in =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 962,468 | 962,469 | u939372094 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
using namespace std;
typedef long long LL;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!(ch >= '0' && ch <= '9')) {
if (ch == '-')
f = -1;
ch = ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
using namespace std;
typedef long long LL;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!(ch >= '0' && ch <= '9')) {
if (ch == '-')
f = -1;
ch = ... | [
"call.add",
"call.arguments.change"
] | 962,470 | 962,471 | u021294378 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; i++)
cin >> h[i];
ll dp[N];
dp[0] = 0;
for (int i = 1; i < N; i++) {
ll m = 100000;
for (int k = 1; k <= K; k++)... | #include <climits>
#include <iostream>
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; i++)
cin >> h[i];
ll dp[N];
dp[0] = 0;
for (int i = 1; i < N; i++) {
ll m = LLONG_MAX;
for (int k = 1; k <= K;... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 962,472 | 962,473 | u248670554 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 10000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1000000000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;... | [
"literal.number.change",
"call.arguments.change"
] | 962,485 | 962,484 | u763115743 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1000000000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;... | [
"literal.number.change",
"call.arguments.change"
] | 962,486 | 962,484 | u763115743 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 10000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1 << 30);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
... | [
"literal.number.change",
"call.arguments.change"
] | 962,485 | 962,487 | u763115743 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1 << 30);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
... | [
"literal.number.change",
"call.arguments.change"
] | 962,486 | 962,487 | u763115743 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int j;
cin >> j;
vector<int> vec;
int dp[n + 20];
for (int i = 0; i < n; i++) {
int h;
cin >> h;
vec.push_back(h);
dp[i] = 2000000000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int k = 1; k <= j; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int j;
cin >> j;
vector<int> vec;
int dp[n + 300];
for (int i = 0; i < n; i++) {
int h;
cin >> h;
vec.push_back(h);
dp[i] = 2000000000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int k = 1; k <= j;... | [
"literal.number.change",
"expression.operation.binary.change"
] | 962,490 | 962,491 | u713582551 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define lsb(x) (x & -x)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("a.in", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> v[i];
vector<int>... | #include <bits/stdc++.h>
#define ll long long
#define lsb(x) (x & -x)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("a.in", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> v[i];
vector<int>... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 962,492 | 962,493 | u088237968 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define rep(i, l, r) for (int i = l; i < r; i++)
#define SSTR(x) \
static_cast<std::ostringstream &>((std::ostringstream() << std::dec << x))... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define rep(i, l, r) for (int i = l; i < r; i++)
#define SSTR(x) \
static_cast<std::ostringstream &>((std::ostringstream() << std::dec << x))... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,494 | 962,495 | u258498090 | cpp |
p03161 | #include <iostream>
#include <stdlib.h>
using namespace std;
int n, k, i, j, h[10000], b[10000];
int tmp;
int main() {
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> h[i];
}
b[1] = h[1];
for (i = 2; i <= n; i++) {
tmp = 99999;
for (j = 1; j <= k; j++) {
if (i > j) {
tmp = min(b[i -... | #include <iostream>
#include <stdlib.h>
using namespace std;
long n, k, i, j, h[100001], b[100001];
long tmp;
int main() {
// freopen("frog2.inp","r",stdin);
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> h[i];
}
b[1] = h[1];
for (i = 2; i <= n; i++) {
tmp = 999999999;
for (j = 1; j <= k; j++)... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change"
] | 962,506 | 962,505 | u997459040 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = max(0, i... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = max(0, i... | [
"expression.operation.binary.remove"
] | 962,507 | 962,508 | u799165954 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = k; i < n; i++) {
for (j = max(0, i... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = max(0, i... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 962,509 | 962,508 | u799165954 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = min(0, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = max(0, i... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 962,510 | 962,508 | u799165954 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 0; j < k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[... | [
"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"
] | 962,519 | 962,520 | u573738515 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 0; j < k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[... | [
"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",
"assignment.value.change",
"identifier.change",
"... | 962,522 | 962,520 | u573738515 | cpp |
p03161 | /*
ID: mckibbe1
TASK: money
LANG: C++11
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int dp[100111], a[100111];
int main() {
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie();
int N, K;
cin >> ... | /*
ID: mckibbe1
TASK: money
LANG: C++11
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int dp[100111], a[100111];
int main() {
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie();
int N, K;
cin >> ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 962,525 | 962,526 | u895243133 | cpp |
p03161 | /*
ID: mckibbe1
TASK: money
LANG: C++11
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int dp[100111], a[100111];
int main() {
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie();
int N, K;
cin >> ... | /*
ID: mckibbe1
TASK: money
LANG: C++11
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int dp[100111], a[100111];
int main() {
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie();
int N, K;
cin >> ... | [
"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",
"assignment.variable.change",
"identifier.change",
... | 962,527 | 962,526 | u895243133 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3];
int x = n;
while (n--)
cin >> arr[n - x - 1][0] >> arr[n - x - 1][1] >> arr[n - x - 1][2];
int dp[n][3];
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3];
int x = n;
while (x--)
cin >> arr[n - x - 1][0] >> arr[n - x - 1][1] >> arr[n - x - 1][2];
int dp[n][3];
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 962,532 | 962,533 | u936953256 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define kk
#define FOR(i, n) for (int i = 1; i <= n; i++)
#define ff first
#define ss second
#define ll int
#define inf 1000000000
typedef pair<int, int> pi;
int dp[100001][3];
void solve() {
int n;
cin >> n;
int a, b, c;
cin >> a >> b >> c;
dp[1][0] = a, dp[... | #include <bits/stdc++.h>
using namespace std;
//#define kk
#define FOR(i, n) for (int i = 1; i <= n; i++)
#define ff first
#define ss second
#define ll int
#define inf 1000000000
typedef pair<int, int> pi;
int dp[100001][3];
void solve() {
int n;
cin >> n;
int a, b, c;
cin >> a >> b >> c;
dp[1][0] = a, d... | [] | 962,537 | 962,538 | u842610029 | cpp |
p03162 | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*
1) long long vs int overflow
2) read question carefully
*/
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#d... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*
1) long long vs int overflow
2) read question carefully
*/
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#d... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"io.output.change"
] | 962,541 | 962,542 | u448290027 | cpp |
p03162 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> as(n, 0), bs(n, 0), cs(n, 0);
for (int i = 0; i < n; i++) {
cin >> as[i];
cin >> bs[i];
cin >> cs[i];
}
vector<vector<int>> dp(n, vector<int>(3, 0));
dp[0][0] = as[0];
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> as(n, 0), bs(n, 0), cs(n, 0);
for (int i = 0; i < n; i++) {
cin >> as[i];
cin >> bs[i];
cin >> cs[i];
}
vector<vector<int>> dp(n, vector<int>(3, 0));
dp[0][0] = as[0];
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,551 | 962,552 | u067151927 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,559 | 962,558 | u767554325 | cpp |
p03162 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
cin >> n;
int a = 0, b = 0, c = 0;
for (int i = 0; i < n; i++) {
int p, q, r; // p is max happiness acheived if i do a today
int t1, t2, t3;
cin >> t1 >> t2 >> t3;
p = max(b, c) + t1;
q = max(a, c) +... |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
cin >> n;
int a = 0, b = 0, c = 0;
for (int i = 0; i < n; i++) {
int p, q, r; // p is max happiness acheived if i do a today
int t1, t2, t3;
cin >> t1 >> t2 >> t3;
p = max(b, c) + t1;
q = max(a, c) +... | [
"call.add",
"call.arguments.change"
] | 962,581 | 962,582 | u468529789 | cpp |
p03162 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a ... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 962,583 | 962,584 | u242717212 | cpp |
p03162 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#de... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#de... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 962,589 | 962,590 | u751311751 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a[100009][3], dp[100009][3];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (ll i = 0; i < n; i++)
cin >> a[i][0] >> a[i][1] >> a[i][2];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a[100009][3], dp[100009][3];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (ll i = 0; i < n; i++)
cin >> a[i][0] >> a[i][1] >> a[i][2];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,591 | 962,592 | u731311090 | cpp |
p03162 | // if Ans is to like maximize or minimize after a particular day without having
// to take any consecutive same element O(N * choices^2)
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); ... | // if Ans is to like maximize or minimize after a particular day without having
// to take any consecutive same element O(N * choices^2)
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); ... | [
"expression.unary.arithmetic.add"
] | 962,599 | 962,600 | u954133007 | cpp |
p03162 | // https://atcoder.jp/contests/dp/tasks/dp_c
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define f(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i > b; i--)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#defin... | // https://atcoder.jp/contests/dp/tasks/dp_c
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define f(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i > b; i--)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#defin... | [
"call.arguments.add",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,601 | 962,602 | u434035301 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> dp(n, vector<int>(3));
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
dp[0][0] = a[0];
dp[0][1] = a[1];
dp[0][2] = a[2];
for (int i = 0; i < n; i++) {
cin >> a[0] >> a[1] >> a[2];
for (int j = 0; j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> dp(n, vector<int>(3, 0));
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
dp[0][0] = a[0];
dp[0][1] = a[1];
dp[0][2] = a[2];
for (int i = 1; i < n; i++) {
cin >> a[0] >> a[1] >> a[2];
for (int j = 0... | [
"call.arguments.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 962,605 | 962,606 | u204158532 | cpp |
p03162 | #include <stdio.h>
long long int arr[100005][3];
long long int dp[1000005][3];
long long int n;
long long int max(long long int a, long long int b) {
if (a >= b)
return a;
else {
return b;
}
}
long long int happy(long long int n) {
for (long long int i = n - 1; i >= 0; i--) {
for (long long int j = ... | #include <stdio.h>
long long int arr[100005][3];
long long int dp[1000005][3];
long long int n;
long long int max(long long int a, long long int b) {
if (a >= b)
return a;
else {
return b;
}
}
long long int happy(long long int n) {
for (long long int i = n - 1; i >= 0; i--) {
for (long long int j = ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 962,609 | 962,610 | u320525899 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
ll dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
ll dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,615 | 962,616 | u659210268 | cpp |
p03162 | #include "bits/stdc++.h"
using namespace std;
#define Fast_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int l... | #include "bits/stdc++.h"
using namespace std;
#define Fast_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int l... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,617 | 962,618 | u961487195 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define Fast_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int32_t main... | #include <bits/stdc++.h>
using namespace std;
#define Fast_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int32_t main... | [] | 962,619 | 962,620 | u961487195 | cpp |
p03162 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b, c;
for (int i = 0; i < n; i++) {
int temp1, temp2, temp3;
cin >> temp1 >> temp2 >> temp3;
a.push_back(temp1);
b.push_back(temp2);
c.push_back(temp3);
}
vector<... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b, c;
for (int i = 0; i < n; i++) {
int temp1, temp2, temp3;
cin >> temp1 >> temp2 >> temp3;
a.push_back(temp1);
b.push_back(temp2);
c.push_back(temp3);
}
vector<... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,621 | 962,622 | u108976315 | cpp |
p03162 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b, c;
for (int i = 0; i < n; i++) {
int temp1, temp2, temp3;
cin >> temp1 >> temp2 >> temp3;
a.push_back(temp1);
b.push_back(temp2);
c.push_back(temp3);
}
vector<... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b, c;
for (int i = 0; i < n; i++) {
int temp1, temp2, temp3;
cin >> temp1 >> temp2 >> temp3;
a.push_back(temp1);
b.push_back(temp2);
c.push_back(temp3);
}
vector<... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,623 | 962,622 | u108976315 | cpp |
p03162 | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, rb_... | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, rb_... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 962,630 | 962,631 | u364129544 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> dp(n);
for (int days = 0; days < n; ++days) {
vector<int> c(3);
vector<int> new_dp(n, 0);
for (int i = 0; i < 3; ++i) {
cin >> c[i];
}
... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> dp(3);
for (int days = 0; days < n; ++days) {
vector<int> c(3);
vector<int> new_dp(3, 0);
for (int i = 0; i < 3; ++i) {
cin >> c[i];
}
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 962,632 | 962,633 | u470383136 | cpp |
p03162 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int vac[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> vac[i][j];
}
}
int dp[n][3];
dp[0][0] = vac[0][0];
dp[0][1] = vac[0][1];
dp[0][2] = vac[0][2];
for (int i = 1; i... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int vac[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> vac[i][j];
}
}
int dp[n][3];
dp[0][0] = vac[0][0];
dp[0][1] = vac[0][1];
dp[0][2] = vac[0][2];
for (int i = 1; i... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,639 | 962,640 | u666207305 | cpp |
p03162 | // Created by Krishna Ashok
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cout << #x << "=" << x << '\n'
#define ll long long
#define pr pair<int, int>
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#pragma GCC optimization(... | // Created by Krishna Ashok
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cout << #x << "=" << x << '\n'
#define ll long long
#define pr pair<int, int>
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#pragma GCC optimization(... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,641 | 962,642 | u701311264 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<vector<long long int>> v(n);
vector<long long int> at(n);
vector<long long int> bt(n);
vector<long long int> ct(n);
for (long long int i = 0; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<vector<long long int>> v(n);
vector<long long int> at(n);
vector<long long int> bt(n);
vector<long long int> ct(n);
for (long long int i = 0; ... | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.add"
] | 962,643 | 962,644 | u583063982 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define f first
#define se second
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sor... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define f first
#define se second
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sor... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,645 | 962,646 | u051484887 | cpp |
p03162 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
int n;
cin >> n;
vector<vector<int>> h(n, vector<int>(3));
rep(i, n) {
rep(j, 3) { cin >> h.at(i).at(j); }
}
vector<vector<int>> dp(n, vector<int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
int n;
cin >> n;
vector<vector<int>> h(n, vector<int>(3));
rep(i, n) {
rep(j, 3) { cin >> h.at(i).at(j); }
}
vector<vector<int>> dp(n, vector<int... | [] | 962,649 | 962,650 | u886613668 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1e9 + 5
using namespace std;
int solve() {
int n;
cin >> n;
vector<int> dp(3);
for (int day = 0; day < n; day++) {
vector<int> new_dp(3);
vector<int> a(3);
for (int i = 0; i < 3; i++)... | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1e9 + 5
using namespace std;
int solve() {
int n;
cin >> n;
vector<int> dp(3);
for (int day = 0; day < n; day++) {
vector<int> new_dp(3);
vector<int> a(3);
for (int i = 0; i < 3; i++)... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,651 | 962,652 | u237185366 | cpp |
p03162 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | [
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 962,660 | 962,661 | u714724786 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,662 | 962,663 | u041396154 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | [
"variable_declaration.remove"
] | 962,664 | 962,665 | u041396154 | cpp |
p03162 | /*
███╗ ███╗ █████╗ ███████╗███╗ ███╗ ██████╗ ██╗
██╗██████╗ ███████╗ █████╗ ███╗ ███╗██████╗ ██╗ ██╗ ████╗
████║██╔══██╗╚════██║████╗ ████║██╔═══██╗██║ ██║██╔══██╗╚════██║██╔══██╗████╗
████║██╔══██╗╚██╗ ██╔╝ ██╔████╔██║███████║ ██╔╝██╔████╔██║██║ ██║██║
██║██║ ██║ █... | /*
███╗ ███╗ █████╗ ███████╗███╗ ███╗ ██████╗ ██╗
██╗██████╗ ███████╗ █████╗ ███╗ ███╗██████╗ ██╗ ██╗ ████╗
████║██╔══██╗╚════██║████╗ ████║██╔═══██╗██║ ██║██╔══██╗╚════██║██╔══██╗████╗
████║██╔══██╗╚██╗ ██╔╝ ██╔████╔██║███████║ ██╔╝██╔████╔██║██║ ██║██║
██║██║ ██║ █... | [] | 962,670 | 962,671 | u801961010 | cpp |
p03162 | #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>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int h[10010][3], dp[100100][3];
int main() {
int n;
cin ... | #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>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int h[100100][3], dp[100100][3];
int main() {
int n;
cin... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 962,677 | 962,676 | u420190011 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size - 1; i++) {
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size; i++) {
for (int j =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,678 | 962,679 | u223168630 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size - 1; i++) {
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size; i++) {
for (int j =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operation.unary.add"
] | 962,680 | 962,679 | u223168630 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size - 1; i++) {
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size; i++) {
for (int j =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operation.unary.add",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 962,681 | 962,679 | u223168630 | cpp |
p03162 | // https: //atcoder.jp/contests/dp/tasks/dp_c
#include <iostream>
#include <tuple>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::tuple<int, int, int>> days(n + 1);
for (int i = 1; i <= n; ++i) {
int a, b, c;
std::cin >> a >> b >> c;
days[i] = std::make_tuple(a, b, c);
}
... | // https: //atcoder.jp/contests/dp/tasks/dp_c
#include <iostream>
#include <tuple>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::tuple<int, int, int>> days(n + 1);
for (int i = 1; i <= n; ++i) {
int a, b, c;
std::cin >> a >> b >> c;
days[i] = std::make_tuple(a, b, c);
}
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,682 | 962,683 | u001468394 | cpp |
p03162 | #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 mii map<int, int>
#define pqb priority_queue<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 mii map<int, int>
#define pqb priority_queue<in... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 962,686 | 962,687 | u980593902 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.