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 <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
vector<int> c(N);
for (int i = 0; i < N; i++) {
int A, B, C;
cin >> A >> B >> C;
a.at(i) = A;
b.at(i) = B;
c.at(i) = C;
}
vector<vector<int>> dp(N + 1, vector<int>(3, 0));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
vector<int> c(N);
for (int i = 0; i < N; i++) {
int A, B, C;
cin >> A >> B >> C;
a.at(i) = A;
b.at(i) = B;
c.at(i) = C;
}
vector<vector<int>> dp(N + 1, vector<int>(3, 0));
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 963,139 | 963,140 | u101018317 | cpp |
p03162 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> dp(n, vector<int>(3, __INT32_MAX__)... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> dp(n, vector<int>(3, __INT32_MAX__)... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,149 | 963,150 | u530350853 | cpp |
p03162 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 963,151 | 963,152 | u352350187 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
struct option {
int x, y, z;
};
int vacation(option *arr, int n) {
int dp[n][3];
dp[0][0] = arr[0].x;
dp[0][1] = arr[0].y;
dp[0][2] = arr[0].z;
for (int i = 1; i < n; i++) {
dp[i][0] = arr[i].x + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = arr[i].y + max... | #include <bits/stdc++.h>
using namespace std;
struct option {
int x, y, z;
};
int vacation(option *arr, int n) {
int dp[n][3];
dp[0][0] = arr[0].x;
dp[0][1] = arr[0].y;
dp[0][2] = arr[0].z;
for (int i = 1; i < n; i++) {
dp[i][0] = arr[i].x + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = arr[i].y + max... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,162 | 963,163 | u133683370 | cpp |
p03162 | /*
╔═══╦═══╦═══╗
║╔═╗║╔══╩╗╔╗║
║║░║║╚══╗║║║║
║║░║║╔══╝║║║║
║╚═╝║╚══╦╝╚╝║
╚══╗╠═══╩═══╝
░░░╚╝░░░░░░░░
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s,... | /*
╔═══╦═══╦═══╗
║╔═╗║╔══╩╗╔╗║
║║░║║╚══╗║║║║
║║░║║╔══╝║║║║
║╚═╝║╚══╦╝╚╝║
╚══╗╠═══╩═══╝
░░░╚╝░░░░░░░░
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s,... | [
"call.arguments.change"
] | 963,166 | 963,167 | u288568295 | cpp |
p03162 | #include <bits/stdc++.h>
#include <stdint.h>
using namespace std;
#define int long long
#define pb push_back
#define mod 1000000007
#define w(x) \
int x; \
cin >> x; ... | #include <bits/stdc++.h>
#include <stdint.h>
using namespace std;
#define int long long
#define pb push_back
#define mod 1000000007
#define w(x) \
int x; \
cin >> x; ... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,172 | 963,173 | u464104383 | cpp |
p03162 | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 963,176 | 963,177 | u689853759 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int A[n];
int B[n];
int C[n];
for (int i = 0; i < n; i++) {
cin >> A[i] >> B[i] >> C[i];
}
int dp[n][3];
dp[0][0] = A[0];
dp[0][1] = C[0];
dp[0][2] = C[0];
for (int i = 1; i < n; i++) {
dp[i][0] = max(dp[i - 1][1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int A[n];
int B[n];
int C[n];
for (int i = 0; i < n; i++) {
cin >> A[i] >> B[i] >> C[i];
}
int 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] = max(dp[i - 1][1... | [
"assignment.value.change",
"identifier.change"
] | 963,180 | 963,181 | u527398664 | cpp |
p03162 | // dp_c_p3.cc
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> days(3, vector<int>(n));
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &days[0][i], &days[1][i], &days[2][i]);
}
vector<vector<int>> dp(3, vector<int>(n, 0));
dp[0][0] = days[0][0];
... | // dp_c_p3.cc
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> days(3, vector<int>(n));
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &days[0][i], &days[1][i], &days[2][i]);
}
vector<vector<int>> dp(3, vector<int>(n, 0));
dp[0][0] = days[0][0];
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.oper... | 963,187 | 963,188 | u349225213 | cpp |
p03162 | // dp_c_p3.cc
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> days(3, vector<int>(n));
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &days[0][i], &days[1][i], &days[2][i]);
}
vector<vector<int>> dp(3, vector<int>(n, 0));
dp[0][0] = days[0][0];
... | // dp_c_p3.cc
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> days(3, vector<int>(n));
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &days[0][i], &days[1][i], &days[2][i]);
}
vector<vector<int>> dp(3, vector<int>(n, 0));
dp[0][0] = days[0][0];
... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,189 | 963,188 | u349225213 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e10;
int main() {
ll n;
cin >> n;
vector<vector<ll>> v(n, vector<ll>(3));
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j < 3; ++j)
cin >> v[i][j];
}
vector<vector<ll>> dp(n, vector<ll>(3));
dp[0] = v[0];
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e10;
int main() {
ll n;
cin >> n;
vector<vector<ll>> v(n, vector<ll>(3));
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j < 3; ++j)
cin >> v[i][j];
}
vector<vector<ll>> dp(n, vector<ll>(3));
dp[0] = v[0];
for (... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,190 | 963,191 | u698760125 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e10;
int main() {
ll n;
cin >> n;
vector<vector<ll>> v(n, vector<ll>(3));
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j < 3; ++j)
cin >> v[i][j];
}
vector<vector<ll>> dp(n, vector<ll>(3));
dp[0] = v[0];
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e10;
int main() {
ll n;
cin >> n;
vector<vector<ll>> v(n, vector<ll>(3));
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j < 3; ++j)
cin >> v[i][j];
}
vector<vector<ll>> dp(n, vector<ll>(3));
dp[0] = v[0];
for (... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 963,192 | 963,191 | u698760125 | cpp |
p03162 | #include <bits/stdc++.h>
#define m 1000000007
using namespace std;
int main() {
long long n, k, q;
cin >> n;
long long h[n + 1], dp1[n + 1], dp2[n + 1], dp3[n + 1], a[n + 1], b[n + 1],
c[n + 1], last;
for (int i = 1; i <= n; ++i) {
cin >> a[i] >> b[i] >> c[i];
}
dp1[1] = a[1];
dp2[1] = b[1];
... | #include <bits/stdc++.h>
#define m 1000000007
using namespace std;
int main() {
long long n, k, q;
cin >> n;
long long h[n + 1], dp1[n + 1], dp2[n + 1], dp3[n + 1], a[n + 1], b[n + 1],
c[n + 1], last;
for (int i = 1; i <= n; ++i) {
cin >> a[i] >> b[i] >> c[i];
}
dp1[1] = a[1];
dp2[1] = b[1];
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 963,193 | 963,194 | u322913626 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb pu... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb pu... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 963,197 | 963,198 | u955792251 | cpp |
p03162 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int maxPointsDP(int **arr, int m, int lastN) {
int **dp = new int *[m + 1];
for (int i = 0; i <= m; i++) {
dp[i] = new int[4];
for (int j = 0; j <= 3; j++) {
dp[i][j] = 0;
}
}
for (int j = 1; j <= 3; j++) {
dp[0][j] = 0;
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int maxPointsDP(int **arr, int m, int lastN) {
int **dp = new int *[m + 1];
for (int i = 0; i <= m; i++) {
dp[i] = new int[4];
for (int j = 0; j <= 3; j++) {
dp[i][j] = 0;
}
}
for (int j = 1; j <= 3; j++) {
dp[0][j] = 0;
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 963,199 | 963,200 | u833540569 | cpp |
p03162 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int maxPointsDP(int **arr, int m, int lastN) {
int **dp = new int *[m + 1];
for (int i = 0; i <= m; i++) {
dp[i] = new int[4];
for (int j = 0; j <= 3; j++) {
dp[i][j] = 0;
}
}
for (int j = 1; j <= 3; j++) {
dp[0][j] = 0;
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int maxPointsDP(int **arr, int m, int lastN) {
int **dp = new int *[m + 1];
for (int i = 0; i <= m; i++) {
dp[i] = new int[4];
for (int j = 0; j <= 3; j++) {
dp[i][j] = 0;
}
}
for (int j = 1; j <= 3; j++) {
dp[0][j] = 0;
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 963,201 | 963,200 | u833540569 | cpp |
p03162 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> input(N, vector<int>(3));
vector<int> dp(3);
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
cin >> input[i][j];
}
}
dp[0] = input[0][0];
dp[0] = input[0][1];
dp[0] ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> input(N, vector<int>(3));
vector<int> dp(3);
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
cin >> input[i][j];
}
}
dp[0] = input[0][0];
dp[1] = input[0][1];
dp[2] ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 963,203 | 963,204 | u638254110 | cpp |
p03162 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
#define int long long
#define double long double
#define FAST \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
#define int long long
#define double long double
#define FAST \
ios_base::sync_with_stdio(false); ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,212 | 963,213 | u450781068 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MAX 1000001
#define N 1000000007
ll n;
ll a[100001][3];
ll dp[100001][3];
bool prime[MAX];
ll func(ll i, ll j) {
if (dp[i][j] != -1)
return dp[i][j];
if (i == n - 1)
dp[i][j] = a[i][j];
else {
ll res = 0;
for (ll k =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MAX 1000001
#define N 1000000007
ll n;
ll a[100001][3];
ll dp[100001][3];
bool prime[MAX];
ll func(ll i, ll j) {
if (dp[i][j] != -1)
return dp[i][j];
if (i == n - 1)
dp[i][j] = a[i][j];
else {
ll res = 0;
for (ll k =... | [
"expression.operation.binary.remove"
] | 963,214 | 963,215 | u818482882 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"io.output.change"
] | 963,241 | 963,242 | u394656605 | cpp |
p03162 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int cost(int N, vector<vector<int>> dp) {
for (int i = N - 1; i >= 0; i--) {
for (int j = 0; j < 3; j++) {
cout << i;
if (i == N - 1) {
continue;
} else if (j == 0)
dp[i][j] = max(dp[i + 1][1], dp[i ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int cost(int N, vector<vector<int>> dp) {
for (int i = N - 1; i >= 0; i--) {
for (int j = 0; j < 3; j++) {
if (i == N - 1) {
continue;
} else if (j == 0)
dp[i][j] = max(dp[i + 1][1], dp[i + 1][2]) + dp[i][... | [] | 963,250 | 963,251 | u280697499 | cpp |
p03162 | #include <bits/stdc++.h>
int main() {
int n, v;
scanf("%d", &n);
std::vector<int> dp(3, 0);
for (int d = 0; d < n; ++d) {
std::vector<int> tmp_dp(3, 0);
for (int i = 0; i < 3; ++i) {
scanf("%d", &v);
for (int j = 0; j < 3; ++j) {
if (i != j) {
tmp_dp[i] = std::max(tmp_dp[i... | #include <bits/stdc++.h>
int main() {
int n, v;
scanf("%d", &n);
std::vector<int> dp(3, 0);
for (int d = 0; d < n; ++d) {
std::vector<int> tmp_dp(3, 0);
for (int i = 0; i < 3; ++i) {
scanf("%d", &v);
for (int j = 0; j < 3; ++j) {
if (i != j) {
tmp_dp[i] = std::max(tmp_dp[i... | [] | 963,256 | 963,257 | u158312277 | cpp |
p03162 | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define pii pair<int, int>
#define pll pair<long long, long long>
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define f first
... | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define pii pair<int, int>
#define pll pair<long long, long long>
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define f first
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,262 | 963,263 | u938766060 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n][3], dp[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for (int j = 0; j < 3; j++) {
dp[0][j] = a[0][j];
}
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n][3], dp[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for (int j = 0; j < 3; j++) {
dp[0][j] = a[0][j];
}
for (int ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,279 | 963,280 | u845907943 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> arr(n, vector<int>(3));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
for (int i = 1; i < n; i++) {
arr[i][0] += max(arr[i - 1][1], arr[i - 1][2]);
arr[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> arr(n, vector<int>(3));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
for (int i = 1; i < n; i++) {
arr[i][0] += max(arr[i - 1][1], arr[i - 1][2]);
arr[... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 963,301 | 963,302 | u704524932 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &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) {
scanf("%d", &c[i]);
}
for (int i = 0; i < 3; ++i) {
for (int j = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &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) {
scanf("%d", &c[i]);
}
for (int i = 0; i < 3; ++i) {
for (int j = 0; ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 963,307 | 963,308 | u306697932 | cpp |
p03162 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
//これを見る初心者の方へ:mainより上のいっぱい書いてあるやつはプログラムを簡略化するためのものです。自分も最近知りました。各種コメントをつけているので参考にしてみてください(検索すればqittaとかでも色々見つかるので探してみてください)
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
//これを見る初心者の方へ:mainより上のいっぱい書いてあるやつはプログラムを簡略化するためのものです。自分も最近知りました。各種コメントをつけているので参考にしてみてください(検索すればqittaとかでも色々見つかるので探してみてください)
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 963,317 | 963,316 | u457601965 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int> vint;
typedef vector<ll> vll;
template <typename T> istream &operator>>(istream &is, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int> vint;
typedef vector<ll> vll;
template <typename T> istream &operator>>(istream &is, ... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,318 | 963,319 | u978308810 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long;
using namespace std;
int a[100005][3];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 3; j++)
cin >> a[i][j];
if (i != 1) {
for (int j = 0; j < 3; j++... | #include <bits/stdc++.h>
#define ll long long;
using namespace std;
int a[100005][3];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 3; j++)
cin >> a[i][j];
if (i != 1) {
for (int j = 0; j < 3; j++... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 963,323 | 963,324 | u663494838 | cpp |
p03162 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 963,325 | 963,326 | u803893892 | cpp |
p03162 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<vector<ll>> dp(n, vector<ll>(3, 0));
vector<vector<ll>> v(n, std::vector<ll>(3));
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < 3; j++)
cin >> v[i][j];
}
for (ll i = 0; i < 3; i++)
dp[0]... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<vector<ll>> dp(n, vector<ll>(3, 0));
vector<vector<ll>> v(n, std::vector<ll>(3));
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < 3; j++)
cin >> v[i][j];
}
for (ll i = 0; i < 3; i++)
dp[0]... | [
"expression.operation.binary.remove"
] | 963,327 | 963,328 | u268041276 | cpp |
p03162 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 963,330 | 963,331 | u684423349 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> dp(3);
for (int day = 0; day < n; ++day) {
vector<int> c(3);
for (int i = 0; i < 3; ++i) {
cin >> c[i];
}
vector<int> new_dp(3, 0);
for (int i = 0; i < 3; ++i) {
for (in... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> dp(3);
for (int day = 0; day < n; ++day) {
vector<int> c(3);
for (int i = 0; i < 3; ++i) {
cin >> c[i];
}
vector<int> new_dp(3, 0);
for (int i = 0; i < 3; ++i) {
for (in... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,341 | 963,342 | u863722262 | cpp |
p03162 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int N;
long... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int N;
long... | [
"assignment.change"
] | 963,347 | 963,348 | u731665172 | cpp |
p03162 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int N;
long... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int N;
long... | [
"assignment.change",
"expression.operation.binary.remove"
] | 963,350 | 963,348 | u731665172 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define n_p next_permutation
#define p_p prev_permutation
#define in insert
#define rev reverse
#define pf push_front
#define pob pop_back
#define all(x) (x).begin(), (x).end()
#define pof pop_front
#define ios ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define n_p next_permutation
#define p_p prev_permutation
#define in insert
#define rev reverse
#define pf push_front
#define pob pop_back
#define all(x) (x).begin(), (x).end()
#define pof pop_front
#define ios ... | [
"assignment.value.change",
"call.arguments.change"
] | 963,351 | 963,352 | u141362914 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int maxi(int a, int b, int c) {
if (a >= b && a >= c)
return a;
else if (b >= a && b >= c)
return b;
else
return c;
}
int main() {
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++)
cin >> a[i][0] >> a[i][1] >> a[i][2];
int b[n][3];
... | #include <bits/stdc++.h>
using namespace std;
int maxi(int a, int b, int c) {
if (a >= b && a >= c)
return a;
else if (b >= a && b >= c)
return b;
else
return c;
}
int main() {
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++)
cin >> a[i][0] >> a[i][1] >> a[i][2];
int b[n][3];
... | [
"expression.operation.binary.add"
] | 963,353 | 963,354 | u510784445 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3];
for (int i = 0; i < 3; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][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++) {
dp[i][0] = max... | #include <bits/stdc++.h>
using namespace std;
int main() {
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];
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++) {
dp[i][0] = max... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,362 | 963,363 | u901327149 | cpp |
p03162 | #pragma region Template
#include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits.h>
#include <map>
#include <set>
#include <string>
#include <vector>
#define lli long long int
#define l long
#define us unsigned short
#define mod 1000000007
#define INF 1e9 + 5
#d... | #pragma region Template
#include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits.h>
#include <map>
#include <set>
#include <string>
#include <vector>
#define lli long long int
#define l long
#define us unsigned short
#define mod 1000000007
#define INF 1e9 + 5
#d... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"misc.opposites",
"call.function.change"
] | 963,364 | 963,365 | u949194433 | cpp |
p03162 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tup... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tup... | [
"assignment.value.change",
"call.arguments.change",
"assignment.change"
] | 963,374 | 963,375 | u221285045 | cpp |
p03162 | #pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (__typeof(a) i = (a); i < (b); ++i)
#define iter(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c... | #pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (__typeof(a) i = (a); i < (b); ++i)
#define iter(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c... | [
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 963,382 | 963,383 | u874174286 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> dp(3);
for (int day = 0; day < 7; day++) {
vector<int> new_dp(3, 0);
int c[3];
cin >> c[0] >> c[1] >> c[2];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (i != 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);
int c[3];
cin >> c[0] >> c[1] >> c[2];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (i != j) {
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,385 | 963,386 | u922347667 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, a0, b1, c2;
cin >> N;
vector<vector<int64_t>> dp(N, vector<int64_t>(3, 0));
cin >> a0 >> b1 >> c2;
dp.at(0).at(0) = a0;
dp.at(0).at(1) = b1;
dp.at(0).at(2) = c2;
for (int i = 1; i < N; i++) {
cin >> a0 >> b1 >> c2;
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, a0, b1, c2;
cin >> N;
vector<vector<int64_t>> dp(N, vector<int64_t>(3, 0));
cin >> a0 >> b1 >> c2;
dp.at(0).at(0) = a0;
dp.at(0).at(1) = b1;
dp.at(0).at(2) = c2;
for (int i = 1; i < N; i++) {
cin >> a0 >> b1 >> c2;
for (int... | [
"call.add",
"call.arguments.change"
] | 963,390 | 963,391 | u875815230 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
rep(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
rep(... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 963,394 | 963,395 | u648009244 | cpp |
p03162 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int getMaxPoint(int n, vector<int> &a, vector<int> &b, vector<int> &c) {
vector<vector<int>> dp(n + 1, vector<int>(3, 0));
int cur = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j < 3; ++j) {
cur = (i == 0) ? a[i - 1] : (... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int getMaxPoint(int n, vector<int> &a, vector<int> &b, vector<int> &c) {
vector<vector<int>> dp(n + 1, vector<int>(3, 0));
int cur = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j < 3; ++j) {
cur = (j == 0) ? a[i - 1] : (... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,396 | 963,397 | u750165355 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A, B, C;
long long a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
A.push_back(a);
B.push_back(b);
C.push_back(c);
}
vector<vector<long long int>> dp(3, vector<long long int>(n, 0));
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A, B, C;
long long a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
A.push_back(a);
B.push_back(b);
C.push_back(c);
}
vector<vector<long long int>> dp(3, vector<long long int>(n, 0));
for (i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 963,402 | 963,403 | u922651947 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n;
cin >> n;
ll a[n][3];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < 2; j++) {
cin >> a[i][j];
}
}
ll dp[n][3] = {0};
for (ll j = 0; j < 3; j++) {
dp[0][j] = a[0][j];
}
for (ll i = 1; i < n;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n;
cin >> n;
ll a[n][3];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
ll dp[n][3] = {0};
for (ll j = 0; j < 3; j++) {
dp[0][j] = a[0][j];
}
for (ll i = 1; i < n;... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 963,425 | 963,426 | u119259666 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> v1(n, vector<int>(3, 0)), v2(n, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> v1[i][j];
}
}
for (int i = 1; i < n; i++) {
v1[i][0] = max(v1[i - 1][1], v1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> v1(n, vector<int>(3, 0)), v2(n, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> v1[i][j];
}
}
for (int i = 1; i < n; i++) {
v1[i][0] = max(v1[i - 1][1], v1... | [
"variable_declaration.value.change",
"identifier.change"
] | 963,433 | 963,434 | u398129514 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define intMax 2147483647
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repp(ii, aa, bb) for (int ii = aa; ii >= bb; ii--)
#define be(a) (a.begin(), a.end())
#define rbe(p) (p.rbegin(), p.rend())
#define pb push_back
vector<vector<int>> dp;
vector<int> A, B, C;
i... | #include <bits/stdc++.h>
using namespace std;
#define intMax 2147483647
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repp(ii, aa, bb) for (int ii = aa; ii >= bb; ii--)
#define be(a) (a.begin(), a.end())
#define rbe(p) (p.rbegin(), p.rend())
#define pb push_back
vector<vector<int>> dp;
vector<int> A, B, C;
i... | [
"literal.number.change",
"call.arguments.change",
"io.output.change"
] | 963,435 | 963,436 | u793264122 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define intMax 2147483647
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repp(ii, aa, bb) for (int ii = aa; ii >= bb; ii--)
#define be(a) (a.begin(), a.end())
#define rbe(p) (p.rbegin(), p.rend())
#define pb push_back
vector<vector<int>> dp;
vector<int> A, B, C;
i... | #include <bits/stdc++.h>
using namespace std;
#define intMax 2147483647
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repp(ii, aa, bb) for (int ii = aa; ii >= bb; ii--)
#define be(a) (a.begin(), a.end())
#define rbe(p) (p.rbegin(), p.rend())
#define pb push_back
vector<vector<int>> dp;
vector<int> A, B, C;
i... | [
"call.function.change",
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 963,437 | 963,436 | u793264122 | cpp |
p03162 | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\... | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\... | [
"assignment.value.change",
"call.arguments.change"
] | 963,438 | 963,439 | u128189308 | cpp |
p03162 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#in... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#in... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 963,442 | 963,443 | u317177661 | cpp |
p03162 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#in... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#in... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,444 | 963,443 | u317177661 | cpp |
p03162 | #include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define mll map<ll, ll>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define deb(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout <... | #include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define mll map<ll, ll>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define deb(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout <... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,445 | 963,446 | u731601480 | cpp |
p03162 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <util... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <util... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 963,449 | 963,450 | u342051078 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 10000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
ll INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int main() {
ll N;
cin >> N;
ll a[N], b[N], c[N];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 10000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
ll INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int main() {
ll N;
cin >> N;
ll a[N], b[N], c[N];... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 963,451 | 963,452 | u342051078 | cpp |
p03162 | #define _CRT_SECURE_NO_DEPRECATE
#include <bits/stdc++.h>
#define Rint register int
#define MP make_pair
#define fi first
#define se second
#define PB push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii; // 注意必要时改类型
typedef vector<int> vi;
const int N = 1e5 + 5;
int n;
vi a(3);
ll dp[N][3];
... | #define _CRT_SECURE_NO_DEPRECATE
#include <bits/stdc++.h>
#define Rint register int
#define MP make_pair
#define fi first
#define se second
#define PB push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii; // 注意必要时改类型
typedef vector<int> vi;
const int N = 1e5 + 5;
int n;
vi a(3);
ll dp[N][3];
... | [
"expression.operation.binary.remove"
] | 963,461 | 963,462 | u452819435 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100005;
const int DAYS = 3;
struct Day {
long long a, b, c;
};
int n;
long long dp[DAYS][MAX_N];
Day arr[MAX_N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%lld %lld %lld", &arr[i].a, &arr[i].b, &arr[i].c);
}
d... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100005;
const int DAYS = 3;
struct Day {
long long a, b, c;
};
int n;
long long dp[DAYS][MAX_N];
Day arr[MAX_N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%lld %lld %lld", &arr[i].a, &arr[i].b, &arr[i].c);
}
d... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 963,463 | 963,464 | u211017046 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
// Function Macros:
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define setpre(n) cout << fixed << setprecision(n)
// Type / Class / Struct Definitions:
using ll = long long;
using ull = unsigned long long;
// Constants:
con... | #include <bits/stdc++.h>
using namespace std;
// Function Macros:
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define setpre(n) cout << fixed << setprecision(n)
// Type / Class / Struct Definitions:
using ll = long long;
using ull = unsigned long long;
// Constants:
con... | [] | 963,465 | 963,466 | u449175559 | cpp |
p03162 | #include <bits/stdc++.h>
#define vi vector<int>
#include <algorithm>
#include <iostream>
#include <iterator>
using namespace std;
int main() {
int n;
cin >> n;
int dp[3];
for (int d = 0; d < n; d++) {
int arr[3];
for (int i = 0; i < 3; i++)
scanf("%d", &arr[i]);
int curr[3] = {0};
for (i... | #include <bits/stdc++.h>
#define vi vector<int>
#include <algorithm>
#include <iostream>
#include <iterator>
using namespace std;
int main() {
int n;
cin >> n;
int dp[3] = {0};
for (int d = 0; d < n; d++) {
int arr[3];
for (int i = 0; i < 3; i++)
scanf("%d", &arr[i]);
int curr[3] = {0};
... | [
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 963,469 | 963,470 | u163123674 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
vector<int> dp(3);
for (int d = 0; d < n; ++d) {
vector<int> n_dp(3, 0);
vector<int> cst(3);
for (int x = 0; x < 3; ++x)
cin >> cst[x];
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
vector<int> dp(3);
for (int d = 0; d < n; ++d) {
vector<int> n_dp(3, 0);
vector<int> cst(3);
for (int x = 0; x < 3; ++x)
cin >> cst[x];
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 963,475 | 963,476 | u048764593 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long> a(n + 1, 0);
vector<long> b(n + 1, 0);
vector<long> c(n + 1, 0);
for (long i = 0; i < n; i++) {
long long x, y, z;
cin >> x >> y >> z;
a[i] = x;
b[i] = y;
c[i] = z;
}
for (long i = 1; i < n... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long> a(n + 1, 0);
vector<long> b(n + 1, 0);
vector<long> c(n + 1, 0);
for (long i = 0; i < n; i++) {
long long x, y, z;
cin >> x >> y >> z;
a[i] = x;
b[i] = y;
c[i] = z;
}
for (long i = 1; i < n... | [
"call.add",
"call.arguments.change"
] | 963,479 | 963,480 | u299510043 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long> a(n + 1, 0);
vector<long> b(n + 1, 0);
vector<long> c(n + 1, 0);
for (long i = 0; i < n; i++) {
long x, y, z;
cin >> x >> y >> z;
a[i] = x;
b[i] = y;
c[i] = z;
}
for (long i = 1; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long> a(n + 1, 0);
vector<long> b(n + 1, 0);
vector<long> c(n + 1, 0);
for (long i = 0; i < n; i++) {
long long x, y, z;
cin >> x >> y >> z;
a[i] = x;
b[i] = y;
c[i] = z;
}
for (long i = 1; i < n... | [
"variable_declaration.type.widen.change",
"call.add",
"call.arguments.change"
] | 963,481 | 963,480 | u299510043 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int dp[maxn][3]; // dp[i][j]±íʾѡÁËa[i][j]µÄ×ÀÖÊý
int a[maxn][3], n;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> a[i][j];
}
dp[0][0] = a[0][0]; //µÚ0Ðгõʼ»¯
dp[0][1] = a[0][1];... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int dp[maxn][3]; // dp[i][j]±íʾѡÁËa[i][j]µÄ×ÀÖÊý
int a[maxn][3], n;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> a[i][j];
}
dp[0][0] = a[0][0]; //µÚ0Ðгõʼ»¯
dp[0][1] = a[0][1];... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 963,486 | 963,485 | u775877429 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define PI (2 * acos(0.0))
#define eps 1e-9
#define pb push_back
#define endl "\n"
#define watch(x) cout << (#x) << " ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define PI (2 * acos(0.0))
#define eps 1e-9
#define pb push_back
#define endl "\n"
#define watch(x) cout << (#x) << " ... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 963,487 | 963,488 | u992106088 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define PI (2 * acos(0.0))
#define eps 1e-9
#define pb push_back
#define endl "\n"
#define watch(x) cout << (#x) << " ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define PI (2 * acos(0.0))
#define eps 1e-9
#define pb push_back
#define endl "\n"
#define watch(x) cout << (#x) << " ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,489 | 963,490 | u992106088 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(), v.end()
#define repf(i, a, b) for (ll i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define IOS ... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(), v.end()
#define repf(i, a, b) for (ll i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define IOS ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,499 | 963,500 | u834480753 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
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 ans[n][3];
ans[0][0] = arr[0][0];
ans[0][1] = arr[0][1];
ans[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
ans[i][0] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
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 ans[n][3];
ans[0][0] = arr[0][0];
ans[0][1] = arr[0][1];
ans[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
ans[i][0] =... | [
"expression.operation.binary.remove"
] | 963,501 | 963,502 | u847978334 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int val[N][3];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
cin >> val[i][j];
}
}
long long int dp[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
dp[i][j] = -100000;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int val[N][3];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
cin >> val[i][j];
}
}
long long int dp[N][3];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
dp[i][j] = -100000;
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 963,505 | 963,506 | u384300282 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const s... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const s... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 963,510 | 963,511 | u872885167 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r+", stdin);
// for writing output to output.txt
freopen("outp... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r+", stdin);
// for writing output to output.txt
freopen("outpu... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 963,512 | 963,513 | u368645110 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int dp[100001][3], arr[100001][3], N, maxe = INT_MIN;
void solve() {
int lasteve = -1, lindex = -1;
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
maxe = max(dp[0][0], max(dp[0][1], dp[0][2]));
for (int i = 1; i < N; i++) {
for (int j = 0;... | #include <bits/stdc++.h>
using namespace std;
int dp[100001][3], arr[100001][3], N, maxe = INT_MIN;
void solve() {
int lasteve = -1, lindex = -1;
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
maxe = max(dp[0][0], max(dp[0][1], dp[0][2]));
for (int i = 1; i < N; i++) {
for (int j = 0;... | [
"call.remove"
] | 963,517 | 963,518 | u396829767 | 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 INT_INF = 2147483647;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INT_INF = 2147483647;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 963,527 | 963,528 | u639032323 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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];
}
int ma = a[0], mb = b[0], mc = c[0];
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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];
}
int ma = a[0], mb = b[0], mc = c[0];
for (int... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,529 | 963,530 | u063318293 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define si size()
#define bk back()
#define popb pop_back()
#define fastio \
ios_base::sync_with_stdio(false);... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define si size()
#define bk back()
#define popb pop_back()
#define fastio \
ios_base::sync_with_stdio(false);... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 963,533 | 963,534 | u397955542 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define INF 1234567890
#define N (int)(1e5 + 5)
#define pi acos(-1)
void solve() {
int dp[4];
int n;
cin >> n;
for (int i = 1; i <= 3; ++i)
cin >> dp[i];
for (int i = 2; i <= n; ++i) {
int cost[4], new_dp[4];
for (int j ... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define INF 1234567890
#define N (int)(1e5 + 5)
#define pi acos(-1)
void solve() {
int dp[4];
int n;
cin >> n;
for (int i = 1; i <= 3; ++i)
cin >> dp[i];
for (int i = 2; i <= n; ++i) {
int cost[4], new_dp[4];
for (int j ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,537 | 963,538 | u592548368 | cpp |
p03162 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define Rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for (ll i = 1; i <= (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// cout << fixed << setprecision(10);//
//最小公... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define Rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for (ll i = 1; i <= (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// cout << fixed << setprecision(10);//
//最小公... | [
"call.add"
] | 963,542 | 963,543 | u233626335 | cpp |
p03162 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define Rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for (ll i = 1; i <= (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// cout << fixed << setprecision(10);//
//最小公... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define Rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for (ll i = 1; i <= (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// cout << fixed << setprecision(10);//
//最小公... | [
"assignment.value.change",
"call.add"
] | 963,544 | 963,543 | u233626335 | cpp |
p03162 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 1;
const int MX = 1e15 + 123456789;
int n;
int a[N][4];
int dp[N][4];
int solve(int i, int j) {
if (i == 1)
return a[i][j];
if (dp[i][j] + 1) {
return dp[i][j];
}
int path, mx = 0;
for (int u = 1; u <= 3; u++) {
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 1;
const int MX = 1e15 + 123456789;
int n;
int a[N][4];
int dp[N][4];
int solve(int i, int j) {
if (i == 1)
return a[i][j];
if (dp[i][j] + 1) {
return dp[i][j];
}
int path, mx = 0;
for (int u = 1; u <= 3; u++) {
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 963,545 | 963,546 | u903920392 | cpp |
p03162 | #include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
vector<int> dp(3);
for (int day = 0; day < n; day++) {
vector<int> new_dp(3, 0);
vector<int... | #include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
vector<int> dp(3);
for (int day = 0; day < n; day++) {
vector<int> new_dp(3, 0);
vector<int... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 963,547 | 963,548 | u895395057 | cpp |
p03162 | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC optimi... | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC optimi... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,551 | 963,552 | u752949890 | cpp |
p03162 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define ll long long
#define ae addEdge
#define mp make_pair
#define vi vector<int>
#define vll vector<long long>
#define si set<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define sortv sort(v.b... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define ll long long
#define ae addEdge
#define mp make_pair
#define vi vector<int>
#define vll vector<long long>
#define si set<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define sortv sort(v.b... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,553 | 963,554 | u583798468 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
void swap(ll &a, ll &b) {
ll t = a;
a = b;
b = t;
}
ll min(ll a, ll b) {
if (a < b)
return a;
return b;
}
ll max(ll a, ll b) {
if (a > b)
return a;
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
void swap(ll &a, ll &b) {
ll t = a;
a = b;
b = t;
}
ll min(ll a, ll b) {
if (a < b)
return a;
return b;
}
ll max(ll a, ll b) {
if (a > b)
return a;
ret... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 963,555 | 963,556 | u537301941 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[3][N];
int mem[3][N];
int n;
int vac(int day, int act) {
if (day == n)
return 0;
if (mem[day][act] != -1)
return mem[day][act];
int ans = 0;
ans = max(ans, a[day][act] + vac(day + 1, (act + 1) % 3));
ans = max(ans, a[day][... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N][3];
int mem[N][3];
int n;
int vac(int day, int act) {
if (day == n)
return 0;
if (mem[day][act] != -1)
return mem[day][act];
int ans = 0;
ans = max(ans, a[day][act] + vac(day + 1, (act + 1) % 3));
ans = max(ans, a[day][... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add"
] | 963,557 | 963,558 | u452706738 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> dp1(3);
for (int day = 0; day < n; day++) {
vector<int> dp2(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++)
i... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> dp1(3);
for (int day = 0; day < n; day++) {
vector<int> dp2(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++)
i... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 963,563 | 963,564 | u763827124 | cpp |
p03162 | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | [
"identifier.replace.add",
"literal.replace.remove"
] | 963,565 | 963,566 | u700811072 | cpp |
p03162 | // author: hitch_hiker42;
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
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];
int dp[3][n];
memset(dp, 0, sizeof dp);
... | // author: hitch_hiker42;
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
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];
int dp[3][n];
memset(dp, 0, sizeof dp);
... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 963,572 | 963,573 | u683739220 | cpp |
p03162 | // author: hitch_hiker42;
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
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];
int dp[3][n];
memset(dp, 0, sizeof dp);
... | // author: hitch_hiker42;
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
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];
int dp[3][n];
memset(dp, 0, sizeof dp);
... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 963,574 | 963,573 | u683739220 | cpp |
p03162 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 963,584 | 963,585 | u901561754 | cpp |
p03162 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
c... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
c... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 963,588 | 963,589 | u933962236 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
long long i, j, n, m, t, k, ans, x, dp[200001][3], B, a[200001][3], Min1, Min2;
int main() {
cin >> n;
cin >> k;
for (i = 1; i <= n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
dp[1][0] = a[1][0];
dp[1][1] = a[1][1];
dp[1][2] = a[1][2];
for (i = 2; i ... | #include <bits/stdc++.h>
using namespace std;
long long i, j, n, m, t, k, ans, x, dp[200001][3], B, a[200001][3], Min1, Min2;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
dp[1][0] = a[1][0];
dp[1][1] = a[1][1];
dp[1][2] = a[1][2];
for (i = 2; i <= n; i++) {... | [] | 963,590 | 963,591 | u427421765 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep_1(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define rep_2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
cons... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep_1(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define rep_2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
cons... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 963,596 | 963,597 | u709751610 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int maax(int a, int b) {
if (a > b)
return a;
return b;
}
int main() {
int t;
cin >> t;
int a[t], b[t], c[t];
for (int i = 0; i < t; i++) {
cin >> a[t] >> b[t] >> c[t];
}
for (int i = 1; i < t; i++) {
a[i] += maax(b[i - 1], c[i - 1]);
b[i] +... | #include <bits/stdc++.h>
using namespace std;
int maax(int a, int b) {
if (a > b)
return a;
return b;
}
int main() {
int t;
cin >> t;
int a[t], b[t], c[t];
for (int i = 0; i < t; i++) {
cin >> a[i] >> b[i] >> c[i];
}
for (int i = 1; i < t; i++) {
a[i] += maax(b[i - 1], c[i - 1]);
b[i] +... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 963,601 | 963,602 | u093796889 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, pa, pb, pc, a, b, c;
cin >> n >> pa >> pb >> pc;
for (int i = 1; i < n; i++) {
cin >> a >> b >> c;
a += max(pb, pc);
b += max(pa, pc);
c += max(p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, pa, pb, pc, a, b, c;
cin >> n >> pa >> pb >> pc;
for (int i = 1; i < n; i++) {
cin >> a >> b >> c;
a += max(pb, pc);
b += max(pa, pc);
c += max(p... | [
"identifier.change",
"io.output.change"
] | 963,603 | 963,604 | u242195640 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, pa, pb, pc, a, b, c;
cin >> n >> pa >> pb >> pc;
for (int i = 1; i < n; i++) {
cin >> a >> b >> c;
a += max(pb, pc);
b += max(pa, pc);
c += max(p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, pa, pb, pc, a, b, c;
cin >> n >> pa >> pb >> pc;
for (int i = 1; i < n; i++) {
cin >> a >> b >> c;
a += max(pb, pc);
b += max(pa, pc);
c += max(p... | [
"identifier.change",
"io.output.change"
] | 963,605 | 963,604 | u242195640 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
typedef vector<pii> vii;
typedef map<ll, ll> mii;
const int MOD = 1e9 + 7;
#define fastIO() \
ios_base::sync_with... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
typedef vector<pii> vii;
typedef map<ll, ll> mii;
const int MOD = 1e9 + 7;
#define fastIO() \
ios_base::sync_with... | [
"identifier.change",
"io.output.change"
] | 963,610 | 963,611 | u697384706 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int koszta[1000006][3]; // koszty kwiatkow
int tab[1000006][3]; // koszt do rabatki dal koloru a kazym numerze na koncu
int n, best;
void dp() {
for (int i = 2; i <= n; i++) { // przejdz po domach
tab[i][0] = max(tab[i - 1][1], tab[i - 1][2]) + koszta[i][0];
t... | #include <bits/stdc++.h>
using namespace std;
int koszta[1000006][3]; // koszty kwiatkow
int tab[1000006][3]; // koszt do rabatki dal koloru a kazym numerze na koncu
int n, best;
void dp() {
for (int i = 2; i <= n; i++) { // przejdz po domach
tab[i][0] = max(tab[i - 1][1], tab[i - 1][2]) + koszta[i][0];
t... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 963,612 | 963,613 | u829712891 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, dis1 = 0, dis2 = 0, m, k;
cin >> n;
int arra[n] = {9};
fill(arra, arra + n, 999999999);
vector<int> dp(3, 0);
for (int day = 0; day < n; day++) {
vector<int> vec;
vector<int> new_dp(3, 0);
for (int i = 0; i < 3; i++) {
cin >... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, dis1 = 0, dis2 = 0, m, k;
cin >> n;
int arra[n] = {9};
fill(arra, arra + n, 999999999);
vector<int> dp(3, 0);
for (int day = 0; day < n; day++) {
vector<int> vec;
vector<int> new_dp(3, 0);
for (int i = 0; i < 3; i++) {
cin >... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 963,614 | 963,615 | u998339520 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n], fc[n], fb[n], fa[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
fc[0] = c[0];
fb[0] = b[0];
fa[0] = a[0];
for (int i = 1; i < n; i++) {
fc[i] = c[i] + max(fb[i - 1], fa[i - 1])... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n], fc[n], fb[n], fa[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
fc[0] = c[0];
fb[0] = b[0];
fa[0] = a[0];
for (int i = 1; i < n; i++) {
fc[i] = c[i] + max(fb[i - 1], fa[i - 1])... | [
"identifier.change",
"io.output.change"
] | 963,618 | 963,619 | u746339181 | cpp |
p03162 | #include <stdio.h>
int main() {
int i;
scanf("%d", &i);
int k = -1;
int tab[i][3];
while (++k < i)
scanf("%d %d %d", &tab[k][0], &tab[k][1], &tab[k][2]);
k = 0;
while (++k < i) {
tab[k][0] = tab[k][0] + ((tab[k - 1][1] >= tab[k - 1][2]) ? tab[k - 1][1]
... | #include <stdio.h>
int main() {
int i;
scanf("%d", &i);
int k = -1;
int tab[i][3];
while (++k < i)
scanf("%d %d %d", &tab[k][0], &tab[k][1], &tab[k][2]);
k = 0;
while (++k < i) {
tab[k][0] = tab[k][0] + ((tab[k - 1][1] >= tab[k - 1][2]) ? tab[k - 1][1]
... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 963,622 | 963,623 | u896013930 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.