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 |
|---|---|---|---|---|---|---|---|
p03162 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 963,624 | 963,625 | u195054737 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"variable_declaration.value.change"
] | 963,626 | 963,627 | u195054737 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"variable_declaration.value.change"
] | 963,628 | 963,627 | u195054737 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF (1LL << 60)
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF (1LL << 60)
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#de... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 963,629 | 963,630 | u768347697 | cpp |
p03162 | #include <cmath>
#include <iostream>
#include <string>
typedef long long lint;
using namespace std;
// dpテンプレ
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;... | #include <cmath>
#include <iostream>
#include <string>
typedef long long lint;
using namespace std;
// dpテンプレ
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;... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,640 | 963,641 | u664272778 | cpp |
p03162 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#d... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#d... | [
"assignment.change"
] | 963,644 | 963,645 | u516525290 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++)
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
long long dp[n][3];
memset(dp, 0, sizeof(dp));
dp[0][0] = arr[0][0], dp[0][1] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++)
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
int dp[n][3];
memset(dp, 0, sizeof(dp));
dp[0][0] = arr[0][0], dp[0][1] = arr[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,646 | 963,647 | u616030860 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++)
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
int dp[n][3];
memset(dp, 0, sizeof(dp));
dp[0][0] = arr[0][0], dp[0][1] = arr[... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++)
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
int dp[n][3];
memset(dp, 0, sizeof(dp));
dp[0][0] = arr[0][0], dp[0][1] = arr[... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,648 | 963,647 | u616030860 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++)
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
long long dp[n][3];
memset(dp, 0, sizeof(dp));
dp[0][0] = arr[0][0], dp[0][1] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++)
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
long long dp[n][3];
memset(dp, 0, sizeof(dp));
dp[0][0] = arr[0][0], dp[0][1] ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 963,646 | 963,649 | u616030860 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++)
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
int dp[n][3];
memset(dp, 0, sizeof(dp));
dp[0][0] = arr[0][0], dp[0][1] = arr[... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < n; i++)
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
long long dp[n][3];
memset(dp, 0, sizeof(dp));
dp[0][0] = arr[0][0], dp[0][1] ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,648 | 963,649 | u616030860 | cpp |
p03162 | #include <iostream>
using namespace std;
int main() {
int days;
cin >> days;
int happy[days][3];
for (int i = 0; i < days; ++i) {
cin >> happy[i][0] >> happy[i][1] >> happy[i][2];
}
int a1, a2, a3;
int temp1, temp2, temp3;
a1 = happy[0][0];
a2 = happy[0][1];
a3 = happy[0][2];
for (int i = 1; i... | #include <iostream>
using namespace std;
int main() {
int days;
cin >> days;
int happy[days][3];
for (int i = 0; i < days; ++i) {
cin >> happy[i][0] >> happy[i][1] >> happy[i][2];
}
int a1, a2, a3;
int temp1, temp2, temp3;
a1 = happy[0][0];
a2 = happy[0][1];
a3 = happy[0][2];
for (int i = 1; i... | [
"assignment.variable.change",
"identifier.change"
] | 963,653 | 963,654 | u840752761 | cpp |
p03162 | /*
ID: Barry Wang
LANG: C++11
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
/*---define tricks---*/
#define ALL(v) v.begin(), v.end()
#define UN(v) sort(ALL(v)), v.erase(unique(ALL(v)), v.end())
#define FILL(x, y) memset(x, y, sizeof(x))
#define EACH(v, it) ... | /*
ID: Barry Wang
LANG: C++11
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
/*---define tricks---*/
#define ALL(v) v.begin(), v.end()
#define UN(v) sort(ALL(v)), v.erase(unique(ALL(v)), v.end())
#define FILL(x, y) memset(x, y, sizeof(x))
#define EACH(v, it) ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 963,669 | 963,670 | u734192058 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int N;
cin >> N;
vector<int> a(N), b(N), c(N);
int dp[N + 100][3] = {};
rep(i, N) cin >> a.at(i) >> b.at(i) >> c.at(i);
dp[0][0] = a.at(0);
dp[0][1] = b.at(0);
dp[0][2] = c.at(0);
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int N;
cin >> N;
vector<int> a(N), b(N), c(N);
int dp[N + 100][3] = {};
rep(i, N) cin >> a.at(i) >> b.at(i) >> c.at(i);
dp[0][0] = a.at(0);
dp[0][1] = b.at(0);
dp[0][2] = c.at(0);
for (int ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,676 | 963,677 | u741815956 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int N;
cin >> N;
vector<int> a(N), b(N), c(N);
int dp[N + 100][3] = {};
rep(i, N) cin >> a.at(i) >> b.at(i) >> c.at(i);
dp[0][0] = a.at(0);
dp[0][1] = b.at(0);
dp[0][2] = c.at(0);
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int N;
cin >> N;
vector<int> a(N), b(N), c(N);
int dp[N + 100][3] = {};
rep(i, N) cin >> a.at(i) >> b.at(i) >> c.at(i);
dp[0][0] = a.at(0);
dp[0][1] = b.at(0);
dp[0][2] = c.at(0);
for (int ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 963,678 | 963,677 | u741815956 | cpp |
p03162 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int maxn = 1e4;
int a[maxn][maxn];
int dp[maxn][maxn];
int main() {
int n;
cin >> n;
dp[0][0] = 0;
dp[0][1] = 0;
dp[0][2] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i - 1][j];
}
dp[i][... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int maxn = 1e5;
int a[maxn][3];
int dp[maxn][3];
int main() {
int n;
cin >> n;
dp[0][0] = 0;
dp[0][1] = 0;
dp[0][2] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i - 1][j];
}
dp[i][0] = a... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 963,695 | 963,696 | u047353219 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define p... | [] | 963,701 | 963,702 | u779159351 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(3, 0);
for (int day = 0; day < n; day++) {
vector<int> c(3, 0);
vector<int> new_dp(3, 0);
for (int i = 0; i < 3; i++) {
cin >> c[i];
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < n;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(3, 0);
for (int day = 0; day < n; day++) {
vector<int> c(3, 0);
vector<int> new_dp(3, 0);
for (int i = 0; i < 3; i++) {
cin >> c[i];
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3;... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,703 | 963,704 | u366686355 | cpp |
p03162 | #include <bits/stdc++.h>
#define fff(i, a, b) for (int(i) = (a); (i) <= (b); i++)
#define pb push_back
#define len(a) (a).length()
#define all(a) (a).begin(), (a).end()
#define sz(a) (a).size()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef unsi... | #include <bits/stdc++.h>
#define fff(i, a, b) for (int(i) = (a); (i) <= (b); i++)
#define pb push_back
#define len(a) (a).length()
#define all(a) (a).begin(), (a).end()
#define sz(a) (a).size()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef unsi... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,711 | 963,712 | u504771112 | cpp |
p03162 | #include <bits/stdc++.h>
#define int long long
#define fi first
#define sc second
#define pii pair<int, int>
#define vi vector<int>
#define msi map<string, int>
#define si set<int>
#define all(v) v.begin(), v.end()
#define sz(v) int((v).size())
#define rep(i, a, b) for (int i = a; i < b; i++)
#define dep(i, a, b) for (... | #include <bits/stdc++.h>
#define int long long
#define fi first
#define sc second
#define pii pair<int, int>
#define vi vector<int>
#define msi map<string, int>
#define si set<int>
#define all(v) v.begin(), v.end()
#define sz(v) int((v).size())
#define rep(i, a, b) for (int i = a; i < b; i++)
#define dep(i, a, b) for (... | [] | 963,723 | 963,724 | u429144503 | cpp |
p03162 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,725 | 963,726 | u288087195 | cpp |
p03162 | #include <bits/stdc++.h>
#include <fstream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(3);
for (int d = 0; d < n; d++) {
vector<int> chk(3, 0);
int vals[3];
for (int j = 0; j < 3; j++)
cin >> vals[j];
for (int i = 0; i < 3; i++) {
for (int j ... | #include <bits/stdc++.h>
#include <fstream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(3);
for (int d = 0; d < n; d++) {
vector<int> chk(3, 0);
int vals[3];
for (int j = 0; j < 3; j++)
cin >> vals[j];
for (int i = 0; i < 3; i++) {
for (int j ... | [
"assignment.add"
] | 963,735 | 963,736 | u711686772 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX / 2;
int main() {
int N;
cin >> N;
vector<vector<int>> dp(N + 1, {-INF, -INF, -INF});
for (int &i : dp[0])
i = 0;
for (int i = 1; i < N + 1; i++) {
int a[3];
cin >> a[0] >> a[1] >> a[2];
dp[i][0] = max(dp[i - 1][1] + a[1],... | #include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX / 2;
int main() {
int N;
cin >> N;
vector<vector<int>> dp(N + 1, {-INF, -INF, -INF});
for (int &i : dp[0])
i = 0;
for (int i = 1; i < N + 1; i++) {
int a[3];
cin >> a[0] >> a[1] >> a[2];
dp[i][0] = max(dp[i - 1][1] + a[1],... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,737 | 963,738 | u777258731 | cpp |
p03161 | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define LEFT(a) ((a) << 1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a, b) ((a + b) >> 1)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
using namespace std;
c... | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define LEFT(a) ((a) << 1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a, b) ((a + b) >> 1)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
using namespace std;
c... | [
"control_flow.loop.for.condition.change"
] | 963,743 | 963,744 | u704324882 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, dp[100005], a[100005], k;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = i - k; j < i;... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, dp[100005], a[100005], k;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = max(1, i - k)... | [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.change"
] | 963,748 | 963,749 | u600091451 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 100002;
int n, k, h[maxn], f[maxn];
int main() {
ios_base::sync_... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 100002;
int n, k, h[maxn], f[maxn];
int main() {
ios_base::sync_... | [
"control_flow.loop.for.condition.change"
] | 963,750 | 963,751 | u499373855 | cpp |
p03162 | #define _CRT_SECURE_NO_WARINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef int... | #define _CRT_SECURE_NO_WARINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef int... | [
"control_flow.branch.if.condition.change"
] | 963,754 | 963,755 | u816631826 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 123;
int dp[mx][4], n;
int a[mx][4];
int solve(int i, int f1) {
if (i > n)
return 0;
if (dp[i][f1] != -1)
return dp[i][f1];
int ret = 0;
for (int j = 1; j <= n; j++) {
if (j != f1) {
ret = max(ret, a[i][j] + solve(i + 1, j))... | #include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 123;
int dp[mx][4], n;
int a[mx][4];
int solve(int i, int f1) {
if (i > n)
return 0;
if (dp[i][f1] != -1)
return dp[i][f1];
int ret = 0;
for (int j = 1; j <= 3; j++) {
if (j != f1) {
ret = max(ret, a[i][j] + solve(i + 1, j))... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,771 | 963,772 | u724640452 | cpp |
p03162 | // Alisher_2211
#include <bits/stdc++.h>
#define long long long
#define all(vc) vc.begin(), vc.end()
#define allr(vc) vc.rbegin(), vc.rend()
#define pb push_back
#define fi first
#define se second
#define pi pair<long, long>
#define lcm(a, b) (a * b) / __gcd(a, b)
using namespace std;
co... | // Alisher_2211
#include <bits/stdc++.h>
#define long long long
#define all(vc) vc.begin(), vc.end()
#define allr(vc) vc.rbegin(), vc.rend()
#define pb push_back
#define fi first
#define se second
#define pi pair<long, long>
#define lcm(a, b) (a * b) / __gcd(a, b)
using namespace std;
co... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,773 | 963,774 | u863370423 | cpp |
p03162 | // Alisher_2211
#include <bits/stdc++.h>
#define long long long
#define all(vc) vc.begin(), vc.end()
#define allr(vc) vc.rbegin(), vc.rend()
#define pb push_back
#define fi first
#define se second
#define pi pair<long, long>
#define lcm(a, b) (a * b) / __gcd(a, b)
using namespace std;
co... | // Alisher_2211
#include <bits/stdc++.h>
#define long long long
#define all(vc) vc.begin(), vc.end()
#define allr(vc) vc.rbegin(), vc.rend()
#define pb push_back
#define fi first
#define se second
#define pi pair<long, long>
#define lcm(a, b) (a * b) / __gcd(a, b)
using namespace std;
co... | [
"assignment.change"
] | 963,775 | 963,774 | u863370423 | cpp |
p03162 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define stop(x) \
{ \
cout << x << endl; ... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define stop(x) \
{ \
cout << x << endl; ... | [
"variable_declaration.type.change",
"call.remove",
"literal.number.change",
"io.output.change"
] | 963,780 | 963,779 | u018679195 | cpp |
p03162 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define erep(i, n) for (ll i = 1; i <= (n); i++)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
// input
ll h[100010][3];
// dp table
ll dp[100010][3];
int... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define erep(i, n) for (ll i = 1; i <= (n); i++)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
// input
ll h[100010][3];
// dp table
ll dp[100010][3];
int... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 963,785 | 963,786 | u732854336 | cpp |
p03162 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"literal.number.change",
"expression.operation.binary.change"
] | 963,789 | 963,790 | u884476319 | cpp |
p03162 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"literal.number.change",
"expression.operation.binary.change"
] | 963,791 | 963,790 | u884476319 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> a(3);
cin >> n;
int dp[3][n];
int ans = 0;
for (int i{}; i < 3; i++) {
cin >> a[i];
dp[i][0] = a[i];
ans = max(ans, a[i]);
}
if (n == 1) {
cout << ans << endl;
return 0;
}
n--;
for (int i{1}; i < n; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> a(3);
cin >> n;
int dp[3][n];
int ans = 0;
for (int i{}; i < 3; i++) {
cin >> a[i];
dp[i][0] = a[i];
ans = max(ans, a[i]);
}
if (n == 1) {
cout << ans << endl;
return 0;
}
// n--;
for (int i{1}; i < n... | [
"expression.unary.arithmetic.remove"
] | 963,795 | 963,796 | u752124256 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
struct iofix {
ios_base::Init i;
iofix() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.sync_with_stdio(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
}
} iofix;
void solve() {
int N;
cin >> N;
vector<int64_t> dp(3, 0);
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
struct iofix {
ios_base::Init i;
iofix() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.sync_with_stdio(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
}
} iofix;
void solve() {
int N;
cin >> N;
vector<int64_t> dp(3, 0);
for (int i = 0... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,801 | 963,802 | u649291993 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
struct iofix {
ios_base::Init i;
iofix() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.sync_with_stdio(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
}
} iofix;
void solve() {
int N;
cin >> N;
vector<int64_t> dp(3);
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
struct iofix {
ios_base::Init i;
iofix() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.sync_with_stdio(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
}
} iofix;
void solve() {
int N;
cin >> N;
vector<int64_t> dp(3, 0);
for (int i = 0... | [
"call.arguments.add",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,803 | 963,802 | u649291993 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N;
cin >> N;
ll a[110000][3];
ll dp[110000][3];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N;
cin >> N;
ll a[110000][3];
ll dp[110000][3];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
f... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,806 | 963,807 | u883680855 | cpp |
p03162 | #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 l... | #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 l... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,814 | 963,815 | u625417564 | cpp |
p03162 | #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 l... | #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 l... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 963,816 | 963,815 | u625417564 | cpp |
p03162 | #include <iostream>
#define N 3
#define loop(i, n) for (int i = 0; i < n; i++)
using namespace std;
int a[100002][N];
int dp[100002][N + 1];
int n;
int min_cost(int n, int c) {
if (n == 0)
return 0;
if (dp[n][c] != -1)
return dp[n][c];
int ans = 0;
for (int i = 0; i <= 2; i++)
if (c == 3)
ans... | #include <iostream>
#define N 3
#define loop(i, n) for (int i = 0; i < n; i++)
using namespace std;
int a[100002][N];
int dp[100002][N + 1];
int n;
int min_cost(int n, int c) {
if (n == 0)
return 0;
if (dp[n][c] != -1)
return dp[n][c];
int ans = 0;
for (int i = 0; i <= 2; i++)
if (c == 3)
ans... | [
"expression.operation.binary.add"
] | 963,823 | 963,824 | u775778491 | cpp |
p03162 | #include <bits/stdc++.h>
#include <cctype>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define PRY cout << "YES\n"
#define PRN cout << "NO\n"
#define SETP(sp) fixed << setprecision(sp)
#define PB push_back
#define GO ... | #include <bits/stdc++.h>
#include <cctype>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define PRY cout << "YES\n"
#define PRN cout << "NO\n"
#define SETP(sp) fixed << setprecision(sp)
#define PB push_back
#define GO ... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 963,825 | 963,826 | u232917796 | cpp |
p03162 | // This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int n;
int aa, bb, cc;
cin >> n;
int a[n + 1], b[n + 1], c[n + 1];
a[0] = 0;
b[0] = 0;
c[0] = 0;
for ... | // This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int n;
int aa, bb, cc;
cin >> n;
int a[n + 1], b[n + 1], c[n + 1];
a[0] = 0;
b[0] = 0;
c[0] = 0;
for ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 963,835 | 963,836 | u693716675 | cpp |
p03162 | //~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") ~ #pragma
//GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/as... | //~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") ~ #pragma
//GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/as... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 963,839 | 963,840 | u093929604 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if... | [
"assignment.change"
] | 963,846 | 963,847 | u270178188 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n + 1], b[n + 1], c[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
long long int dp[n][4];
dp[1][1] = a[1];
dp[1][2] = b[1];
dp[1][3] = c[1];
for (int i = 2; i <= n; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n + 1], b[n + 1], c[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
long long int dp[n + 1][4];
dp[1][1] = a[1];
dp[1][2] = b[1];
dp[1][3] = c[1];
for (int i = 2; i <= n; ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,848 | 963,849 | u040130608 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> a[i][j];
int dp[n][3];
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
dp[i][j] = 0;
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> a[i][j];
int dp[n][3];
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
dp[i][j] = 0;
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 963,850 | 963,851 | u538921852 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pll pair<long long, long long>
#define pdd pair<long double, long double>
#define mp make_pair
#define pb push_back
priority_queue<pll, vector<pll>, greater<pll>> pq;
#define ll long long
int main() {
int n;
cin >> n;
vector<ll> a(n + ... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pll pair<long long, long long>
#define pdd pair<long double, long double>
#define mp make_pair
#define pb push_back
priority_queue<pll, vector<pll>, greater<pll>> pq;
#define ll long long
int main() {
int n;
cin >> n;
vector<ll> a(n + ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 963,874 | 963,875 | u029479695 | cpp |
p03162 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void file() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#end... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void file() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#end... | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 963,876 | 963,877 | u132754310 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n], b[n], c[n];
int dp[3][n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
dp[0][0] = a[0];
dp[1][0] = b[0]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n], b[n], c[n];
int dp[3][n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
dp[0][0] = a[0];
dp[1][0] = b[0]... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 963,880 | 963,881 | u222329105 | cpp |
p03162 | #include <algorithm>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <math.h>
#include <memory>
#include <numeric>
#include <... | #include <algorithm>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <math.h>
#include <memory>
#include <numeric>
#include <... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,888 | 963,889 | u533400718 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int N;
cin >> N;
vector<int> dp(3);
for (int day = 0; day < N; day++) {
vector<int> new_dp(3, 0);
vector<int> c(3);
for (int i = 0; i < 3; i++) {
cin >> i;
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) ... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int N;
cin >> N;
vector<int> dp(3);
for (int day = 0; day < N; day++) {
vector<int> new_dp(3, 0);
vector<int> c(3);
for (int i = 0; i < 3; i++) {
cin >> c[i];
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j+... | [] | 963,890 | 963,891 | u440619190 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define llt long long int
#define pb push_back
void fun(int n, llt dp[][3], int a[], int b[], int c[]) {
if (n == 0) {
dp[n][0] = a[0];
dp[n][1] = b[0];
dp[n][2] = c[0];
} else {
fun(n - 1, dp, a, b, c);
dp[n][0] = max(dp[n - 1][1] + a[n], dp[n - 1][... | #include <bits/stdc++.h>
using namespace std;
#define llt long long int
#define pb push_back
void fun(int n, llt dp[][3], int a[], int b[], int c[]) {
if (n == 0) {
dp[n][0] = a[0];
dp[n][1] = b[0];
dp[n][2] = c[0];
} else {
fun(n - 1, dp, a, b, c);
dp[n][0] = max(dp[n - 1][1] + a[n], dp[n - 1][... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 963,894 | 963,895 | u356063349 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define llt long long int
#define pb push_back
void fun(int n, int dp[][3], int a[], int b[], int c[]) {
if (n == 0) {
dp[n][0] = a[0];
dp[n][1] = b[0];
dp[n][2] = c[0];
} else {
fun(n - 1, dp, a, b, c);
dp[n][0] = max(dp[n - 1][1] + a[n], dp[n - 1][... | #include <bits/stdc++.h>
using namespace std;
#define llt long long int
#define pb push_back
void fun(int n, llt dp[][3], int a[], int b[], int c[]) {
if (n == 0) {
dp[n][0] = a[0];
dp[n][1] = b[0];
dp[n][2] = c[0];
} else {
fun(n - 1, dp, a, b, c);
dp[n][0] = max(dp[n - 1][1] + a[n], dp[n - 1][... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 963,896 | 963,895 | u356063349 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define llt long long int
#define pb push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a, b, c;
llt dp[3][2];
cin >> a >> b >> c;
n--;
dp[0][0] = a;
dp[1][0] = b;
dp[2][0] = c;
while (n--) ... | #include <bits/stdc++.h>
using namespace std;
#define llt long long int
#define pb push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a, b, c;
llt dp[3][2];
cin >> a >> b >> c;
n--;
dp[0][0] = a;
dp[1][0] = b;
dp[2][0] = c;
while (n--) ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,897 | 963,898 | u356063349 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a, b, c, dp[3], d, e, f;
cin >> a >> b >> c;
dp[0] = a;
dp[1] = b;
dp[2] = c;
for (int i = 1; i < n; i++) {
cin >> a >> b >> c;
d = (dp[1] > dp[2... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a, b, c, dp[3], d, e, f;
cin >> a >> b >> c;
dp[0] = a;
dp[1] = b;
dp[2] = c;
for (int i = 1; i < n; i++) {
cin >> a >> b >> c;
d = (dp[1] > dp[2... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 963,899 | 963,900 | u356063349 | cpp |
p03162 | #include <iostream>
using namespace std;
int main() {
long long int i, n;
cin >> n;
long long int a[n + 10], b[n + 10], c[n + 10], A[n + 10], B[n + 10],
C[n + 10];
for (i = 1; i <= n; i++)
cin >> a[i] >> b[i] >> c[i];
for (i = 1; i <= n; i++) {
A[i] = 0;
B[i] = 0;
C[i] = 0;
}
A[1] = ... | #include <iostream>
using namespace std;
int main() {
long long int i, n, s = 0;
cin >> n;
long long int a[n + 10], b[n + 10], c[n + 10], A[n + 10], B[n + 10],
C[n + 10];
for (i = 1; i <= n; i++)
cin >> a[i] >> b[i] >> c[i];
for (i = 1; i <= n; i++) {
A[i] = 0;
B[i] = 0;
C[i] = 0;
}
... | [
"variable_declaration.add",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 963,909 | 963,910 | u985186777 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(3, 0));
vector<vector<int>> dp(n, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
dp[0][0] = a[0][0];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(3, 0));
vector<vector<int>> dp(n, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
dp[0][0] = a[0][0];
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,915 | 963,916 | u824642100 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(3, 0));
vector<vector<int>> dp(n, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
dp[0][0] = a[0][0];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(3, 0));
vector<vector<int>> dp(n, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
dp[0][0] = a[0][0];
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 963,917 | 963,916 | u824642100 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
typedef long long ll;
typedef vector<long long> vl;
const ll INF = 100000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
typedef long long ll;
typedef vector<long long> vl;
const ll INF = 100000... | [
"expression.operation.binary.remove"
] | 963,918 | 963,919 | u583628727 | cpp |
p03162 | #include <iostream>
int abs(int a) { return (a > 0) ? a : -a; }
int main() {
int n;
std::cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
std::cin >> a[i] >> b[i] >> c[i];
int dpa[n], dpb[n], dpc[n];
dpa[0] = a[0];
dpb[0] = b[0];
dpc[0] = c[0];
for (int i = 1; i < n; i++) {
dp... | #include <iostream>
int abs(int a) { return (a > 0) ? a : -a; }
int main() {
int n;
std::cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
std::cin >> a[i] >> b[i] >> c[i];
int dpa[n], dpb[n], dpc[n];
dpa[0] = a[0];
dpb[0] = b[0];
dpc[0] = c[0];
for (int i = 1; i < n; i++) {
dp... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,920 | 963,921 | u387880194 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<long long>> dp(n, vector<long long>(3, -1));
vector<vector<int>> h(n, vector<int>(3));
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> h[i][j];
for (int i = 1; i < n; i++) {
h[i][0] = h[i][... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<long long>> dp(n, vector<long long>(3, -1));
vector<vector<int>> h(n, vector<int>(3));
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> h[i][j];
for (int i = 1; i < n; i++) {
h[i][0] = h[i][... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,924 | 963,925 | u456910634 | cpp |
p03162 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
vector<int> c(N);
vector<vector<int>> v(N, vector<i... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
vector<int> c(N);
vector<vector<int>> v(N, vector<i... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 963,926 | 963,927 | u340010271 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define fast \
{ \
ios ::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define fast \
{ \
ios ::sync_with_stdio(false); \
cin.tie(0); ... | [
"assignment.change"
] | 963,931 | 963,932 | u377859957 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define inf 0
using namespace std;
int main() {
// ll t; cin>> t; while(t--){
ll n, m = 3;
cin >> n;
ll a[n][m], dp[n][m];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < m; j++) {
cin >> a[i][j];
dp[i][j] = inf;
}
}
for (ll j = 0; j < m... | #include <bits/stdc++.h>
#define ll long long
#define inf 0
using namespace std;
int main() {
// ll t; cin>> t; while(t--){
ll n, m = 3;
cin >> n;
ll a[n][m], dp[n][m];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < m; j++) {
cin >> a[i][j];
dp[i][j] = inf;
}
}
for (ll j = 0; j < m... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 963,940 | 963,941 | u448570453 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define inf 1000000005
using namespace std;
int main() {
// ll t; cin>> t; while(t--){
ll n, m = 3;
cin >> n;
ll a[n][m], dp[n][m];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < m; j++) {
cin >> a[i][j];
dp[i][j] = inf;
}
}
for (ll j =... | #include <bits/stdc++.h>
#define ll long long
#define inf 0
using namespace std;
int main() {
// ll t; cin>> t; while(t--){
ll n, m = 3;
cin >> n;
ll a[n][m], dp[n][m];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < m; j++) {
cin >> a[i][j];
dp[i][j] = inf;
}
}
for (ll j = 0; j < m... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 963,942 | 963,941 | u448570453 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 963,943 | 963,944 | u471212175 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> par;
typedef vector<par> vpar;
#define forn(i, n) for (ll i = 0; i < n; i++)
#define wez(n) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> par;
typedef vector<par> vpar;
#define forn(i, n) for (ll i = 0; i < n; i++)
#define wez(n) ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,947 | 963,948 | u797339743 | cpp |
p03162 | #include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
const int N = 1e5... | #include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
const int N = 1e5... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,951 | 963,952 | u208483272 | cpp |
p03162 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
const ll mod = 1e9 + 7;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return o... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
const ll mod = 1e9 + 7;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return o... | [
"variable_declaration.remove",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 963,957 | 963,958 | u171804186 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n + 1, 0), b(n + 1, 0), h(n + 1, 0);
vector<vector<int>> p(n + 1, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
cin >> s[i] >> b[i] >> h[i];
}
for (int i = 1; i <= n; i++) {
p[i][0] = s[i] + max(p[i - 1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n + 1, 0), b(n + 1, 0), h(n + 1, 0);
vector<vector<int>> p(n + 1, vector<int>(3, 0));
for (int i = 1; i <= n; i++) {
cin >> s[i] >> b[i] >> h[i];
}
for (int i = 1; i <= n; i++) {
p[i][0] = s[i] + max(p[i - 1... | [
"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"
] | 963,963 | 963,964 | u000931732 | cpp |
p03162 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define sz(x) ll(x.size())
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ll n, ans = 0;
cin >> n;
vector<vector<ll>... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define sz(x) ll(x.size())
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ll n, ans = 0;
cin >> n;
vector<vector<ll>... | [
"expression.operation.binary.remove"
] | 963,967 | 963,968 | u059207724 | cpp |
p03162 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [
"expression.operation.binary.remove"
] | 963,969 | 963,970 | u135572611 | cpp |
p03162 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [] | 963,971 | 963,970 | u135572611 | cpp |
p03162 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
vector<int> dp(3, 0);
for (int i = 0; i < n; i++) {
vector<int> c(3);
vector<int> temp_dp(3, 0);
cin >> c[0] >> c[1] >> c[2];
for (int i = 0; i < 3; i++)... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
vector<int> dp(3);
for (int i = 0; i < n; i++) {
vector<int> c(3);
vector<int> temp_dp(3, 0);
cin >> c[0] >> c[1] >> c[2];
for (int i = 0; i < 3; i++) {
... | [
"call.arguments.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 963,977 | 963,978 | u819054341 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int... | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int... | [
"assignment.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,985 | 963,986 | u973991908 | cpp |
p03162 | // define debug for debugging
#define DEBUG
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define MAX 100000 + 100
#define max3(a, b, c) max(a, max(b, c))
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<... | // define debug for debugging
//#define DEBUG
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define MAX 100000 + 100
#define max3(a, b, c) max(a, max(b, c))
typedef long long int ll;
typedef pair<int, int> pii;
typedef pai... | [] | 963,987 | 963,988 | u067401008 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mx 100009
const ll inf = 1e18;
ll dp_array[mx][4];
ll a[mx], b[mx], c[mx], n;
ll dp(ll i, ll object) {
if (i >= n)
return 0L;
if (dp_array[i][object] != -1)
return dp_array[i][object];
ll value, value2;
if (object == 1) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mx 100009
const ll inf = 1e18;
ll dp_array[mx][4];
ll a[mx], b[mx], c[mx], n;
ll dp(ll i, ll object) {
if (i >= n)
return 0L;
if (dp_array[i][object] != -1)
return dp_array[i][object];
ll value, value2;
if (object == 1) {
... | [
"identifier.change",
"call.arguments.change"
] | 963,991 | 963,992 | u746954503 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mx 100009
const ll inf = 1e18;
ll dp_array[mx][4];
ll a[mx], b[mx], c[mx], n;
ll dp(ll i, ll object) {
if (i >= n)
return 0;
if (dp_array[i][object] != -1)
return dp_array[i][object];
ll value, value2;
if (object == 1) {
v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mx 100009
const ll inf = 1e18;
ll dp_array[mx][4];
ll a[mx], b[mx], c[mx], n;
ll dp(ll i, ll object) {
if (i >= n)
return 0L;
if (dp_array[i][object] != -1)
return dp_array[i][object];
ll value, value2;
if (object == 1) {
... | [
"literal.number.type.widen.change",
"identifier.change",
"call.arguments.change"
] | 963,993 | 963,992 | u746954503 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ll long long
int n;
int dp[3][100005];
int a[3][100005]; //,b[100005],c[100005];
int dpa(int last, int n) {
if (n < 0) {
return 0;
}
if (dp[last][n] != -1) {
return dp[last][n];
}
int lcmx = -999;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ll long long
int n;
int dp[3][100005];
int a[3][100005]; //,b[100005],c[100005];
int dpa(int last, int n) {
if (n < 0) {
return 0;
}
if (dp[last][n] != -1) {
return dp[last][n];
}
int lcmx = -999;
for (int i = 0;... | [
"call.arguments.change"
] | 963,996 | 963,997 | u258931378 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ll long long
int n;
int dp[3][100005];
int a[3][100005]; //,b[100005],c[100005];
int dpa(int last, int n) {
if (n < 0) {
return 0;
}
if (dp[last][n] != -1) {
return dp[last][n];
}
int lcmx = -999;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ll long long
int n;
int dp[3][100005];
int a[3][100005]; //,b[100005],c[100005];
int dpa(int last, int n) {
if (n < 0) {
return 0;
}
if (dp[last][n] != -1) {
return dp[last][n];
}
int lcmx = -999;
for (int i = 0;... | [
"call.arguments.change"
] | 963,998 | 963,997 | u258931378 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int dp[100001][3];
vector<int> a, b, c;
int n, x, y, z;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y >> z;
a.push_back(x);
b.push_back(y);
c.push_back(z);
}
memset(dp, 0, siz... | #include <bits/stdc++.h>
using namespace std;
int dp[100001][3];
vector<int> a, b, c;
int n, x, y, z;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y >> z;
a.push_back(x);
b.push_back(y);
c.push_back(z);
}
memset(dp, 0, siz... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 964,008 | 964,009 | u365058393 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int dp[100001][3];
vector<int> a, b, c;
int n, x, y, z;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y >> z;
a.push_back(x);
b.push_back(y);
c.push_back(z);
}
memset(dp, 0, siz... | #include <bits/stdc++.h>
using namespace std;
int dp[100001][3];
vector<int> a, b, c;
int n, x, y, z;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y >> z;
a.push_back(x);
b.push_back(y);
c.push_back(z);
}
memset(dp, 0, siz... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 964,010 | 964,009 | u365058393 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(3, 0);
for (int i = 0; i < n; i++) {
vector<int> c(3);
for (int j = 0; j < 3; j++)
cin >> c[i];
vector<int> new_dp(3, 0);
for (int x = 0; x < 3; x++) {
for (int y = 0; y < 3; y++) {
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(3, 0);
for (int i = 0; i < n; i++) {
vector<int> c(3);
for (int j = 0; j < 3; j++)
cin >> c[j];
vector<int> new_dp(3, 0);
for (int x = 0; x < 3; ++x) {
for (int y = 0; y < 3; ++y) {
if ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 964,018 | 964,019 | u435190720 | cpp |
p03162 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <vector>
#define INFTY 10000000000
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[110000][3];
long long dp[110000][3] = {0};
for (int i = 1; i <= n; i++) {
cin >> h[i][0] >> h[i][1] >... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <vector>
#define INFTY 10000000000
using namespace std;
int main() {
int n;
cin >> n;
int h[110000][3];
long long dp[110000][3] = {0};
for (int i = 1; i <= n; i++) {
cin >> h[i][0] >> h[i][1] >> h[i][2... | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 964,022 | 964,023 | u591914971 | cpp |
p03162 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arrA[n], arrB[n], arrC[n];
int dpA[n], dpB[n], dpC[n];
for (int i = 0; i < n; i++) {
cin >> arrA[i] >> arrB[i] >> arrC[i];
}
dpA[0] = arrA[0];
dpB[0] = arrB[0];
dpC[0] = arrC[0];
for (int i = 1; i < n; i++) {
dpA[i] ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arrA[n], arrB[n], arrC[n];
int dpA[n], dpB[n], dpC[n];
for (int i = 0; i < n; i++) {
cin >> arrA[i] >> arrB[i] >> arrC[i];
}
dpA[0] = arrA[0];
dpB[0] = arrB[0];
dpC[0] = arrC[0];
for (int i = 1; i < n; i++) {
dpA[i] ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 964,031 | 964,032 | u592913746 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod 1... | #include <bits/stdc++.h>
#define ll long long
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod 1... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,033 | 964,034 | u703899606 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod 1... | #include <bits/stdc++.h>
#define ll long long
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod 1... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,033 | 964,035 | u703899606 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(3)), dp(n + 1, vector<int>(3));
for (int i = 0; i < n; i++)
for (int j = 0; j < 2; j++)
cin >> a.at(i).at(j);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(3)), dp(n + 1, vector<int>(3));
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> a.at(i).at(j);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (i... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 964,036 | 964,037 | u697658632 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, j, k, h;
cin >> n;
vector<int> dp(3);
vector<int> c(3);
int i;
for (i = 0; i < n; i++) {
vector<int> new_dp(3, 0);
for (j = 0; j < 3; j++)
cin >> c[j];
for (k = 0; k < 3; k++)
for (h = 0; h < 3; h++)
if (h != k... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, j, k, h;
cin >> n;
vector<int> dp(3);
vector<int> c(3);
int i;
for (i = 0; i < n; i++) {
vector<int> new_dp(3, 0);
for (j = 0; j < 3; j++)
cin >> c[j];
for (k = 0; k < 3; k++)
for (h = 0; h < 3; h++)
if (h != k... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,040 | 964,041 | u420971902 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 100005;
int a[maxn], b[maxn], c[maxn], dp[maxn][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
dp[0][0] = a[1], dp[0][1] = b[1], dp[0][2] = c[1];
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 100005;
int a[maxn], b[maxn], c[maxn], dp[maxn][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
dp[0][0] = a[0], dp[0][1] = b[0], dp[0][2] = c[0];
for... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 964,052 | 964,053 | u943208163 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int N = 100000... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int N = 100000... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,054 | 964,055 | u605872309 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int N = 100000... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int N = 100000... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,056 | 964,055 | u605872309 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int N = 100005... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int N = 100000... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,057 | 964,055 | u605872309 | cpp |
p03162 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v, a, b) v.begin(a), v.end(b)
#define in cin >>
#define out cout <<
#define end << endl
#define INF 100000000000
int main() {
int N;
in N;
vector<vector<int>> abc(N, vector<int>(3));
rep(i, N) { in abc.at(i... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v, a, b) v.begin(a), v.end(b)
#define in cin >>
#define out cout <<
#define end << endl
#define INF 100000000000
int main() {
int N;
in N;
vector<vector<int>> abc(N, vector<int>(3));
rep(i, N) { in abc.at(i... | [
"expression.operation.binary.remove"
] | 964,058 | 964,059 | u550560757 | cpp |
p03162 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v, a, b) v.begin(a), v.end(b)
#define in cin >>
#define out cout <<
#define end << endl
#define INF 100000000000
int main() {
int N;
in N;
vector<vector<int>> abc(N, vector<int>(3));
rep(i, N) { in abc.at(i... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v, a, b) v.begin(a), v.end(b)
#define in cin >>
#define out cout <<
#define end << endl
#define INF 100000000000
int main() {
int N;
in N;
vector<vector<int>> abc(N, vector<int>(3));
rep(i, N) { in abc.at(i... | [
"expression.operation.binary.remove"
] | 964,060 | 964,059 | u550560757 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(3);
for (int i = 0; i < n; i++) {
vector<int> new_dp(3);
vector<int> c(3);
for (int i = 0; i < n; i++)
scanf("%d", &c[i]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(3);
for (int days = 0; days < n; days++) {
vector<int> new_dp(3);
vector<int> c(3);
for (int i = 0; i < 3; i++)
scanf("%d", &c[i]);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add"
] | 964,061 | 964,062 | u568117906 | cpp |
p03162 | #include <iostream>
using namespace std;
long long int l[100000][3];
int n;
int naj = -1;
long long int dp[100000][3];
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
l[i][0] = a;
l[i][1] = b;
l[i][0] = c;
}
dp[0][0] = l[0][0];
dp[0][1] = ... | #include <iostream>
using namespace std;
long long int l[100000][3];
int n;
int naj = -1;
long long int dp[100000][3];
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
l[i][0] = a;
l[i][1] = b;
l[i][2] = c;
}
dp[0][0] = l[0][0];
dp[0][1] = ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 964,063 | 964,064 | u830900349 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
int data[4][100005];
int dp[4][100005];
int ans;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> data[1][i] >> data[2][i] >> data[3][i];
dp[1][1] = data[1][1];
dp[2][1] = data[2][1];
dp[3][1] = data[3][1];
for... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
int data[4][100005];
int dp[4][100005];
int ans;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> data[1][i] >> data[2][i] >> data[3][i];
dp[1][1] = data[1][1];
dp[2][1] = data[2][1];
dp[3][1] = data[3][1];
for... | [
"expression.operation.binary.remove"
] | 964,065 | 964,066 | u935028161 | cpp |
p03162 | #include <iostream>
using namespace std;
long n, a[10000][10000], f[10000][10000];
int main() {
cin >> n;
for (long i = 1; i <= n; i++) {
for (long j = 1; j <= 3; j++)
cin >> a[i][j];
}
f[0][1] = 0;
f[0][2] = 0;
f[0][3] = 0;
for (long i = 1; i <= n; i++) {
for (long j = 1; j <= 3; j++) {
... | #include <iostream>
using namespace std;
long n, a[100005][4], f[100005][4];
int main() {
cin >> n;
for (long i = 1; i <= n; i++) {
for (long j = 1; j <= 3; j++)
cin >> a[i][j];
}
f[0][1] = 0;
f[0][2] = 0;
f[0][3] = 0;
for (long i = 1; i <= n; i++) {
for (long j = 1; j <= 3; j++) {
if... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,069 | 964,070 | u777021364 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define INF LLONG_MAX
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define INF LLONG_MAX
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> b... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 964,073 | 964,074 | u854690176 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.