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;
typedef long long ll;
#define f(i, n) for (ll i = 0; i < n; i++)
#define pb push_back
int mod = 1e9 + 7;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll fast(ll a, ll n) {
a %= mod;
ll res = 1;
while (n > 0) {
if (n & 1)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f(i, n) for (ll i = 0; i < n; i++)
#define pb push_back
int mod = 1e9 + 7;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll fast(ll a, ll n) {
a %= mod;
ll res = 1;
while (n > 0) {
if (n & 1)
... | [
"variable_declaration.type.change",
"io.output.newline.add"
] | 965,938 | 965,939 | u700590924 | cpp |
p03163 | #include <algorithm>
#include <cmath> // circle math ( sin, con, sinh
#include <iomanip> // input output manipulation
#include <iostream> // input output stream, cin cout( console in console out)
#include <stdio.h> // standard input output
#include <string>
#include <vector>
using namespace std;
#define rep(i, n)... | #include <algorithm>
#include <cmath> // circle math ( sin, con, sinh
#include <iomanip> // input output manipulation
#include <iostream> // input output stream, cin cout( console in console out)
#include <stdio.h> // standard input output
#include <string>
#include <vector>
using namespace std;
#define rep(i, n)... | [
"variable_declaration.type.change",
"assignment.variable.change",
"function.return_value.change"
] | 965,940 | 965,941 | u480059652 | cpp |
p03163 | // In the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define MAX 100011
#define ll long long
#define endl '\n'
ll dp[101][MAX], w;
int v[MAX], c[MAX];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n >> w;
for (int i = 0; i < n; i++)
cin >> c[i] >> v[i];
... | // In the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define MAX 100011
#define ll long long
#define endl '\n'
ll dp[101][MAX], w;
int v[MAX], c[MAX];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n >> w;
for (int i = 0; i < n; i++)
cin >> c[i] >> v[i];
... | [
"control_flow.loop.for.condition.change"
] | 965,947 | 965,948 | u732350342 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.en... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.en... | [
"assignment.change"
] | 965,949 | 965,950 | u784072785 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll knap(ll i, ll w, vector<vector<ll>> &v, ll n, vector<vector<ll>> &dp) {
if (i >= n) {
return 0;
}
if (w == 0) {
return 0;
}
if (dp[i][w] != -1)
return dp[i][w];
ll l, r;
if (v[i][0] <= w) {
l = v[i... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll knap(ll i, ll w, vector<vector<ll>> &v, ll n, vector<vector<ll>> &dp) {
if (i >= n) {
return 0;
}
if (w == 0) {
return 0;
}
if (dp[i][w] != -1)
return dp[i][w];
ll l, r;
if (v[i][0] <= w) {
l = v[i]... | [
"identifier.change",
"call.arguments.change"
] | 965,957 | 965,958 | u401330034 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll knap(ll i, ll w, vector<vector<ll>> &v, ll n, vector<vector<ll>> &dp) {
if (i >= n) {
return 0;
}
if (w <= 0) {
return 0;
}
if (dp[i][w] != -1)
return dp[i][w];
ll l, r;
if (v[i][0] <= w) {
l = v[i... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll knap(ll i, ll w, vector<vector<ll>> &v, ll n, vector<vector<ll>> &dp) {
if (i >= n) {
return 0;
}
if (w == 0) {
return 0;
}
if (dp[i][w] != -1)
return dp[i][w];
ll l, r;
if (v[i][0] <= w) {
l = v[i]... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change"
] | 965,959 | 965,958 | u401330034 | cpp |
p03163 | #include <bits/stdc++.h>
const int mod = 1000000007;
const int modx = 998244353;
#define ll long long
#define readi(x) scanf("%d", &x)
#define reads(x) scanf("%s", x)
#define readl(x) scanf("%I64d", &x)
#define rep(i, n) for (i = 0; i < n; i++)
#define rep1(i, a, b) for (i = a; i < b; i++)
#define rep2(i, a, b) for (i ... | #include <bits/stdc++.h>
const int mod = 1000000007;
const int modx = 998244353;
#define ll long long
#define readi(x) scanf("%d", &x)
#define reads(x) scanf("%s", x)
#define readl(x) scanf("%I64d", &x)
#define rep(i, n) for (i = 0; i < n; i++)
#define rep1(i, a, b) for (i = a; i < b; i++)
#define rep2(i, a, b) for (i ... | [
"variable_declaration.type.change"
] | 965,963 | 965,964 | u706547107 | cpp |
p03163 | using namespace std;
#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define vect vector<ll>
#define maap map<ll, ll>
#define MOD 1000000007
#define mit map::iterator
#define pii pair<ll, ll>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define fast ... | using namespace std;
#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define vect vector<ll>
#define maap map<ll, ll>
#define MOD 1000000007
#define mit map::iterator
#define pii pair<ll, ll>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define fast ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 965,965 | 965,966 | u379844185 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long int knapsack(int W, int wt[], long long int val[], int n) {
long long 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) {
k[i][j] = 0;
} else if (j >= wt[i - 1]) {
k[i][j] ... | #include <bits/stdc++.h>
using namespace std;
long long int knapsack(int W, int wt[], long long int val[], int n) {
long long 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) {
k[i][j] = 0;
} else if (j >= wt[i - 1]) {
k[i][j] ... | [
"identifier.change",
"variable_access.subscript.index.change",
"function.return_value.change"
] | 965,971 | 965,972 | u961774311 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int mx = 101, mxW = 1e5 + 1;
int w[mx], v[mx], tWeiht, n;
long long dp[mx][mxW];
long long solve(int i, int cWeight) // i->item
{
if (i > n)
return 0;
if (dp[i][cWeight] != -1)
return dp[i][cWeight];
int ret1 = solve(i + 1, cWeight);
int ret2 = 0;
i... | #include <bits/stdc++.h>
using namespace std;
const int mx = 101, mxW = 1e5 + 1;
int w[mx], v[mx], tWeiht, n;
long long dp[mx][mxW];
long long solve(int i, int cWeight) // i->item
{
if (i > n)
return 0;
if (dp[i][cWeight] != -1)
return dp[i][cWeight];
long long ret1 = solve(i + 1, cWeight);
long long r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,973 | 965,974 | u507086371 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int mx = 101, mxW = 1e5 + 1;
int w[mx], v[mx], tWeiht, n;
int dp[mx][mxW];
long long solve(int i, int cWeight) // i->item
{
if (i > n)
return 0;
if (dp[i][cWeight] != -1)
return dp[i][cWeight];
int ret1 = solve(i + 1, cWeight);
int ret2 = 0;
if (w[i... | #include <bits/stdc++.h>
using namespace std;
const int mx = 101, mxW = 1e5 + 1;
int w[mx], v[mx], tWeiht, n;
long long dp[mx][mxW];
long long solve(int i, int cWeight) // i->item
{
if (i > n)
return 0;
if (dp[i][cWeight] != -1)
return dp[i][cWeight];
long long ret1 = solve(i + 1, cWeight);
long long r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,975 | 965,974 | u507086371 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ll long long
#define N 100005
#define M 1000000007
#define pb push_back
#define p_q priority_queue
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii,... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ll long long
#define N 100005
#define M 1000000007
#define pb push_back
#define p_q priority_queue
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii,... | [
"assignment.change"
] | 965,978 | 965,979 | u719660991 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define sz(x) (int)(x).size()
const int N = 110;
const int M = 100010;
int w[N], v[N], f[N][M], n, max_w;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> max_w;
for (int i = 0; i < n; i++)
ci... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define sz(x) (int)(x).size()
const int N = 110;
const int M = 100010;
ll w[N], v[N], f[N][M], n, max_w;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> max_w;
for (int i = 0; i < n; i++)
cin... | [
"variable_declaration.type.change"
] | 965,980 | 965,981 | u350267480 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const long long INF = 1e15;
int main() {
long long n, w;
cin >> n >> w;
long long dp[n + 1][w + 1] = {0};
vector<long long> weight(n), value(n);
for (int i = 0; i < n; i++)
cin >> weight[i] >> value[i];
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const long long INF = 1e15;
int main() {
long long n, w;
cin >> n >> w;
long long dp[n + 1][w + 1] = {};
vector<long long> weight(n), value(n);
for (int i = 0; i < n; i++)
cin >> weight[i] >> value[i];
for (i... | [] | 965,988 | 965,989 | u191484928 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define sz 100005
typedef long long ll;
int arr[101];
int brr[101];
ll dp[101][sz];
int cal(int n, int val) {
if (n <= 0)
return 0;
if (val <= 0)
return 0;
if (dp[n][val] != -1)
return dp[n][val];
ll a = cal(n - 1, val);
ll b = 0;
if (val - arr[n] ... | #include <bits/stdc++.h>
using namespace std;
#define sz 100005
typedef long long ll;
int arr[101];
int brr[101];
ll dp[101][sz];
ll cal(int n, int val) {
if (n <= 0)
return 0;
if (val <= 0)
return 0;
if (dp[n][val] != -1)
return dp[n][val];
ll a = cal(n - 1, val);
ll b = 0;
if (val - arr[n] >... | [] | 965,992 | 965,993 | u842204282 | cpp |
p03163 | // Space O(C)
#include <iostream>
#include <vector>
using namespace std;
int n, c;
int main() {
scanf("%d %d", &n, &c);
vector<int> w(n), v(n);
for (int i = 0; i < n; ++i) {
scanf("%d %d", &w[i], &v[i]);
}
// dp[i][j] := maximum total value of a subset of the first i items, with
// total size at most... | // Space O(C), Time O(NC)
#include <iostream>
#include <vector>
using namespace std;
int n, c;
int main() {
scanf("%d %d", &n, &c);
vector<int> w(n), v(n);
for (int i = 0; i < n; ++i) {
scanf("%d %d", &w[i], &v[i]);
}
// dp[i][j] := maximum total value of a subset of the first i items, with
// total ... | [
"assignment.add"
] | 965,994 | 965,995 | u773308454 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
struct item {
int w;
int v;
};
long long int knapsack(vector<item> arr, int c, int n) {
long long int dp[n + 1][c + 1];
memset(dp, 0, sizeof dp);
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
}
for (int i = 0; i <= c; i++) {
dp[0][... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
struct item {
int w;
int v;
};
long long int knapsack(vector<item> arr, int c, int n) {
long long int dp[n + 1][c + 1];
memset(dp, 0, sizeof dp);
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
}
for (int i = 0; i <= c; i++) {
dp[0][... | [
"assignment.change"
] | 965,998 | 965,999 | u737527091 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Reverse(x) reverse((x).begin(), (x).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Reverse(x) reverse((x).begin(), (x).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 966,000 | 966,001 | u225388820 | cpp |
p03163 | /* Simplicity and Goodness */
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
void my... | /* Simplicity and Goodness */
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
void my... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 966,004 | 966,005 | u777549027 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = int(a); i < int(n); i++)
#define OUT freopen("output.txt", "w", stdout)
#define IN freopen("input.txt", "r", stdin)
#define mem(a, b) memset((a), (b), sizeof(a))
#define NumofDigits(n) ((int)log10(n) + 1)
#define NumofBits(n) ((int)log2(n) + 1)
#define PI 3.141... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = int(a); i < int(n); i++)
#define OUT freopen("output.txt", "w", stdout)
#define IN freopen("input.txt", "r", stdin)
#define mem(a, b) memset((a), (b), sizeof(a))
#define NumofDigits(n) ((int)log10(n) + 1)
#define NumofBits(n) ((int)log2(n) + 1)
#define PI 3.141... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 966,017 | 966,018 | u055038081 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <vector>
using namespace std;
const int mx = 1e5 + 123;
#define mem(a, b) memset(a, b, sizeof(a));
int w[120], v[120], W, n;
long long dp[120][mx];
long long solve(int i, int j) {
if (i > n)
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <vector>
using namespace std;
const int mx = 1e5 + 123;
#define mem(a, b) memset(a, b, sizeof(a));
int w[120], v[120], W, n;
long long dp[120][mx];
long long solve(int i, int j) {
if (i > n)
... | [] | 966,030 | 966,031 | u866491819 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define dbl double
#define forn(i, n, k) for (int i = 0; i < n; i = i + k)
#define forpn(p, n, k) for (int i = p; i < n; i += k)
#define for0(n) for (int i = 0; i < n; i++)
#define for1(n) for (int i = 1; i <= n; i++)
using namespace std;
int no_of_bits(long long n) {
int... | #include <bits/stdc++.h>
#define ll long long
#define dbl double
#define forn(i, n, k) for (int i = 0; i < n; i = i + k)
#define forpn(p, n, k) for (int i = p; i < n; i += k)
#define for0(n) for (int i = 0; i < n; i++)
#define for1(n) for (int i = 1; i <= n; i++)
using namespace std;
int no_of_bits(long long n) {
int... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 965,785 | 965,786 | u883528203 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define dbl double
#define forn(i, n, k) for (int i = 0; i < n; i = i + k)
#define forpn(p, n, k) for (int i = p; i < n; i += k)
#define for0(n) for (int i = 0; i < n; i++)
#define for1(n) for (int i = 1; i <= n; i++)
using namespace std;
int no_of_bits(long long n) {
int... | #include <bits/stdc++.h>
#define ll long long
#define dbl double
#define forn(i, n, k) for (int i = 0; i < n; i = i + k)
#define forpn(p, n, k) for (int i = p; i < n; i += k)
#define for0(n) for (int i = 0; i < n; i++)
#define for1(n) for (int i = 1; i <= n; i++)
using namespace std;
int no_of_bits(long long n) {
int... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 965,787 | 965,786 | u883528203 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define dbl double
#define forn(i, n, k) for (int i = 0; i < n; i = i + k)
#define forpn(p, n, k) for (int i = p; i < n; i += k)
#define for0(n) for (int i = 0; i < n; i++)
#define for1(n) for (int i = 1; i <= n; i++)
using namespace std;
int no_of_bits(long long n) {
int... | #include <bits/stdc++.h>
#define ll long long
#define dbl double
#define forn(i, n, k) for (int i = 0; i < n; i = i + k)
#define forpn(p, n, k) for (int i = p; i < n; i += k)
#define for0(n) for (int i = 0; i < n; i++)
#define for1(n) for (int i = 1; i <= n; i++)
using namespace std;
int no_of_bits(long long n) {
int... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 965,788 | 965,786 | u883528203 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<int> dp(200005);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
for (int j = w - a; j >= 0; j--) {
dp[j + a] = max(dp[j + a], dp[j] + b);
}
}
cout << dp[w] << " ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<long long> dp(200005);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
for (int j = w - a; j >= 0; j--) {
dp[j + a] = max(dp[j + a], dp[j] + b);
}
}
cout << dp[w] << " ";
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,789 | 965,790 | u883528203 | 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 (... | [
"variable_declaration.type.widen.change"
] | 965,801 | 965,802 | u219874809 | cpp |
p03163 | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int wi[100001], vi[100001];
long long dp[105][100005];
int solve(int n, int w) {
if (n == 0 || w == 0)
return 0;
if (dp[n - 1][w] != -1)
return dp[n - 1][w];
if (wi[n - 1] > w) {
return dp[n - 1][w] = solve(n - 1, w);
}
return dp[n -... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int wi[100001], vi[100001];
long long dp[105][100005];
long long solve(int n, int w) {
if (n == 0 || w == 0)
return 0;
if (dp[n - 1][w] != -1)
return dp[n - 1][w];
if (wi[n - 1] > w) {
return dp[n - 1][w] = solve(n - 1, w);
}
return ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,803 | 965,804 | u928828066 | cpp |
p03163 | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int wi[100001], vi[100001];
int dp[105][100005];
int solve(int n, int w) {
if (n == 0 || w == 0)
return 0;
if (dp[n - 1][w] != -1)
return dp[n - 1][w];
if (wi[n - 1] > w) {
return dp[n - 1][w] = solve(n - 1, w);
}
return dp[n - 1][w]... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int wi[100001], vi[100001];
long long dp[105][100005];
long long solve(int n, int w) {
if (n == 0 || w == 0)
return 0;
if (dp[n - 1][w] != -1)
return dp[n - 1][w];
if (wi[n - 1] > w) {
return dp[n - 1][w] = solve(n - 1, w);
}
return ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,805 | 965,804 | u928828066 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
class item {
public:
int weight;
ll value;
};
ll Knapsack1(vector<item> v, int n, int w) {
ll dp[n + 1][w + 1];
for (int wt = 0; wt <= w; wt++)
dp[1][wt] = 0;
dp[1][v[1].weight] = v[1].value;
for (int i = 2; i <= ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
class item {
public:
int weight;
ll value;
};
ll Knapsack1(vector<item> v, int n, int w) {
ll dp[n + 1][w + 1];
for (int wt = 0; wt <= w; wt++)
dp[1][wt] = 0;
dp[1][v[1].weight] = v[1].value;
for (int i = 2; i <= ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,806 | 965,807 | u519412059 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll i, j;
ll n, goal_weight;
ll w[105], v[105];
ll ans;
ll dp[105][100005];
ll fun(ll count, ll current_weight) {
if (count == n)
return 0;
if (dp[count][current_weight] != -1) {
return dp[count][current_weight];
}
ans = fun(count ... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll i, j;
ll n, goal_weight;
ll w[105], v[105];
ll dp[105][100005];
ll fun(ll count, ll current_weight) {
if (count == n)
return 0;
if (dp[count][current_weight] != -1) {
return dp[count][current_weight];
}
ll ans = fun(count + 1,... | [
"variable_declaration.remove"
] | 965,810 | 965,811 | u075311636 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int mxN = 1e2 + 5;
const int mxM = 1e5 + 5;
int dp[mxN][mxM];
int n, w, wei[mxN], val[mxN];
int main() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> wei[i] >> val[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][... | #include <bits/stdc++.h>
using namespace std;
const int mxN = 1e2 + 5;
const int mxM = 1e5 + 5;
long long dp[mxN][mxM];
long long n, w, wei[mxN], val[mxN];
int main() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> wei[i] >> val[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,816 | 965,817 | u464846946 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int w;
cin >> n >> w;
int wt[n];
int 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 = 0; i <= w; i++) {
dp[0][i] = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int w;
cin >> n >> w;
long long int wt[n];
long long int 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 = 0; i <... | [
"variable_declaration.type.widen.change"
] | 965,829 | 965,830 | u348267046 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int l;
l knapsack(l wt[], l v[], l W, l n) {
l dp[n + 1][W + 1];
for (l i = 0; i <= n; i++) {
for (l w = 0; w <= W; w++) {
if (i == 0 || w == 0)
dp[i][w] = 0;
else if (wt[i - 1] <= W) {
dp[i][w] = ma... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int l;
l knapsack(l wt[], l v[], l W, l n) {
l dp[n + 1][W + 1];
for (l i = 0; i <= n; i++) {
for (l w = 0; w <= W; w++) {
if (i == 0 || w == 0)
dp[i][w] = 0;
else if (wt[i - 1] <= w) {
dp[i][w] = ma... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,831 | 965,832 | u947215968 | cpp |
p03163 | // R<3S
#include <bits/stdc++.h>
#define hell 1000000007
#define PI 3.14159265358979323844
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define endl "\n"
#define vecmax(v) max_element(all(v)... | // R<3S
#include <bits/stdc++.h>
#define hell 1000000007
#define PI 3.14159265358979323844
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define endl "\n"
#define vecmax(v) max_element(all(v)... | [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 965,835 | 965,836 | u229122754 | cpp |
p03163 | // R<3S
#include <bits/stdc++.h>
#define hell 1000000007
#define PI 3.14159265358979323844
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define endl "\n"
#define vecmax(v) max_element(all(v)... | // R<3S
#include <bits/stdc++.h>
#define hell 1000000007
#define PI 3.14159265358979323844
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define endl "\n"
#define vecmax(v) max_element(all(v)... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 965,838 | 965,839 | u229122754 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define puts(i) cout << i << endl
#define pi 3.14159265358979323846264338
#define pb push_back
#define mp make_pair
#define inf 10000
using ll = long long;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
ll divisor = 100000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define puts(i) cout << i << endl
#define pi 3.14159265358979323846264338
#define pb push_back
#define mp make_pair
#define inf 10000
using ll = long long;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
ll divisor = 100000... | [
"variable_declaration.type.change"
] | 965,840 | 965,841 | u827974318 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int knapscak(ll a[], ll b[], ll n, ll w) {
ll t[n + 1][w + 1];
for (ll i = 0; i <= n; i++) {
for (ll j = 0; j <= w; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= w; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll knapscak(ll a[], ll b[], ll n, ll w) {
ll t[n + 2][w + 2];
for (ll i = 0; i <= n; i++) {
for (ll j = 0; j <= w; j++) {
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= w; j... | [
"literal.number.change",
"expression.operation.binary.change"
] | 965,844 | 965,845 | u814623049 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> DP(W + 1);
for (int w, v; cin >> w >> v;) {
for (int i = W; i - w >= 0; i--) {
DP.at(i) = max(DP.at(i), DP.at(i - w) + v);
}
}
cout << *max_element(DP.begin(), DP.end()) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<long> DP(W + 1);
for (int w, v; cin >> w >> v;) {
for (int i = W; i - w >= 0; i--) {
DP.at(i) = max(DP.at(i), DP.at(i - w) + v);
}
}
cout << *max_element(DP.begin(), DP.end()) << "\n";
} | [
"variable_declaration.type.primitive.change"
] | 965,847 | 965,848 | u045289115 | cpp |
p03163 | #include <bits/stdc++.h>
#define PB push_back
#define ld long double
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
#define ios ios_base::sync_with_stdio(0);
#define ll long long
#define open(name) ... | #include <bits/stdc++.h>
#define PB push_back
#define ld long double
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
#define ios ios_base::sync_with_stdio(0);
#define ll long long
#define open(name) ... | [
"variable_declaration.type.change"
] | 965,852 | 965,853 | u791636240 | cpp |
p03163 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int root(int arr[], int i) {
while (arr[i] != i) {
arr[i] = arr[arr[i]];
i = arr[i];
}
return i;
}
void Union(int arr[], int Size[], int a, int b) {
int rootA ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int root(int arr[], int i) {
while (arr[i] != i) {
arr[i] = arr[arr[i]];
i = arr[i];
}
return i;
}
void Union(int arr[], int Size[], int a, int b) {
int rootA ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,856 | 965,857 | u377640743 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.14159265359
#define all(v) v.begin(), v.end()
#define vil vector<long int>
#define vi vector<int>
#define pb(x) push_back(x)
#define mxe(v) *max_element(v.begin(), v.end())
#define mne(v) *min_element(v.begin(), v.end())
#define ub uppe... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.14159265359
#define all(v) v.begin(), v.end()
#define vil vector<long int>
#define vi vector<int>
#define pb(x) push_back(x)
#define mxe(v) *max_element(v.begin(), v.end())
#define mne(v) *min_element(v.begin(), v.end())
#define ub uppe... | [
"variable_declaration.type.change"
] | 965,863 | 965,864 | u206487738 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.14159265359
#define all(v) v.begin(), v.end()
#define vil vector<long int>
#define vi vector<int>
#define pb(x) push_back(x)
#define mxe(v) *max_element(v.begin(), v.end())
#define mne(v) *min_element(v.begin(), v.end())
#define ub uppe... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.14159265359
#define all(v) v.begin(), v.end()
#define vil vector<long int>
#define vi vector<int>
#define pb(x) push_back(x)
#define mxe(v) *max_element(v.begin(), v.end())
#define mne(v) *min_element(v.begin(), v.end())
#define ub uppe... | [
"variable_declaration.type.change",
"identifier.change",
"expression.operation.binary.change"
] | 965,865 | 965,864 | u206487738 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.14159265359
#define all(v) v.begin(), v.end()
#define vil vector<long int>
#define vi vector<int>
#define pb(x) push_back(x)
#define mxe(v) *max_element(v.begin(), v.end())
#define mne(v) *min_element(v.begin(), v.end())
#define ub uppe... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.14159265359
#define all(v) v.begin(), v.end()
#define vil vector<long int>
#define vi vector<int>
#define pb(x) push_back(x)
#define mxe(v) *max_element(v.begin(), v.end())
#define mne(v) *min_element(v.begin(), v.end())
#define ub uppe... | [
"variable_declaration.type.change",
"identifier.change",
"expression.operation.binary.change",
"assignment.change"
] | 965,866 | 965,864 | u206487738 | cpp |
p03163 | // A Dynamic Programming based solution for Knapsack problem
#include <iomanip>
#include <iostream>
using namespace std;
long long knapSack01(long long W, int weight[], int val[], int n) {
long long F[n + 1][W + 1];
// Build table K[][] in bottom up manner
for (int k = 0; k <= n; k++) {
for (int w = 0; w <= ... | // A Dynamic Programming based solution for Knapsack problem
#include <iomanip>
#include <iostream>
using namespace std;
long long knapSack01(long long W, int weight[], int val[], int n) {
long long F[n + 1][W + 1];
// Build table K[][] in bottom up manner
for (int k = 0; k <= n; k++) {
for (int w = 0; w <= ... | [
"expression.operation.binary.remove"
] | 966,042 | 966,043 | u930153819 | cpp |
p03163 | // A Dynamic Programming based solution for Knapsack problem
#include <iomanip>
#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 ... | // A Dynamic Programming based solution for Knapsack problem
#include <iomanip>
#include <iostream>
using namespace std;
long long knapSack01(long long W, int weight[], int val[], int n) {
long long F[n + 1][W + 1];
// Build table K[][] in bottom up manner
for (int k = 0; k <= n; k++) {
for (int w = 0; w <= ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 966,044 | 966,043 | u930153819 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long int res(vector<long long int> &va, vector<long long int> &we,
long long int n, long long int w) {
long long int a[n + 1][w + 1];
for (long long int i = 0; i <= w; i++) {
a[0][i] = 0;
}
for (long long int i = 1; i <= n; i++) {
for... | #include <bits/stdc++.h>
using namespace std;
long long int res(vector<long long int> &va, vector<long long int> &we,
long long int n, long long int w) {
long long int a[n + 1][w + 1];
for (long long int i = 0; i <= w; i++) {
a[0][i] = 0;
}
for (long long int i = 1; i <= n; i++) {
for... | [
"expression.operation.binary.remove"
] | 966,051 | 966,052 | u498786935 | cpp |
p03163 | /// Bismillahir Rahmanir Rahim
// Author: Tanvir Hussain
// ICE,NSTU
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
const long long MOD = 1000000007;
#define SET(x) memset(x, 0, sizeof(x))
#define SET2d(x, m, n) mem... | /// Bismillahir Rahmanir Rahim
// Author: Tanvir Hussain
// ICE,NSTU
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
const long long MOD = 1000000007;
#define SET(x) memset(x, 0, sizeof(x))
#define SET2d(x, m, n) mem... | [
"variable_declaration.type.change"
] | 966,059 | 966,060 | u341368129 | cpp |
p03163 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
// BEGIN NO SAD
#define rep(i, a, b) for (int i = a; i < (b); +... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
// BEGIN NO SAD
#define rep(i, a, b) for (int i = a; i < (b); +... | [] | 966,061 | 966,062 | u109256064 | cpp |
p03163 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
// BEGIN NO SAD
#define rep(i, a, b) for (int i = a; i < (b); +... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
// BEGIN NO SAD
#define rep(i, a, b) for (int i = a; i < (b); +... | [
"variable_declaration.type.change"
] | 966,063 | 966,062 | u109256064 | cpp |
p03163 | /*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll int64_t
#define f first
#define s second
#define vll vector<ll>
#define fastio \
ios_base:... | /*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll int64_t
#define f first
#define s second
#define vll vector<ll>
#define fastio \
ios_base:... | [
"call.remove"
] | 966,068 | 966,069 | u953269735 | cpp |
p03163 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-06-17 12:20:49
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 966,070 | 966,071 | u095266283 | cpp |
p03163 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-06-17 12:20:49
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 966,072 | 966,071 | u095266283 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = -2000000000;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n), v(n);
rep(i, n) cin >> w[i] >> v[i];
vector<vector<int>> dp(n + 1, vector<int>(W + ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = -2000000000;
int main() {
ll n, W;
cin >> n >> W;
vector<ll> w(n), v(n);
rep(i, n) cin >> w[i] >> v[i];
vector<vector<ll>> dp(n + 1, vector<ll>(W + 1, 0... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 966,075 | 966,076 | u796877631 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int ans[100005];
int a[100005], b[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
}
int fans = 0;
for (int i = 1; i <= n; i++) {
for (int j = k; j >= a[i]; j--) {
ans[j] = max(ans[j], b[i] + ans[j... | #include <bits/stdc++.h>
using namespace std;
long long ans[100005];
long long a[100005], b[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
}
long long fans = 0;
for (int i = 1; i <= n; i++) {
for (int j = k; j >= a[i]; j--) {
ans[j] = max(an... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,077 | 966,078 | u652662440 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN... | [
"call.arguments.add"
] | 966,081 | 966,082 | u700986952 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, l, n) for (long long i = (l); i < (long long)(n); i++)
#define REP(i, n) for (long long i = 1; i <= (long long)(n); i++)
using namespace std;
/*
long long rec(long long i, long long j) {
if (dp[i][j] > ... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, l, n) for (long long i = (l); i < (long long)(n); i++)
#define REP(i, n) for (long long i = 1; i <= (long long)(n); i++)
using namespace std;
/*
long long rec(long long i, long long j) {
if (dp[i][j] > ... | [
"expression.operation.binary.remove"
] | 966,085 | 966,086 | u041662998 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll w[n + 1], v[n + 1];
w[0] = 0;
v[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> w[i] >> v[i];
}
ll dp[n][k];
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= k; ++j) {
if (... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll w[n + 1], v[n + 1];
w[0] = 0;
v[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> w[i] >> v[i];
}
ll dp[n + 1][k + 1];
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= k; ++j) {
... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 966,089 | 966,090 | u483794341 | cpp |
p03163 | #include <bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define pp pair<ll, ll>
#define vi vector<ll>
#define vvi vector<vi>
#define vb vector<bool>
#define vvb vector<vb>
using namespace std;
int knapsack(vi &profit, vi &wt, ll maxwt) {
vvi dp(profit.size() + 1, vi(maxwt + 1, 0));
for (int i = 1;... | #include <bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define pp pair<ll, ll>
#define vi vector<ll>
#define vvi vector<vi>
#define vb vector<bool>
#define vvb vector<vb>
using namespace std;
ll knapsack(vi &profit, vi &wt, ll maxwt) {
vvi dp(profit.size() + 1, vi(maxwt + 1, 0));
for (int i = 1; ... | [] | 966,100 | 966,101 | u704524932 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define LD long double
#define LL long long int
#define ULL unsigned long long
#define vi vector<int>
#define mod 1000000007
int main() {
int N, W;
cin >> N >> W;
vector<int> weights;
vector<int> values;
weights.push_back(0);
values.push_back(0);
for (int... | #include <bits/stdc++.h>
using namespace std;
#define LD long double
#define LL long long int
#define ULL unsigned long long
#define vi vector<int>
#define mod 1000000007
int main() {
int N, W;
cin >> N >> W;
vector<ULL> weights;
vector<ULL> values;
weights.push_back(0);
values.push_back(0);
for (int... | [
"call.arguments.change"
] | 966,103 | 966,104 | u833101561 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, W;
cin >> n >> W;
int dp[n + 1][W + 1];
int w[n], v[n];
for (i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (i = 0; i <= n; i++) {
for (j = 0; j <= W; j++) {
if (i == 0 || j == 0) {
dp[i][j] = 0;
con... | #include <bits/stdc++.h>
using namespace std;
int main() {
long i, j, n, W;
cin >> n >> W;
long dp[n + 1][W + 1];
long w[n], v[n];
for (i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (i = 0; i <= n; i++) {
for (j = 0; j <= W; j++) {
if (i == 0 || j == 0) {
dp[i][j] = 0;
... | [
"variable_declaration.type.primitive.change"
] | 966,105 | 966,106 | u496722670 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define MP make_pair
#define S second
#define F first
//#define D cout<<"*\n";
#define fast \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define MP make_pair
#define S second
#define F first
//#define D cout<<"*\n";
#define fast \
ios_base::sync_with_stdio(0); ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 966,110 | 966,111 | u693178143 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxN = 1e5 + 10;
int N, W, v[111], w[111], mem[111][maxN];
int dp(int i, int cap) {
if (i == N)
return 0;
if (mem[i][cap] != -1)
return mem[i][cap];
int path1 = dp(i + 1, cap);
int path2 = 0;
if (cap + w[i] <= W)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxN = 1e5 + 10;
int N, W, v[111], w[111];
ll mem[111][maxN];
ll dp(int i, int cap) {
if (i == N)
return 0;
if (mem[i][cap] != -1)
return mem[i][cap];
ll path1 = dp(i + 1, cap);
ll path2 = 0;
if (cap + w[i] <= W)
... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 966,112 | 966,113 | u027405444 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int knapsack(int wt[], int val[], int n, int w) {
long int dp[n + 1][w + 1];
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < w + 1; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
}
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; ... | #include <bits/stdc++.h>
using namespace std;
long long int knapsack(int wt[], int val[], int n, int w) {
long long int dp[n + 1][w + 1];
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < w + 1; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
}
}
for (int i = 1; i < n + 1; i++) {
f... | [
"variable_declaration.type.widen.change"
] | 966,114 | 966,115 | u910056155 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int knapsack(int wt[], int val[], int n, int w) {
int dp[n + 1][w + 1];
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < w + 1; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
}
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < w... | #include <bits/stdc++.h>
using namespace std;
long long int knapsack(int wt[], int val[], int n, int w) {
long long int dp[n + 1][w + 1];
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < w + 1; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
}
}
for (int i = 1; i < n + 1; i++) {
f... | [
"variable_declaration.type.widen.change"
] | 966,116 | 966,115 | u910056155 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int knapsack(int wt[], int val[], int n, int w) {
int dp[n + 1][w + 1];
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < w + 1; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
}
}
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < w... | #include <bits/stdc++.h>
using namespace std;
long long int knapsack(int wt[], int val[], int n, int w) {
long long int dp[n + 1][w + 1];
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < w + 1; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
}
}
for (int i = 1; i < n + 1; i++) {
f... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 966,117 | 966,115 | u910056155 | cpp |
p03163 |
// secreterror
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rev(i, n) for (ll i = n - 1; i >= 0; i--)
#define forr(i, x, y) for (ll i = x; i < y; i++)
#define f first
#define s second
#define vll vector<ll>
#define vvll vector<vector<ll>>
#defi... |
// secreterror
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rev(i, n) for (ll i = n - 1; i >= 0; i--)
#define forr(i, x, y) for (ll i = x; i < y; i++)
#define f first
#define s second
#define vll vector<ll>
#define vvll vector<vector<ll>>
#defi... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 966,134 | 966,135 | u878396672 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
pair<long long int, long long int> w[n];
for (int i = 0; i < n; i++) {
cin >> w[i].first >> w[i].second;
}
sort(w, w + n);
vector<vector<long long int>> dp(n + 1, vector<long long int>(k + 1, 0));
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
pair<long long int, long long int> w[n];
for (int i = 0; i < n; i++) {
cin >> w[i].first >> w[i].second;
}
sort(w, w + n);
vector<vector<long long int>> dp(n + 1, vector<long long int>(k + 1, 0));
for (int i = 1; ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change"
] | 966,140 | 966,141 | u022396000 | cpp |
p03163 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dp[5000][5000];
ll fun(ll *w, ll *v, ll i, ll n, ll W) {
if (i >= n) {
return 0;
}
if (dp[i][W] != -1) {
return dp[i][W];
}
if (W - w[i] >= 0) {
return dp[i][W] = max(v[i] + fun(w, v, i + 1, n, W - w[i]),
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[100][100000];
ll fun(ll *w, ll *v, ll i, ll n, ll W) {
if (i >= n) {
return 0;
}
if (dp[i][W] != -1) {
return dp[i][W];
}
if (W - w[i] >= 0) {
return dp[i][W] = max(v[i] + fun(w, v, i + 1, n, W - w[i]),
... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 966,142 | 966,143 | u402612387 | cpp |
p03163 | // dp_d.cc
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, W;
scanf("%d%d", &a, &W);
vector<int> w(a), v(a);
vector<int> dp(W + 1, 0);
for (int i = 0; i < a; i++) {
scanf("%d%d", &w[i], &v[i]);
// }
// for (int i = 0; i < a; i++) {
for (int j = W - w[i]; j >= 0; j--) {
... | // dp_d.cc
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, W;
scanf("%d%d", &a, &W);
vector<int> w(a), v(a);
vector<long long> dp(W + 1, 0);
for (int i = 0; i < a; i++) {
scanf("%d%d", &w[i], &v[i]);
// }
// for (int i = 0; i < a; i++) {
for (int j = W - w[i]; j >= 0; j--) {... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 966,144 | 966,145 | u349225213 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define pb push_back
// #define vi vector<int>
// #define usi unordered_set<int>
// #define si set<int>
// #define umii unordered_map<int, int>
// #define mii map<int, int>
// #define all(a) a.begin(), a.end()
// #define vii vector<pair<int, int>>
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> v(n), w(n);
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
for (int i = 0; i < n; i++) {
cin >> w[i] >>... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 966,146 | 966,147 | u091408899 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int N = 200, W = 1e5 + 100;
int v[N], w[N];
long long dp[N][W];
int main() {
int n, we;
cin >> n >> we;
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = n - 1; i >= 0; i--)
for (int j = 0; j <= we; j++)
dp[i][j] =
max(dp[i... | #include <bits/stdc++.h>
using namespace std;
const int N = 200, W = 1e5 + 100;
int v[N], w[N];
long long dp[N][W];
int main() {
int n, we;
cin >> n >> we;
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = n - 1; i >= 0; i--)
for (int j = 0; j <= we; j++)
dp[i][j] =
max(dp[i... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 966,152 | 966,153 | u872069739 | cpp |
p03163 | #include <iostream>
using namespace std;
void dp(int wt[], int val[], int n, int w) {
int matrix[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
matrix[i][j] = 0;
else if (j >= wt[i])
matrix[i][j] = max(val[i] + matrix[i - 1][j - wt... | #include <iostream>
using namespace std;
void dp(int wt[], int val[], int n, int w) {
long int matrix[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
matrix[i][j] = 0;
else if (j >= wt[i])
matrix[i][j] = max(val[i] + matrix[i - 1][j... | [
"variable_declaration.type.widen.change"
] | 966,158 | 966,159 | u452103000 | cpp |
p03163 | /// @pSaurabh
#include <bits/stdc++.h>
using namespace std;
#define read(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define print(a, n) ... | /// @pSaurabh
#include <bits/stdc++.h>
using namespace std;
#define read(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define print(a, n) ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 966,164 | 966,165 | u920545417 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int a[n][2];
vector<vector<int>> dp(n + 1, vector<int>(w + 1, 0));
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
if (... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long int a[n][2];
vector<vector<long int>> dp(n + 1, vector<long int>(w + 1, 0));
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j+... | [
"variable_declaration.type.widen.change"
] | 966,166 | 966,167 | u983194109 | cpp |
p03163 | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef map<int, int> mii;
typedef pair<int, int> pii;
#define INF 1000000000
#define MOD 1000000007
#define itr ::iterator it
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a),... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef map<int, int> mii;
typedef pair<int, int> pii;
#define INF 1000000000
#define MOD 1000000007
#define itr ::iterator it
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a),... | [] | 966,178 | 966,179 | u551630432 | cpp |
p03163 | using namespace std;
#include <bits/stdc++.h>
#define Debug(...) fprintf(stderr, __VA_ARGS__)
#define st first
#define nd second
#define FORE(i, a, b) for (int i = (a), b_ = (b); i <= b_; ++i)
#define FORD(i, a, b) for (int i = (a), b_ = (b); i >= b_; --i)
#define TR(c, it) ... | using namespace std;
#include <bits/stdc++.h>
#define Debug(...) fprintf(stderr, __VA_ARGS__)
#define st first
#define nd second
#define FORE(i, a, b) for (int i = (a), b_ = (b); i <= b_; ++i)
#define FORD(i, a, b) for (int i = (a), b_ = (b); i >= b_; --i)
#define TR(c, it) ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,180 | 966,181 | u617431891 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, w;
cin >> n >> w;
vector<int> wi(n, 0);
vector<int> vi(n, 0);
for (int i = 0; i < n; ++i) {
int w_tmp, v_tmp;
cin >> w_tmp >> v_tmp;
wi.at(i) = w_tmp;
vi.at(i) = v_tmp;
}
vector<vector<long long int>> vt(n + 1, vecto... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, w;
cin >> n >> w;
vector<int> wi(n, 0);
vector<int> vi(n, 0);
for (int i = 0; i < n; ++i) {
int w_tmp, v_tmp;
cin >> w_tmp >> v_tmp;
wi.at(i) = w_tmp;
vi.at(i) = v_tmp;
}
vector<vector<long long int>> vt(n + 1, vecto... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 966,184 | 966,185 | u150012595 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < (int)(n); ++i)
#define lpi(i,... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < (int)(n); ++i)
#define lpi(i,... | [
"expression.operation.binary.add"
] | 966,193 | 966,194 | u657470843 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < (int)(n); ++i)
#define lpi(i, ... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < (int)(n); ++i)
#define lpi(i, ... | [
"variable_declaration.type.change"
] | 966,195 | 966,196 | u657470843 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll N, W;
cin >> N >> W;
int weights[N], values[N];
for (int i = 0; i < N; i++) {
cin >> weights[i] >> values[i];
}
int dp[N + 1][W + 1];
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= W; j++) {
if (i ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll N, W;
cin >> N >> W;
int weights[N], values[N];
for (int i = 0; i < N; i++) {
cin >> weights[i] >> values[i];
}
ll dp[N + 1][W + 1];
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= W; j++) {
if (i == ... | [
"variable_declaration.type.change"
] | 966,197 | 966,198 | u303461239 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int INF = 1e9 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, w;
cin >> n >> w;
vector<int> item(w + 1);
for (int i = 0; i < n; i++) {
int weight, val;
cin >> weight >> val;
for (int j = w; j >= weight; j--) {
i... | #include <bits/stdc++.h>
using namespace std;
int INF = 1e9 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, w;
cin >> n >> w;
vector<long long> item(w + 1);
for (int i = 0; i < n; i++) {
int weight, val;
cin >> weight >> val;
for (int j = w; j >= weight; j--) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,207 | 966,208 | u353706368 | cpp |
p03163 |
#include <bits/stdc++.h>
#include <dirent.h>
#include <stdlib.h>
using namespace std;
#define sp << " " <<
typedef vector<int> vi;
typedef vector<long int> vli;
typedef vector<long long int> vlli;
typedef long int li;
typedef long long int lli;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<lli, lli>> vplli;
... |
#include <bits/stdc++.h>
#include <dirent.h>
#include <stdlib.h>
using namespace std;
#define sp << " " <<
typedef vector<int> vi;
typedef vector<long int> vli;
typedef vector<long long int> vlli;
typedef long int li;
typedef long long int lli;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<lli, lli>> vplli;
... | [
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 966,209 | 966,210 | u083076249 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, W;
cin >> n >> W;
int w[n + 1], v[n + 1];
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
int a[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>
#define ll long long
using namespace std;
int main() {
ll n, W;
cin >> n >> W;
ll w[n + 1], v[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
ll a[n + 1][W + 1];
for (ll i = 0; i <= n; i++) {
for (ll j = 0; j <= W; j++) {
if (i == 0 || j == 0) {
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 966,213 | 966,214 | u948379857 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define llu unsigned long long int
#define fo(i, n) for (int i = 0; i < n; i++)
#define eb emplace_back
#define M 1000000007
#define vi vector<int>
#define vlli vector<lli>
#define pi pair<int, int>
#define mp make_pair
#define mapi map<int, int>
l... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define llu unsigned long long int
#define fo(i, n) for (int i = 0; i < n; i++)
#define eb emplace_back
#define M 1000000007
#define vi vector<int>
#define vlli vector<lli>
#define pi pair<int, int>
#define mp make_pair
#define mapi map<int, int>
l... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 966,215 | 966,216 | u308644372 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
int main() {
ll n, W;
cin >> n >> W;
ll i, j;
ll w[n + 1], v[n + 1];
w[0] = 0;
v[0] = 0;
for (i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
ll dp[n + 1][W + 1];
for (i = 0; i < W + 1; i++)
dp[0][i] = 0;
for (i = 0; i < n + 1; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, W;
cin >> n >> W;
ll i, j;
ll w[n + 1], v[n + 1];
w[0] = 0;
v[0] = 0;
for (i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
ll dp[n + 1][W + 1];
for (i = 0; i < W + 1; i++)
dp[0][i] = 0;
for (i = 0; i ... | [
"variable_declaration.type.widen.change"
] | 966,222 | 966,223 | u850089425 | cpp |
p03163 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef long double ld;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
ll exp(ll x... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef long double ld;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
ll exp(ll x... | [
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 966,231 | 966,232 | u330328563 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, wt;
cin >> n >> wt;
int w[n], val[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> val[i];
}
int dp[2][wt + 1];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < wt + 1; j++) {
dp[i][j] = 0;
}
}
for (int i = 1; i < n +... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, wt;
cin >> n >> wt;
long long w[n], val[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> val[i];
}
long long dp[2][wt + 1];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < wt + 1; j++) {
dp[i][j] = 0;
}
}
for (... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,239 | 966,240 | u320677093 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
int knapsack(vector<long long int> &wt, vector<long long int> &val, int n,
int Weight) {
vector<long long int> dp(10e5);
for (int i = 1; i <= n; i++) {
for (int w = Weight; w >= 0; w--) {
if (w >= wt[i - 1])
dp... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
long long int knapsack(vector<long long int> &wt, vector<long long int> &val,
int n, int Weight) {
vector<long long int> dp(10e5);
for (int i = 1; i <= n; i++) {
for (int w = Weight; w >= 0; w--) {
if (w >= w... | [
"variable_declaration.type.widen.change"
] | 966,241 | 966,242 | u898200089 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF (long long int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define ll long long int
#define ret return
#define NUM 100020
void fastio() {
ios_base::sync_w... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF (long long int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define ll long long int
#define ret return
#define NUM 100020
void fastio() {
ios_base::sync_w... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 966,243 | 966,244 | u168216888 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first // For pairs
#define ss second // For pairs
#define sz(a) int((a).size()) // Function to determine size of any container
#define pb push_back // Pushback to vector
#define mp make_pair // Mak... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first // For pairs
#define ss second // For pairs
#define sz(a) int((a).size()) // Function to determine size of any container
#define pb push_back // Pushback to vector
#define mp make_pair // Mak... | [
"expression.operation.binary.remove"
] | 966,249 | 966,250 | u159748458 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int INF = 1e9;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n), v(n);
re... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int INF = 1e9;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n);
vector<l... | [] | 966,265 | 966,266 | u648009244 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define pb push_back
#define fi first
#define si second
#define mp make_pair
#define f(n) for (ll i = 0; i < n; i++)
#define ff(m) for (ll j = 0; j < m; j++)
#define fr(i, p, n) for (ll i = p; i < n; i++)
#define in insert
ll ... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define pb push_back
#define fi first
#define si second
#define mp make_pair
#define f(n) for (ll i = 0; i < n; i++)
#define ff(m) for (ll j = 0; j < m; j++)
#define fr(i, p, n) for (ll i = p; i < n; i++)
#define in insert
ll ... | [
"identifier.change",
"expression.operation.binary.change"
] | 966,270 | 966,271 | u339112743 | cpp |
p03163 | #include <iostream>
using namespace std;
int main() {
int n, w, dp[2][200000];
cin >> n >> w;
for (int i = 0; i < w; i++) {
dp[0][i] = 0;
dp[1][i] = 0;
}
for (int i = 0; i < n; i++) {
int tmpw, tmpv;
cin >> tmpw >> tmpv;
for (int j = 1; j <= w; j++) {
// new=dp[n%2] old=dp[(n+1)%2]
... | #include <iostream>
using namespace std;
int main() {
int n, w;
long long dp[2][100002];
cin >> n >> w;
for (int i = 0; i < w; i++) {
dp[0][i] = 0;
dp[1][i] = 0;
}
for (int i = 0; i < n; i++) {
int tmpw, tmpv;
cin >> tmpw >> tmpv;
for (int j = 1; j <= w; j++) {
// new=dp[n%2] old=... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 966,276 | 966,277 | u499619187 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
long long solveKnapsack(vector<int> &profits, vector<int> &weights,
int capacity) {
// basic checks
if (capacity <= 0 || profits.empty() || weights.size() != profits.size()) {
return 0;
}
int n = profits.size();
vector<v... | #include <iostream>
#include <vector>
using namespace std;
long long solveKnapsack(vector<int> &weights, vector<int> &profits,
int capacity) {
// basic checks
if (capacity <= 0 || profits.empty() || weights.size() != profits.size()) {
return 0;
}
int n = profits.size();
vector<v... | [
"identifier.change"
] | 966,278 | 966,279 | u638254110 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll int n, w;
cin >> n >> w;
pair<ll int, ll int> values[n];
for (ll int i = 0; i < n; i++) {
cin >> values[i].first >> values[i].second;
}
ll int dp[2][w + 1];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll int n, w;
cin >> n >> w;
pair<ll int, ll int> values[n];
for (ll int i = 0; i < n; i++) {
cin >> values[i].first >> values[i].second;
}
ll int dp[2][w + 1];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++) {
... | [
"call.arguments.change"
] | 966,288 | 966,289 | u266048884 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int val[n], weight[n];
for (int i = 0; i < n; ++i) {
cin >> weight[i] >> val[i];
}
int m[n + 1][w + 1]; // m[i][j] denotes the maximum value taking max weight
// limit of j and considering i eleme... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long long int val[n], weight[n];
for (int i = 0; i < n; ++i) {
cin >> weight[i] >> val[i];
}
long long int m[n + 1][w + 1]; // m[i][j] denotes the maximum value taking max
// weight limi... | [
"variable_declaration.type.widen.change"
] | 966,292 | 966,293 | u867806614 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
int main() {
std::ios::sync_with_stdio(false);
using namespace std;
int n, w, a, b;
cin >> n >> w;
vector<int> A(w + 1, 0);
for (int i = 0; i < n; i++) {
cin >> a >> b;
for (int j = w - a; j >= 0; j--)
A[j + a] = max(A[j + a], A[j] + b);
}
co... | #include <bits/stdc++.h>
#define ll long long
int main() {
std::ios::sync_with_stdio(false);
using namespace std;
ll n, w, a, b;
cin >> n >> w;
vector<ll> A(w + 1, 0);
for (int i = 0; i < n; i++) {
cin >> a >> b;
for (int j = w - a; j >= 0; j--)
A[j + a] = max(A[j + a], A[j] + b);
}
cout... | [
"variable_declaration.type.change"
] | 966,296 | 966,297 | u135880256 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
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;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
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;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 966,300 | 966,301 | u646962247 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N;
long long W, weight[110], value[11... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N;
long long W, weight[110], value[11... | [] | 966,308 | 966,309 | u336145516 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int n, W;
int w[105], v[105];
int dp[105][105];
int solve(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
int res;
if (i == n)
res = 0;
else if (j < w[i])... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int n, W;
int w[105], v[105];
ll dp[105][100100];
ll solve(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
ll res;
if (i == n)
res = 0;
else if (j < w[i])... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 966,312 | 966,311 | u259578308 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.