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"
#pragma warning(disable : 4996)
using namespace std;
const int N = 1e5 + 5;
struct node {
int a, b, c;
} s[N];
long long dp[N][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i].a >> s[i].b >> s[i].c;
}
dp[0][0] = s[0].a;
dp[0][1] = s[0].b;
dp[0][2] ... | #include "bits/stdc++.h"
#pragma warning(disable : 4996)
using namespace std;
const int N = 1e5 + 5;
struct node {
int a, b, c;
} s[N];
long long dp[N][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i].a >> s[i].b >> s[i].c;
}
dp[0][0] = s[0].a;
dp[0][1] = s[0].b;
dp[0][2] ... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,089 | 964,090 | u873935558 | cpp |
p03162 | // C - Vacation
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
ll n;
// vector<ll> dp(3, vector<ll>(1000005, -1));
ll dp[3][1000005];
ll cost(vector<vector<ll>> &matrix, ll selected, ll day) {
if (dp[day][selected] != -1)
return dp[day][selected];
if (day == matrix.size())
... | // C - Vacation
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
ll n;
// vector<ll> dp(3, vector<ll>(1000005, -1));
ll dp[1000005][3];
ll cost(vector<vector<ll>> &matrix, ll selected, ll day) {
if (dp[day][selected] != -1)
return dp[day][selected];
if (day == matrix.size())
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,105 | 964,106 | u339512054 | cpp |
p03162 | // C - Vacation
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
ll n;
// vector<ll> dp(3, vector<ll>(1000005, -1));
ll dp[3][1000005];
ll cost(vector<vector<ll>> &matrix, ll selected, ll day) {
if (dp[day][selected] != -1)
return dp[day][selected];
if (day == matrix.size())
... | // C - Vacation
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
ll n;
// vector<ll> dp(3, vector<ll>(1000005, -1));
ll dp[1000005][3];
ll cost(vector<vector<ll>> &matrix, ll selected, ll day) {
if (dp[day][selected] != -1)
return dp[day][selected];
if (day == matrix.size())
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add"
] | 964,107 | 964,106 | u339512054 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i, a) for (int i = 0; i < (a); i++)
#define ub upper_bound // first element > val(itr)
#define lb lower_bound //... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i, a) for (int i = 0; i < (a); i++)
#define ub upper_bound // first element > val(itr)
#define lb lower_bound //... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 964,108 | 964,109 | u227976892 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
const int M = 3;
ll dp[N][M];
int a[N], b[N], c[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
dp[0][0] = a[0];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
const int M = 3;
ll dp[N][M];
int a[N], b[N], c[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
dp[0][0] = a[0];
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,110 | 964,111 | u767097637 | cpp |
p03162 | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int n = 0;
struct Dia {
int a = 0;
int b = 0;
int c = 0;
};
Dia a[100002];
int pd[100002][4];
long long int func(int dia, int anterior) {
if (pd[dia][anterior] != -1)
return pd[dia][anterior];
if (dia == n)
return 0;
else... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int n = 0;
struct Dia {
int a = 0;
int b = 0;
int c = 0;
};
Dia a[100002];
int pd[100002][4];
long long int func(int dia, int anterior) {
if (pd[dia][anterior] != -1)
return pd[dia][anterior];
if (dia == n)
return 0;
else... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 964,112 | 964,113 | u216881850 | cpp |
p03162 | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int n = 0;
struct Dia {
int a = 0;
int b = 0;
int c = 0;
};
Dia a[100002];
int pd[100002][3];
long long int func(int dia, int anterior) {
if (pd[dia][anterior] != -1)
return pd[dia][anterior];
if (dia == n)
return 0;
else... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int n = 0;
struct Dia {
int a = 0;
int b = 0;
int c = 0;
};
Dia a[100002];
int pd[100002][4];
long long int func(int dia, int anterior) {
if (pd[dia][anterior] != -1)
return pd[dia][anterior];
if (dia == n)
return 0;
else... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 964,114 | 964,113 | u216881850 | cpp |
p03162 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const long long INF = (1 << 30);
int main() {
int n;
cin >> n;
int a[100000][3];
rep(i, n) {
rep(j, 3) { cin >> a[i][j]; }
}
long long dp[100100][3] = {}; //幸福度を0で初期化
rep(i, 3) { dp[0][i] = a[0][i]; }
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const long long INF = (1 << 30);
int main() {
int n;
cin >> n;
int a[100000][3];
rep(i, n) {
rep(j, 3) { cin >> a[i][j]; }
}
long long dp[100100][3] = {}; //幸福度を0で初期化
rep(i, 3) { dp[0][i] = a[0][i]; }
... | [] | 964,117 | 964,118 | u621582427 | cpp |
p03162 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const long long INF = (1 << 30);
int main() {
int n;
cin >> n;
int a[10000][3];
rep(i, n) {
rep(j, 3) { cin >> a[i][j]; }
}
long long dp[100100][3] = {}; //幸福度を0で初期化
rep(i, 3) { dp[0][i] = a[0][i]; }
r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const long long INF = (1 << 30);
int main() {
int n;
cin >> n;
int a[100000][3];
rep(i, n) {
rep(j, 3) { cin >> a[i][j]; }
}
long long dp[100100][3] = {}; //幸福度を0で初期化
rep(i, 3) { dp[0][i] = a[0][i]; }
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,119 | 964,118 | u621582427 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int result[110000][3], A[110000], B[110000], C[110000];
for (int i = 0; i < 3; i++)
result[0][i] = 0;
A[0] = B[0] = C[0] = 0;
for (int i = 1; i <= n; i++)
cin >> A[i] >> B[i] >> C[i];
int s = 0, b = 1, h = 2;
for (int i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int result[110000][3], A[110000], B[110000], C[110000];
for (int i = 0; i < 3; i++)
result[0][i] = 0;
A[0] = B[0] = C[0] = 0;
for (int i = 1; i <= n; i++)
cin >> A[i] >> B[i] >> C[i];
int s = 0, b = 1, h = 2;
for (int i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 964,129 | 964,130 | u498651680 | cpp |
p03162 | #include <iostream>
using namespace std;
const int MAXN = 1e5 + 1;
int dp[MAXN][3];
int a[MAXN];
int b[MAXN];
int c[MAXN];
int n;
int main() {
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 (int j = 1; j < n; j++) {
dp[... | #include <iostream>
using namespace std;
const int MAXN = 1e5 + 1;
int dp[MAXN][3];
int a[MAXN];
int b[MAXN];
int c[MAXN];
int n;
int main() {
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 (int j = 1; j < n; j++) {
dp[... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 964,131 | 964,132 | u247141523 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define fast_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define fast_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,133 | 964,134 | u260130097 | cpp |
p03162 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
const int IMAX = pow(2.0, 31.0) - 1;
#define max(a, b) a > b ? a : b
#define min(a, b) a < b ? a : b
void strInit(char str[]); // str[]を0で初期化
void extIntStr(char str[],
int data[]); /... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
const int IMAX = pow(2.0, 31.0) - 1;
#define max(a, b) a > b ? a : b
#define min(a, b) a < b ? a : b
void strInit(char str[]); // str[]を0で初期化
void extIntStr(char str[],
int data[]); /... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 964,151 | 964,152 | u493708099 | cpp |
p03162 | #include <iostream>
#include <vector>
//#include <boost/multi_array.hpp>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline ... | #include <iostream>
#include <vector>
//#include <boost/multi_array.hpp>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline ... | [
"expression.operation.binary.remove"
] | 964,155 | 964,156 | u544563563 | cpp |
p03162 | #include "bits/stdc++.h"
using namespace std;
const int inf = 10e9 + 5;
int main() {
int n;
cin >> n;
vector<int> dp(3);
for (int days = 0; days < n; ++days) {
vector<int> cost(3);
for (int i = 0; i < 3; i++) {
cin >> cost[i];
}
vector<int> newDp(3, inf);
for (int i = 0; i < 3; i++) ... | #include "bits/stdc++.h"
using namespace std;
const int inf = 10e9 + 5;
int main() {
int n;
cin >> n;
vector<int> dp(3);
for (int days = 0; days < n; ++days) {
vector<int> cost(3);
for (int i = 0; i < 3; i++) {
cin >> cost[i];
}
vector<int> newDp(3, 0);
for (int i = 0; i < 3; i++) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 964,165 | 964,166 | u021688125 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int b[N];
int c[N];
long long dp[N][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 (int i = 1; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int b[N];
int c[N];
long long dp[N][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 (int i = 1; i < n; i++) {
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 964,171 | 964,172 | u559671281 | cpp |
p03162 | #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
const int Nmax = 1e5 + 5;
int N, S, Max, p;
int a[Nmax][3], dp[Nmax][3];
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d%d%d", a[i][0], a[i][1], a[i][2]);
for (int j = 0; j < 3; ++j) {
for (i... | #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
const int Nmax = 1e5 + 5;
int N, S, Max, p;
int a[Nmax][3], dp[Nmax][3];
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d%d%d", &a[i][0], &a[i][1], &a[i][2]);
for (int j = 0; j < 3; ++j) {
for... | [
"expression.operation.unary.reference.add"
] | 964,192 | 964,193 | u361594188 | cpp |
p03162 | // motatoes cp snippet
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define forr(a, b, v) for (int v = a; v <= b; v++)
#define ford(a, b, v) for (int v = a; v >= b; v--)
// https://www.topcoder.com/community/competitive-programming/tutorials/power-up-c-with-the-standard-templ... | // motatoes cp snippet
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define forr(a, b, v) for (int v = a; v <= b; v++)
#define ford(a, b, v) for (int v = a; v >= b; v--)
// https://www.topcoder.com/community/competitive-programming/tutorials/power-up-c-with-the-standard-templ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 964,197 | 964,198 | u798678713 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
long long N, cost[100001][3], DP[100001][3];
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
for (int j = 0; j < 3; j++) {
cin >> cost[i][j];
}
}
DP[0][0] = 0;
DP[0][1] = 0;
DP[0][2] = 0;
cost[0][0] = 0;
cost[0][1] = 0;
cost[0][2] = 0;
... | #include <bits/stdc++.h>
using namespace std;
long long N, cost[100001][3], DP[100001][3];
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
for (int j = 0; j < 3; j++) {
cin >> cost[i][j];
}
}
DP[0][0] = 0;
DP[0][1] = 0;
DP[0][2] = 0;
cost[0][0] = 0;
cost[0][1] = 0;
cost[0][2] = 0;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,202 | 964,200 | u312604259 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
void chmin(auto &a, auto b) {
if (b < a)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
void chmin(auto &a, auto b) {
if (b < a)
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,203 | 964,204 | u422633119 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
const int INF = 1e9 + 5;
#undef int
int main() {
int n, k;
scanf("%d", &n);
vector<int> dp(3, 0);
vector<int> arr(3, 0);
dp[0] = 0;
for (int i = 0; i < n; i++) {
vector<int> new_dp(3, 0);
for (int j = 0; j < 3; j++)
s... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
const int INF = 1e9 + 5;
#undef int
int main() {
int n, k;
scanf("%d", &n);
vector<int> dp(3, 0);
vector<int> arr(3, 0);
dp[0] = 0;
for (int i = 0; i < n; i++) {
vector<int> new_dp(3, 0);
for (int j = 0; j < 3; j++)
s... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,205 | 964,206 | u720279479 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << " = " << x << endl;
#define ll long long
#define A 0
#define B 1
#define C 2
#define INF 0x3f3f3f3f
int n;
vector<int> height;
vector<vector<int>> dp;
vector<vector<int>> vis;
vector<vector<int>> matriz;
int solve(int i, int anterior) {
... | #include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << " = " << x << endl;
#define ll long long
#define A 0
#define B 1
#define C 2
#define INF 0x3f3f3f3f
int n;
vector<int> height;
vector<vector<int>> dp;
vector<vector<int>> vis;
vector<vector<int>> matriz;
int solve(int i, int anterior) {
... | [
"identifier.change",
"function.return_value.change"
] | 964,207 | 964,208 | u565819128 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using llu = unsigned long long;
#define mod 1000000007
#define mode 998244353
#define PI 3.14159265358979323846
#define fast \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using llu = unsigned long long;
#define mod 1000000007
#define mode 998244353
#define PI 3.14159265358979323846
#define fast \
ios_base::sync_with_stdio(false); ... | [
"expression.operation.binary.remove"
] | 964,209 | 964,210 | u168298651 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N;
long long a[100010][3];
// DPテーブル
l... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N;
long long a[100010][3];
// DPテーブル
l... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 964,211 | 964,212 | u553129408 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N;
long long a[100010][3];
// DPテーブル
l... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N;
long long a[100010][3];
// DPテーブル
l... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,213 | 964,212 | u553129408 | cpp |
p03162 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,214 | 964,215 | u147556624 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long int
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define null NULL
#define mp make_pair
#define fi first
#define se second
#define boost ... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long int
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define null NULL
#define mp make_pair
#define fi first
#define se second
#define boost ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"io.output.change"
] | 964,218 | 964,219 | u860215190 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 964,222 | 964,223 | u127768253 | cpp |
p03162 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,242 | 964,243 | u532894762 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
using namespace std;
ifstream f("test.in");
ofstream g("test.out");
ll n, a[100005], b[100005], c[100005], dp[100005][5];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i] >... | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
using namespace std;
ifstream f("test.in");
ofstream g("test.out");
ll n, a[100005], b[100005], c[100005], dp[100005][5];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i] >... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,244 | 964,245 | u842916328 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
using namespace std;
ifstream f("test.in");
ofstream g("test.out");
ll n, a[100005], b[100005], c[100005], dp[100005][5];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i] >... | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
using namespace std;
ifstream f("test.in");
ofstream g("test.out");
ll n, a[100005], b[100005], c[100005], dp[100005][5];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i] >... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,246 | 964,245 | u842916328 | cpp |
p03162 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,253 | 964,254 | u386107860 | cpp |
p03162 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int N;
ll dp[100001][3]; // dp[i][j] := i日目(1-idx)に行動jをした時の幸福度
// 今回は1-idxで実装してることに注意！
// j == 0なら行動A、j == 1なら行動B、j == 2なら行動C
ll A[100001], B[100001],
C[100001]; //三つの行動の日にちごとに得られる幸福度 今回は1-xで実装してることに注意！
ll memo... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int N;
ll dp[100001][3];
// dp[i][j] := i日目(1-idx)に行動jをした時の幸福度
// 今回は1-idxで実装してることに注意！ j == 0なら行動A、j == 1なら行動B、j ==
// 2なら行動C
ll A[100001], B[100001],
C[100001]; //三つの行動の日にちごとに得られる幸福度 今回は1-xで実装してることに注意！
ll memo(int a, int act) ... | [
"call.add",
"call.arguments.change"
] | 964,263 | 964,264 | u107077805 | cpp |
p03162 | #include <algorithm>
#include <array>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 7;
int n, k;
vector<array<int, 3>> happy;
int dp[100000][4];
int dfs(int now, int before) {
if (now == n)
return 0;
if (~dp[now][before])
return dp[now][before];
in... | #include <algorithm>
#include <array>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 7;
int n;
vector<array<int, 3>> happy;
int dp[100000][4];
int dfs(int now, int before) {
if (now == n)
return 0;
if (~dp[now][before])
return dp[now][before];
int r... | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 964,265 | 964,266 | u752074356 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int a[n + 1], b[n + 1], c[n + 1];
for (int i = 1; i < n + 1; i++)
cin >> a[i] >> b[i] >> c[i];
int dp[n + 1][3];
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
dp[i][1] = 0;
dp[i][2] = 0;
... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int a[n + 1], b[n + 1], c[n + 1];
for (int i = 1; i < n + 1; i++)
cin >> a[i] >> b[i] >> c[i];
int dp[n + 1][3];
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
dp[i][1] = 0;
dp[i][2] = 0;
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,271 | 964,272 | u672771778 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][3];
for (int... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][3];
for (int... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,273 | 964,274 | u427681070 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
const int MaxN =... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
const int MaxN =... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 964,275 | 964,276 | u124992729 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// DP テーブル
long long dpa[100010];
long long dpb[100010];
long long dpc[100010];
int main() {
// DP テーブル全体を初期化
for (int i = 0; i < 100010; ++i) {
dpa[i] = 0;
dpb[i] = 0;
dpc[i] = 0;
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// DP テーブル
long long dpa[100010];
long long dpb[100010];
long long dpc[100010];
int main() {
// DP テーブル全体を初期化
for (int i = 0; i < 100010; ++i) {
dpa[i] = 0;
dpb[i] = 0;
dpc[i] = 0;
}
... | [
"identifier.change",
"io.output.change"
] | 964,277 | 964,278 | u774160580 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, sta, end, inc) for (int i = sta; i <= end; i += inc)
#define itr(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(a, b, c) assert(b <= a && a <= c... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, sta, end, inc) for (int i = sta; i <= end; i += inc)
#define itr(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(a, b, c) assert(b <= a && a <= c... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 964,279 | 964,280 | u858856811 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, sta, end, inc) for (int i = sta; i <= end; i += inc)
#define itr(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(a, b, c) assert(b <= a && a <= c... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, sta, end, inc) for (int i = sta; i <= end; i += inc)
#define itr(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(a, b, c) assert(b <= a && a <= c... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 964,281 | 964,280 | u858856811 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef std::vector<int> vi;
int main() {
int n;
scanf("%d", &n);
vi ans(3, 0);
for (int day = 0; day < n; day++) {
vi c(3);
for (int i = 0; i < n; i++) {
scanf("%d", &c[i]);
}
vi dp(3, 0);
for (int i = 0; i < 3; i++) {
for (int j... | #include <bits/stdc++.h>
using namespace std;
typedef std::vector<int> vi;
int main() {
int n;
scanf("%d", &n);
vi ans(3);
for (int day = 0; day < n; day++) {
vi c(3);
for (int i = 0; i < 3; i++) {
scanf("%d", &c[i]);
}
vi dp(3, 0);
for (int i = 0; i < 3; i++) {
for (int j = ... | [
"call.arguments.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 964,300 | 964,301 | u864207035 | cpp |
p03162 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[100100][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
long long dp[100100][3] = {0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[100100][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
long long dp[100100][3] = {0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,309 | 964,310 | u513736711 | cpp |
p03162 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[100100][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
long long dp[100100][3] = {0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[100100][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
long long dp[100100][3] = {0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,311 | 964,310 | u513736711 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e9 + 5;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
int n;
cin >> n;
vector<int> dp(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e9 + 5;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
int n;
cin >> n;
vector<int> dp(... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 964,314 | 964,315 | u319343724 | cpp |
p03162 | /*
* Created by Dipta Das on 27-06-2019
* Title:
* Problem Link:
* Editorial:
* Source Code:
* Comments:
*/
#include <bits/stdc++.h>
#include <stdio.h>
#define fin freopen("input", "r", stdin)
#define whatis(x) cerr << #x << ": " << x << endl;
using namespace std;
using ll = long long;
int main() {
ios_base... | /*
* Created by Dipta Das on 27-06-2019
* Title:
* Problem Link:
* Editorial:
* Source Code:
* Comments:
*/
#include <bits/stdc++.h>
#include <stdio.h>
#define fin freopen("input", "r", stdin)
#define whatis(x) cerr << #x << ": " << x << endl;
using namespace std;
using ll = long long;
int main() {
ios_base... | [
"expression.operation.binary.remove"
] | 964,335 | 964,336 | u567992495 | cpp |
p03162 | #include <iostream>
using namespace std;
int ans[100000][3];
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];
}
ans[0][0] = arr[0][0];
ans[0][1] = ans[0][1];
ans[0][2] = ans[0][2];
for (int i = 1; i < n; i++) {
if (ans[i -... | #include <iostream>
using namespace std;
int ans[100000][3];
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];
}
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++) {
if (ans[i -... | [
"assignment.value.change",
"identifier.change"
] | 964,339 | 964,340 | u855642922 | cpp |
p03162 | #include <iostream>
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
int main() {
int i, j, n;
cin >> n;
int dp[n][3], a[n][3];
for (i = 0; i < n; i++) {
for (j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
dp[0][0] = a[0][0... | #include <iostream>
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
int main() {
int i, j, n;
cin >> n;
int dp[n][3], a[n][3];
for (i = 0; i < n; i++) {
for (j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
dp[0][0] = a[0][0... | [
"call.arguments.change",
"call.arguments.add"
] | 964,341 | 964,342 | u700270455 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int N = 100007;
const int INF = 1000000007;
int a[N], b[N], c[N], dp[N][3];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i] >> b[i] >> c[i];
for (int i = 1; i <= n; ++i) {
dp[i][0] = max(dp[i][0], max(dp[i - 1][1], dp[i - 1... | #include <bits/stdc++.h>
using namespace std;
const int N = 100007;
const int INF = 1000000007;
int a[N], b[N], c[N], dp[N][3];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i] >> b[i] >> c[i];
for (int i = 1; i <= n; ++i) {
dp[i][0] = max(dp[i][0], max(dp[i - 1][1], dp[i - 1... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 964,347 | 964,348 | u411195488 | cpp |
p03162 | /*..................................
manojeet24
....................................*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fl(i, a, b) for (int i = a; i < b; i++)
#define flr(i, a, b) for (int i = a; i > b; i--)
#define INF INT_MAX
ll dp[100005][3], h[100005][3], k;
int n;
ll ... | /*..................................
manojeet24
....................................*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fl(i, a, b) for (int i = a; i < b; i++)
#define flr(i, a, b) for (int i = a; i > b; i--)
#define INF INT_MAX
ll dp[100005][3], h[100005][3], k;
int n;
ll ... | [
"identifier.change",
"variable_access.subscript.index.change",
"function.return_value.change"
] | 964,349 | 964,350 | u973352787 | cpp |
p03162 | /*..................................
manojeet24
....................................*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fl(i, a, b) for (int i = a; i < b; i++)
#define flr(i, a, b) for (int i = a; i > b; i--)
#define INF INT_MAX
int dp[100005][3], h[100005][3], k;
int n;
in... | /*..................................
manojeet24
....................................*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fl(i, a, b) for (int i = a; i < b; i++)
#define flr(i, a, b) for (int i = a; i > b; i--)
#define INF INT_MAX
ll dp[100005][3], h[100005][3], k;
int n;
ll ... | [
"variable_declaration.type.change",
"identifier.change",
"variable_access.subscript.index.change",
"function.return_value.change"
] | 964,351 | 964,350 | u973352787 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, i, j;
ll a[n][3];
for (i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
for (i = 1; i < n; i++) {
a[i][0] += max(a[i - 1][1], a[i - 1][2]);
a[i][1] += max(a[i - 1][0], a[i - 1][2]);
a[i][2] +=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, i, j;
cin >> n;
ll a[n][3];
for (i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
for (i = 1; i < n; i++) {
a[i][0] += max(a[i - 1][1], a[i - 1][2]);
a[i][1] += max(a[i - 1][0], a[i - 1][2]);
... | [] | 964,352 | 964,353 | u231613785 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define rep(i, n) for (int i = 0; i < n; ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define stl_repr(itr, x) for (auto itr = x.rbegin(); itr != x.rend(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(... | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define rep(i, n) for (int i = 0; i < n; ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define stl_repr(itr, x) for (auto itr = x.rbegin(); itr != x.rend(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 964,356 | 964,357 | u943004959 | cpp |
p03162 | //
// main.cpp
// C - Vacation
//
// Created by Hashizo on 2019/06/12.
//
#include <algorithm>
#include <iostream>
#include <regex>
#include <string>
#include <vector>
using namespace std;
#undef INT_MAX
#undef INT_MIN
#define INT_MAX 2147483647
#define INT_MIN (-INT_MAX - 1)
#define FOR(i, a, b) for (int i = (... | //
// main.cpp
// C - Vacation
//
// Created by Hashizo on 2019/06/12.
//
#include <algorithm>
#include <iostream>
#include <regex>
#include <string>
#include <vector>
using namespace std;
#undef INT_MAX
#undef INT_MIN
#define INT_MAX 2147483647
#define INT_MIN (-INT_MAX - 1)
#define FOR(i, a, b) for (int i = (... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.change"
] | 964,369 | 964,370 | u156723325 | cpp |
p03162 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define f first
#define s second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define debug(x) cout << #x << " " << x << "\n"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<ll,... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define f first
#define s second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define debug(x) cout << #x << " " << x << "\n"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<ll,... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,371 | 964,372 | u381052328 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<array<int, 3>> dp(n);
vector<array<int, 3>> happy(n);
for (auto idx(0); idx < n; ++idx) {
cin >> happy[idx][0] >> happy[idx][1] >> happy[idx][2];
}
dp[0][0] = happy[0][0];
dp[0][3] = happy[0][1];
dp[0][2] = happy[0]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<array<int, 3>> dp(n);
vector<array<int, 3>> happy(n);
for (auto idx(0); idx < n; ++idx) {
cin >> happy[idx][0] >> happy[idx][1] >> happy[idx][2];
}
dp[0][0] = happy[0][0];
dp[0][1] = happy[0][1];
dp[0][2] = happy[0]... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 964,373 | 964,374 | u268434654 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n, i, j;
cin >> n;
long int a[n][3];
for (i = 0; i < n; i++) {
for (j = 0; j < 3; j++)
cin >> a[i][j];
}
long int dp[n][3];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (i = 0; i < n; i++) {
for (j =... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n, i, j;
cin >> n;
long int a[n][3];
for (i = 0; i < n; i++) {
for (j = 0; j < 3; j++)
cin >> a[i][j];
}
long int dp[n][3];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (i = 1; i < n; i++) {
for (j =... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 964,377 | 964,378 | u415896336 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n;
cin >> n;
ll a[n + 1], b[n + 1], c[n + 1];
ll dp[n + 1][3];
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
dp[1][0] = a[1];
dp[1][1] = b[1];
dp[1][2] = c[1];
for (int i = 2; i <= n; i++) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n;
cin >> n;
ll a[n + 1], b[n + 1], c[n + 1];
ll dp[n + 1][3];
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
dp[1][0] = a[1];
dp[1][1] = b[1];
dp[1][2] = c[1];
for (int i = 2; i <= n; i++) ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"io.output.change"
] | 964,379 | 964,380 | u742642200 | cpp |
p03162 | #include <bits/stdc++.h>
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using ll = long lon... | #include <bits/stdc++.h>
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using ll = long lon... | [
"assignment.change"
] | 964,381 | 964,382 | u398135166 | cpp |
p03162 | #include <bits/stdc++.h>
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using ll = long lon... | #include <bits/stdc++.h>
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using ll = long lon... | [
"assignment.change"
] | 964,383 | 964,382 | u398135166 | cpp |
p03162 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
using namespace std;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0)... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
using namespace std;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0)... | [
"assignment.change"
] | 964,400 | 964,401 | u317754719 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define faster ios::sync_with_stdio(false)
#define ll long long int
#define sz 200005
#define mp(x, y) make_pair(x, y)
#define pii pair<long long int, long long int>
#define tor ::iterator
#define letsgo ... | #include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define faster ios::sync_with_stdio(false)
#define ll long long int
#define sz 200005
#define mp(x, y) make_pair(x, y)
#define pii pair<long long int, long long int>
#define tor ::iterator
#define letsgo ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 964,409 | 964,410 | u116062521 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
vector<vector<int>> dp(n, vector<int>(3));
dp[n - 1][0] = a[n - 1];
dp[n - 1][1] = b[n - 1];
dp[n - 1][2] = c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
vector<vector<int>> dp(n, vector<int>(3));
dp[n - 1][0] = a[n - 1];
dp[n - 1][1] = b[n - 1];
dp[n - 1][2] = c... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 964,422 | 964,423 | u355724718 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
int n, h[4][maxn], dp[maxn][4];
int solve(int x, int last) {
if (dp[x][last] == -1)
return dp[x][last];
if (x == n + 1)
return 0;
for (int i = 1; i <= 3; i++) {
if (i != last) {
dp[x][last] = max(dp[x][last], h[i][x] +... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
int n, h[4][maxn], dp[maxn][4];
int solve(int x, int last) {
if (dp[x][last] != -1)
return dp[x][last];
if (x == n + 1)
return 0;
for (int i = 1; i <= 3; i++) {
if (i != last) {
dp[x][last] = max(dp[x][last], h[i][x] +... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 964,440 | 964,441 | u427216196 | cpp |
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++) {
cin >> a[i] >> b[i] >> c[i];
}
vector<vector<int>> answer(3, vector<int>(n, 0));
answer[0][0] = a[0];
answer[2][0] = b[0];
answer[2][... | #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++) {
cin >> a[i] >> b[i] >> c[i];
}
vector<vector<int>> answer(3, vector<int>(n, 0));
answer[0][0] = a[0];
answer[1][0] = b[0];
answer[2][0... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 964,451 | 964,452 | u667099228 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
long long mem[100005][3];
int arr[100005][3];
int n;
long long go(int x, int y) {
if (x >= n)
return 0;
if (mem[x][y] != -1)
return mem[x][y];
for (int i = 0; i < 3; i++) {
if (i == y && i != 0)
continue;
mem[x][y] = max(mem[x][y], go(x + 1, i... | #include <bits/stdc++.h>
using namespace std;
long long mem[100005][3];
int arr[100005][3];
int n;
long long go(int x, int y) {
if (x >= n)
return 0;
if (mem[x][y] != -1)
return mem[x][y];
for (int i = 0; i < 3; i++) {
if (i == y && x != 0)
continue;
mem[x][y] = max(mem[x][y], go(x + 1, i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 964,453 | 964,454 | u360904601 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int max_n = 1e5 + 20;
int n, k;
int a[max_n], b[max_n], c[max_n], DP[3][max_n];
int main() {
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 (int i = 1; i < n; i++) {
DP[i][... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 1e5 + 20;
int n, k;
int a[max_n], b[max_n], c[max_n], DP[max_n][3];
int main() {
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 (int i = 1; i < n; i++) {
DP[i][0... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add"
] | 964,457 | 964,458 | u986144116 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int n, dp[300005][5], arr[300005][5];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
scanf("%d", arr[i][j]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j ... | #include <bits/stdc++.h>
using namespace std;
int n, dp[300005][5], arr[300005][5];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
scanf("%d", &arr[i][j]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j... | [
"expression.operation.unary.reference.add"
] | 964,463 | 964,464 | u078937298 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100100
int n, a[MAXN][3], dp[MAXN][3], k;
int main() {
cin >> n;
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 < n; ++j) {
if (i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100100
int n, a[MAXN][3], dp[MAXN][3], k;
int main() {
cin >> n;
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) {
if (i == 0) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,471 | 964,472 | u463720901 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
const ll dx[4] = {-1, 1, 0, 0};
const ll dy[4] = {0, 0, -1, 1};
const ll MAX = 3e5 + 10;
#define pb push_back
#define f first
#define s second
#define all(v) v.begin(), v.end()
long long gcd(long long a, long long b) { return ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
const ll dx[4] = {-1, 1, 0, 0};
const ll dy[4] = {0, 0, -1, 1};
const ll MAX = 3e5 + 10;
#define pb push_back
#define f first
#define s second
#define all(v) v.begin(), v.end()
long long gcd(long long a, long long b) { return ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 964,475 | 964,476 | u386842336 | cpp |
p03162 | #include <iostream>
#define NMAX 100001
using namespace std;
int DP[NMAX][4], initial[NMAX][4], n, p;
void read() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= 2; j++) {
cin >> initial[i][j];
}
}
}
void solve() {
for (int i = 0; i <= 2; i++)
DP[1][i] = initial[1][i];
f... | #include <iostream>
#define NMAX 100001
using namespace std;
int DP[NMAX][4], initial[NMAX][4], n, p;
void read() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= 2; j++) {
cin >> initial[i][j];
}
}
}
void solve() {
for (int i = 0; i <= 2; i++)
DP[1][i] = initial[1][i];
f... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 964,488 | 964,489 | u389532053 | cpp |
p03162 | #include <iostream>
#define NMAX 100001
using namespace std;
int DP[NMAX][4], initial[NMAX][4], n, p;
void read() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= 2; j++) {
cin >> initial[i][j];
}
}
}
void solve() {
for (int i = 1; i <= 3; i++)
DP[1][i] = initial[1][i];
f... | #include <iostream>
#define NMAX 100001
using namespace std;
int DP[NMAX][4], initial[NMAX][4], n, p;
void read() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= 2; j++) {
cin >> initial[i][j];
}
}
}
void solve() {
for (int i = 0; i <= 2; i++)
DP[1][i] = initial[1][i];
f... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,490 | 964,489 | u389532053 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> abc(n, vector<int>(3));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> abc[i][j];
vector<vector<int>> dp(n + 1, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> abc(n, vector<int>(3));
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> abc[i][j];
vector<vector<int>> dp(n + 1, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,493 | 964,494 | u283229916 | cpp |
p03162 | #include <bits/stdc++.h>
#define int long long
#define N 100011
using namespace std;
const int INF = -(int)1e17;
int n, arr[N][3], opt[N][3];
signed main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
... | #include <bits/stdc++.h>
#define int long long
#define N 100011
using namespace std;
const int INF = -(int)1e17;
int n, arr[N][3], opt[N][3];
signed main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,497 | 964,498 | u800680442 | cpp |
p03162 | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include ... | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 964,499 | 964,500 | u422592877 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie();
vector<int> prev(3, 0);
vector<int> cur(3);
int N;
cin >> N;
cin >> cur[0] >> cur[1] >> cur[2];
for (int i = 1; i < N; ++i) {
std::swap(prev, cur);
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie();
vector<int> prev(3, 0);
vector<int> cur(3);
int N;
cin >> N;
cin >> cur[0] >> cur[1] >> cur[2];
for (int i = 1; i < N; ++i) {
std::swap(prev, cur);
... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,501 | 964,502 | u046277696 | cpp |
p03162 | // *
// *
// * Created By :hozaifa wahid
// * "mai maut ko takia aur kafan ko chadar banakar sota hu"
// *------------------------------------
// * OS : Ubuntu 16.04
// * Language : CPP14
// * Editor : Sublime Text 3
// * C++ compiler : g++
// *
// *
// https://www.geeksforgeeks.org/find-the-point-where-maximum-in... | // *
// *
// * Created By :hozaifa wahid
// * "mai maut ko takia aur kafan ko chadar banakar sota hu"
// *------------------------------------
// * OS : Ubuntu 16.04
// * Language : CPP14
// * Editor : Sublime Text 3
// * C++ compiler : g++
// *
// *
// https://www.geeksforgeeks.org/find-the-point-where-maximum-in... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,503 | 964,504 | u872703130 | cpp |
p03162 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000][3], cc[500000][3];
int main() {
scanf("%d", &n, &k);
for (int i = 1; i <= n; i++)
for (int j = 0; j < 3; j++)
scanf("%d", &cc[i][j]);
// for (int i=2;i<=n;i++) for (int j=0;j<3;j++) dp[i][j]=9999999999;
... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000][3], cc[500000][3];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 0; j < 3; j++)
scanf("%d", &cc[i][j]);
// for (int i=2;i<=n;i++) for (int j=0;j<3;j++) dp[i][j]=9999999999;
for ... | [
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 964,509 | 964,510 | u704549083 | cpp |
p03162 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> abc(N, vector<int>(3));
int a, b, c;
for (auto &i : abc)
cin >> i[0] >> i[1] >> i[2];
a = abc[0][0];
b = abc[0][1];
b = abc[0][2];
for (int i = 1; i < N; i++) {
int x = max(b, c) +... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> abc(N, vector<int>(3));
int a, b, c;
for (auto &i : abc)
cin >> i[0] >> i[1] >> i[2];
a = abc[0][0];
b = abc[0][1];
c = abc[0][2];
for (int i = 1; i < N; i++) {
int x = max(b, c) +... | [
"assignment.variable.change",
"identifier.change"
] | 964,517 | 964,518 | u042026294 | cpp |
p03162 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,519 | 964,520 | u266643907 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int maxi = 1e5 + 10;
int M[maxi][3];
long long dp[maxi][4];
long long f(int n, int hacer) {
if (n < 0)
return 0;
if (dp[n][hacer] != -1)
return dp[n][hacer];
long long ans = 0;
for (int i = 0; i < 3; i++) {
if (i == hacer)
continue;
ans =... | #include <bits/stdc++.h>
using namespace std;
const int maxi = 1e5 + 10;
int M[maxi][3];
long long dp[maxi][4];
long long f(int n, int hacer) {
if (n < 0)
return 0;
if (dp[n][hacer] != -1)
return dp[n][hacer];
long long ans = 0;
for (int i = 0; i < 3; i++) {
if (i == hacer)
continue;
ans =... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"function.return_value.change",
"literal.number.change",
"variable_declaration.value.change"
] | 964,533 | 964,534 | u380410396 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> vec(n, vector<int>(3));
vector<vector<int>> dp(n, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> vec[i][j];
}
}
dp[0][0] = vec[0][0];
dp[0][1] = vec[0][... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> vec(n, vector<int>(3));
vector<vector<int>> dp(n, vector<int>(3, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> vec[i][j];
}
}
dp[0][0] = vec[0][0];
dp[0][1] = vec[0]... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,535 | 964,536 | u823444917 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define vi vector<int>
#define pb emplace_back
#define sz(x) (int)x.size()
#define all(v) v.begin(), v.end()
#define x first
#define y second
#define rep(i, j, k) for (i = j; i < k; i++)
#define sep(i, j, k) for (i = j; i > k;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define vi vector<int>
#define pb emplace_back
#define sz(x) (int)x.size()
#define all(v) v.begin(), v.end()
#define x first
#define y second
#define rep(i, j, k) for (i = j; i < k; i++)
#define sep(i, j, k) for (i = j; i > k;... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 964,537 | 964,538 | u761472821 | cpp |
p03162 | //============================================================================
// Name : c
// Date : Tue Feb 19 22:22:47 CST 2019
// Author : landcold7
// Description : Actions speak louder more than words
//============================================================================
#include "bits/s... | //============================================================================
// Name : c
// Date : Tue Feb 19 22:22:47 CST 2019
// Author : landcold7
// Description : Actions speak louder more than words
//============================================================================
#include "bits/s... | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 964,541 | 964,542 | u161007542 | cpp |
p03162 | /*
Author : Pranav_Raut.
*/
#include <bits/stdc++.h>
using namespace std;
#define input(arr, n) \
for (ll i = 0; i < n; i++) { \
cin >> arr[i]; ... | /*
Author : Pranav_Raut.
*/
#include <bits/stdc++.h>
using namespace std;
#define input(arr, n) \
for (ll i = 0; i < n; i++) { \
cin >> arr[i]; ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 964,543 | 964,544 | u743925717 | cpp |
p03162 | #include <bits/stdc++.h>
#pragma GCC_compile("Ofast")
using namespace std;
int N, MAX;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
vector<vector<int>> a(N);
for (int i = 0; i < N; i++) {
a[i] = vector<int>(3);
for (int &x : a[i])
cin >> x;
}
// dp[i] - the total cost suc... | #include <bits/stdc++.h>
#pragma GCC_compile("Ofast")
using namespace std;
int N, MAX;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
vector<vector<int>> a(N);
for (int i = 0; i < N; i++) {
a[i] = vector<int>(3);
for (int &x : a[i])
cin >> x;
}
// dp[i] - the total cost suc... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,545 | 964,546 | u368952837 | cpp |
p03162 | //----------ACCIDENTAL COMPETITIVE PROGRAMMER---------------------
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace ... | //----------ACCIDENTAL COMPETITIVE PROGRAMMER---------------------
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 964,547 | 964,548 | u109311178 | cpp |
p03162 | //----------ACCIDENTAL COMPETITIVE PROGRAMMER---------------------
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace ... | //----------ACCIDENTAL COMPETITIVE PROGRAMMER---------------------
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace ... | [
"variable_declaration.type.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 964,549 | 964,548 | u109311178 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int ans = 0;
void up(int &x, int y) {
if (x < y) {
x = y;
if (ans < y)
ans = y;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n;
cin >> n;
vector<vector... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int ans = 0;
void up(int &x, int y) {
if (x < y) {
x = y;
if (ans < y)
ans = y;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n;
cin >> n;
vector<vector... | [
"call.add",
"call.arguments.change"
] | 964,550 | 964,551 | u784576081 | cpp |
p03162 | #include <stdio.h>
#include <vector>
using namespace std;
const int C = 150001;
int n, k, a, b, c, dp[2][C];
int abs(int a) { return (a > 0) ? (a) : (-a); }
int main() {
int j;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d %d", &a, &b, &c);
dp[0][i] = max(dp[1][i - 1], dp[2][i - 1]) + a;... | #include <stdio.h>
#include <vector>
using namespace std;
const int C = 150001;
int n, k, a, b, c, dp[3][C];
int abs(int a) { return (a > 0) ? (a) : (-a); }
int main() {
int j;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d %d", &a, &b, &c);
dp[0][i] = max(dp[1][i - 1], dp[2][i - 1]) + a;... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,560 | 964,561 | u679729810 | cpp |
p03162 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <ccomplex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <sstream>
#include <tuple>
#include <unordered_map>
#include <vector>
... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <ccomplex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <sstream>
#include <tuple>
#include <unordered_map>
#include <vector>
... | [
"literal.number.change",
"call.arguments.change"
] | 964,566 | 964,567 | u935056190 | cpp |
p03162 | #include <bits/stdc++.h>
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define re0(i, a) for (int i = 0; i < (a); i++)
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef long double ld;
const int mod = 7 + 1e9;
const int inf = 1e9;
con... | #include <bits/stdc++.h>
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define re0(i, a) for (int i = 0; i < (a); i++)
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef long double ld;
const int mod = 7 + 1e9;
const int inf = 1e9;
con... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,568 | 964,569 | u465705011 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define OO 2e18
#define oo 1e9
#define yalla ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define FILES \
freopen("input.txt", "r", stdin); \
freopen("output... | #include <bits/stdc++.h>
#define ll long long
#define OO 2e18
#define oo 1e9
#define yalla ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define FILES \
freopen("input.txt", "r", stdin); \
freopen("output... | [
"assignment.value.change",
"identifier.change",
"literal.number.change",
"variable_access.subscript.index.change"
] | 964,580 | 964,581 | u412213585 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,582 | 964,583 | u767717086 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
#define ll long long
const ll inf = 1e18;
int main() {
int n;
scanf("%d", &n);
vector<ll> c(3, 0);
vector<ll> dp(3, 0);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 3; ++j)
cin >> c[j];
vector<ll> ndp(3, 0);
for (int ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
#define ll long long
const ll inf = 1e18;
int main() {
int n;
scanf("%d", &n);
vector<ll> c(3, 0);
vector<ll> dp(3, 0);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 3; ++j)
cin >> c[j];
vector<ll> ndp(3, 0);
for (int ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 964,608 | 964,609 | u763404917 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, ... | [
"identifier.change",
"expression.operation.binary.change"
] | 964,624 | 964,625 | u038027079 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
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];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int i = 1; i < n;... | #include <bits/stdc++.h>
#define ll long long
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];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int i = 1; i < n;... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 964,630 | 964,631 | u430781070 | cpp |
p03162 | // Problem link - https://atcoder.jp/contests/dp/tasks/dp_c
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | // Problem link - https://atcoder.jp/contests/dp/tasks/dp_c
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,632 | 964,633 | u266433281 | cpp |
p03162 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = -1;
int solve(void);
int main(void) {
while (solve()) {
}
return 0;
}
int solve(void) {
ll N;
cin >> N;
const int K = 3;
vector<vector<ll>> act(K, vector<ll>(N, 0)... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = -1;
int solve(void);
int main(void) {
while (solve()) {
}
return 0;
}
int solve(void) {
ll N;
cin >> N;
const int K = 3;
vector<vector<ll>> act(K, vector<ll>(N, 0... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 964,638 | 964,639 | u462237086 | cpp |
p03162 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = -1;
int solve(void);
int main(void) {
while (solve()) {
}
return 0;
}
int solve(void) {
ll N;
cin >> N;
const int K = 3;
vector<vector<ll>> act(K, vector<ll>(N, 0)... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = -1;
int solve(void);
int main(void) {
while (solve()) {
}
return 0;
}
int solve(void) {
ll N;
cin >> N;
const int K = 3;
vector<vector<ll>> act(K, vector<ll>(N, 0... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 964,640 | 964,639 | u462237086 | cpp |
p03162 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int dp[100001][3] = {0};
int h[100001][3];
int n;
cin >> n;
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++) {
for (int j = 0; j < 3; j++) {
for ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int dp[100001][3] = {0};
int h[100001][3];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> h[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 964,641 | 964,642 | u192541825 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.