problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03162 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
enum Act { A, B, C };
using arr3 = std::array<int64_t, 3>;
int main(int argc, char *argv[]) {
int64_t N;
std::cin >> N;
std::vector<arr3> h(N + 1);
for (int64_t i = 1; i <= N; ++i) {
std::cin >>... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
enum Act { A, B, C };
using arr3 = std::array<int64_t, 3>;
int main(int argc, char *argv[]) {
int64_t N;
std::cin >> N;
std::vector<arr3> h(N + 1);
for (int64_t i = 1; i <= N; ++i) {
std::cin >>... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,646 | 964,647 | u854760708 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define ff first
#define ss second
#define se set<ll>
#define inf 10000000000000
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef APNA_IO
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define ff first
#define ss second
#define se set<ll>
#define inf 10000000000000
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef APNA_IO
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,650 | 964,651 | u511137896 | cpp |
p03162 | #include <iostream>
using namespace std;
typedef long long int ll;
ll max(ll a, ll b) { return (a > b ? a : b); }
ll max3(ll a, ll b, ll c) { return max(max(a, b), c); }
// recursive solution
ll vacation(ll *a, ll *b, ll *c, ll n, ll choice) {
if (n == 1 && choice == 0)
return a[0];
else if (n == 1 && choi... | #include <iostream>
using namespace std;
typedef long long int ll;
ll max(ll a, ll b) { return (a > b ? a : b); }
ll max3(ll a, ll b, ll c) { return max(max(a, b), c); }
// recursive solution
ll vacation(ll *a, ll *b, ll *c, ll n, ll choice) {
if (n == 1 && choice == 0)
return a[0];
else if (n == 1 && choi... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change"
] | 964,654 | 964,655 | u644828064 | cpp |
p03162 | // VIVEK UPADHYAY
// MANIT, BHOPAL(M.P)
/**********************************************************************************************/
/**********************************************************************************************/
// $$ JAB-TAK ... | // VIVEK UPADHYAY
// MANIT, BHOPAL(M.P)
/**********************************************************************************************/
/**********************************************************************************************/
// $$ JAB-TAK ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 964,659 | 964,660 | u753615145 | cpp |
p03162 | // VIVEK UPADHYAY
// MANIT, BHOPAL(M.P)
/**********************************************************************************************/
/**********************************************************************************************/
// $$ JAB-TAK ... | // VIVEK UPADHYAY
// MANIT, BHOPAL(M.P)
/**********************************************************************************************/
/**********************************************************************************************/
// $$ JAB-TAK ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"io.output.change"
] | 964,661 | 964,660 | u753615145 | cpp |
p03162 | #include <iostream>
#include <string>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define INT_MAX 0x7FFFFFFF
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define ABS(a) ((a) < 0 ? (-(a)) : (a))
using namespace std;
typedef long long int LL;
int main() {
int N, Ha = 0, Hb = ... | #include <iostream>
#include <string>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define INT_MAX 0x7FFFFFFF
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define ABS(a) ((a) < 0 ? (-(a)) : (a))
using namespace std;
typedef long long int LL;
int main() {
int N, Ha = 0, Hb = ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,664 | 964,665 | u597940868 | cpp |
p03162 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
#define rep(i, n) Rep(i, 0, n)
#define Rep... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
#define rep(i, n) Rep(i, 0, n)
#define Rep... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 964,666 | 964,667 | u381585104 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005], c[100005];
long long int dp[200000][3];
int main() {
int N, d, e, f;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i] >> b[i] >> c[i];
dp[1][0] = a[1];
dp[1][2] = b[1];
dp[1][2] = c[1];
for (int i = 2; i <= N; i++) {
dp[... | #include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005], c[100005];
long long int dp[200000][3];
int main() {
int N, d, e, f;
cin >> N;
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++) {
dp[... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 964,670 | 964,671 | u292217769 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int a[100000], b[100000], c[100000];
int dp[200000][3];
int main() {
int N, d, e, f;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i] >> b[i] >> c[i];
dp[1][0] = a[1];
dp[1][2] = b[1];
dp[1][2] = c[1];
for (int i = 2; i <= N; i++) {
dp[i][0] = a[... | #include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005], c[100005];
long long int dp[200000][3];
int main() {
int N, d, e, f;
cin >> N;
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++) {
dp[... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 964,672 | 964,671 | u292217769 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define N 100004
int memo[N][3];
int A[N];
int B[N];
int C[N];
int n;
int m3(int a, int b, int c) { return max(c, max(a, b)); }
int dp(int pos, int l) {
if (pos >= n) {
return 0;
}
if (memo[pos][l] != -1)
return memo[pos][l];
if (l == 0)
return memo[pos]... | #include <bits/stdc++.h>
using namespace std;
#define N 100004
int memo[N][3];
int A[N];
int B[N];
int C[N];
int n;
int m3(int a, int b, int c) { return max(c, max(a, b)); }
int dp(int pos, int l) {
if (pos >= n) {
return 0;
}
if (memo[pos][l] != -1)
return memo[pos][l];
if (l == 0)
return memo[pos]... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 964,673 | 964,674 | u928468768 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 964,677 | 964,678 | u333917945 | cpp |
p03162 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ll dp[n + 1][3] = {};
rep(i, n) {
int a, b, c;
cin >> a >> b >> c;
dp[i + 1][0] = max(dp[i][1] + a, dp[i][2] + a);
dp[i + 1][1] = max(dp[i][0] + b, dp[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ll dp[n + 1][3] = {};
rep(i, n) {
int a, b, c;
cin >> a >> b >> c;
dp[i + 1][0] = max(dp[i][1] + a, dp[i][2] + a);
dp[i + 1][1] = max(dp[i][0] + b, dp[... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,679 | 964,680 | u174404613 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;... | [] | 964,681 | 964,682 | u443685186 | cpp |
p03162 | #include <algorithm>
#include <cstdio>
using namespace std;
int N;
int a[100000];
int b[100000];
int c[100000];
int dp[100000][3];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
}
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i =... | #include <algorithm>
#include <cstdio>
using namespace std;
int N;
int a[100000];
int b[100000];
int c[100000];
int dp[100000][3];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
}
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i =... | [
"literal.number.change",
"variable_declaration.value.change"
] | 964,698 | 964,699 | u048945791 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
typedef long long int lo;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
typedef long long int lo;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() \
ios_base::sync_with_stdio(false); ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 964,700 | 964,701 | u050607149 | cpp |
p03162 | #include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#define max(a, b) ((a > b) ? (a) : (b))
#define min(a, b) ((a < b) ? (a) : (b))
#define abs(x) (((x) < 0) ? (-(x)) : (x))
using namespace std;
int main() {
int N;
long *a, *b, *c;
cin >> N;
a = new long[N];
b = new long[N];
c =... | #include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#define max(a, b) ((a > b) ? (a) : (b))
#define min(a, b) ((a < b) ? (a) : (b))
#define abs(x) (((x) < 0) ? (-(x)) : (x))
using namespace std;
int main() {
int N;
long *a, *b, *c;
cin >> N;
a = new long[N];
b = new long[N];
c =... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 964,708 | 964,709 | u793275002 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | [
"identifier.change",
"call.function.change"
] | 964,719 | 964,720 | u828388155 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main... | [
"variable_declaration.type.change"
] | 964,721 | 964,722 | u828388155 | cpp |
p03163 | #include <bits/stdc++.h>
//#define int long long
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(nullptr)
using namespace std;
signed main() {
FAST_IO;
int N, W;
cin >> N >> W;
int t = N;
vector<int> wt;
vector<int> val;
while (t--) {
int a, b;
cin >> a >> b;
wt.push_back(a);
v... | #include <bits/stdc++.h>
//#define int long long
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(nullptr)
using namespace std;
signed main() {
FAST_IO;
int N, W;
cin >> N >> W;
int t = N;
vector<int> wt;
vector<int> val;
while (t--) {
int a, b;
cin >> a >> b;
wt.push_back(a);
v... | [
"variable_declaration.type.widen.change"
] | 964,723 | 964,724 | u437254737 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int knapsack(vector<int> w, vector<int> v, int W) {
int n = w.size();
vector<vector<int>> vec(n + 1, vector<int>(W + 1));
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
vec[i][j] = 0;
else if (j < w[i - 1])... | #include <bits/stdc++.h>
using namespace std;
long long knapsack(vector<int> w, vector<int> v, int W) {
int n = w.size();
vector<vector<long long>> vec(n + 1, vector<long long>(W + 1));
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
vec[i][j] = 0;
else... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 964,725 | 964,726 | u635291249 | cpp |
p03163 | // A Dynamic Programming based
// solution for 0-1 Knapsack problem
#include <iostream>
using namespace std;
// A utility function that returns
// maximum of two integers
int max(int a, int b) { return (a > b) ? a : b; }
// Returns the maximum value that
// can be put in a knapsack of capacity W
int knapSack(int W, in... | // A Dynamic Programming based
// solution for 0-1 Knapsack problem
#include <iostream>
using namespace std;
// A utility function that returns
// maximum of two integers
int max(int a, int b) { return (a > b) ? a : b; }
// Returns the maximum value that
// can be put in a knapsack of capacity W
long long knapSack(int... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 964,728 | 964,729 | u772913903 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int v[n], w[n], dp[n + 1][W + 1];
for (int i = 0; i < n; i++)
cin >> v[i] >> w[i];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
else if (j >= w[i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
long long v[n], w[n], dp[n + 1][W + 1];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
else if (j >=... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"expression.operation.binary.change"
] | 964,732 | 964,733 | u972747689 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
#define quickie \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep1(i, a, b) for (int i = a; i <= b;... | #include <bits/stdc++.h>
#define int long long
#define quickie \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep1(i, a, b) for (int i = a; i <= b;... | [
"identifier.change",
"expression.operation.binary.change"
] | 964,734 | 964,735 | u185295955 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cou... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cou... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.add",
"literal.replace.remove"
] | 964,738 | 964,737 | u443962092 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cou... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cou... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 964,739 | 964,737 | u443962092 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cou... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cou... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.type.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 964,740 | 964,737 | u443962092 | cpp |
p03163 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
int cost[101], cap[101], n;
long long dp[101][100005];
int knap(int i, int c) {
if (dp[i][c] != -1)
return dp[i][c];
long long res;
if (i == 0 || c == 0)
res = 0;
else if (cap[i] > c)
res ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
long long cost[101], cap[101], n;
long long dp[101][100005];
long long knap(int i, int c) {
if (dp[i][c] != -1)
return dp[i][c];
long long res;
if (i == 0 || c == 0)
res = 0;
else if (cap[i] >... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 964,741 | 964,742 | u510741562 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int W;
cin >> W;
int w[n];
int v[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
int dp[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0) {
dp[i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
int W;
cin >> W;
int w[n];
int v[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
ll dp[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j ... | [
"variable_declaration.type.change"
] | 964,743 | 964,744 | u345267444 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 1; i <= (n); i++)
using ll = long long;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1000000007;
int main() {
ll N, W;
cin >> N >> W;
vector<ll> w(N + 1), v(N + 1);
rep(i, N) cin >> w[i] >> v[i];
vector<vector<ll>> d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 1; i <= (n); i++)
using ll = long long;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1000000007;
int main() {
ll N, W;
cin >> N >> W;
vector<ll> w(N + 1), v(N + 1);
rep(i, N) cin >> w[i] >> v[i];
vector<vector<ll>> d... | [
"expression.operation.binary.remove"
] | 964,745 | 964,746 | u713574885 | cpp |
p03163 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long int
#define skip cin >> ws;
#define vll vector<ll>
#define vb vector<bool>
#define vpll vector<pair<ll, ll>>
#defin... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long int
#define skip cin >> ws;
#define vll vector<ll>
#define vb vector<bool>
#define vpll vector<pair<ll, ll>>
#defin... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 964,747 | 964,748 | u345866226 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define itn int
int main(void) {
int n, x;
cin >> n >> x;
int w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
int dp[n + 1][x + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {
for (int j = 0; j <= x; j+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define itn int
int main(void) {
int n, x;
cin >> n >> x;
int w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
ll dp[n + 1][x + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {
for (int j = 0; j <= x; j++... | [
"variable_declaration.type.change"
] | 964,753 | 964,754 | u512624048 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
int solve() {
int N, W;
cin >> N >> W;
int w[N], v[N];
int i;
for (i = 0; i < N; i++)
cin >> w[i] >> v[i];
int dp[N + 1][W + 1];
for (i = 0; i <= N; i++)
dp[i][0] = 0;
for (i = 0; i <= W; i++)
dp[0][i] = 0;
int j;
for (i... | #include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define int long long
int solve() {
int N, W;
cin >> N >> W;
int w[N], v[N];
int i;
for (i = 0; i < N; i++)
cin >> w[i] >> v[i];
int dp[N + 1][W + 1];
for (i = 0; i <= N; i++)
dp[i][0] = 0;
for (i = 0; i <= W; i++)
dp[0][i] ... | [] | 964,757 | 964,758 | u628586011 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[110][100100] = {0};
int weight[110], value[110];
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
signed main() {
int n, w;
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[110][100100] = {0};
int weight[110], value[110];
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
signed main() {
int n, w;
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >... | [] | 964,762 | 964,763 | u962609087 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[110][100100] = {0};
int weight[110], value[110];
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
signed main() {
int n, w;
cin >> n, w;
for (int i = 0; i < n; i++) {
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[110][100100] = {0};
int weight[110], value[110];
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
signed main() {
int n, w;
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >... | [] | 964,764 | 964,763 | u962609087 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int weight[110], value[110];
int dp[110][100100] = {0};
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 ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int weight[110], value[110];
int dp[110][100100] = {0};
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 ... | [
"io.output.change"
] | 964,765 | 964,766 | u962609087 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int weight[110], value[110];
int dp[110][100100] = {0};
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 ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int weight[110], value[110];
int dp[110][100100] = {0};
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 ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"io.output.change"
] | 964,767 | 964,766 | u962609087 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int weight[110], value[110];
int dp[110][100010] = {0};
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 ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int weight[110], value[110];
int dp[110][100100] = {0};
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 ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"io.output.change"
] | 964,768 | 964,766 | u962609087 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTIO \
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(nullptr)
#define INF (1LL << 62) - 1
#define F first
#define S second
#define pb push_back
ll dp[102][100002];
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTIO \
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(nullptr)
#define INF (1LL << 62) - 1
#define F first
#define S second
#define pb push_back
ll dp[102][100002];
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,771 | 964,772 | u717852897 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
int dp[W + 1];
for (int i = 0; i < W + 1; i++)
d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
ll dp[W + 1];
for (int i = 0; i < W + 1; i++)
dp... | [
"variable_declaration.type.change"
] | 964,780 | 964,781 | u872581897 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cap;
cin >> n >> cap;
vector<int> weights;
vector<int> values;
for (int i = 0; i < n; i++) {
int w, v;
cin >> w >> v;
weights.push_back(w);
values.push_back(v);
}
int dp[n + 1][cap + 1];
memset(dp, 0, sizeof(dp));
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cap;
cin >> n >> cap;
vector<int> weights;
vector<long long int> values;
for (int i = 0; i < n; i++) {
int w, v;
cin >> w >> v;
weights.push_back(w);
values.push_back(v);
}
long long int dp[n + 1][cap + 1];
memset(dp, 0,... | [
"variable_declaration.type.widen.change"
] | 964,788 | 964,789 | u696991379 | cpp |
p03163 | #include <algorithm>
#include <iostream>
using namespace std;
int dp[101][100001];
long long int solve(int **a, int i, long long int w, int n) {
if (w == 0) {
return (0);
}
if (i == n) {
return (0);
}
if (dp[i][w] != -1) {
return (dp[i][w]);
}
long long int op1 = -1, op2 = -1;
op1 = solve(a... | #include <algorithm>
#include <iostream>
using namespace std;
long long int dp[101][100001];
long long int solve(int **a, int i, long long int w, int n) {
if (w == 0) {
return (0);
}
if (i == n) {
return (0);
}
if (dp[i][w] != -1) {
return (dp[i][w]);
}
long long int op1 = -1, op2 = -1;
op1... | [
"variable_declaration.type.widen.change"
] | 964,790 | 964,791 | u643355770 | cpp |
p03163 | /*
Created on Fri Aug 25 16:34:06 2020
@author: roastedcoder
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
const int mod = 1e9 + 7;
#define endl "\n"
#define append push_back
#define roastedcoder \
... | /*
Created on Fri Aug 25 16:34:06 2020
@author: roastedcoder
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
const int mod = 1e9 + 7;
#define endl "\n"
#define append push_back
#define roastedcoder \
... | [] | 964,792 | 964,793 | u078505805 | cpp |
p03163 | /*
Created on Fri Aug 25 16:34:06 2020
@author: roastedcoder
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
const int mod = 1e9 + 7;
#define endl "\n"
#define append push_back
#define roastedcoder \
... | /*
Created on Fri Aug 25 16:34:06 2020
@author: roastedcoder
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
const int mod = 1e9 + 7;
#define endl "\n"
#define append push_back
#define roastedcoder \
... | [
"variable_declaration.type.change"
] | 964,794 | 964,793 | u078505805 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int wt[100005];
int val[100005];
int ans[10005][10005];
int N, w;
int ks(int n, int c) {
if (ans[n][c] != -1)
return ans[n][c];
if (n == 0 or c == 0)
return 0;
if (wt[n - 1] > c)
return ks(n - 1, c);
int a = ks(n - 1, c);
int b = ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int wt[105];
int val[105];
int ans[105][100005];
int N, w;
int ks(int n, int c) {
if (ans[n][c] != -1)
return ans[n][c];
if (n == 0 or c == 0)
return 0;
if (wt[n - 1] > c)
return ks(n - 1, c);
int a = ks(n - 1, c);
int b = val[n -... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,800 | 964,796 | u578753285 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input1.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, w;
cin >> n >> w;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
vector<int> d... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input1.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, w;
cin >> n >> w;
vector<long long int> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
vec... | [
"variable_declaration.type.widen.change"
] | 964,803 | 964,804 | u339560028 | cpp |
p03163 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
void max_self(ll &a, ll b) { a = max(a, b); }
int main() {
ll N, W;
cin >> N >> W;
vector<ll> dp(W + 1);
... |
#include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
void max_self(ll &a, ll b) { a = max(a, b); }
int main() {
ll N, W;
cin >> N >> W;
vector<ll> dp(W + 1);
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 964,809 | 964,808 | u772397797 | cpp |
p03163 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
void max_self(ll &a, ll b) { a = max(a, b); }
int main() {
ll N, W;
cin >> N >> W;
vector<ll> dp(W + 1, 0)... |
#include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
void max_self(ll &a, ll b) { a = max(a, b); }
int main() {
ll N, W;
cin >> N >> W;
vector<ll> dp(W + 1);
... | [
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 964,810 | 964,808 | u772397797 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int dp... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
ll dp[... | [
"variable_declaration.type.change"
] | 964,811 | 964,812 | u280175105 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int nxx = 1e5 + 5;
vector<pair<long long, long long>> v(101);
int dp[101][nxx];
int n, k;
long long ans(int i, int k) {
if (i == n || k == 0) {
return 0;
}
if (v[i].first > k)
return ans(i + 1, k);
if (dp[i][k] != -1)
return dp[i][k];
else {
... | #include <bits/stdc++.h>
using namespace std;
const int nxx = 1e5 + 5;
vector<pair<long long, long long>> v(101);
long long dp[101][nxx];
int n, k;
long long ans(int i, int k) {
if (i == n || k == 0) {
return 0;
}
if (v[i].first > k)
return ans(i + 1, k);
if (dp[i][k] != -1)
return dp[i][k];
el... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 964,819 | 964,820 | u690116847 | cpp |
p03163 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | [] | 964,821 | 964,822 | u280982574 | cpp |
p03163 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | [] | 964,821 | 964,823 | u280982574 | cpp |
p03163 | // https://atcoder.jp/contests/dp/tasks/dp_d
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define gcd __gcd
#define inf INT_MAX
#define INF LLONG_MAX
#define minf INT_MIN
#d... | // https://atcoder.jp/contests/dp/tasks/dp_d
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define gcd __gcd
#define inf INT_MAX
#define INF LLONG_MAX
#define minf INT_MIN
#d... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 964,826 | 964,825 | u315416184 | cpp |
p03163 | // https://atcoder.jp/contests/dp/tasks/dp_d
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define gcd __gcd
#define inf INT_MAX
#define INF LLONG_MAX
#define minf INT_MIN
#d... | // https://atcoder.jp/contests/dp/tasks/dp_d
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define gcd __gcd
#define inf INT_MAX
#define INF LLONG_MAX
#define minf INT_MIN
#d... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,829 | 964,825 | u315416184 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define inf (1e9 + 7)
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define inf (1e9 + 7)
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"... | 964,830 | 964,831 | u315416184 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector<pair<ll, ll>>
#define plli pair<ll, ll... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector<pair<ll, ll>>
#define plli pair<ll, ll... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 964,836 | 964,837 | u029912106 | cpp |
p03163 | #include <bits/stdc++.h>
#define fly \
ios::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr)
using namespace std;
int main(... | #include <bits/stdc++.h>
#define fly \
ios::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr)
using namespace std;
int main(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 964,838 | 964,839 | u477700362 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, w;
int dp[100001][1001];
int v[100001][1001];
int w1[100001];
int v1[100001];
int s1(int wr, int i) {
if (wr < 0) {
return INT_MIN;
}
if (i == n + 1) {
return 0;
}
if (v[wr][i]) {
return dp[wr][i];
}
v[wr][i] = 1;
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, w;
int dp[100001][101];
int v[100001][101];
int w1[101];
int v1[101];
int s1(int wr, int i) {
if (wr < 0) {
return INT_MIN;
}
if (i == n + 1) {
return 0;
}
if (v[wr][i]) {
return dp[wr][i];
}
v[wr][i] = 1;
dp[wr][i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,843 | 964,844 | u976563729 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pi pair<ll, ll>
#define pii vector<pair<ll, ll>>
#define v vector
#define vi vector<ll>
#define f(a, i, n) for (int i = a; i < n; i++)
#define pb push_back
#define mp make_pair
#define MOD 10... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pi pair<ll, ll>
#define pii vector<pair<ll, ll>>
#define v vector
#define vi vector<ll>
#define f(a, i, n) for (int i = a; i < n; i++)
#define pb push_back
#define mp make_pair
#define MOD 10... | [
"assignment.change"
] | 964,845 | 964,846 | u540062470 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> price(n), pages(n);
for (int i = 0; i < n; i++) {
cin >> price[i] >> pages[i];
}
vector<int> dp(x + 1, 0);
for (int i = 0; i < n; i++) {
for (int j = x; j >= price[i]; j--)
dp[j] = max(dp[j], pag... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<long long> price(n), pages(n);
for (int i = 0; i < n; i++) {
cin >> price[i] >> pages[i];
}
vector<long long> dp(x + 1, 0);
for (int i = 0; i < n; i++) {
for (int j = x; j >= price[i]; j--)
dp[j] = ma... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 964,849 | 964,850 | u193037962 | cpp |
p03163 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define ff first
#define ss second
#define inf 9e18
#define pii pair<int, int>
#define fastio \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define ff first
#define ss second
#define inf 9e18
#define pii pair<int, int>
#define fastio \
ios_base::sync_with_stdio(0); ... | [
"identifier.change"
] | 964,856 | 964,857 | u660479949 | cpp |
p03163 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, c;
cin >> n >> c;
long long val[n], wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
long long dp[c + 1];
for (int i = 0; i <= n; i++) {
for (int j = c; j <= 0; j--) {
if (i == 0 || j == 0)
dp[j] = 0;... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, c;
cin >> n >> c;
long long val[n], wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
long long dp[c + 1];
for (int i = 0; i <= n; i++) {
for (int j = c; j >= 0; j--) {
if (i == 0 || j == 0)
dp[j] = 0;... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 964,858 | 964,859 | u707252821 | cpp |
p03163 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, c;
cin >> n >> c;
long long val[n], wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
long long dp[n + 1][c + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= c; j++) {
if (i == 0 || j == 0)
dp[i... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, c;
cin >> n >> c;
long long val[n], wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
long long dp[n + 1][c + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= c; j++) {
if (i == 0 || j == 0)
dp[... | [
"io.output.change"
] | 964,860 | 964,861 | u707252821 | cpp |
p03163 | #include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
for (int i = 0; i < N; ++i) {
cin >> w[i] >> v[i];
}
int dp[N + 1][W + 1];
for (int i = 0; i <= W; ++i) {
dp[0][i] = 0;
}
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= W; ++j) {
if (... | #include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
for (int i = 0; i < N; ++i) {
cin >> w[i] >> v[i];
}
long long dp[N + 1][W + 1];
for (int i = 0; i <= W; ++i) {
dp[0][i] = 0;
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= W; ++j) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 964,880 | 964,881 | u321492259 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i ... | [
"call.arguments.change",
"expression.operation.unary.remove"
] | 964,884 | 964,885 | u296160120 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// knapsack
struct item {
int wt, val;
};
ll solve(vector<item> ar, int n, int W) {
int dp[n + 1][W + 1];
for (int w = 0; w <= W; w++) {
dp[1][w] = 0;
}
dp[1][ar[1].wt] = ar[1].val;
for (int i = 2; i <= n; i++) {
for (int w = 0; w <=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// knapsack
struct item {
int wt, val;
};
ll solve(vector<item> ar, int n, int W) {
ll dp[n + 1][W + 1];
for (ll w = 0; w <= W; w++) {
dp[1][w] = 0;
}
dp[1][ar[1].wt] = ar[1].val;
for (ll i = 2; i <= n; i++) {
for (ll w = 0; w <= W; ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 964,956 | 964,957 | u411727360 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
int n, capacity;
cin >> n >> capacity;
vector<ll> weights(n), values(n);
for (int i = 0; i < n; i++)
cin >> weights[i] >> values[i];
vector<vector<ll>> dp(n, vector<ll>(capaci... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
int n, capacity;
cin >> n >> capacity;
vector<ll> weights(n), values(n);
for (int i = 0; i < n; i++)
cin >> weights[i] >> values[i];
vector<vector<ll>> dp(n, vector<ll>(capaci... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 964,962 | 964,963 | u712474804 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll t[10001][101];
int knapsackdpTab(ll val[], ll wt[], ll w, ll n) // Tabulation
{
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < n + 1; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (int i = 1; i < w + 1; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll t[100001][101];
ll knapsackdpTab(ll val[], ll wt[], ll w, ll n) // Tabulation
{
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < n + 1; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (int i = 1; i < w + 1; i++) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,964 | 964,965 | u043995126 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll t[100001][101];
int knapsackdpTab(ll val[], ll wt[], ll w, ll n) // Tabulation
{
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < n + 1; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (int i = 1; i < w + 1; i++)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll t[100001][101];
ll knapsackdpTab(ll val[], ll wt[], ll w, ll n) // Tabulation
{
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < n + 1; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (int i = 1; i < w + 1; i++) ... | [] | 964,966 | 964,965 | u043995126 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll t[1000001][101];
int knapsackdpTab(ll val[], ll wt[], ll w, ll n) // Tabulation
{
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < n + 1; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (int i = 1; i < w + 1; i++... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll t[100001][101];
ll knapsackdpTab(ll val[], ll wt[], ll w, ll n) // Tabulation
{
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < n + 1; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (int i = 1; i < w + 1; i++) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,967 | 964,965 | u043995126 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll t[100002][102];
int knapsackdpTab(ll val[], ll wt[], ll w, ll n) // Tabulation
{
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < n + 1; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (int i = 1; i < w + 1; i++)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll t[100001][101];
ll knapsackdpTab(ll val[], ll wt[], ll w, ll n) // Tabulation
{
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < n + 1; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (int i = 1; i < w + 1; i++) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,968 | 964,965 | u043995126 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll t[1002][102];
int knapsackdpTab(ll val[], ll wt[], ll w, ll n) // Tabulation
{
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < n + 1; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (int i = 1; i < w + 1; i++) {... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll t[100001][101];
ll knapsackdpTab(ll val[], ll wt[], ll w, ll n) // Tabulation
{
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < n + 1; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (int i = 1; i < w + 1; i++) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,969 | 964,965 | u043995126 | cpp |
p03163 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int LIM = 105;
int n, w;
int q[LIM];
long long ans = 0, sum[100005], v[LIM];
int main() {
cin >> n >> w;
for (int i = 1; i <= n; ++i)
cin >> q[i] >> v[i];
vector<int> s; // vector cu g... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int LIM = 105;
int n, w;
int q[LIM];
long long ans = 0, sum[100005], v[LIM];
int main() {
cin >> n >> w;
for (int i = 1; i <= n; ++i)
cin >> q[i] >> v[i];
vector<int> s;
for (int j ... | [] | 964,971 | 964,972 | u841608305 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
int MAX = 1e9;
int MAXEST = 1e18;
int MOD = 1e9 + 7;
int n, w;
int v[105], s[105];
int dp[2][100005];
in main() {
int tc = 1;
// cin>>tc;
while (tc--) {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> s[i]... | #include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
int MAX = 1e9;
int MAXEST = 1e18;
int MOD = 1e9 + 7;
int n, w;
int v[105], s[105];
int dp[2][100005];
in main() {
int tc = 1;
// cin>>tc;
while (tc--) {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> s[i]... | [
"expression.operation.binary.add"
] | 964,973 | 964,974 | u727767116 | cpp |
p03163 | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostre... | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostre... | [
"literal.number.change",
"call.arguments.change"
] | 964,976 | 964,977 | u345693891 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int W;
cin >> N >> W;
vector<int> weight(110);
vector<int> value(110);
for (int i = 0; i < N; i++) {
cin >> weight.at(i) >> value.at(i);
}
vector<vector<int>> dp(110, vector<int>(100100, 0));
//ちょうどWのときの最大の価値を計算
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int W;
cin >> N >> W;
vector<int> weight(110);
vector<int> value(110);
for (int i = 0; i < N; i++) {
cin >> weight.at(i) >> value.at(i);
}
vector<vector<long long int>> dp(110, vector<long long int>(100100, 0));
//ちょうどWのときの最大の価値を計... | [
"variable_declaration.type.widen.change"
] | 964,980 | 964,981 | u120586196 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long int W;
cin >> N >> W;
vector<long long int> weight(110);
vector<long long int> value(110);
for (int i = 0; i < N; i++) {
cin >> weight.at(i) >> value.at(i);
}
vector<vector<long long int>> dp(110, vector<long long int>(1000... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int W;
cin >> N >> W;
vector<long long int> weight(110);
vector<long long int> value(110);
for (int i = 0; i < N; i++) {
cin >> weight.at(i) >> value.at(i);
}
vector<vector<long long int>> dp(110, vector<long long int>(100100, 0));
... | [
"literal.number.change",
"call.arguments.change"
] | 964,986 | 964,983 | u120586196 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long int W;
cin >> N >> W;
vector<long long int> weight(110);
vector<long long int> value(110);
for (int i = 0; i < N; i++) {
cin >> weight.at(i) >> value.at(i);
}
vector<vector<long long int>> dp(110, vector<long long int>(1000... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long int W;
cin >> N >> W;
vector<long long int> weight(110);
vector<long long int> value(110);
for (int i = 0; i < N; i++) {
cin >> weight.at(i) >> value.at(i);
}
vector<vector<long long int>> dp(110, vector<long long int>(1001... | [
"literal.number.change",
"call.arguments.change",
"call.arguments.add"
] | 964,988 | 964,987 | u120586196 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define in long long int
int dp[101][100001];
in knapsack(vector<in> &w, vector<in> &v, in n, in cap) {
if (n == 0 || cap == 0)
return 0;
if (dp[n][cap] != -1)
return dp[n][cap];
if (w[n - 1] <= cap)
dp[n][cap] = max(v[n - 1] + knapsack... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define in long long int
in dp[101][100001];
in knapsack(vector<in> &w, vector<in> &v, in n, in cap) {
if (n == 0 || cap == 0)
return 0;
if (dp[n][cap] != -1)
return dp[n][cap];
if (w[n - 1] <= cap)
dp[n][cap] = max(v[n - 1] + knapsack(... | [
"variable_declaration.type.change"
] | 964,994 | 964,995 | u848144297 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, w;
cin >> n >> w;
vector<int> dp(w + 1);
while (n--) {
int we, va;
cin >> we >> va;
for (int j = w - we; j >= 0; --j) {
dp[j + we] = max(dp[j + we], dp[j] + va);
}
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, w;
cin >> n >> w;
vector<long long> dp(w + 1);
while (n--) {
int we, va;
cin >> we >> va;
for (int j = w - we; j >= 0; --j) {
dp[j + we] = max(dp[j + we], dp[j] + va);
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,011 | 965,012 | u049708565 | cpp |
p03163 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
long long n, m;
cin >> n >> m;
long long arr[n][2];
for (long long i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1];
}
long long dp[n + 1][m + 1];
for (long long j = 0; j < m + 1; j++) {
for (long long i = 0; i <... | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
long long n, m;
cin >> n >> m;
long long arr[n][2];
for (long long i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1];
}
long long dp[n + 1][m + 1];
for (long long j = 0; j < m + 1; j++) {
for (long long i = 0; i <... | [
"identifier.change",
"io.output.change",
"io.output.newline.add"
] | 965,015 | 965,016 | u407743105 | cpp |
p03163 |
#include <algorithm>
#include <iostream>
using namespace std;
const int MAXN = 100;
const int MAXW = 100000;
unsigned long long dp[MAXN + 1][MAXW + 1];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, W;
cin >> n >> W;
int v[n], w[n];
for (int i = 0; i < n; i++) {
cin >> w[i] ... |
#include <algorithm>
#include <iostream>
using namespace std;
const int MAXN = 100;
const int MAXW = 100000;
unsigned long long dp[MAXN + 1][MAXW + 1];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, W;
cin >> n >> W;
int v[n + 1], w[n + 1];
for (int i = 1; i <= n; i++) {
cin... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 965,021 | 965,022 | u278097351 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define fastii \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define endl "\n"... | #include <bits/stdc++.h>
using namespace std;
#define fastii \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define endl "\n"... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 965,030 | 965,029 | u970254260 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, maxw;
int w[111], v[111];
int f[111111];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n >> maxw;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; ++i) {
for (int j = maxw;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, maxw;
int w[111], v[111];
ll f[111111];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n >> maxw;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; ++i) {
for (int j = maxw; ... | [
"variable_declaration.type.change"
] | 965,037 | 965,038 | u448205469 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, maxw;
int w[111], v[111];
int f[111][111111];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n >> maxw;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; ++i) {
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, maxw;
int w[111], v[111];
ll f[111][111111];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n >> maxw;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
// for(int i = 1; i <= maxw; ++i) f[1][i] = i >= ... | [
"variable_declaration.type.change"
] | 965,039 | 965,040 | u448205469 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
int dp[N + 1][W + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
ll dp[N + 1][W + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= W; j++) {
if (i ==... | [
"variable_declaration.type.change"
] | 965,041 | 965,042 | u448570453 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using namespace std;
ll dp[101][101010];
int main() {
int N, W;
cin >> N >> W;
vector<ll> w(N), v(N);
rep(i, N) cin >> w[i + 1] >> v[i + 1];
for (int i = 1; i <= N; ++i) {
fo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using namespace std;
ll dp[101][101010];
int main() {
int N, W;
cin >> N >> W;
vector<ll> w(N + 1), v(N + 1);
rep(i, N) cin >> w[i + 1] >> v[i + 1];
for (int i = 1; i <= N; ++i) ... | [
"assignment.change"
] | 965,043 | 965,044 | u482544950 | cpp |
p03163 | /*"Everything in the universe is balanced. Every disappointment
you face in life will be balanced by something good for you!
Keep going, never give up." */
#include "bits/stdc++.h"
using namespace std;
#define ll long long
const ll N = 1e6 + 9;
const ll mod = 1e9 + 7;
ll a[N];
void sol... | /*"Everything in the universe is balanced. Every disappointment
you face in life will be balanced by something good for you!
Keep going, never give up." */
#include "bits/stdc++.h"
using namespace std;
#define ll long long
const ll N = 1e6 + 9;
const ll mod = 1e9 + 7;
ll a[N];
void sol... | [
"variable_declaration.type.widen.change"
] | 965,045 | 965,046 | u947134954 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, wt;
cin >> n >> wt;
vector<int> w(n + 1), v(n + 1);
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> dp(n, vector<int>(wt + 1));
for (int i = 1; i <= n; i++)
for (int j = 0; j < wt + 1; j+... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, wt;
cin >> n >> wt;
vector<int> w(n + 1), v(n + 1);
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> dp(n + 1, vector<int>(wt + 1));
for (int i = 1; i <= n; i++)
for (int j = 0; j < wt + 1... | [
"assignment.change"
] | 965,051 | 965,052 | u389500770 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, wt;
cin >> n >> wt;
vector<int> w(n + 1), v(n + 1);
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> dp(n, vector<int>(wt + 1));
for (int i = 1; i < n; i++)
for (int j = 0; j < wt + 1; j++... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, wt;
cin >> n >> wt;
vector<int> w(n + 1), v(n + 1);
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> dp(n + 1, vector<int>(wt + 1));
for (int i = 1; i <= n; i++)
for (int j = 0; j < wt + 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 965,053 | 965,052 | u389500770 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, wt;
cin >> n >> wt;
vector<int> w(n), v(n);
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> dp(n, vector<int>(wt + 1));
// dp[i][j]->max value with j weight after processing 1st i wts.
// dp[i][j]=max(dp[i-1][j-w... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, wt;
cin >> n >> wt;
vector<int> w(n), v(n);
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> dp(n, vector<int>(wt + 1));
// dp[i][j]->max value with j weight after processing 1st i wts.
// dp... | [] | 965,054 | 965,055 | u389500770 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (i = 0; i < n; i++)
#define pb push_back
#define lli long long int
#define all(v) (v.begin(), v.end())
#define fr first
#define sc second
#define mp make_pair
using namespace std;
int wt[100], val[100];
lli dp[10000][10000];
lli rec(int n, int s) {
if... | #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (i = 0; i < n; i++)
#define pb push_back
#define lli long long int
#define all(v) (v.begin(), v.end())
#define fr first
#define sc second
#define mp make_pair
using namespace std;
int wt[100], val[100];
lli dp[105][100005];
lli rec(int n, int s) {
if ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 965,062 | 965,063 | u431403516 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
// int dp[1000][1000]={-1};
ll solve(ll i, ll j, ll weig, vector<ll> &weight, vector<ll> &value,
vector<vector<ll>> &dp) {
if (i >= j)
return 0;
if (weig <= 0)
return 0;
if (dp[i][weig] != -1) {
return dp[i][weig];
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll solve(ll i, ll j, ll weig, vector<ll> &weight, vector<ll> &value,
vector<vector<ll>> &dp) {
if (i > j)
return 0;
if (weig <= 0)
return 0;
if (dp[i][weig] != -1) {
return dp[i][weig];
}
if (weight[i] > weig) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"call.arguments.change"
] | 965,068 | 965,069 | u309322226 | cpp |
p03163 |
#include <bits/stdc++.h>
using namespace std;
int max(int a, int b) {
if (a > b)
return a;
return b;
}
int main() {
int N, W;
cin >> N >> W;
int i;
int VW[N][2];
for (i = 0; i < N; i++) {
cin >> VW[i][0] >> VW[i][1];
}
int KS[N + 1][W + 1];
for (int n = 0; n < N + 1; n++) {
for (int w... |
#include <bits/stdc++.h>
using namespace std;
int max(int a, int b) {
if (a > b)
return a;
return b;
}
int main() {
int N, W;
cin >> N >> W;
int i;
long long int VW[N][2];
for (i = 0; i < N; i++) {
cin >> VW[i][0] >> VW[i][1];
}
long long int KS[N + 1][W + 1];
for (int n = 0; n < N + 1; n... | [
"variable_declaration.type.widen.change"
] | 965,074 | 965,075 | u245521778 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FORN(i, j, k) for (int i = j; i < k; i++)
#define FORR(i, j, k) for (int i = j; i >= k; i--)
#... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FORN(i, j, k) for (int i = j; i < k; i++)
#define FORR(i, j, k) for (int i = j; i >= k; i--)
#... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 965,087 | 965,088 | u426335391 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator> // std::back_inserter
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define r... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator> // std::back_inserter
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define r... | [
"call.arguments.change"
] | 965,095 | 965,096 | u272628953 | cpp |
p03163 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [
"control_flow.branch.if.condition.change"
] | 965,109 | 965,110 | u264265458 | cpp |
p03163 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [
"control_flow.branch.if.condition.change"
] | 965,109 | 965,111 | u264265458 | cpp |
p03163 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"assignment.change",
"variable_access.subscript.index.change"
] | 965,112 | 965,113 | u264265458 | cpp |
p03163 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [
"assignment.change"
] | 965,112 | 965,114 | u264265458 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
// input_from_file;
ll n, k, sum = 0;
;
cin >> n >> k;
vector<ll> wt(n + 1... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
// input_from_file;
ll n, k, sum = 0;
;
cin >> n >> k;
vector<ll> wt(n + 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 965,117 | 965,118 | u066630187 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.