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 |
|---|---|---|---|---|---|---|---|
p03163 | #include <bits/stdc++.h>
using namespace std;
int n, W, dp[105][100005], v[105], w[105], ans;
int main() {
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i <= n; i++)
dp[i][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (j >= ... | #include <bits/stdc++.h>
using namespace std;
long long n, W, dp[105][100005], v[105], w[105], ans;
int main() {
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i <= n; i++)
dp[i][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,433 | 965,434 | u483551214 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a) * (a)
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugv(v) \
cerr << #v << " : ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a) * (a)
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugv(v) \
cerr << #v << " : ... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,437 | 965,439 | u438469926 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a) * (a)
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugv(v) \
cerr << #v << " : ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a) * (a)
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugv(v) \
cerr << #v << " : ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,440 | 965,439 | u438469926 | cpp |
p03163 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | [
"call.add",
"call.arguments.change"
] | 965,441 | 965,442 | u714724786 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int dp[101][100001];
long long maxProfit(vector<int> &w, vector<int> &v, int n, int W) {
if (n == 0 || W == 0)
return 0;
if (dp[n][W] != -1)
return dp[n][W];
if (w[n - 1] <= W)
return dp[n][W] = max(v[n - 1] + maxProfit(w, v, n - 1, W - w[n - 1]),
... | #include <bits/stdc++.h>
using namespace std;
long long dp[101][100001];
long long maxProfit(vector<int> &w, vector<int> &v, int n, int W) {
if (n == 0 || W == 0)
return 0;
if (dp[n][W] != -1)
return dp[n][W];
if (w[n - 1] <= W)
return dp[n][W] = max(v[n - 1] + maxProfit(w, v, n - 1, W - w[n - 1]),
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,443 | 965,444 | u257062721 | cpp |
p03163 | #include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define MOD 10000000000000007
#define MOD9 1000000009
#define pi 3.1415926535
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define eps 0.000001
#define all(v) v.be... | #include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define MOD 10000000000000007
#define MOD9 1000000009
#define pi 3.1415926535
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define eps 0.000001
#define all(v) v.be... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 965,445 | 965,446 | u269759214 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
struct item {
ll weight;
ll value;
};
ll solve(ll n, ll w, vector<item> &v) {
ll dp[n + 1][w + 1]; // w is the maximum capacity that the bag can hold....
// agr app 1 pr hu to sirf vo he item ko le sakte hu jiska weight... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
struct item {
ll weight;
ll value;
};
ll solve(ll n, ll w, vector<item> &v) {
ll dp[n + 1][w + 1]; // w is the maximum capacity that the bag can hold....
// agr app 1 pr hu to sirf vo he item ko le sakte hu jiska weight... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 965,486 | 965,487 | u881931540 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
struct item {
ll weight;
ll value;
};
ll solve(ll n, ll w, vector<item> &v) {
ll dp[n + 1][w + 1]; // w is the maximum capacity that the bag can hold....
// agr app 1 pr hu to sirf vo he item ko le sakte hu jiska weight... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
struct item {
ll weight;
ll value;
};
ll solve(ll n, ll w, vector<item> &v) {
ll dp[n + 1][w + 1]; // w is the maximum capacity that the bag can hold....
// agr app 1 pr hu to sirf vo he item ko le sakte hu jiska weight... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 965,488 | 965,487 | u881931540 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long dp[101][(int)pow(10, 5) + 1] = {0};
int value[101];
int weight[101];
int main() {
int n, w;
cin >> n >> w;
for (int i = 0; i < n; i++)
cin >> weight[i] >> value[i];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
dp[i][j] = dp[i... | #include <bits/stdc++.h>
using namespace std;
long long dp[101][(int)pow(10, 5) + 1] = {0};
int value[101];
int weight[101];
int main() {
int n, w;
cin >> n >> w;
for (int i = 0; i < n; i++)
cin >> weight[i] >> value[i];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
dp[i][j] = dp[i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 965,491 | 965,492 | u958745398 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
long long actionFunction(vector<int> &weights, vector<long long> &values,
int maxWeightCapacity) {
if (weights.size() == 0 || maxWeightCapacity < 0)
return 0;
vector<vector<long long>> dp(... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
long long actionFunction(vector<int> &weights, vector<long long> &values,
int maxWeightCapacity) {
if (weights.size() == 0 || maxWeightCapacity < 0)
return 0;
vector<vector<long long>> dp(... | [
"expression.operation.binary.remove"
] | 965,495 | 965,496 | u309984532 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
long long actionFunction(vector<int> &weights, vector<long long> &values,
int maxWeightCapacity) {
if (weights.size() == 0 || maxWeightCapacity < 0)
return 0;
vector<vector<long long>> dp(... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
long long actionFunction(vector<int> &weights, vector<long long> &values,
int maxWeightCapacity) {
if (weights.size() == 0 || maxWeightCapacity < 0)
return 0;
vector<vector<long long>> dp(... | [
"expression.operation.binary.remove"
] | 965,497 | 965,496 | u309984532 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long int lmax(long long int a, long long int b) {
if (a < b)
return b;
else
return a;
}
int main() {
long long int n, W;
cin >> n >> W;
vector<long long int> w(n);
vector<long long int> v(n);
for (long long int i = 0; i < n; i++) {
cin >> w[i]... | #include <bits/stdc++.h>
using namespace std;
long long int lmax(long long int a, long long int b) {
if (a < b)
return b;
else
return a;
}
int main() {
long long int n, W;
cin >> n >> W;
vector<long long int> w(n);
vector<long long int> v(n);
for (long long int i = 0; i < n; i++) {
cin >> w[i]... | [
"assignment.change"
] | 965,498 | 965,499 | u685983477 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n, we;
cin >> n >> we;
vector<long long> w(n);
vector<long long> v(n);
for (int i = 0; i < n; i++) {
cin >> w.at(i) >> v.at(i);... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n, we;
cin >> n >> we;
vector<long long> w(n);
vector<long long> v(n);
for (int i = 0; i < n; i++) {
cin >> w.at(i) >> v.at(i);... | [
"call.arguments.change",
"call.arguments.add"
] | 965,513 | 965,514 | u507351098 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct items {
int wt;
int val;
};
long long solution(vector<items> a, int n, int W) {
int dp[n + 1][W + 1];
for (int w = 0; w <= W; w++) {
dp[1][w] = 0;
}
dp[1][a[1].wt] = a[1].val;
for (int i = 2; i <= n; i++) {
for... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct items {
int wt;
int val;
};
long long solution(vector<items> a, int n, int W) {
long long dp[n + 1][W + 1];
for (int w = 0; w <= W; w++) {
dp[1][w] = 0;
}
dp[1][a[1].wt] = a[1].val;
for (int i = 2; i <= n; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,515 | 965,516 | u117708638 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int a[n], b[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
int x[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
x[i][j] = 0;
else if (j <... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, w;
cin >> n >> w;
long a[n], b[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
long x[n + 1][w + 1];
for (long i = 0; i <= n; i++) {
for (long j = 0; j <= w; j++) {
if (i == 0 || j == 0)
x[i][j] = 0;
else if... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 965,517 | 965,518 | u691174533 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | [
"expression.operation.binary.add"
] | 965,519 | 965,520 | u856445425 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int MAX = 1e5;
int n, w;
vector<vector<int>> dp(100, vector<int>(MAX + 1));
vector<int> wi(100);
vector<int> vi(100);
ll calc(int index, int weight) {
if (index == n) {
return 0;
}
if (dp[index][weight] != -1) {
return dp[index]... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int MAX = 1e5;
int n, w;
vector<vector<ll>> dp(100, vector<ll>(MAX + 1));
vector<int> wi(100);
vector<int> vi(100);
ll calc(int index, int weight) {
if (index == n) {
return 0;
}
if (dp[index][weight] != -1) {
return dp[index][w... | [
"call.arguments.change",
"variable_declaration.type.change"
] | 965,521 | 965,522 | u711132198 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"variable_access.subscript.index.change"
] | 965,525 | 965,526 | u548791035 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,527 | 965,526 | u548791035 | cpp |
p03163 | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | [
"variable_declaration.type.change"
] | 965,528 | 965,529 | u340424586 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
void rwf() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 105, mxW = 1e5 + 5;
int n, W, w[N], v[N];
int dp[N][mxW];
int solve(int wr, int m) {
if (m == 0... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
void rwf() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 105, mxW = 1e5 + 5;
int n, W, w[N], v[N];
int dp[N][mxW];
int solve(int wr, int m) {
if (m == 0... | [
"call.remove"
] | 965,541 | 965,542 | u870088166 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
vector<long long> p;
vector<long long> val;
long long W;
long long n;
int knapSack() {
long long DP[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int i1 = 0; i1 <= W; i1++) {
if (i == 0 || i1 == 0) {
DP[i][i1] = 0;
} else {
if (p[i -... | #include <bits/stdc++.h>
using namespace std;
vector<long long> p;
vector<long long> val;
long long W;
long long n;
long long knapSack() {
long long DP[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int i1 = 0; i1 <= W; i1++) {
if (i == 0 || i1 == 0) {
DP[i][i1] = 0;
} else {
if ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,543 | 965,544 | u365691497 | cpp |
p03163 |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ll long long
#define pb push_back
#define mp make_pair
#define inp(x) cin >> x
#define print(x) cout << x
#define pii pair<int, int>
#define pll pair<ll, ll>
#define gcd(a, b) __gcd(a, b)
#define reset(d, val) memset(d, val, sizeof... |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ll long long
#define pb push_back
#define mp make_pair
#define inp(x) cin >> x
#define print(x) cout << x
#define pii pair<int, int>
#define pll pair<ll, ll>
#define gcd(a, b) __gcd(a, b)
#define reset(d, val) memset(d, val, sizeof... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 965,547 | 965,548 | u925841581 | cpp |
p03163 |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ll long long
#define pb push_back
#define mp make_pair
#define inp(x) cin >> x
#define print(x) cout << x
#define pii pair<int, int>
#define pll pair<ll, ll>
#define gcd(a, b) __gcd(a, b)
#define reset(d, val) memset(d, val, sizeof... |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ll long long
#define pb push_back
#define mp make_pair
#define inp(x) cin >> x
#define print(x) cout << x
#define pii pair<int, int>
#define pll pair<ll, ll>
#define gcd(a, b) __gcd(a, b)
#define reset(d, val) memset(d, val, sizeof... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"misc.opposites",
"assignment.value.change",
"call.function.change"
] | 965,549 | 965,548 | u925841581 | cpp |
p03163 |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#defin... |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#defin... | [
"assignment.change"
] | 965,552 | 965,553 | u918403704 | cpp |
p03163 | #include <bits/stdc++.h>
//#define int long long
typedef long long ll;
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define forn(i, n) fore(i, 0, n)
#define fori(i, l, r) fore(i, l, (r) + 1)
#define sz(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#def... | #include <bits/stdc++.h>
//#define int long long
typedef long long ll;
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define forn(i, n) fore(i, 0, n)
#define fori(i, l, r) fore(i, l, (r) + 1)
#define sz(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#def... | [
"variable_declaration.type.change"
] | 965,554 | 965,555 | u412316386 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int KnapSack(int W, vector<int> val, vector<int> wt, int n) {
vector<vector<int>> K(n + 1, vector<int>(W + 1));
for (int i = 0; i <= n; i++) {
for (int w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (wt[i - 1] <= w)
K[... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int KnapSack(int W, vector<int> val, vector<int> wt, int n) {
vector<vector<int>> K(n + 1, vector<int>(W + 1));
for (int i = 0; i <= n; i++) {
for (int w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (wt[i... | [
"variable_declaration.type.primitive.change"
] | 965,565 | 965,566 | u405337522 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int knapSackRec(int W, int wt[], int val[], int i, int **dp) {
if (i < 0)
return 0;
if (dp[i][W] != -1)
return dp[i][W];
if (wt[i] > W) {
// Store the value of function call
// stack in table before return
dp[i][W] = knapSackRec(W, wt, val, i - ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int knapSackRec(int W, int wt[], int val[], int i, int **dp) {
if (i < 0)
return 0;
if (dp[i][W] != -1)
return dp[i][W];
if (wt[i] > W) {
// Store the value of function call
// stack in table before return
dp[i][W] = knapSa... | [
"variable_declaration.type.primitive.change"
] | 965,567 | 965,568 | u405337522 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n), v(n);
vector<long long int> dp(W + 1, 0);
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = W; j >= 0; j--) {
dp[j] = max(dp[j], dp[j - w[i]] +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n), v(n);
vector<long long int> dp(W + 1, 0);
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = W; j >= w[i]; j--) {
dp[j] = max(dp[j], dp[j - w[i]... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 965,569 | 965,570 | u558282734 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int dp[100001];
for (int i = 0; i <= W; i++)
dp[i] = 0;
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = W; j >= w; j--) {
dp[j] = max(dp[j], dp[j - w] + v);
}
}
cout << dp[W... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
long long dp[100001];
for (int i = 0; i <= W; i++)
dp[i] = 0;
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = W; j >= w; j--) {
dp[j] = max(dp[j], dp[j - w] + v);
}
}
cout <... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,571 | 965,572 | u929569377 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll mod = 1e9 + 7;
#define PI 3.1415926535897932385
#define INF 100000000000000000ll
#define fastio \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll mod = 1e9 + 7;
#define PI 3.1415926535897932385
#define INF 100000000000000000ll
#define fastio \
ios_base::sync_with_stdio(false); ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 965,580 | 965,581 | u268750247 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
/*long maxValue(int n, int w, vector<int>& weight, vector<int>& value, int i) {
if (w <= 0 or i == n) return 0;
cout << w << endl;
if (w-weight[i] < 0) return maxValue (n, w, weight, value, i+1);
return (long) max ((long) value[i] + maxValue ... | #include <bits/stdc++.h>
using namespace std;
/*long maxValue(int n, int w, vector<int>& weight, vector<int>& value, int i) {
if (w <= 0 or i == n) return 0;
cout << w << endl;
if (w-weight[i] < 0) return maxValue (n, w, weight, value, i+1);
return (long) max ((long) value[i] + maxValue ... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 965,586 | 965,587 | u275673917 | cpp |
p03163 | /*
Author : Simanta Deb Turja
*/
#include <bits/stdc++.h>
using namespace std;
#define Professor
using ll = long long;
using i64 = unsigned long long;
template <typename T> inline T Min(T a, T b, T c) { return min(a, min(b, c)); }
template <typename T> inline T Min(T a, T b, T c, T d) {
return min(a, min(b, mi... | /*
Author : Simanta Deb Turja
*/
#include <bits/stdc++.h>
using namespace std;
#define Professor
using ll = long long;
using i64 = unsigned long long;
template <typename T> inline T Min(T a, T b, T c) { return min(a, min(b, c)); }
template <typename T> inline T Min(T a, T b, T c, T d) {
return min(a, min(b, mi... | [
"call.arguments.change"
] | 965,590 | 965,591 | u095814925 | cpp |
p03163 | #include <bits/stdc++.h>
/* imp functions
ARRAYS AND STRINGS
sorting arrays - sort(array,array+n);
sorting string - sort(s.begin() , s.end())
finding size of string - str.length();
VECTORS:
assign() – It assigns new value to the vector elements by replacing old
ones push_back() – It pus... | #include <bits/stdc++.h>
/* imp functions
ARRAYS AND STRINGS
sorting arrays - sort(array,array+n);
sorting string - sort(s.begin() , s.end())
finding size of string - str.length();
VECTORS:
assign() – It assigns new value to the vector elements by replacing old
ones push_back() – It pus... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 965,596 | 965,597 | u483635716 | cpp |
p03163 | #include <bits/stdc++.h>
#include <cctype>
#define ll long long int
#define PB push_back
#define GO \
ll t; \
cin >> t; ... | #include <bits/stdc++.h>
#include <cctype>
#define ll long long int
#define PB push_back
#define GO \
ll t; \
cin >> t; ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 965,598 | 965,599 | u232917796 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, w;
cin >> n >> w;
int val[n + 1];
int wg[n + 1];
for (int i = 1; i <= n; i++) {
cin >> wg[i] >> val[i];
}
val[0] = 0;
wg[0] = 0;
int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(void) {
int n, w;
cin >> n >> w;
int val[n + 1];
int wg[n + 1];
for (int i = 1; i <= n; i++) {
cin >> wg[i] >> val[i];
}
val[0] = 0;
wg[0] = 0;
int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0;... | [
"variable_declaration.type.primitive.change"
] | 965,612 | 965,613 | u043140820 | cpp |
p03163 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [] | 965,616 | 965,617 | u110044127 | cpp |
p03163 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | [
"call.remove"
] | 965,623 | 965,624 | u752344870 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define f first
#define sec second
#define pb push_back
#define pf push_front
#define pbb pop_back
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define pi pair<ll, ll>
#define map map<ll, ll>
#define set set<ll>
const int m = 1e9 + 7;
int main()... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define f first
#define sec second
#define pb push_back
#define pf push_front
#define pbb pop_back
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define pi pair<ll, ll>
#define map map<ll, ll>
#define set set<ll>
const int m = 1e9 + 7;
int main()... | [
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 965,625 | 965,626 | u675040086 | cpp |
p03163 |
using namespace std;
#include <bits/stdc++.h>
int max(int a, int b) { return (a > b) ? a : b; }
int knapSack(int W, int wt[], int val[], int n) {
int i, w;
int K[n + 1][W + 1];
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (wt[i - 1] <... |
using namespace std;
#include <bits/stdc++.h>
long long int max(int a, int b) { return (a > b) ? a : b; }
long long int knapSack(int W, int wt[], int val[], int n) {
int i, w;
long long int K[n + 1][W + 1];
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] =... | [
"variable_declaration.type.widen.change"
] | 965,627 | 965,628 | u581698586 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
constexpr ll M = 1e9 + 7;
inline ll sum_1(const ll n) { return ((n * (n + 1)) / 2) % M; }
inline ll sum_2(const ll n) { return ((n * (n + 1) * (2 * n + 1)) / 6) % M; }
inline ll sum_3(const ll n) {
return (((n * (n + 1)) / 2) % M * ((n * (n + 1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
constexpr ll M = 1e9 + 7;
inline ll sum_1(const ll n) { return ((n * (n + 1)) / 2) % M; }
inline ll sum_2(const ll n) { return ((n * (n + 1) * (2 * n + 1)) / 6) % M; }
inline ll sum_3(const ll n) {
return (((n * (n + 1)) / 2) % M * ((n * (n + 1)... | [
"call.arguments.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 965,629 | 965,630 | u878592875 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
constexpr ll M = 1e9 + 7;
inline ll sum_1(const ll n) { return ((n * (n + 1)) / 2) % M; }
inline ll sum_2(const ll n) { return ((n * (n + 1) * (2 * n + 1)) / 6) % M; }
inline ll sum_3(const ll n) {
return (((n * (n + 1)) / 2) % M * ((n * (n + 1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
constexpr ll M = 1e9 + 7;
inline ll sum_1(const ll n) { return ((n * (n + 1)) / 2) % M; }
inline ll sum_2(const ll n) { return ((n * (n + 1) * (2 * n + 1)) / 6) % M; }
inline ll sum_3(const ll n) {
return (((n * (n + 1)) / 2) % M * ((n * (n + 1)... | [
"call.arguments.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 965,629 | 965,631 | u878592875 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n);
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> w.at(i) >> v.at(i);
}
vector<vector<int>> dp(n + 1, vector<int>(W + 1));
for (int j = 0; j <= W; j++) {
dp.at(0).at(j) = 0;
}
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n);
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> w.at(i) >> v.at(i);
}
vector<vector<long long int>> dp(n + 1, vector<long long int>(W + 1));
for (int j = 0; j <= W; j++) {
dp.at(0).at(j)... | [
"variable_declaration.type.widen.change"
] | 965,632 | 965,633 | u607229598 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int knap[n][2];
for (int i = 0; i < n; i++)
for (int j = 0; j < 2; j++)
cin >> knap[i][j];
//入力
int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= w; j++)
dp[i][j] = 0;
// dp表
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long long knap[n][2];
for (int i = 0; i < n; i++)
for (int j = 0; j < 2; j++)
cin >> knap[i][j];
//入力
long long dp[n + 1][w + 1];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= w; j++)
dp[i][j] = 0;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,634 | 965,635 | u842028864 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define SZ(items) (int)items.size()
#define CLR(a) memset(a, 0, sizeof(a))
#define SET(a) memset(a, -1, sizeof(a))
#define nl "\n";
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T> inline T biton(T n, T pos) { return n |... | #include <bits/stdc++.h>
using namespace std;
#define SZ(items) (int)items.size()
#define CLR(a) memset(a, 0, sizeof(a))
#define SET(a) memset(a, -1, sizeof(a))
#define nl "\n";
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T> inline T biton(T n, T pos) { return n |... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,641 | 965,642 | u098704227 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define SZ(items) (int)items.size()
#define CLR(a) memset(a, 0, sizeof(a))
#define SET(a) memset(a, -1, sizeof(a))
#define nl "\n";
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T> inline T biton(T n, T pos) { return n |... | #include <bits/stdc++.h>
using namespace std;
#define SZ(items) (int)items.size()
#define CLR(a) memset(a, 0, sizeof(a))
#define SET(a) memset(a, -1, sizeof(a))
#define nl "\n";
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T> inline T biton(T n, T pos) { return n |... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 965,643 | 965,642 | u098704227 | cpp |
p03163 | #include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
const int wmax = 1e5 + 5;
const int nmax = 1e2 + 5;
int weights[nmax];
int value[nmax];
int dp[wmax];
int main() {
std::ios_base::sync_with_stdio(false);
int N, W;
std::cin >> N >> W;
for (int i = 0; i < N; i++) {
std::cin >> w... | #include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
const int wmax = 1e5 + 5;
const int nmax = 1e2 + 5;
int weights[nmax];
long long value[nmax];
long long dp[wmax];
int main() {
std::ios_base::sync_with_stdio(false);
int N, W;
std::cin >> N >> W;
for (int i = 0; i < N; i++) {
s... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,644 | 965,645 | u958610807 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int v[n + 1], w[n + 1];
int dp[n + 1][k + 1];
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= k; j++) {
if (i == 0 || j == 0)
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long int v[n + 1], w[n + 1];
long long int dp[n + 1][k + 1];
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= k; j++) {
if (... | [
"variable_declaration.type.widen.change"
] | 965,646 | 965,647 | u842473278 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define debug(var) \
do { \
std::cout ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define debug(var) \
do { \
std::cout ... | [
"variable_declaration.type.change"
] | 965,652 | 965,653 | u279033107 | cpp |
p03163 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#inc... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 965,656 | 965,655 | u896543512 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,659 | 965,660 | u473179530 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll Knapsack(ll *weights, ll *values, int w, int n) {
ll 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][j] = 0;
} else if (weights[i - 1] <= j) {
dp[i][j]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll Knapsack(ll *weights, ll *values, int w, int n) {
ll 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][j] = 0;
} else if (weights[i - 1] <= j) {
dp[i][j]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,661 | 965,662 | u740301715 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#... | [
"assignment.change"
] | 965,663 | 965,664 | u373096848 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#... | [
"variable_declaration.type.change"
] | 965,665 | 965,666 | u373096848 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define pb push_... | #include <bits/stdc++.h>
#define int long long
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define pb push_... | [
"call.remove"
] | 965,667 | 965,668 | u841140330 | cpp |
p03163 |
#include <iostream>
using namespace std;
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define ll long long
int main() {
ll w, n;
cin >> n >> w;
ll wt[n], v[n];
ffor(i, 0, n) { cin >> wt[i] >> v[i]; }
ll dp[n + 1][w + 1];
ffor(i, 0, n + 1) {
ffor(j, 0, w + 1) {
if (i == 0 || j == 0) {
... |
#include <iostream>
using namespace std;
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define ll long long
int main() {
ll w, n;
cin >> n >> w;
ll wt[n], v[n];
ffor(i, 0, n) { cin >> wt[i] >> v[i]; }
ll dp[n + 1][w + 1];
ffor(i, 0, n + 1) {
ffor(j, 0, w + 1) {
if (i == 0 || j == 0) {
... | [
"expression.operation.binary.remove"
] | 965,669 | 965,670 | u476428694 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int knapSack(int W, int wt[], int val[], int n) {
int i, w;
int K[n + 1][W + 1];
// Build table K[][] in bottom up manner
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (wt[i - 1] <= w)
... | #include <bits/stdc++.h>
using namespace std;
long long int knapSack(int W, int wt[], int val[], int n) {
int i, w;
long long int K[n + 1][W + 1];
// Build table K[][] in bottom up manner
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (w... | [
"variable_declaration.type.widen.change"
] | 965,671 | 965,672 | u472796082 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define f(i, x, y) for (int i = x; i < y; i++)
#define mp make_pair
#define F first
#define S second
#define N 100005
int main() {
int n, w;
cin >> n >> w;
int wt[n + 1], p[n + 1];
f(i, 1, n + 1) cin >> wt[i] >> p[i];
// cout<<"c1";
vector<vector<int>> dp(n +... | #include <bits/stdc++.h>
using namespace std;
#define f(i, x, y) for (int i = x; i < y; i++)
#define mp make_pair
#define F first
#define S second
#define N 100005
int main() {
int n, w;
cin >> n >> w;
int wt[n + 1], p[n + 1];
f(i, 1, n + 1) cin >> wt[i] >> p[i];
// cout<<"c1";
vector<vector<long long>> ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,673 | 965,674 | u440947888 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int t[101][100001];
int solve(int wt[], int val[], int n, int w) {
if (n == 0 || w == 0)
return 0;
if (t[n][w] != -1)
return t[n][w];
else {
if (wt[n - 1] <= w)
return t[n][w] = max(val[n - 1] + solve(wt, val, n - 1, w - wt[n - 1]),
... | #include <bits/stdc++.h>
using namespace std;
long long int t[101][100001];
long long int solve(int wt[], int val[], int n, int w) {
if (n == 0 || w == 0)
return 0;
if (t[n][w] != -1)
return t[n][w];
else {
if (wt[n - 1] <= w)
return t[n][w] = max(val[n - 1] + solve(wt, val, n - 1, w - wt[n - 1]... | [
"variable_declaration.type.widen.change"
] | 965,678 | 965,679 | u730945939 | cpp |
p03163 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define F first
#define S second
using namespace std;
void data() {
#ifdef NURS
freopen("main.in", "r", stdin);
freopen("main.out", "w", stdout);
#endif
}
const int N = 1e5 + 100;
const int mod = 1e9 + 7;
int dp[N];
int main() ... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define F first
#define S second
using namespace std;
void data() {
#ifdef NURS
freopen("main.in", "r", stdin);
freopen("main.out", "w", stdout);
#endif
}
const int N = 1e5 + 100;
const int mod = 1e9 + 7;
ll dp[N];
int main() {... | [
"variable_declaration.type.change"
] | 965,680 | 965,681 | u165212329 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, W, i, j;
cin >> n >> W;
int wt[n];
int val[n];
for (i = 0; i < n; i++) {
cin >> wt[i];
cin >> val[i];
}
int dp[n + 1][W + 1];
for (i = 0; i <= W; i++)
dp[0][i] = 0;
for (i = 0; i <= n; i++)
dp[i][0] ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll int n, W, i, j;
cin >> n >> W;
ll int wt[n];
ll int val[n];
for (i = 0; i < n; i++) {
cin >> wt[i];
cin >> val[i];
}
ll int dp[n + 1][W + 1];
for (i = 0; i <= W; i++)
dp[0][i] = 0;
for (i = 0; i <= n; i++)
... | [] | 965,686 | 965,687 | u963181188 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int dp[105][100005];
int knapsack(int w[], int v[], int W, int n) {
if (W == 0 || n == 0)
return 0;
if (dp[n][W] != -1)
return dp[n][W];
if (w[n - 1] <= W) {
return dp[n][W] = max(v[n - 1] + knapsack(w, v, W - w[n - 1], n - 1),
kn... | #include <bits/stdc++.h>
using namespace std;
long long dp[105][100005];
long long knapsack(int w[], int v[], int W, int n) {
if (W == 0 || n == 0)
return 0;
if (dp[n][W] != -1)
return dp[n][W];
if (w[n - 1] <= W) {
return dp[n][W] = max(v[n - 1] + knapsack(w, v, W - w[n - 1], n - 1),
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,690 | 965,691 | u248069860 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int dp[100000 + 1];
int main() {
int n, weight;
cin >> n >> weight;
int w[n], v[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {
for (int j = weight; j >= w[i]; j--) ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[100000 + 1];
int main() {
int n, weight;
cin >> n >> weight;
int w[n], v[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {
for (int j = weight; j >= w[i]; j--) {... | [
"variable_declaration.type.change"
] | 965,692 | 965,693 | u500482384 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, w;
cin >> n >> w;
int wt[n], v[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
cin >> v[i];
}
int k[n + 1][w + 1];
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;
typedef long long ll;
int main() {
int n, w;
cin >> n >> w;
int wt[n], v[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
cin >> v[i];
}
long long k[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.primitive.change",
"variable_declaration.type.widen.change"
] | 965,694 | 965,695 | u926681074 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, W;
scanf("%d%d", &n, &W);
vector<int> dp(W + 1, 0);
for (int item = 0; item < n; item++) {
int weight, value;
scanf("%d%d", &weight, &value);
for (int wa = W - weight; wa >= 0; wa--) {
dp[wa + weight] = max(dp[wa + weight]... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, W;
scanf("%d%d", &n, &W);
vector<long long int> dp(W + 1, 0);
for (int item = 0; item < n; item++) {
int weight, value;
scanf("%d%d", &weight, &value);
for (int wa = W - weight; wa >= 0; wa--) {
dp[wa + weight] = max(dp[wa... | [
"variable_declaration.type.widen.change"
] | 965,696 | 965,697 | u801369645 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 110;
const int MAXW = 1e5 + 10;
struct item {
int w, v;
};
item a[MAXN];
int N, W;
int dp[MAXW];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> a[i].w >> a[i].v;
}
memset(dp, 0, sizeof(dp));
for (int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 110;
const int MAXW = 1e5 + 10;
struct item {
int w, v;
};
item a[MAXN];
int N, W;
ll dp[MAXW];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> a[i].w >> a[i].v;
}
memset(dp, 0, sizeof(dp));
for (int ... | [
"variable_declaration.type.change"
] | 965,698 | 965,699 | u309591719 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define tc \
int T; \
cin >> T; ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define tc \
int T; \
cin >> T; ... | [
"call.arguments.change"
] | 965,702 | 965,703 | u035574447 | cpp |
p03163 | // THINK FIRST CODE NEXT!!!!!!!!!!!!!!!!!
// It does not matter how slowly you go as long as you do not stop. - Confucius
#include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << ':' << x << endl;
#define loop3(i, k, n) for (i = k; i < n; i++)
#define ll long long
#define loop(i, n) for (int i = 0; i ... | // THINK FIRST CODE NEXT!!!!!!!!!!!!!!!!!
// It does not matter how slowly you go as long as you do not stop. - Confucius
#include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << ':' << x << endl;
#define loop3(i, k, n) for (i = k; i < n; i++)
#define ll long long
#define loop(i, n) for (int i = 0; i ... | [
"call.arguments.change"
] | 965,712 | 965,713 | u958825287 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int wt[N + 1], val[N + 1];
for (int i = 0; i < N; i++) {
cin >> wt[i] >> val[i];
}
int dp[N + 1][W + 1];
for (int i = 0; i <= N; i++) {
for (int w = 0; w <= W; w++) {
if (i == 0 || w == 0)... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int wt[N + 1], val[N + 1];
for (int i = 0; i < N; i++) {
cin >> wt[i] >> val[i];
}
long long dp[N + 1][W + 1];
for (int i = 0; i <= N; i++) {
for (int w = 0; w <= W; w++) {
if (i == 0 || w... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,714 | 965,715 | u601589675 | cpp |
p03163 | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end... | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end... | [
"call.remove"
] | 965,716 | 965,717 | u491084584 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n);
vector<ll> v(n)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n);
vector<ll> v(n)... | [
"assignment.change"
] | 965,733 | 965,734 | u493928141 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = 0, w = 0;
cin >> n >> w;
int t[n + 1][w + 1] = {0};
int weight_array[n] = {0};
int value_array[n] = {0};
for (int i = 0; i < n; i++) {
cin >> weight_array[i] >> v... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = 0, w = 0;
cin >> n >> w;
long long int t[n + 1][w + 1] = {0};
int weight_array[n] = {0};
int value_array[n] = {0};
for (int i = 0; i < n; i++) {
cin >> weight_arr... | [
"variable_declaration.type.widen.change"
] | 965,737 | 965,738 | u208922403 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int t[102][100002];
int n = 0, w = 0;
int knapsack(int n, int w, int weight_array[], int value_array[]) {
if (n == 0 || w == 0)
return 0;
if (t[n][w] != -1)
return t[n][w];
if (weight_array[n - 1] > w)
return t[n][w] = knapsack(n - 1,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
long long t[101][100001];
int n = 0, w = 0;
long long int knapsack(int n, int w, int weight_array[], int value_array[]) {
if (n == 0 || w == 0)
return 0;
if (t[n][w] != -1)
return t[n][w];
if (weight_array[n - 1] > w)
return t[n][w] =... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 965,739 | 965,740 | u208922403 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define MOD 1000000007
#define mod 1000000007
#define M 1000000007
#define pb push_back
#define take(a, b, c) \
for (int b = 0; b < c; b++) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define MOD 1000000007
#define mod 1000000007
#define M 1000000007
#define pb push_back
#define take(a, b, c) \
for (int b = 0; b < c; b++) ... | [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 965,741 | 965,742 | u827746123 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define MOD 1000000007
#define mod 1000000007
#define M 1000000007
#define pb push_back
#define take(a, b, c) \
for (int b = 0; b < c; b++) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define MOD 1000000007
#define mod 1000000007
#define M 1000000007
#define pb push_back
#define take(a, b, c) \
for (int b = 0; b < c; b++) ... | [
"assignment.change"
] | 965,743 | 965,742 | u827746123 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define MOD 1000000007
#define mod 1000000007
#define M 1000000007
#define pb push_back
#define take(a, b, c) \
for (int b = 0; b < c; b++) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define MOD 1000000007
#define mod 1000000007
#define M 1000000007
#define pb push_back
#define take(a, b, c) \
for (int b = 0; b < c; b++) ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 965,744 | 965,742 | u827746123 | cpp |
p03163 | /*
Author-KUSHAGRA SINGH
Birla Institute of Technology Mesra
CS K18
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
//#define mp make_pair
#define pb emplace_back
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define pq priority_que... | /*
Author-KUSHAGRA SINGH
Birla Institute of Technology Mesra
CS K18
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
//#define mp make_pair
#define pb emplace_back
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define pq priority_que... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 965,760 | 965,759 | u897990209 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, w;
cin >> n >> w;
vector<vector<ll>> dp(n + 1, vector<ll>(w + 1, 0));
for (int i = 1; i <= n; i++) {
ll weight, value;
cin >> weight >> value;
for (int j = 1; j <= w; j++) {
dp[i][j] = max(dp[i - 1][j],
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, w;
cin >> n >> w;
vector<vector<ll>> dp(n + 1, vector<ll>(w + 1, 0));
for (int i = 1; i <= n; i++) {
ll weight, value;
cin >> weight >> value;
for (int j = 1; j <= w; j++) {
dp[i][j] = max(dp[i - 1][j],
... | [
"expression.operation.binary.remove"
] | 965,763 | 965,764 | u972556261 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int wt[n], val[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
}
for (int i = 1; i <= w; i++) {
dp[0][i] = 0;
}
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, w;
cin >> n >> w;
long long int wt[n], val[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
long long int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
}
for (int i = 1; i <= w; i++) {
d... | [
"variable_declaration.type.widen.change"
] | 965,771 | 965,772 | u249024658 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<long long> vals;
vector<int> weights;
vector<pair<int, long long>> all;
for (int i = 0; i < N; i++) {
long long val, weight;
cin >> weight >> val;
// vals.push_back(val);
// weights.p... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<long long> vals;
vector<int> weights;
// vals.push_back(0);
// weights.push_back(0);
vector<pair<int, long long>> all;
for (int i = 0; i < N; i++) {
long long val, weight;
cin >> weight >> val;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 965,775 | 965,776 | u298033264 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = INT_MAX; // 2147483647
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
#ifdef LOCAL_ENV
#define debug(var) std::cout << #var " = " << var << std::endl
#else
#define debug(var)
#endif
#define p(var) std::cout << var << std::endl
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = INT_MAX; // 2147483647
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
#ifdef LOCAL_ENV
#define debug(var) std::cout << #var " = " << var << std::endl
#else
#define debug(var)
#endif
#define p(var) std::cout << var << std::endl
... | [
"call.arguments.change"
] | 965,783 | 965,784 | u061071198 | cpp |
p03163 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack... | [
"control_flow.branch.else.remove"
] | 965,875 | 965,876 | u820341516 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using ... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using ... | [] | 965,877 | 965,878 | u820341516 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using ... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 965,879 | 965,878 | u820341516 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
int main() {
lli i, j, k, n, t;
cin >> n >> t;
lli w[n], v[n];
for (i = 0; i < n; i++)
cin >> w[i] >> v[i];
lli a[n + 1][t + 1];
for (i = 0; i <= n; i++)
a[i][0] = 0;
for (i = 0; i <= t; i++)
a[0][i] = 0;
for (i = 1; i ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
int main() {
lli i, j, k, n, t;
cin >> n >> t;
lli w[n], v[n];
for (i = 0; i < n; i++)
cin >> w[i] >> v[i];
lli a[n + 1][t + 1];
for (i = 0; i <= n; i++)
a[i][0] = 0;
for (i = 0; i <= t; i++)
a[0][i] = 0;
for (i = 1; i ... | [
"expression.operation.binary.remove"
] | 965,880 | 965,881 | u391913928 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace ... | #include <bits/stdc++.h>
#define ll long long
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace ... | [
"variable_declaration.type.change",
"literal.number.change",
"function.return_value.change"
] | 965,888 | 965,889 | u131127512 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define mp make_pair
using namespace std;
int n, w;
std::vector<pair<int, ll>> inp;
vector<vector<ll>> dp;
ll knapsack(int i = 0, int curr_wt = w) {
if (i == n)
return 0;
if (dp[i][curr_wt] == -1) {
ll ans = knapsack(i + 1, curr_wt);
if (curr_wt - inp[i].fi... | #include <bits/stdc++.h>
#define ll long long
#define mp make_pair
using namespace std;
int n, w;
std::vector<pair<int, ll>> inp;
vector<vector<ll>> dp;
ll knapsack(int i = 0, int curr_wt = w) {
if (i == n)
return 0;
if (dp[i][curr_wt] == -1) {
ll ans = knapsack(i + 1, curr_wt);
if (curr_wt - inp[i].fi... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 965,902 | 965,903 | u351351871 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template ... | [
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 965,911 | 965,912 | u450093740 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 965,913 | 965,912 | u450093740 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
vector<long long int> wt;
vector<long long int> val;
long long int n, w;
long long int mem[105][100005];
long long int dp(long long int i, long long int x) {
if (i >= n)
return 0;
if (mem[i][x] != -1)
return mem[i][x];
long long int ans = 0;
ans = max(dp(... | #include <bits/stdc++.h>
using namespace std;
vector<long long int> wt;
vector<long long int> val;
long long int n, w;
long long int mem[105][100005];
long long int dp(long long int i, long long int x) {
if (i >= n)
return 0;
if (mem[i][x] != -1)
return mem[i][x];
long long int ans = 0;
ans = max(dp(i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 965,919 | 965,920 | u774919576 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
struct item {
long long int val;
long long int wt;
};
vector<item> v;
long long int mem[105][100005] = {-1};
long long int dp(long long int n, long long int w) {
if (mem[n][w] != -1)
return mem[n][w];
if (n == 1) {
if (v[n].wt <= w)
return v[n].val;
... | #include <bits/stdc++.h>
using namespace std;
struct item {
long long int val;
long long int wt;
};
vector<item> v;
long long int mem[105][100005] = {-1};
long long int dp(long long int n, long long int w) {
if (mem[n][w] != -1)
return mem[n][w];
if (n == 1) {
if (v[n].wt <= w)
return v[n].val;
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 965,921 | 965,922 | u774919576 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N);
vector<int> val(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> val[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)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<long> w(N);
vector<long> val(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> val[i];
}
long dp[N + 1][W + 1];
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
... | [
"variable_declaration.type.primitive.change"
] | 965,923 | 965,924 | u290563481 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll knapsack(vector<ll> &val, vector<ll> &wt, ll W, ll n,
vector<vector<ll>> &dp) {
if (n == 0 || W == 0)
return dp[n][W] = 0;
if (dp[n][W] != -1)
return dp[n][W];
if (wt[n - 1] <= W)
return dp[n][W] =
max(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll knapsack(vector<ll> &val, vector<ll> &wt, ll W, ll n,
vector<vector<ll>> &dp) {
if (n == 0 || W == 0)
return dp[n][W] = 0;
if (dp[n][W] != -1)
return dp[n][W];
if (wt[n - 1] <= W)
return dp[n][W] =
max(... | [
"assignment.change"
] | 965,925 | 965,926 | u464716710 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll knapsack(vector<ll> &val, vector<ll> &wt, ll W, ll n,
vector<vector<ll>> &dp) {
if (n == 0 || W == 0)
return dp[n][W] = 0;
if (dp[n - 1][W] != -1)
return dp[n][W];
if (wt[n - 1] <= W)
return dp[n][W] =
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll knapsack(vector<ll> &val, vector<ll> &wt, ll W, ll n,
vector<vector<ll>> &dp) {
if (n == 0 || W == 0)
return dp[n][W] = 0;
if (dp[n][W] != -1)
return dp[n][W];
if (wt[n - 1] <= W)
return dp[n][W] =
max(... | [
"expression.operation.binary.remove"
] | 965,927 | 965,926 | u464716710 | 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];
for (int i = 0; i <= n; i++)
dp[i][0] = 0;
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
for (int i = 1; i <= n; i++... | #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];
}
long long int dp[n + 1][W + 1];
for (int i = 0; i <= n; i++)
dp[i][0] = 0;
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
for (int i = 1; i... | [
"variable_declaration.type.widen.change"
] | 965,928 | 965,929 | u072063395 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, w;
cin >> n >> w;
int wt[n], val[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, w;
cin >> n >> w;
int wt[n];
long long val[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
long long dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,930 | 965,931 | u766871659 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define int long long
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define ff first
#define tc ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define int long long
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define ff first
#define tc ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"literal.number.change",
"call.arguments.change"
] | 965,932 | 965,933 | u311931982 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define int long long
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define ff first
#define tc ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define int long long
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define ff first
#define tc ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"literal.number.change",
"call.arguments.change"
] | 965,932 | 965,934 | u311931982 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define lol 200005
#define debug(x) cout << #x << " is " << x << endl;
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define bfor(i, a, b) for (int i = b; i >= a; i--)
#define mp make_pair
#define pb push_back
#define ff ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define lol 200005
#define debug(x) cout << #x << " is " << x << endl;
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define bfor(i, a, b) for (int i = b; i >= a; i--)
#define mp make_pair
#define pb push_back
#define ff ... | [
"variable_declaration.type.widen.change"
] | 965,935 | 965,936 | u972619069 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define lol 200005
#define debug(x) cout << #x << " is " << x << endl;
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define bfor(i, a, b) for (int i = b; i >= a; i--)
#define mp make_pair
#define pb push_back
#define ff ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define lol 200005
#define debug(x) cout << #x << " is " << x << endl;
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define bfor(i, a, b) for (int i = b; i >= a; i--)
#define mp make_pair
#define pb push_back
#define ff ... | [
"variable_declaration.type.widen.change"
] | 965,937 | 965,936 | u972619069 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.