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 <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,787 | 966,788 | u169524054 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W, i, j;
cin >> n >> W;
int w[n + 1], v[n + 1];
for (i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
int k[n + 1][W + 1];
for (i = 0; i <= n; i++) {
k[i][0] = 0;
}
for (i = 0; i <= W; i++) {
k[0][i] = 0;
}
for (i = 1; i <= n... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, W, i, j;
cin >> n >> W;
long long w[n + 1], v[n + 1];
for (i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
long long k[n + 1][W + 1];
for (i = 0; i <= n; i++) {
k[i][0] = 0;
}
for (i = 0; i <= W; i++) {
k[0][i] = 0;
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,793 | 966,794 | u580216411 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = a; i < b; ++i)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, W;
cin >> N >> W;
vector<ll> weights(N + 1), values(N + 1);
loop(i, 1, N) cin >> weights[i] >> values[i];
vector<vector<l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = a; i < b; ++i)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, W;
cin >> N >> W;
vector<ll> weights(N + 1), values(N + 1);
loop(i, 1, N + 1) cin >> weights[i] >> values[i];
vector<vect... | [
"call.arguments.change"
] | 966,797 | 966,798 | u158826456 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(x, val) memset(x, val, sizeof(x));
int v[105], w[105];
int n;
int weight;
int dp[105][100005];
ll cal(int pos, int cap) {
if (pos >= n) {
return 0;
}
if (dp[pos][cap] != -1)
return dp[pos][cap];
ll x = 0, y = 0;
if (cap +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(x, val) memset(x, val, sizeof(x));
int v[105], w[105];
int n;
int weight;
ll dp[105][100005];
ll cal(int pos, int cap) {
if (pos >= n) {
return 0;
}
if (dp[pos][cap] != -1)
return dp[pos][cap];
ll x = 0, y = 0;
if (cap + ... | [
"variable_declaration.type.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 966,799 | 966,800 | u562027277 | cpp |
p03163 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repc(i, a, b, c) \
for (ll i = a; (c > 0 ? i < b : i > b) and c != 0; i += c)
#define mp make_pair
#define pb push... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repc(i, a, b, c) \
for (ll i = a; (c > 0 ? i < b : i > b) and c != 0; i += c)
#define mp make_pair
#define pb push... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 966,801 | 966,802 | u202796595 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int n;
long long valor[105];
long long peso[105];
long long dp[105000][1060];
int p;
long long pd(long long id, long long aguenta) {
if (dp[id][aguenta] != -1) {
return dp[id][aguenta];
}
if (id == n or !aguenta) {
return dp[id][aguenta] = 0;
}
long lo... | #include <bits/stdc++.h>
using namespace std;
int n;
long long valor[105];
long long peso[105];
long long dp[105][106000];
int p;
long long pd(long long id, long long aguenta) {
if (dp[id][aguenta] != -1) {
return dp[id][aguenta];
}
if (id == n or !aguenta) {
return dp[id][aguenta] = 0;
}
long lon... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 966,803 | 966,804 | u557463467 | cpp |
p03163 | /*
*/
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | /*
*/
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | [] | 966,809 | 966,810 | u378221363 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define fore(i, a, b) for (int i = a; i < b; i++)
#define maxe(a, b, c) max(a, max(b, c))
#define pb push_back
#define eb emplace_back
#define em emplace
#define print(x) cout << x << endl;
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define fore(i, a, b) for (int i = a; i < b; i++)
#define maxe(a, b, c) max(a, max(b, c))
#define pb push_back
#define eb emplace_back
#define em emplace
#define print(x) cout << x << endl;
typedef long lo... | [
"variable_declaration.type.change"
] | 966,817 | 966,818 | u719855312 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
class Knapsack {
public:
vector<vector<long long>> dp;
int solve(vector<long long> &val, vector<long long> &wt, int item,
int capacity) {
if (item <= 0 || capacity <= 0)
return 0;
if (dp[item][capacity] != -1)
return dp[item][capacity... | #include <bits/stdc++.h>
using namespace std;
class Knapsack {
public:
vector<vector<long long>> dp;
long long solve(vector<long long> &val, vector<long long> &wt, int item,
int capacity) {
if (item <= 0 || capacity <= 0)
return 0;
if (dp[item][capacity] != -1)
return dp[it... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,819 | 966,820 | u192061265 | cpp |
p03163 | #include <bits/stdc++.h>
#define int ll
#define D(x) cout << "D: " << #x << '=' << x << endl;
#define R(x, l) \
cout << "R: Array " << #x << endl; \
for (int i = 0; i < l; i++) ... | #include <bits/stdc++.h>
#define int ll
#define D(x) cout << "D: " << #x << '=' << x << endl;
#define R(x, l) \
cout << "R: Array " << #x << endl; \
for (int i = 0; i < l; i++) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 966,826 | 966,825 | u313129279 | cpp |
p03163 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vi vector<i... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vi vector<i... | [
"variable_declaration.type.widen.change"
] | 966,831 | 966,832 | u809582239 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int n, w, dp[100001], maxi;
int main() {
cin >> n >> w;
for (int i = 0; i < n; i += 1) {
int a, b;
cin >> a >> b;
for (int j = w; j >= a; j -= 1) {
dp[j] = max(dp[j], dp[j - a] + b);
maxi = max(maxi, dp[j]);
}
}
cout << maxi << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long n, w, dp[100001], maxi;
int main() {
cin >> n >> w;
for (int i = 0; i < n; i += 1) {
int a, b;
cin >> a >> b;
for (int j = w; j >= a; j -= 1) {
dp[j] = max(dp[j], dp[j - a] + b);
maxi = max(maxi, dp[j]);
}
}
cout << maxi << end... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,835 | 966,836 | u689442090 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, i, j;
cin >> n;
cin >> c;
vector<int> w(n + 1);
vector<int> v(n + 1);
vector<vector<int>> kp(n + 1, vector<int>(c + 1));
kp[0] = vector<int>(c + 1, 0);
for (i = 1; i < n + 1; i++)
kp[i][0] = 0;
w[0] = 0;
v[0] = 0;
for (i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, i, j;
cin >> n;
cin >> c;
vector<int> w(n + 1);
vector<long int> v(n + 1);
vector<vector<long int>> kp(n + 1, vector<long int>(c + 1));
kp[0] = vector<long int>(c + 1, 0);
for (i = 1; i < n + 1; i++)
kp[i][0] = 0;
w[0] = 0;
... | [
"variable_declaration.type.widen.change"
] | 966,837 | 966,838 | u596879772 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
#define rep(i, a, b) for (int i = a; i < b; i += 1)
#define vi vector<int>
using namespace std;
int helper(int n, int w, int *weights, int *values) {
int ans[2][w + 1];
rep(i, 0, w + 1) ans[0][i] = 0;
int res = 1;
rep(i, 1, n + 1) {
rep(j, 0, w + 1) {
... | #include <bits/stdc++.h>
#define int long long
#define rep(i, a, b) for (int i = a; i < b; i += 1)
#define vi vector<int>
using namespace std;
int helper(int n, int w, int *weights, int *values) {
int ans[2][w + 1];
rep(i, 0, w + 1) ans[0][i] = 0;
int res = 1;
rep(i, 1, n + 1) {
rep(j, 0, w + 1) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 966,847 | 966,848 | u547231875 | cpp |
p03163 | // youngjinp20
// 2020 03
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 100;
int N, W;
int w[MAX];
int v[MAX];
int main() {
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
int dp[W + 1] = {0};
for (int j = 0; j < N; j++) {
for (int i = W... | // youngjinp20
// 2020 03
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 100;
int N, W;
int w[MAX];
int v[MAX];
int main() {
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
ll dp[W + 1] = {0};
for (int j = 0; j < N; j++) {
for (int i = W;... | [
"variable_declaration.type.change"
] | 966,849 | 966,850 | u688683948 | cpp |
p03163 | /*
_ __ _ _ _ ____ _____
| |/ / / \ | | | / ___|_ _|
| ' / / _ \| | | \___ \ | |
| . \ / ___ \ |_| |___) || |
|_|\_\/_/ \_\___/|____/ |_|
*/
#include <bits/stdc++.h>
#include <fstream>
#define rep(i, a, b) for (long long i = (a); i < (b); i++)
#define per(i, a, b) for (long long i = (a); i > (b); i--)... | /*
_ __ _ _ _ ____ _____
| |/ / / \ | | | / ___|_ _|
| ' / / _ \| | | \___ \ | |
| . \ / ___ \ |_| |___) || |
|_|\_\/_/ \_\___/|____/ |_|
*/
#include <bits/stdc++.h>
#include <fstream>
#define rep(i, a, b) for (long long i = (a); i < (b); i++)
#define per(i, a, b) for (long long i = (a); i > (b); i--)... | [
"variable_declaration.type.change"
] | 966,851 | 966,852 | u054759548 | cpp |
p03163 | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>--------------------
#include <bits/stdc++.h>
#define ll long long
using namespace std;
// #include <ext/pb_ds/asso... | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>--------------------
#include <bits/stdc++.h>
#define ll long long
using namespace std;
// #include <ext/pb_ds/asso... | [] | 966,857 | 966,858 | u307290797 | cpp |
p03163 | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>--------------------
#include <bits/stdc++.h>
#define ll long long
using namespace std;
// #include <ext/pb_ds/asso... | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>--------------------
#include <bits/stdc++.h>
#define ll long long
using namespace std;
// #include <ext/pb_ds/asso... | [
"expression.operation.binary.remove"
] | 966,859 | 966,858 | u307290797 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <vector>
#define lli long long int
#define endl "\n"
#define whats(x) cout << #x << " is: " << x << endl;
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, w;
cin >> n >> w;
lli weights[n + 1];
lli values[n + 1];
... | #include <algorithm>
#include <iostream>
#include <vector>
#define lli long long int
#define endl "\n"
#define whats(x) cout << #x << " is: " << x << endl;
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, w;
cin >> n >> w;
lli weights[n + 1];
lli values[n + 1];
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 966,867 | 966,866 | u519787311 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = a; i < b; ++i)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, W;
cin >> N >> W;
vector<ll> weights(N + 1), values(N + 1);
for (int i = 1; i <= N; ++i)
cin >> weights[i] >> values[i]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = a; i < b; ++i)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, W;
cin >> N >> W;
vector<ll> weights(N + 1), values(N + 1);
for (int i = 1; i <= N; ++i)
cin >> weights[i] >> values[i]... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 966,868 | 966,869 | u212258177 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 101
#define MAX_W 100001
int N, W;
long long Lookup[MAX_N][MAX_W];
int wei[MAX_N];
long long val[MAX_N];
long long Knapsack(int c, int n) {
if (W == 0 || n == 0)
return 0;
if (Lookup[n][c] != -1)
return Lookup[n][c];
if (W - wei[n] >= 0)
r... | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 101
#define MAX_W 100001
int N, W;
long long Lookup[MAX_N][MAX_W];
int wei[MAX_N];
long long val[MAX_N];
long long Knapsack(int c, int n) {
if (c == 0 || n == 0)
return 0;
if (Lookup[n][c] != -1)
return Lookup[n][c];
if (c - wei[n] >= 0)
r... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 966,870 | 966,871 | u212258177 | cpp |
p03163 | // A Dynamic Programming based solution for 0-1 Knapsack problem
#include <bits/stdc++.h>
using namespace std;
int max(int a, int b) { return (a > b) ? a : b; }
double K[102][100005];
// Returns the maximum value that can be put in a knapsack of capacity W
int knapSack(int W, int wt[], int val[], int n) {
int i, w;
... | // A Dynamic Programming based solution for 0-1 Knapsack problem
#include <bits/stdc++.h>
using namespace std;
int max(int a, int b) { return (a > b) ? a : b; }
long int K[102][100005];
// Returns the maximum value that can be put in a knapsack of capacity W
int knapSack(int W, int wt[], int val[], int n) {
int i, w... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,872 | 966,873 | u431571098 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool compare(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second > b.second);
}
int findmax(int arr[], int n) {
int curr_max = -1;
for (int i = 0; i < n; i++) {
curr_max = max(curr_max, arr[i]);
}
return curr_max;
}
int fi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool compare(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second > b.second);
}
int findmax(int arr[], int n) {
int curr_max = -1;
for (int i = 0; i < n; i++) {
curr_max = max(curr_max, arr[i]);
}
return curr_max;
}
int fi... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 966,874 | 966,875 | u058292044 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
#define maxy __LONG_LONG_MAX__
#define mod 1000000007
using namespace std;
int main() {
ll n, w;
cin >> n >> w;
int wt[n], val[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
int v[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
v[i][0] =... | #include <bits/stdc++.h>
#define ll long long int
#define maxy __LONG_LONG_MAX__
#define mod 1000000007
using namespace std;
int main() {
ll n, w;
cin >> n >> w;
ll wt[n], val[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
ll v[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
v[i][0] = 0... | [
"variable_declaration.type.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 966,876 | 966,877 | u521434647 | cpp |
p03163 | #include <iostream>
using namespace std;
long long dp[110][100010];
int main() {
int n, m;
int v[110], w[110];
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
dp[i][j] = dp[i - 1][j];
if (w[i] <= j)
d... | #include <iostream>
using namespace std;
long long dp[110][100010];
int main() {
int n, m;
int v[110], w[110];
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
dp[i][j] = dp[i - 1][j];
if (w[i] <= j)
d... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 966,878 | 966,879 | u987727193 | cpp |
p03163 | #include <iostream>
#include <math.h>
using namespace std;
int dp[100010][110];
main() {
int n, m, v[1500], w[1500];
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
dp[0][0] = 0;
for (int i = 1; i <= m; i++) {
for (int k = 1; k <= n; k++) {
dp[i][k] = dp[i][k - 1];
if (w[... | #include <iostream>
#include <math.h>
using namespace std;
long long dp[100010][110];
main() {
int n, m, v[1500], w[1500];
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
dp[0][0] = 0;
for (int i = 1; i <= m; i++) {
for (int k = 1; k <= n; k++) {
dp[i][k] = dp[i][k - 1];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 966,882 | 966,883 | u787900397 | cpp |
p03163 | /**
* Think twice, code once.
* 1.integer overflow(maybe even long long overflow : (a+b >= c) -> (a >= c-b)
* 2.runtime error
* 3.boundary condition
* ---------------------------------------------------------------------------------------
* Author : zzy
* Date : 2020-03-19-18.25.37 Thursday
*/
#include <bits/st... | /**
* Think twice, code once.
* 1.integer overflow(maybe even long long overflow : (a+b >= c) -> (a >= c-b)
* 2.runtime error
* 3.boundary condition
* ---------------------------------------------------------------------------------------
* Author : zzy
* Date : 2020-03-19-18.25.37 Thursday
*/
#include <bits/st... | [
"variable_declaration.type.change",
"expression.operation.binary.change"
] | 966,884 | 966,885 | u172885996 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w, i, j;
cin >> n;
cin >> w;
int a[n], wt[n], dp[n + 1][w + 1];
for (i = 0; i < n; i++) {
cin >> wt[i] >> a[i];
}
for (i = 0; i <= n; i++) {
for (j = 0; j <= w; j++) {
if (i == 0 || j == 0) {
dp[i][j] = 0;
} els... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, w, i, j;
cin >> n;
cin >> w;
long long int a[n], wt[n], dp[n + 1][w + 1];
for (i = 0; i < n; i++) {
cin >> wt[i] >> a[i];
}
for (i = 0; i <= n; i++) {
for (j = 0; j <= w; j++) {
if (i == 0 || j == 0) {
dp[i]... | [
"variable_declaration.type.widen.change"
] | 966,888 | 966,889 | u100931490 | cpp |
p03163 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define mod 1000000007
#define do double
#define loop(i, n) for (int i = 0; i < n; i++)
#define lop(a, b) for (int i = a; i <= b; i++)
#define pb push_back
#define mkp make_pair
typedef vector<int> vi;
typedef map<in... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define mod 1000000007
#define do double
#define loop(i, n) for (int i = 0; i < n; i++)
#define lop(a, b) for (int i = a; i <= b; i++)
#define pb push_back
#define mkp make_pair
typedef vector<int> vi;
typedef map<in... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 966,896 | 966,897 | u580376304 | cpp |
p03163 | #include <bits/stdc++.h>
#define LL long long int
#define Max(x, y) (x > y ? x : y)
#define Min(x, y) (x < y ? x : y)
#define Abs(x) ((x) > 0 ? (x) : -(x))
#define Swap(x, y) \
do { \
... | #include <bits/stdc++.h>
#define LL long long int
#define Max(x, y) (x > y ? x : y)
#define Min(x, y) (x < y ? x : y)
#define Abs(x) ((x) > 0 ? (x) : -(x))
#define Swap(x, y) \
do { \
... | [
"variable_declaration.type.change"
] | 966,898 | 966,899 | u369631563 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 100;
const int CAP = 1e5 + 10;
int n, cap;
int v[N], w[N];
ll dp[N][CAP];
ll run(int idx, int cur) {
if (dp[idx][cur] != -1)
return dp[idx][cur];
ll res = 0;
if (idx == n or cur == 0)
res = 0;
else if (w[idx] > cur)
re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 100 + 10;
const int CAP = 1e5 + 10;
int n, cap;
int v[N], w[N];
ll dp[N][CAP];
ll run(int idx, int cur) {
if (dp[idx][cur] != -1)
return dp[idx][cur];
ll res = 0;
if (idx == n or cur == 0)
res = 0;
else if (w[idx] > cur)
... | [
"call.arguments.add"
] | 966,904 | 966,903 | u537359793 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int haha = 15000;
long long int n, W, best, w[100000], v[100000], dp[haha][haha];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> W;
for (long long int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (long long int i... | #include <bits/stdc++.h>
using namespace std;
const int haha = 15000;
long long int n, W, best, w[10005], v[100005], dp[110][100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> W;
for (long long int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (long long int i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add"
] | 966,907 | 966,908 | u010686961 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int haha = 15000;
long long int n, W, best, w[100000], v[100000], dp[haha][haha];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> W;
for (long long int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (long long int i... | #include <bits/stdc++.h>
using namespace std;
const int haha = 15000;
long long int n, W, best, w[100000], v[100000], dp[110][100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> W;
for (long long int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (long long int ... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 966,907 | 966,909 | u010686961 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W, w, v;
cin >> n >> W;
vector<int> dp(W + 1);
for (int i = 0; i < n; i++) {
// cout<<"working;";
cin >> w >> v;
for (int k = W - w; k >= 0; k--) {
dp[k + w] = max(dp[k + w], v + dp[k]);
}
}
cout << *max_element(dp.begin... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W, w, v;
cin >> n >> W;
vector<long long> dp(W + 1);
for (int i = 0; i < n; i++) {
// cout<<"working;";
cin >> w >> v;
for (int k = W - w; k >= 0; k--) {
dp[k + w] = max(dp[k + w], v + dp[k]);
}
}
cout << *max_element(dp... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,910 | 966,911 | u783777606 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> wt(N, 0);
vector<int> val(N, 0);
for (int i = 0; i < N; i++)
cin >> wt[i] >> val[i];
vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= W; j++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> wt(N, 0);
vector<int> val(N, 0);
for (int i = 0; i < N; i++)
cin >> wt[i] >> val[i];
vector<vector<long long>> dp(N + 1, vector<long long>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,912 | 966,913 | u180641794 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> wt(N, 0);
vector<int> val(N, 0);
for (int i = 0; i < N; i++)
cin >> wt[i] >> val[i];
vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= W; j++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> wt(N, 0);
vector<int> val(N, 0);
for (int i = 0; i < N; i++)
cin >> wt[i] >> val[i];
vector<vector<long long>> dp(N + 1, vector<long long>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,914 | 966,913 | u180641794 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
void maxVal(int &a, int b) { a = max(a, b); }
void solve() {
int n, w, res = 0;
cin >> n >> w;
vector<int> dp(w + 1, 0);
for (int i = 0; i < n; ++i) {
int weight, val;
cin >> weight >> val;
for (int j = w; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
void maxVal(ll &a, ll b) { a = max(a, b); }
void solve() {
ll n, w, res = 0;
cin >> n >> w;
vector<ll> dp(w + 1, 0);
for (int i = 0; i < n; ++i) {
ll weight, val;
cin >> weight >> val;
for (int j = w; j >= ... | [
"variable_declaration.type.change"
] | 966,915 | 966,916 | u719103039 | cpp |
p03163 | //
// Created by Hideaki Imamura on 2020-03-15.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | //
// Created by Hideaki Imamura on 2020-03-15.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 966,919 | 966,920 | u477855214 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long track[n + 1][p + 1];
for (int i = 0; i < p + 1; i++)
track[0][i] = 0;
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j <... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long track[n + 1][p + 1];
for (int i = 0; i < p + 1; i++)
track[0][i] = 0;
for (int i = 1; i < n + 1; i++) {
for (int j = 0; j <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 966,925 | 966,926 | u123706464 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 966,927 | 966,928 | u756247155 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int N, W;
int w[105], v[105];
int cache[105][10005];
int dp(int n, int wt) {
if (wt > W)
return -1e8;
if (n == N)
return 0;
if (cache[n][wt] != -1)
return cache[n][wt];
cache[n][wt] = max(dp(n + 1, wt), v[n] + dp(n + 1, wt + w[n]))... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int N, W;
int w[105], v[105];
int cache[105][100005];
int dp(int n, int wt) {
if (wt > W)
return -1e15;
if (n == N)
return 0;
if (cache[n][wt] != -1)
return cache[n][wt];
cache[n][wt] = max(dp(n + 1, wt), v[n] + dp(n + 1, wt + w[n... | [
"identifier.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"function.return_value.change",
"variable_declaration.type.primitive.change"
] | 966,939 | 966,936 | u554003615 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int N, W;
int w[105], v[105];
int cache[105][105];
int dp(int n, int wt) {
if (wt > W)
return -1e8;
if (n == N)
return 0;
if (cache[n][wt] != -1)
return cache[n][wt];
cache[n][wt] = max(dp(n + 1, wt), v[n] + dp(n + 1, wt + w[n]));
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int N, W;
int w[105], v[105];
int cache[105][100005];
int dp(int n, int wt) {
if (wt > W)
return -1e15;
if (n == N)
return 0;
if (cache[n][wt] != -1)
return cache[n][wt];
cache[n][wt] = max(dp(n + 1, wt), v[n] + dp(n + 1, wt + w[n... | [
"identifier.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"function.return_value.change",
"variable_declaration.type.primitive.change"
] | 966,940 | 966,936 | u554003615 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int d[101][100001];
int main() {
int n, m;
cin >> n >> m;
int a[n + 1], b[n + 1];
for (int k = 1; k <= n; k++)
cin >> a[k] >> b[k];
for (int k = 1; k <= m; k++)
if (k >= a[1])
d[1][k] = b[1];
for (int i = 2; i <= n; i++) {
for (int j = 1; j <... | #include <bits/stdc++.h>
using namespace std;
long long d[101][100001];
int main() {
int n, m;
cin >> n >> m;
int a[n + 1], b[n + 1];
for (int k = 1; k <= n; k++)
cin >> a[k] >> b[k];
for (int k = 1; k <= m; k++)
if (k >= a[1])
d[1][k] = b[1];
for (int i = 2; i <= n; i++) {
for (int j = ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,951 | 966,952 | u350462185 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int64_t dp[100][100000];
int64_t recurse(auto &v, auto &w, int64_t i, int64_t m) {
if (!i == 0 or !m)
return 0;
int64_t &state = dp[i][m];
if (state != -1)
return state;
state = numeric_limits<int64_t>::min();
if (m >= w[i]) {
state = max(state, recu... | #include <bits/stdc++.h>
using namespace std;
int64_t dp[101][100001];
int64_t recurse(auto &v, auto &w, int64_t i, int64_t m) {
if (i < 0 or !m)
return 0;
int64_t &state = dp[i][m];
if (state != -1)
return state;
state = numeric_limits<int64_t>::min();
if (m >= w[i]) {
state = max(state, recurs... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 966,958 | 966,957 | u683739220 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, w, i, j, a, b;
cin >> n >> w;
vector<pair<int, int>> v;
for (i = 0; i < n; ++i) {
cin >> a >> b;
v.push_back(make_pair(a, b));
}
sort(v.begin(), v.end());
int dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, w, i, j, a, b;
cin >> n >> w;
vector<pair<int, long long int>> v;
for (i = 0; i < n; ++i) {
cin >> a >> b;
v.push_back(make_pair(a, b));
}
sort(v.begin()... | [
"variable_declaration.type.widen.change"
] | 966,959 | 966,960 | u723607904 | cpp |
p03163 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"variable_declaration.type.change"
] | 966,961 | 966,962 | u136342563 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll MOD = 1e9 + 7;
const int INF = 1 << 30;
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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll MOD = 1e9 + 7;
const int INF = 1 << 30;
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... | [
"variable_declaration.type.change"
] | 966,963 | 966,964 | u136342563 | 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 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int Nmax = 110;
const int Wm... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int Nmax = 110;
const int Wm... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 966,965 | 966,966 | u136342563 | 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 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int Nmax = 110;
const int Wm... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int Nmax = 110;
const int Wm... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 966,967 | 966,966 | u136342563 | cpp |
p03163 | #include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | #include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | [
"assignment.change"
] | 966,972 | 966,973 | u465478140 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define LOCAL 1
#define UPLOAD 2
#define ll long long
const long long INF = 1LL << 60;
template <class T = long long> T input() {
T x;
cin >> x;
return x;
}
temp... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define LOCAL 1
#define UPLOAD 2
#define ll long long
const long long INF = 1LL << 60;
template <class T = long long> T input() {
T x;
cin >> x;
return x;
}
temp... | [
"assignment.change"
] | 966,974 | 966,975 | u214712859 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define LOCAL 1
#define UPLOAD 2
#define ll long long
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
template <class T = long long> T input() {
T x;
cin >> x;
... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define LOCAL 1
#define UPLOAD 2
#define ll long long
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
template <class T = long long> T input() {
T x;
cin >> x;
... | [
"identifier.change",
"call.function.change"
] | 966,976 | 966,977 | u214712859 | cpp |
p03163 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using i3 = pair<int, ii>;
using li = pair<ll, int>;
using lii = pair<ll, ii>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<ii>;
using vli = vector<li>;
using vpll = vector<pll... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using i3 = pair<int, ii>;
using li = pair<ll, int>;
using lii = pair<ll, ii>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<ii>;
using vli = vector<li>;
using vpll = vector<pll... | [
"assignment.change"
] | 966,987 | 966,988 | u284539389 | cpp |
p03163 | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 1e5 + 7;
int w[105], v[105], f[N];
int main() {
int n, W;
cin >> n >> W;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; ++i)
for (int j = W; j >= w[i]; --j)
f[j] = max(f[j], f[j - w[i]] + v[i]);
... | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 1e5 + 7;
long long w[105], v[105], f[N];
int main() {
int n, W;
cin >> n >> W;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; ++i)
for (int j = W; j >= w[i]; --j)
f[j] = max(f[j], f[j - w[i]] + v... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,991 | 966,992 | u067001883 | cpp |
p03163 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
ll MOD = 1000000007;
// a^p
// 2^3 = 2 * 2^2
// 2^2 = 2 * (2^1)
// 2^1 = 2
ll modpow(ll a... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
ll MOD = 1000000007;
// a^p
// 2^3 = 2 * 2^2
// 2^2 = 2 * (2^1)
// 2^1 = 2
ll modpow(ll a... | [
"expression.operation.binary.remove"
] | 967,001 | 967,002 | u237620737 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long i, j, n, m, t, k, dp[500][500], a[200001], b[200001];
int main() {
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
if (j - a[i] <= 0) {
dp[i][j] = dp[i - 1][j];
... | #include <bits/stdc++.h>
using namespace std;
long long i, j, n, m, t, k, dp[101][100001], a[200001], b[200001];
int main() {
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
if (j - a[i] < 0) {
dp[i][j] = dp[i - 1][j];
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 967,007 | 967,008 | u427421765 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
int N, W;
cin >> N >> W;
vector<vector<int>> dp(N + 1, vector<int>(W + 1));
for (int i = 0; i <= W; i++) {
dp[0][i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
int N, W;
cin >> N >> W;
vector<vector<ll>> dp(N + 1, vector<ll>(W + 1));
for (int i = 0; i <= W; i++) {
dp[0][i] ... | [
"call.arguments.change",
"variable_declaration.type.change"
] | 967,018 | 967,019 | u552357043 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const int INF = 1000000007;
const LL INFLL = 1000000000000000007;
#define st first
#define nd second
#define pb push_back
#define _boost ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const int INF = 1000000007;
const LL INFLL = 1000000000000000007;
#define st first
#define nd second
#define pb push_back
#define _boost ... | [
"variable_declaration.type.change"
] | 967,020 | 967,021 | u694246042 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define mx 200005
#define mod 1000000007
#define mxm 999999999999
using namespace std;
ll dp[mx][200];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, p, w[200], v[200], i, j;
cin >> n >> p;
for (i = 1; i < n + 1; i++) {
cin >> w[i] >> v[... | #include <bits/stdc++.h>
#define ll long long
#define mx 200005
#define mod 1000000007
#define mxm 999999999999
using namespace std;
ll dp[200][mx];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, p, w[200], v[200], i, j;
cin >> n >> p;
for (i = 1; i < n + 1; i++) {
cin >> w[i] >> v[... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"identifier.replace.add",
"literal.replace.remove",
"assignment.change",
"expression.operation.binary.remove"
] | 967,022 | 967,023 | u720296041 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define st first
#define nd second
#define turbo \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define st first
#define nd second
#define turbo \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"variable_declaration.type.change"
] | 967,024 | 967,025 | u317997849 | cpp |
p03163 | #include <iostream>
using namespace std;
int dp[200007];
int main() {
int N, W;
cin >> N >> W;
for (int i = 0; i < N; i++) {
int n, w;
cin >> n >> w;
if (n > W)
continue;
for (int j = W; j > 0; j--)
if (dp[j] != 0)
dp[j + n] = max(dp[j + n], dp[j] + w);
dp[n] = max(dp[n]... | #include <iostream>
using namespace std;
long long dp[200007];
int main() {
int N, W;
cin >> N >> W;
for (int i = 0; i < N; i++) {
long long n, w;
cin >> n >> w;
if (n > W)
continue;
for (int j = W; j > 0; j--)
if (dp[j] != 0)
dp[j + n] = max(dp[j + n], dp[j] + w);
dp[n]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,054 | 967,055 | u098482829 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int dy[] = {1, -1, 0, 0};
int dx[] = {0, 0, 1, -1};
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N), v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<ll>> dp(N, vector<ll>(1e7 + 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int dy[] = {1, -1, 0, 0};
int dx[] = {0, 0, 1, -1};
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N), v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<ll>> dp(N, vector<ll>(1e5 + 1... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 967,060 | 967,061 | u854831509 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return ... | #include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return ... | [
"variable_declaration.type.change"
] | 967,066 | 967,067 | u613931538 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define llt long long int
#define pb push_back
#define pii pair<int, int>
#define mk make_pair
#define f first
#define s second
// int dp[100001];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, w;
cin >> n >> w;
vector<p... | #include <bits/stdc++.h>
using namespace std;
#define llt long long int
#define pb push_back
#define pii pair<int, int>
#define mk make_pair
#define f first
#define s second
// int dp[100001];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, w;
cin >> n >> w;
vector<p... | [
"variable_declaration.type.change"
] | 967,070 | 967,071 | u356063349 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, W, i, j;
cin >> n >> W;
ll v[n + 1], w[n + 1];
for (i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
ll dp[W + 1][n + 1];
memset(dp... | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, W, i, j;
cin >> n >> W;
ll v[n + 1], w[n + 1];
for (i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
ll dp[W + 1][n + 1];
memset(dp... | [
"assignment.change"
] | 967,072 | 967,073 | u741672523 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const double eps = 1e-9;
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) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const double eps = 1e-9;
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) {
... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 967,079 | 967,078 | u831873811 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
#define double long double
#define endl "\n"
const int INF = (int)1e9 + 9;
const int maxn = (int)1e6 + 6;
// const mod = (int) 1e9 + 7;
using namespace std;
signed main() {
int N, W;
cin >> N >> W;
vector<int> v(N), w(N);
vector<vector<int>> dp(N + 1, vector<int... | #include <bits/stdc++.h>
#define int long long
#define double long double
#define endl "\n"
const int INF = (int)1e9 + 9;
const int maxn = (int)1e6 + 6;
// const mod = (int) 1e9 + 7;
using namespace std;
signed main() {
int N, W;
cin >> N >> W;
vector<int> v(N), w(N);
vector<vector<int>> dp(N + 1, vector<int... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 967,085 | 967,086 | u699731638 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
#define double long double
#define endl "\n"
const int INF = (int)1e9 + 9;
const int maxn = (int)1e6 + 6;
// const mod = (int) 1e9 + 7;
using namespace std;
signed main() {
int N, W;
cin >> N >> W;
vector<int> v(N), w(N);
vector<vector<int>> dp(N + 1, vector<int... | #include <bits/stdc++.h>
#define int long long
#define double long double
#define endl "\n"
const int INF = (int)1e9 + 9;
const int maxn = (int)1e6 + 6;
// const mod = (int) 1e9 + 7;
using namespace std;
signed main() {
int N, W;
cin >> N >> W;
vector<int> v(N), w(N);
vector<vector<int>> dp(N + 1, vector<int... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 967,087 | 967,086 | u699731638 | cpp |
p03163 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int wt[n + 1];
int v[n + 1];
for (int i = 0; i < n; i++)
cin >> wt[i] >> v[i];
int dp[n + 1]
[W + 1]; // the cells consider the subproblem where we have the first i
// elements with maximum ... | #include "bits/stdc++.h"
using namespace std;
int main() {
long n, W;
cin >> n >> W;
long wt[n + 1];
long v[n + 1];
for (int i = 0; i < n; i++)
cin >> wt[i] >> v[i];
long dp[n + 1]
[W + 1]; // the cells consider the subproblem where we have the first i
// elements with ma... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 967,088 | 967,089 | u552846576 | cpp |
p03163 | //*******Abhijit Burman***********//
// Jalpaiguri Government Engineering College//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mk make_pair
#define MAXX (1000000000000000000 + 7)
#define fio \
... | //*******Abhijit Burman***********//
// Jalpaiguri Government Engineering College//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mk make_pair
#define MAXX (1000000000000000000 + 7)
#define fio \
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 967,095 | 967,091 | u915235255 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000000
typedef long long ll;
typedef pair<int, int> P;
int dp[101][100001] = {};
int main() {
int n, w, w_i, v, i, j;
cin >> n >> w;
for (i = 1; i <= n; i++) {
cin >> w_i >> v;
for (j = 0; j <= w; j++) {
if (j >= ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000000
typedef long long ll;
typedef pair<int, int> P;
ll dp[101][100001] = {};
int main() {
ll n, w, w_i, v, i, j;
cin >> n >> w;
for (i = 1; i <= n; i++) {
cin >> w_i >> v;
for (j = 0; j <= w; j++) {
if (j >= w_... | [
"variable_declaration.type.change"
] | 967,096 | 967,097 | u058348416 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 967,098 | 967,099 | u255001744 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> w, v;
long int dpv[100001][2];
/*long int dp(int W,int N)
{
if(dpv[W][N])
return dpv[W][N];
if(W==0 || N==0)
return 0;
if(w[N]<=W)
dpv[W][N]=max(dp(W-w[N],N-1)+v[N],dp(... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> w, v;
long int dpv[100001][3];
/*long int dp(int W,int N)
{
if(dpv[W][N])
return dpv[W][N];
if(W==0 || N==0)
return 0;
if(w[N]<=W)
dpv[W][N]=max(dp(W-w[N],N-1)+v[N],dp(W... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"variable_access.subscript.index.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 967,100 | 967,101 | u476597830 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree < int , null_type , less<int> , rb_tree_tag ,
tree_order_statistics_node_update > #define smallk order_of_key #define kth
find_by_order... | #include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree < int , null_type , less<int> , rb_tree_tag ,
tree_order_statistics_node_update > #define smallk order_of_key #define kth
find_by_order... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,102 | 967,103 | u653739037 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 967,104 | 967,105 | u195054737 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int main() {
int n, w;
cin >> n >> w;
vector<pair<int, int>> v(n);
for (auto &i : v) {
cin >> i.first >> i.second;
}
sort(v.begin(), v.end());
vector<vector<int>> dp(n + 1, vector<int>(w + 1, 0));
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int main() {
ll n, w;
cin >> n >> w;
vector<pair<ll, ll>> v(n);
for (auto &i : v) {
cin >> i.first >> i.second;
}
sort(v.begin(), v.end());
vector<vector<ll>> dp(n + 1, vector<ll>(w + 1, 0));
for (int i = 1; i <= ... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 967,114 | 967,115 | u435876834 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
vector<vector<long>> a, dp;
long w, n;
long rec(long i, long j) {
if (i >= n) {
// cout<<"rec("<<i<<","<<j<<")"<<endl;
return 0;
} else {
if (dp[i][j] == 0) {
// cout<<"rec("<<i+1<<","<<j-a[i][0]<<")+"<<a[i][1]<<" ";
// cout<<"rec("<<i+1<<","<<j<... | #include <bits/stdc++.h>
using namespace std;
vector<vector<long>> a, dp;
long w, n;
long rec(long i, long j) {
if (i >= n) {
return 0;
} else {
if (dp[i][j] == 0) {
if (j < a[i][0]) {
dp[i][j] = rec(i + 1, j);
} else {
dp[i][j] = max(rec(i + 1, j), rec(i + 1, j - a[i][0]) + a[i]... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 967,122 | 967,123 | u639264808 | cpp |
p03163 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool ... | [
"variable_declaration.type.change"
] | 967,126 | 967,127 | u110653681 | cpp |
p03163 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <sta... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <sta... | [
"variable_declaration.type.change"
] | 967,128 | 967,129 | u035166659 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, temp, n, total, w, v;
cin >> n >> total;
vector<int> val[n];
int dp[n + 1][total + 1];
for (i = 0; i < n; i++) {
cin >> w >> v;
val[i].push_back(v);
val[i].push_back(w);
}
for (i = 0; i <= n; i++) {
for (j = 0; j <= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, temp, n, total, w, v;
cin >> n >> total;
vector<long long int> val[n];
long long int dp[n + 1][total + 1];
for (i = 0; i < n; i++) {
cin >> w >> v;
val[i].push_back(v);
val[i].push_back(w);
}
for (i = 0; i <= n;... | [
"variable_declaration.type.widen.change"
] | 967,135 | 967,136 | u282921790 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9 + 7
void max_self(int &a, int b) { a = max(a, b); }
int main() {
int n, W;
cin >> n >> W;
vector<int> KS(W + 1);
for (int i = 0; i < n; i++) {
int w, v;
cin >> w >> v;
for (int w_base = W - w; w_base >= 0; w_base--) {
max_self(KS[w_... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9 + 7
void max_self(long long &a, long long b) { a = max(a, b); }
int main() {
int n, W;
cin >> n >> W;
vector<long long> KS(W + 1);
for (int i = 0; i < n; i++) {
int w, v;
cin >> w >> v;
for (int w_base = W - w; w_base >= 0; w_base--) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,144 | 967,145 | u370274941 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep1(i, n, a) for (int i = 0; i < n; i += a)
#define rep2(i, n, a) for (int i = a; i < n; i++)
#define rep3(n) for (int i = 0; i < n; i++)
#define inarr(arr, n) rep1(i, n, 1) cin >> arr[i]
#define ll long long int
#define pb push_back
#define all(v) v.begin(), v.end()
#define trav(a, x)... | #include <bits/stdc++.h>
#define rep1(i, n, a) for (int i = 0; i < n; i += a)
#define rep2(i, n, a) for (int i = a; i < n; i++)
#define rep3(n) for (int i = 0; i < n; i++)
#define inarr(arr, n) rep1(i, n, 1) cin >> arr[i]
#define ll long long int
#define pb push_back
#define all(v) v.begin(), v.end()
#define trav(a, x)... | [
"variable_declaration.type.change"
] | 967,148 | 967,149 | u676474080 | cpp |
p03163 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | [
"literal.number.change",
"call.arguments.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 967,150 | 967,151 | u103850114 | cpp |
p03163 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 967,152 | 967,151 | u103850114 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
int main() {
int n, w;
cin >> n >> w;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
vector<vector<int>> dp(n + 100, vector<int>(w + 100));
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
int main() {
int n, w;
cin >> n >> w;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
vector<vector<long long>> dp(n + 100, vector<long long>(w + 100));
for (in... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,153 | 967,154 | u103850114 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
REP(i, N) cin >> w[i] >> v[i];
int dp[N + 1][W + 1];
REP(i, N + 1) REP(j, W + 1) dp[i][j] = 0;
REP(i, N) REP(j, W + 1) {
dp[i + 1][... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
REP(i, N) cin >> w[i] >> v[i];
ll dp[N + 1][W + 1];
REP(i, N + 1) REP(j, W + 1) dp[i][j] = 0;
REP(i, N) REP(j, W + 1) {
dp[i + 1][j... | [
"variable_declaration.type.change"
] | 967,167 | 967,168 | u303884911 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define endl '\n'
typedef long long ll;
int n;
ll peso;
ll dp[102][100005], w[100005], v[100005];
ll f(int i, ll p) {
if (i == 0 || p <= 0)
return 0;
if (w[i] > p)
return dp[i][p] = f(i - 1, p);
if (dp[i][p] != -1)
return dp[i][p]... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define endl '\n'
typedef long long ll;
int n;
ll peso;
ll dp[102][100005], w[100005], v[100005];
ll f(int i, ll p) {
// cout << i << " " << p << endl;
if (i == 0 || p <= 0)
return 0;
if (w[i] > p)
return dp[i][p] = f(i - 1, p);
if... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 967,169 | 967,170 | u673781079 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(n, i) for (int i = n - 1; i >= 0; --i)
#define PI 3.14159265
#define INF 1e9
using namespace std;
using ll = long long;
void self_max(int &a, int b) { a = max(a, b); }
void self_min(int &a, int b) { a = min(a, b); }
int main() {
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(n, i) for (int i = n - 1; i >= 0; --i)
#define PI 3.14159265
#define INF 1e9
using namespace std;
using ll = long long;
void self_max(int &a, int b) { a = max(a, b); }
void self_min(int &a, int b) { a = min(a, b); }
int main() {
in... | [] | 967,172 | 967,173 | u366686355 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define vi vector<ll>
#define vii vector<ii>
#define vs vector<string>
#define si set<ll>
#define endl "\n"
#define pb push_back
#define x first
#define y second
// g++ -std=c++11 -Wall -Wextra -pedantic-errors main.cpp -o main
const int ms = 1e3 + 5... | #include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define vi vector<ll>
#define vii vector<ii>
#define vs vector<string>
#define si set<ll>
#define endl "\n"
#define pb push_back
#define x first
#define y second
// g++ -std=c++11 -Wall -Wextra -pedantic-errors main.cpp -o main
const int ms = 1e3 + 5... | [
"variable_declaration.type.change"
] | 967,178 | 967,179 | u772495372 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pb emplace_back
#define X first
#define Y second
const int N = 2e5 + 5;
typedef pair<int, int> ii;
int f[105][N];
int main() {
ios_base::sync_with_stdio(0)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pb emplace_back
#define X first
#define Y second
const int N = 2e5 + 5;
typedef pair<int, int> ii;
ll f[105][N];
int main() {
ios_base::sync_with_stdio(0);... | [
"variable_declaration.type.change"
] | 967,180 | 967,181 | u466655539 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, w;
cin >> n >> w;
ll wt[n], val[n], i, j;
for (i = 0; i < n; i++)
cin >> wt[i] >> val[i];
ll dp[n + 1][w + 1];
for (i = 0; i <= n; i++) {
for (j = 0; j <= w; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, w;
cin >> n >> w;
ll wt[n], val[n], i, j;
for (i = 0; i < n; i++)
cin >> wt[i] >> val[i];
ll dp[n + 1][w + 1];
for (i = 0; i <= n; i++) {
for (j = 0; j <= w; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 967,182 | 967,183 | u939889620 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000005;
int dp[101][100001];
int main() {
int N, W;
cin >> N >> W;
vector<int> v(N), w(N);
rep(i, N) { cin >> w[i] >... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000005;
ll dp[101][100001];
int main() {
ll N, W;
cin >> N >> W;
vector<ll> v(N), w(N);
rep(i, N) { cin >> w[i] >> v... | [
"variable_declaration.type.change"
] | 967,184 | 967,185 | u184929210 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
vi weights, vals;
int main() {
int n, w;
cin >> n >> w;
weights.resize(n + 1);
vals.resize(n + 1);
for (int i = 1; i <= n; i++) {
cin >> weights[i] >> vals[i];
}
... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
vi weights, vals;
int main() {
int n, w;
cin >> n >> w;
weights.resize(n + 1);
vals.resize(n + 1);
for (int i = 1; i <= n; i++) {
cin >> weights[i] >> vals[i];
}
... | [] | 967,186 | 967,187 | u058183675 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub up... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub up... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 967,191 | 967,192 | u426777622 | cpp |
p03163 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define rep(i, begin, end) ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define rep(i, begin, end) ... | [] | 967,201 | 967,202 | u255532979 | cpp |
p03163 | /* Those who cannot remember the past are condemned to repeat it.*/
/* author:Ajeet */
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stac... | /* Those who cannot remember the past are condemned to repeat it.*/
/* author:Ajeet */
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stac... | [
"variable_declaration.type.change"
] | 967,205 | 967,206 | u348641375 | cpp |
p03163 |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 105
#define MAXW 100005
int memo[MAXN][MAXW];
vector<int> values, weights;
int N, W;
long long knap(int curr, int wRim) {
if (memo[curr][wRim] != -1)
return memo[curr][wRim];
if (curr == N)
return 0;
long long tot = knap(curr + 1, wRim);
if ... |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 105
#define MAXW 100005
long long memo[MAXN][MAXW];
vector<int> values, weights;
int N, W;
long long knap(int curr, int wRim) {
if (memo[curr][wRim] != -1)
return memo[curr][wRim];
if (curr == N)
return 0;
long long tot = knap(curr + 1, wRim);... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,237 | 967,238 | u172805707 | cpp |
p03163 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using... | [] | 967,256 | 967,257 | u799939777 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll max(ll a, ll b) { return a > b ? a : b; }
int main() {
int n, W;
cin >> n >> W;
vector<vector<ll>> dp(n + 1, vector<ll>(W + 1, 0));
for (int i = 1; i <= n; i++) {
int wt, v;
cin >> wt >> v;
for (int w = 0; w <= W; w++) {
dp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
ll max(ll a, ll b) { return a > b ? a : b; }
int main() {
int n, W;
cin >> n >> W;
vector<vector<ll>> dp(n + 1, vector<ll>(W + 1, 0));
for (int i = 1; i <= n; i++) {
int wt, v;
cin >> wt >> v;
for (int w = 0; w <= W; w++) {
... | [
"variable_declaration.type.widen.change"
] | 967,262 | 967,263 | u493143669 | cpp |
p03163 | // Author : Radhesh Sarma
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using namespace __gnu_pbds;
#def... | // Author : Radhesh Sarma
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using namespace __gnu_pbds;
#def... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 967,278 | 967,279 | u021648187 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.