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>
#include <iostream>
using namespace std;
int knapSack(long long int W[], long long int V[], long long int n,
long long int w) {
long long int res[n + 1][w + 1];
for (long long int i = 0; i <= w; i++) {
res[0][i] = 0;
}
for (long long int j = 0; j <= n; j++) {
re... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
long long int knapSack(long long int W[], long long int V[], long long int n,
long long int w) {
long long int res[n + 1][w + 1];
for (long long int i = 0; i <= w; i++) {
res[0][i] = 0;
}
for (long long int j = 0; j... | [
"variable_declaration.type.widen.change"
] | 967,296 | 967,297 | u624791303 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
vector<vector<int>> f;
int w[103], v[103];
int n, W;
int main() {
cin >> n >> W;
f.assign(n + 1, vector<int>(W + 1, 0));
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (int i = 1;... | #include <algorithm>
#include <climits>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
vector<vector<long long>> f;
int w[103], v[103];
int n, W;
int main() {
cin >> n >> W;
f.assign(n + 1, vector<long long>(W + 1, 0));
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,300 | 967,301 | u226546224 | cpp |
p03163 | #include <bits/stdc++.h>
#define pb push_back
#define pair pair<int, int>
#define ll long long
#define f first
#define se second
using namespace std;
double pi = acos(-1.0);
int main() {
int n, w;
scanf("%d %d", &n, &w);
vector<pair> v(n + 1);
for (int i = 1; i <= n; i++)
scanf("%d %d", &v[i].f, &v[i].se);
... | #include <bits/stdc++.h>
#define pb push_back
#define pair pair<int, int>
#define ll long long
#define f first
#define se second
using namespace std;
double pi = acos(-1.0);
int main() {
int n, w;
scanf("%d %d", &n, &w);
vector<pair> v(n + 1);
for (int i = 1; i <= n; i++)
scanf("%d %d", &v[i].f, &v[i].se);
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 967,302 | 967,303 | u768104057 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n, w;
cin >> n >> w;
vector<int> weights(n);
vector<int> values(n);
vector<pair<int, int>> ipair(n);
for (int i = 0; i < n; i++) {
cin >> weights[i] >> values[i];
ipair[i] = make_pair(weights[i], values[i]);
}
sort(ipair.begin()... | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n, w;
cin >> n >> w;
vector<int> weights(n);
vector<int> values(n);
vector<pair<int, int>> ipair(n);
for (int i = 0; i < n; i++) {
cin >> weights[i] >> values[i];
ipair[i] = make_pair(weights[i], values[i]);
}
sort(ipair.begin()... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,304 | 967,305 | u636031746 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int n;
int W;
long long w[128], v[128];
long long dp[128][101000];
int main() {
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 = 1; j <= w[i]; ++j)
dp[i][j] = dp[i - 1][j];
for (int ... | #include <bits/stdc++.h>
using namespace std;
int n;
int W;
long long w[128], v[128];
long long dp[128][101000];
int main() {
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 = 1; j <= w[i]; ++j)
dp[i][j] = dp[i - 1][j];
for (int ... | [
"assignment.change"
] | 967,306 | 967,307 | u262428225 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
inline bool chmax(long long a, long long b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int max(long long x, long long y) { return (x > y) ? x : y; }
int main() {
int n;
long long W;
cin >> n;
cin >> W;
vector<long long> wei... | #include <iostream>
#include <vector>
using namespace std;
inline bool chmax(long long &a, long long b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int max(long long x, long long y) { return (x > y) ? x : y; }
int main() {
int n;
long long W;
cin >> n;
cin >> W;
vector<long long> weig... | [] | 967,308 | 967,309 | u465135730 | cpp |
p03163 | #include <bits/stdc++.h>
#define LL long long
#define re register
#define SIZE 105
using namespace std;
template <typename T> inline void read(T &x) {
int f;
char c;
x = 0, f = 0, c = getchar();
while (c < '0' && '9' < c)
f |= (c == '-'), c = getchar();
while ('0' <= c && c <= '9')
x = (x << 3) + (x <... | #include <bits/stdc++.h>
#define LL long long
#define re register
#define SIZE 105
using namespace std;
template <typename T> inline void read(T &x) {
int f;
char c;
x = 0, f = 0, c = getchar();
while (c < '0' && '9' < c)
f |= (c == '-'), c = getchar();
while ('0' <= c && c <= '9')
x = (x << 3) + (x <... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 967,317 | 967,318 | u714811652 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define re register
using namespace std;
const int maxn = 100 + 10;
const int maxw = 1e5 + 10;
template <typename T> void read(T &x) {
T f = 1;
x = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c ... | #include <bits/stdc++.h>
#define ll long long
#define re register
using namespace std;
const int maxn = 100 + 10;
const int maxw = 1e5;
template <typename T> void read(T &x) {
T f = 1;
x = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0... | [
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 967,319 | 967,320 | u343169347 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int N = 105, M = 1e6 + 123;
int n, s;
int w[N], a[N], can[M], dp[M], ans;
int main() {
cin >> n >> s;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> a[i];
}
can[0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = s - 1; j >= 0; j--) {
if (c... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 105, M = 1e6 + 123;
int n, s;
int w[N], a[N], can[M], dp[M], ans;
main() {
cin >> n >> s;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> a[i];
}
can[0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = s - 1; j >= 0;... | [
"function.return_value.remove"
] | 967,321 | 967,322 | u909486901 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
const ll mod = 1e9 + 7;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return o... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
const ll mod = 1e9 + 7;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return o... | [
"expression.operation.binary.add"
] | 967,323 | 967,324 | u171804186 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
const ll mod = 1e9 + 7;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return o... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
const ll mod = 1e9 + 7;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return o... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 967,325 | 967,324 | u171804186 | cpp |
p03163 | #include <bits/stdc++.h>
#include <cstring>
using namespace std;
const int Nmax = 105;
typedef long long ll;
struct {
int weight;
ll cost;
} a[Nmax];
int N, W;
inline ll Max(ll a, ll b) { return (a > b) ? a : b; }
int main() {
cin >> N >> W;
for (int i = 1; i <= N; ++i)
cin >> a[i].weight >> a[i].cost... | #include <bits/stdc++.h>
#include <cstring>
using namespace std;
const int Nmax = 105;
typedef long long ll;
struct {
int weight;
ll cost;
} a[Nmax];
int N, W;
const inline ll Max(ll a, ll b) { return (a > b) ? a : b; }
int main() {
cin >> N >> W;
for (int i = 1; i <= N; ++i)
cin >> a[i].weight >> a[i... | [] | 967,328 | 967,329 | u361594188 | cpp |
p03163 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,330 | 967,331 | u449291092 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
#define PI 3 .14159265
// typedef tuple <int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<int, int> pii;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
#define PI 3 .14159265
// typedef tuple <int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<int, int> pii;
typedef... | [
"variable_declaration.type.change"
] | 967,332 | 967,333 | u254886300 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, wt;
cin >> n >> wt;
int *w = new int[n];
int *v = new int[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < n - 1; i++) {
int m = i;
for (int j = i + 1; j < n; j++) {
if (w[m] > w[j])
m = j;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, wt;
cin >> n >> wt;
int *w = new int[n];
int *v = new int[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < n - 1; i++) {
int m = i;
for (int j = i + 1; j < n; j++) {
if (w[m] > w[j])
m = j;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,334 | 967,335 | u601256119 | cpp |
p03163 | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
#define... | [] | 967,339 | 967,340 | u491550356 | cpp |
p03163 | #include <iostream>
using namespace std;
main() {
int n;
cin >> n;
int W;
cin >> W;
int weight[n], value[n];
for (int ii = 0; ii < n; ii++)
cin >> weight[ii] >> value[ii];
int dp[n + 2][W + 2];
for (int ii = 0; ii <= n; ii++) {
for (int jj = 0; jj <= W; jj++) {
dp[ii][jj] = 0;
}
}
... | #include <iostream>
using namespace std;
main() {
int n;
cin >> n;
int W;
cin >> W;
int weight[n], value[n];
for (int ii = 0; ii < n; ii++)
cin >> weight[ii] >> value[ii];
long dp[n + 2][W + 2];
for (int ii = 0; ii <= n; ii++) {
for (int jj = 0; jj <= W; jj++) {
dp[ii][jj] = 0;
}
}
... | [
"variable_declaration.type.primitive.change"
] | 967,345 | 967,346 | u346834985 | cpp |
p03163 | #include <iostream>
using namespace std;
main() {
int n;
int W;
cin >> n;
cin >> W;
int weight[n];
int value[n];
for (int ii = 0; ii < n; ii++) {
cin >> weight[ii];
cin >> value[ii];
}
long dp[n + 1][W + 1];
for (int ii = 0; ii < n; ii++) {
for (int jj = 0; jj < W; jj++) {
dp[ii][... | #include <iostream>
using namespace std;
main() {
int n;
int W;
cin >> n;
cin >> W;
int weight[n];
int value[n];
for (int ii = 0; ii < n; ii++) {
cin >> weight[ii];
cin >> value[ii];
}
long dp[n + 1][W + 1];
for (int ii = 0; ii < n + 1; ii++) {
for (int jj = 0; jj < W + 1; jj++) {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 967,347 | 967,348 | u346834985 | cpp |
p03163 | #include <iostream>
using namespace std;
main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
for (int ii = 0; ii < N; ii++) {
cin >> w[ii] >> v[ii];
}
int dp[N + 1][W + 1];
for (int ii = 0; ii < N + 1; ii++) {
for (int jj = 0; jj < W + 1; jj++) {
dp[ii][jj] = 0;
}
}
dp[0][0] = 0;
fo... | #include <iostream>
using namespace std;
main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
for (int ii = 0; ii < N; ii++) {
cin >> w[ii] >> v[ii];
}
long dp[N + 1][W + 1];
for (int ii = 0; ii < N + 1; ii++) {
for (int jj = 0; jj < W + 1; jj++) {
dp[ii][jj] = 0;
}
}
dp[0][0] = 0;
f... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.else.remove"
] | 967,349 | 967,350 | u346834985 | cpp |
p03163 | /*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX XXXXXXXXX XXXXXXXXXXXXXXXX XXXXXXXXXXXXXXXXXXXXXXXXX X
X XXX XX XXXX XXXX X XXX XXX XXXX XXXX XXXX XXXXXX X
X XXXXXXXXX XXX XXX XXXXX XXX XXX XXXXXXX XX XX XXX XX X
X XXXXX XXX XXX XXXXX XXX XXX XXX XXX XXX X XXX X
X XXX X... | /*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX XXXXXXXXX XXXXXXXXXXXXXXXX XXXXXXXXXXXXXXXXXXXXXXXXX X
X XXX XX XXXX XXXX X XXX XXX XXXX XXXX XXXX XXXXXX X
X XXXXXXXXX XXX XXX XXXXX XXX XXX XXXXXXX XX XX XXX XX X
X XXXXX XXX XXX XXXXX XXX XXX XXX XXX XXX X XXX X
X XXX X... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 967,353 | 967,354 | u829509166 | cpp |
p03163 | #include <iostream>
using namespace std;
int knapsack(long long int n, long long int W, long long int w[],
long long int v[]) {
long long int arr[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0) {
arr[i][j] = 0;
} else {
... | #include <iostream>
using namespace std;
long long int knapsack(long long int n, long long int W, long long int w[],
long long int v[]) {
long long int arr[n + 1][W + 1];
for (long long int i = 0; i <= n; i++) {
for (long long int j = 0; j <= W; j++) {
if (i == 0 || j == 0) {
... | [
"control_flow.loop.for.initializer.change"
] | 967,355 | 967,356 | u549985733 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int main() {
// your code goes here
ll n;
cin >> n;
ll w;
cin >> w;
ll arr[n + 1][2];
arr[0][0] = 0;
arr[0][1] = 0;
for (ll i = 1; i <= n; i++) {
cin >> arr[i][0] >> arr[i][1];
}
for (ll i = 0; i < n - 1; ... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int main() {
// your code goes here
ll n;
cin >> n;
ll w;
cin >> w;
ll arr[n + 1][2];
arr[0][0] = 0;
arr[0][1] = 0;
for (ll i = 1; i <= n; i++) {
cin >> arr[i][0] >> arr[i][1];
}
for (ll i = 1; i < n; i++)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 967,362 | 967,363 | u324078303 | cpp |
p03163 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#d... |
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 967,372 | 967,373 | u851470173 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int dp[105][100005];
long long knap(long long w[], long long v[], int i, long long n, long long W) {
if (i > n || W <= 0)
return 0;
if (dp[i][W] != -1)
return dp[i][W];
if (w[i] > W)
return dp[i][W] = knap(w, v, i + 1, n, W);
return dp[i][W] = max(v[i] +... | #include <bits/stdc++.h>
using namespace std;
long long dp[105][100005];
long long knap(long long w[], long long v[], int i, long long n, long long W) {
if (i > n || W <= 0)
return 0;
if (dp[i][W] != -1)
return dp[i][W];
if (w[i] > W)
return dp[i][W] = knap(w, v, i + 1, n, W);
return dp[i][W] = max(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,376 | 967,377 | u770801122 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, W;
cin >> N >> W;
vector<vector<long>> dp(N + 1, vector<long>(W + 1, 0));
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = 0; j < W + 1; j++) {
if (j - w >= 0)
dp[i + 1][j] = max(dp[i + 1][j], dp[i][... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, W;
cin >> N >> W;
vector<vector<long>> dp(N + 1, vector<long>(W + 1, 0));
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = 0; j < W + 1; j++) {
if (j - w >= 0)
dp[i + 1][j] = max(dp[i + 1][j], dp[i][... | [
"control_flow.branch.else.remove"
] | 967,380 | 967,381 | u777258731 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, W;
cin >> N >> W;
vector<vector<long>> dp(N + 1, vector<long>(W + 1, 0));
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = 0; j < W + 1; j++) {
if (j - w >= 0)
dp[i + 1][j] = max(dp[i + 1][j], dp[i][... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, W;
cin >> N >> W;
vector<vector<long>> dp(N + 1, vector<long>(W + 1, 0));
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = 0; j < W + 1; j++) {
if (j - w >= 0)
dp[i + 1][j] = max(dp[i + 1][j], dp[i][... | [
"control_flow.branch.else.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 967,382 | 967,381 | u777258731 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, W;
cin >> N >> W;
vector<vector<long>> dp(N + 1, vector<long>(W + 1, 0));
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = 0; j < W + 1; j++) {
if (j - w >= 0)
dp[i + 1][j] = max(dp[i + 1][j], dp[i][... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, W;
cin >> N >> W;
vector<vector<long>> dp(N + 1, vector<long>(W + 1, 0));
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = 0; j < W + 1; j++) {
if (j - w >= 0)
dp[i + 1][j] = max(dp[i][j], dp[i][j - ... | [
"expression.operation.binary.remove"
] | 967,382 | 967,383 | u777258731 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N), v(N);
vector<vector<long long>> dp(N + 1, vector<long long>(W + 1, 0));
for (int i = 0; i < N; i++) {
cin >> w[i];
cin >> v[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; j++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N), v(N);
vector<vector<long long>> dp(N + 1, vector<long long>(W + 1, 0));
for (int i = 0; i < N; i++) {
cin >> w[i];
cin >> v[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; j++... | [
"expression.operation.binary.remove"
] | 967,397 | 967,398 | u286539644 | cpp |
p03163 | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <cstring>
#include <queue>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ll long long
#define getI(a) scanf("%d", &a)
#define getII(a, b) scanf("%d%d", &a, &b)
#define getIII(a, b, c) ... | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <cstring>
#include <queue>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ll long long
#define getI(a) scanf("%d", &a)
#define getII(a, b) scanf("%d%d", &a, &b)
#define getIII(a, b, c) ... | [
"variable_declaration.type.primitive.change"
] | 967,404 | 967,405 | u198530799 | cpp |
p03163 | #include <iostream>
using namespace std;
int DP[110][200100];
int W[110], V[110];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> W[i] >> V[i];
for (int i = 0; i < N; i++)
for (int j = 0; j <= K; j++)
DP[i + 1][j + W[i]] = max(DP[i + 1][j + W[i]], DP[i][j] + V[i]),
... | #include <iostream>
using namespace std;
#define int long long
int DP[110][200100];
int W[110], V[110];
signed main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> W[i] >> V[i];
for (int i = 0; i < N; i++)
for (int j = 0; j <= K; j++)
DP[i + 1][j + W[i]] = max(DP[i + 1][j + W[i]], ... | [
"variable_declaration.type.primitive.change"
] | 967,406 | 967,407 | u538921909 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
cons... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
cons... | [
"assignment.change"
] | 967,410 | 967,411 | u963903527 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> v(N);
vector<int> w(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= W; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<long> v(N);
vector<long> w(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<long>> dp(N + 1, vector<long>(W + 1, 0));
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= W; j++) {... | [
"variable_declaration.type.primitive.change"
] | 967,412 | 967,413 | u874719061 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [] | 967,414 | 967,415 | u347057617 | cpp |
p03163 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i =... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i =... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 967,420 | 967,421 | u563710899 | cpp |
p03163 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int val[n], we[n];
for (int i = 0; i < n; i++)
cin >> we[i] >> val[i];
ll dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int val[n], we[n];
for (int i = 0; i < n; i++)
cin >> we[i] >> val[i];
ll dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 967,422 | 967,423 | u035864973 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> weight, value;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
weight.push_back(a);
value.push_back(b);
}
int dp[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int w = 0; w <= W; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<long long> weight, value;
for (int i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
weight.push_back(a);
value.push_back(b);
}
long long dp[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,433 | 967,434 | u201678045 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define DEBUG(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(ALL(x));
#define RSORT(x) sort(RALL(x));
#define SUM(x) accumulate(ALL(x), 0);
using namespace... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define DEBUG(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(ALL(x));
#define RSORT(x) sort(RALL(x));
#define SUM(x) accumulate(ALL(x), 0);
using namespace... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 967,437 | 967,438 | u850516963 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, wt;
cin >> n >> wt;
int w[n], v[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
int dp[n + 1][wt + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <=... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll n, wt;
cin >> n >> wt;
ll w[n], v[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
ll dp[n + 1][wt + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= wt... | [
"variable_declaration.type.change"
] | 967,447 | 967,448 | u202550027 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e2 + 10;
const int M = 1e5 + 10;
const int INF = 2e9;
int v[N], w[N];
ll dp[N][M];
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 = 1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e2 + 10;
const int M = 1e5 + 10;
const int INF = 2e9;
int v[N], w[N];
ll dp[N][M];
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 = 1... | [] | 967,455 | 967,456 | u554906051 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e2 + 10;
const int M = 1e5 + 10;
const int INF = 2e9;
int v[N], w[N];
ll dp[N][M];
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 = 1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e2 + 10;
const int M = 1e5 + 10;
const int INF = 2e9;
int v[N], w[N];
ll dp[N][M];
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 = 1... | [
"assignment.change"
] | 967,457 | 967,456 | u554906051 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int main() {
ll n, W;
cin >> n >> W;
ll w[n], v[n];
for (ll i = 0; i < n; i++)
cin >> w[i] >> v[i];
ll dp[n + 1][n + 1];
for (ll i = 0; i <= n; i++)
for (ll j = 0; j <= W; j++) {
if (i == 0 || j == 0)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int main() {
ll n, W;
cin >> n >> W;
ll w[n], v[n];
for (ll i = 0; i < n; i++)
cin >> w[i] >> v[i];
ll dp[n + 1][W + 1];
for (ll i = 0; i <= n; i++)
for (ll j = 0; j <= W; j++) {
if (i == 0 || j == 0)... | [
"identifier.change",
"expression.operation.binary.change"
] | 967,458 | 967,459 | u439465393 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, i, j, k, W, w, v;
cin >> n >> W;
int dp[W + 1] = {0};
for (i = 0; i < n; i++) {
cin >> w >> v;
for (j = W - w; j >= 0; j--) {
dp[j + w] = m... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
// your code goes here
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, i, j, k, W, w, v;
cin >> n >> W;
int dp[W + 1] = {0};
for (i = 0; i < n; i++) {
cin >> w >> v;
for (j = W - w; j >= 0; j-... | [
"variable_declaration.type.widen.change"
] | 967,460 | 967,461 | u108436978 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
#define endl '\n'
using namespace std;
int main() {
ll n, w;
cin >> n >> w;
ll val[n], weight[n];
ll dp[n + 1][w + 1];
for (int i = 0; i < n; i++) {
cin >> val[i] >> weight[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
... | #include <bits/stdc++.h>
#define ll long long int
#define endl '\n'
using namespace std;
int main() {
ll n, w;
cin >> n >> w;
ll val[n], weight[n];
ll dp[n + 1][w + 1];
for (int i = 0; i < n; i++) {
cin >> weight[i] >> val[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
... | [
"expression.operation.binary.remove"
] | 967,464 | 967,465 | u091412362 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
const int N = 1e5 + 10;
ll n, W;
ll dp[102][N];
std::vector<pair<ll, ll>> v;
ll go(ll idx, ll pick) {
if (idx == v.size())
return 0;
if (dp[idx][pick] != -1)
return dp[idx][pick];
ll xx = -inf, yy = -inf;
if (pic... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
const int N = 1e5 + 10;
ll n, W;
ll dp[102][N];
std::vector<pair<ll, ll>> v;
ll go(ll idx, ll pick) {
if (idx == v.size())
return 0;
if (dp[idx][pick] != -1)
return dp[idx][pick];
ll xx = -inf, yy = -inf;
if (pic... | [
"control_flow.branch.if.condition.change"
] | 967,466 | 967,467 | u597330339 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int knapSack(ll W, ll wt[], ll val[], ll n) {
ll i, w;
ll 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 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll knapSack(ll W, ll wt[], ll val[], ll n) {
ll i, w;
ll K[n + 1][W + 1];
// Build table K[][] in bottom up manner
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (w... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 967,472 | 967,473 | u370388551 | cpp |
p03163 | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N, 0), v(N, 0);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<ll>> dp(N + 1, vector<ll>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= ... | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N, 0), v(N, 0);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<ll>> dp(N + 1, vector<ll>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= ... | [
"assignment.change"
] | 967,479 | 967,480 | u569272329 | cpp |
p03163 | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N, 0), v(N, 0);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<ll>> dp(N + 1, vector<ll>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= ... | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N, 0), v(N, 0);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<ll>> dp(N + 1, vector<ll>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 967,481 | 967,480 | u569272329 | cpp |
p03163 | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N, 0), v(N, 0);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 0; j <... | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N, 0), v(N, 0);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<ll>> dp(N + 1, vector<ll>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= ... | [
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change"
] | 967,482 | 967,480 | u569272329 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
int q[1000000], dp[1000000];
main() {
int n, w, i, j, a, b, mx = -1;
cin >> n >> w;
dp[0] = 1;
for (i = 0; i < n; ++i) {
cin >> a >> b;
for (j = w; j >= a; j--) {
if (dp[j - a] != 0) {
dp[j] = max(dp[j... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
int q[1000000], dp[1000000];
main() {
int n, w, i, j, a, b, mx = -1;
cin >> n >> w;
dp[0] = 1;
for (i = 0; i < n; ++i) {
cin >> a >> b;
for (j = w; j >= a; j--) {
if (dp[j - a] != 0) {
dp[j] = max(dp[j... | [
"expression.operation.binary.add"
] | 967,486 | 967,487 | u526671873 | cpp |
p03163 | // ░░░░░░░░( •̪●)░░░░░░░░░░░░░░░░░░░░░░░░
// ░░░░░░███████ ]▄▄▄▄▄▄▄▄▃░░░▃░░░░ ▃░
// ▂▄▅█████████▅▄▃▂░░░░░░░░░░░░░░░░░
// [███████████████████].░░░░░░░░░░░░░░
// ◥⊙▲⊙▲⊙▲⊙▲⊙▲⊙▲⊙◤...░░░░░░░░░░░░
// PointBlank's code (⌐■_■)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define repp(i, a, b) for (ll... | // ░░░░░░░░( •̪●)░░░░░░░░░░░░░░░░░░░░░░░░
// ░░░░░░███████ ]▄▄▄▄▄▄▄▄▃░░░▃░░░░ ▃░
// ▂▄▅█████████▅▄▃▂░░░░░░░░░░░░░░░░░
// [███████████████████].░░░░░░░░░░░░░░
// ◥⊙▲⊙▲⊙▲⊙▲⊙▲⊙▲⊙◤...░░░░░░░░░░░░
// PointBlank's code (⌐■_■)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define repp(i, a, b) for (ll... | [
"assignment.change"
] | 967,488 | 967,489 | u960071235 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
int knapSack(int W, vector<int> wt, vector<int> val, int n) {
int i, w;
int K[n + 1][W + 1];
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (wt[i - 1] <= w)
K[i][w] = max... | #include <iostream>
#include <vector>
using namespace std;
long long knapSack(int W, vector<int> wt, vector<int> val, int n) {
int i, w;
long long K[n + 1][W + 1];
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (wt[i - 1] <= w)
K... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,492 | 967,493 | u340245438 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int n, w, val[105], peso[105], dp[105][100005];
int main() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> peso[i] >> val[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
if (peso[i] <= j) {
dp[i][j] = max(dp[i - 1][j]... | #include <bits/stdc++.h>
using namespace std;
long long n, w, val[105], peso[105], dp[105][100005];
int main() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> peso[i] >> val[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
if (peso[i] <= j) {
dp[i][j] = max(dp[i -... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,498 | 967,499 | u790908308 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define dd double
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep1(i, b) for (int i = 1; i <= b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define dd double
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep1(i, b) for (int i = 1; i <= b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#d... | [
"variable_declaration.value.change"
] | 967,500 | 967,501 | u423234259 | cpp |
p03163 | #include <iostream>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int weight[n], val[n], dp[n + 1][W + 1];
for (int i = 0; i < n; i++) {
cin >> weight[i] >> val[i];
}
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... | #include <iostream>
using namespace std;
int main() {
long int n, W;
cin >> n >> W;
long int weight[n], val[n], dp[n + 1][W + 1];
for (long int i = 0; i < n; i++) {
cin >> weight[i] >> val[i];
}
for (long int i = 0; i < n + 1; i++) {
for (long int j = 0; j < W + 1; j++) {
if (i == 0 || j == ... | [
"variable_declaration.type.widen.change"
] | 967,502 | 967,503 | u252229477 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
// lint knapsack(int limit, vector<int> &v, vector<int> &w) {
// vector<lint> dyn(limit+1, -1); int n = w.size();
// dyn[0] = 0;
// for (int i = 0; i < n; ++i)
// for (int j = limit; j >= w[i]; --j)
// if (dyn[j - w[... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
// lint knapsack(int limit, vector<int> &v, vector<int> &w) {
// vector<lint> dyn(limit+1, -1); int n = w.size();
// dyn[0] = 0;
// for (int i = 0; i < n; ++i)
// for (int j = limit; j >= w[i]; --j)
// if (dyn[j - w[... | [] | 967,508 | 967,509 | u608306652 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
lint Knapsack(int limit, vector<int> &v, vector<int> &w) {
vector<lint> dyn(limit, -1);
int n = w.size();
dyn[0] = 0;
for (int i = 0; i < n; ++i)
for (int j = limit; j >= w[i]; --j)
if (dyn[j - w[i]] >= 0)
dyn[j] = max(dyn... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
lint Knapsack(int limit, vector<int> &v, vector<int> &w) {
vector<lint> dyn(limit + 1, -1);
int n = w.size();
dyn[0] = 0;
for (int i = 0; i < n; ++i)
for (int j = limit; j >= w[i]; --j)
if (dyn[j - w[i]] >= 0)
dyn[j] = max... | [
"assignment.change"
] | 967,510 | 967,511 | u608306652 | cpp |
p03163 | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
using ullong = unsigned long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define SORT(v, n) sort(v, v + n)
#define ALL(x) (x).begin(), (x).end()
#define debug(x) cer... | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
using ullong = unsigned long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define SORT(v, n) sort(v, v + n)
#define ALL(x) (x).begin(), (x).end()
#define debug(x) cer... | [] | 967,514 | 967,515 | u865767009 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void max_self(ll &a, ll b) { a = max(a, b); }
void solve() {
int n, w;
cin >> n >> w;
vector<ll> dp(w + 1); // 0,1,2............w
// dp[i] = maximum value of items with total weight
for (int item = 0; item < n; item++) {
ll weight, v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void max_self(ll &a, ll b) { a = max(a, b); }
void solve() {
int n, w;
cin >> n >> w;
vector<ll> dp(w + 1); // 0,1,2............w
// dp[i] = maximum value of items with total weight
for (int item = 0; item < n; item++) {
ll weight, v... | [] | 967,518 | 967,519 | u440619190 | cpp |
p03163 | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
in... | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
fa... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,524 | 967,525 | u560322763 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define debug(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end... | #include <bits/stdc++.h>
using namespace std;
#define debug(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end... | [
"variable_declaration.type.narrow.change",
"call.arguments.change"
] | 967,528 | 967,529 | u602028344 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
bool mycmp(pair<int, int> a, pair<int, int> b) {
if (a.first < b.first)
return true;
else if (a.first == b.first) {
if (a.second < b.second)
return true;
return false;
}
return false;
}
int main() {
int num, w;
cin >> num >> w;
vector<pair<... | #include <bits/stdc++.h>
using namespace std;
bool mycmp(pair<int, int> a, pair<int, int> b) {
if (a.first < b.first)
return true;
else if (a.first == b.first) {
if (a.second < b.second)
return true;
return false;
}
return false;
}
int main() {
int num, w;
cin >> num >> w;
vector<pair<... | [
"variable_declaration.type.primitive.change"
] | 967,539 | 967,540 | u058785367 | cpp |
p03163 | /*
Choo Lo jo mujhe tum kabhi, kho na jaoon main raat din
Nazaron mein tum ho basey
Keh do jo tum ek baar, Mere ho bas tum mere
Nazaron mein tum ho basey
*/
#include <bits/stdc++.h>
#include <cstdio>
#define deb(x) cout << #x << " -> " << x << el
#define db double
#define ll long long int
#def... | /*
Choo Lo jo mujhe tum kabhi, kho na jaoon main raat din
Nazaron mein tum ho basey
Keh do jo tum ek baar, Mere ho bas tum mere
Nazaron mein tum ho basey
*/
#include <bits/stdc++.h>
#include <cstdio>
#define deb(x) cout << #x << " -> " << x << el
#define db double
#define ll long long int
#def... | [] | 967,541 | 967,542 | u764866999 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker... | [
"call.arguments.change"
] | 967,547 | 967,548 | u376415869 | cpp |
p03163 | #include <iostream>
using namespace std;
int n;
int max_weight;
int w[100];
long long int v[100];
long long int dp[101][100001];
int ans = 0;
int main() {
cin >> n >> max_weight;
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < max_weight; j++) {
... | #include <iostream>
using namespace std;
int n;
int max_weight;
int w[101];
long long int v[101];
long long int dp[101][100001];
long long int ans = 0;
int main() {
cin >> n >> max_weight;
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= max_weight... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 967,551 | 967,550 | u693953100 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long dp[105][N];
int main() {
long long n, W;
scanf("%lld %lld", &n, &W);
for (int i = 1; i <= n; i++) {
int v, w;
scanf("%lld %lld", &w, &v);
for (int j = 0; j < w; j++)
dp[i][j] = dp[i - 1][j];
for (int j = w; j <= W... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long dp[105][N];
int main() {
long long n, W;
scanf("%lld %lld", &n, &W);
for (int i = 1; i <= n; i++) {
long long v, w;
scanf("%lld %lld", &w, &v);
for (int j = 0; j < w; j++)
dp[i][j] = dp[i - 1][j];
for (int j = w; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,560 | 967,561 | u377964143 | cpp |
p03163 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)((x).size())
#define debug(x) cout << #x << ":" << x << ' ';
#define debugg(x) cout << #x << ":" << x << ' ' << "\n";
#define endl "\n"
#define L(X) ((X) << 1)
#define R(X) (((X) << 1) | 1)
#define... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)((x).size())
#define debug(x) cout << #x << ":" << x << ' ';
#define debugg(x) cout << #x << ":" << x << ' ' << "\n";
#define endl "\n"
#define L(X) ((X) << 1)
#define R(X) (((X) << 1) | 1)
#define... | [
"expression.operation.binary.add"
] | 967,562 | 967,563 | u232320029 | cpp |
p03163 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define all(a) begin((a)), end((a))
#define uniq(c) (c).erase(unique(all((c))), en... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define all(a) begin((a)), end((a))
#define uniq(c) (c).erase(unique(all((c))), en... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 967,566 | 967,567 | u729217226 | cpp |
p03163 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 967,568 | 967,569 | u366125700 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
void testcase() {
int n, w;
cin >> n >> w;
vector<int> values(n), weights(n);
for (int i = 0; i < n; i++) {
cin >> weights[i] >> values[i];
}
vector<int> dp(w + 1);
for (int i = 0; i < n; i++) {
for (int j = w; j >= 0; j--) {
if (j - weights[i... | #include <bits/stdc++.h>
using namespace std;
void testcase() {
int n, w;
cin >> n >> w;
vector<long long> values(n), weights(n);
for (int i = 0; i < n; i++) {
cin >> weights[i] >> values[i];
}
vector<long long> dp(w + 1);
for (int i = 0; i < n; i++) {
for (int j = w; j >= 0; j--) {
if (j... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,574 | 967,575 | u475283806 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, W;
cin >> N >> W;
vector<long long> dp(W + 1);
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = W; j >= w; j--) {
dp[j] = max(dp[j - w] + v, dp[j]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, W;
cin >> N >> W;
vector<long long> dp(W + 1);
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = W; j >= w; j--) {
dp[j] = max(dp[j - w] + v, dp[j]);
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 967,579 | 967,580 | u237011692 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
const int INF = 1e9 + 5;
#undef int
int main() {
#define int long long int
int n, w;
cin >> n >> w;
vector<int> weight(n, 0);
vector<int> values(n, 0);
int dp[n + 5][w + 5];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
const int INF = 1e9 + 5;
#undef int
int main() {
#define int long long int
int n, w;
cin >> n >> w;
vector<int> weight(n, 0);
vector<int> values(n, 0);
int dp[n + 5][w + 5];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {... | [
"assignment.change"
] | 967,583 | 967,584 | u720279479 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
const int INF = 1e9 + 5;
#undef int
int main() {
#define int long long int
int n, w;
cin >> n >> w;
vector<int> weight(n, 0);
vector<int> values(n, 0);
int dp[n + 5][w + 5];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
const int INF = 1e9 + 5;
#undef int
int main() {
#define int long long int
int n, w;
cin >> n >> w;
vector<int> weight(n, 0);
vector<int> values(n, 0);
int dp[n + 5][w + 5];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 967,585 | 967,584 | u720279479 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MN = 1e5 + 5, LN = 20;
int N, W;
int dp[MN];
int main() {
ios_base::sync_with_stdio(0), ci... | #include <algorithm>
#include <climits>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MN = 1e5 + 5, LN = 20;
int N, W;
ll dp[MN];
int main() {
ios_base::sync_with_stdio(0), cin... | [
"variable_declaration.type.change"
] | 967,593 | 967,594 | u338847482 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, w;
cin >> n >> w;
vector<pair<int, int>> items(n);
int weight, val;
for (int i = 0; i < n; ++i) {
cin >> weight >> val;
items[i] = {weight, val};
}
int dp[n + 1][w + 1];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, w;
cin >> n >> w;
vector<pair<int, int>> items(n);
int weight, val;
for (int i = 0; i < n; ++i) {
cin >> weight >> val;
items[i] = {weight, val};
}
long long dp[n + 1][w +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,599 | 967,600 | u264922697 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[100001][101];
ll n, W;
ll w[100001], v[100001];
ll ans(ll ind, ll c) {
if (c < 0)
return -1 * numeric_limits<ll>::infinity();
if (ind > n - 1)
return 0;
if (dp[ind][c] != -1)
return dp[ind][c];
dp[ind][c] = max(ans(ind + 1, c),... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[101][100001];
ll n, W;
ll w[100001], v[100001];
ll ans(ll ind, ll c) {
if (c < 0)
return numeric_limits<ll>::min();
if (ind > n - 1)
return 0;
if (dp[ind][c] != -1)
return dp[ind][c];
dp[ind][c] = max(ans(ind + 1, c), ans(ind +... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove",
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 967,601 | 967,602 | u555510163 | cpp |
p03163 | #include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N, W;
// freopen("input.txt", "r", stdin);
scanf("%d%d", &N, &W);
vector<int> w(N);
vector<int> v(N);
for (int i = 0; i < N; i++) {
scanf("%d%d", &w[i], &v[i]);
}
vector<vector<int>> d... | #include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N, W;
// freopen("input.txt", "r", stdin);
scanf("%d%d", &N, &W);
vector<int> w(N);
vector<int> v(N);
for (int i = 0; i < N; i++) {
scanf("%d%d", &w[i], &v[i]);
}
vector<vector<long>> ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 967,606 | 967,607 | u532328625 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll unsigned long long
#define MAXN 200
using namespace std;
vector<vector<int>> adj;
vector<bool> visited;
vector<int> parent;
ll tree[MAXN];
ll bin[MAXN];
int fbs(int arr[], int l, int r, int x) {
int res = 0;
while (l <= r) {
int m = l + (r - l) / 2;
if (arr[m] == x) {
... | #include <bits/stdc++.h>
#define ll long long
#define MAXN 200
using namespace std;
vector<vector<int>> adj;
vector<bool> visited;
vector<int> parent;
ll tree[MAXN];
ll bin[MAXN];
int fbs(int arr[], int l, int r, int x) {
int res = 0;
while (l <= r) {
int m = l + (r - l) / 2;
if (arr[m] == x) {
res = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 967,608 | 967,609 | u691653216 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll unsigned long long
#define MAXN 200
using namespace std;
vector<vector<int>> adj;
vector<bool> visited;
vector<int> parent;
ll tree[MAXN];
ll bin[MAXN];
int fbs(int arr[], int l, int r, int x) {
int res = 0;
while (l <= r) {
int m = l + (r - l) / 2;
if (arr[m] == x) {
... | #include <bits/stdc++.h>
#define ll long long
#define MAXN 200
using namespace std;
vector<vector<int>> adj;
vector<bool> visited;
vector<int> parent;
ll tree[MAXN];
ll bin[MAXN];
int fbs(int arr[], int l, int r, int x) {
int res = 0;
while (l <= r) {
int m = l + (r - l) / 2;
if (arr[m] == x) {
res = ... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 967,610 | 967,609 | u691653216 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | [
"variable_declaration.type.change"
] | 967,611 | 967,612 | u127768253 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n, W;
int weight[110], value[110];
int... | //制約をよく見る。この場合 型をlong long にしないと通らない。
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 967,617 | 967,616 | u979078704 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n, W;
int weight[110], value[110];
int... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n, W;
long long weight[110], value[110]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 967,617 | 967,618 | u979078704 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
const int N = 109;
int n, w, value[N], weight[N];
int dp[N][100009];
int solve(int i, int w) {
if (i >= n)
return 0;
if (dp[i][w] != -1)
return dp[i][w];
if (weight[i] > w)
return dp[i][w] = solve(i + 1, w);
else {
return dp... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
const int N = 109;
int n, w, value[N], weight[N];
long long dp[N][100009];
long long solve(int i, int w) {
if (i >= n)
return 0;
if (dp[i][w] != -1)
return dp[i][w];
if (weight[i] > w)
return dp[i][w] = solve(i + 1, w);
else {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,619 | 967,620 | u389142513 | cpp |
p03163 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
#define all(obj) obj.begin(), obj.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
#define all(obj) obj.begin(), obj.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"identifier.change",
"expression.operation.binary.change"
] | 967,630 | 967,631 | u369980487 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w1;
cin >> n >> w1;
int v[n];
int w[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
// int dp[101][100001];
int dp[n + 1][w1 + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w1; j++)
dp[i][j] = 0;
}
dp[0][... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w1;
cin >> n >> w1;
long long int v[n];
int w[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
// int dp[101][100001];
long long int dp[n + 1][w1 + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w1; j++) {
dp[... | [
"variable_declaration.type.widen.change"
] | 967,632 | 967,633 | u620775604 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
long long dp[110][100010];
int main() {
int n, w;
cin >> n >> w;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][j] = 0;
}
}
vector<ii> a(n);
for (auto &x : a) {
cin >> x.first >> x.second;
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
long long dp[110][100010];
int main() {
int n, w;
cin >> n >> w;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][j] = 0;
}
}
vector<ii> a(n);
for (auto &x : a) {
cin >> x.first >> x.second;
... | [
"assignment.change"
] | 967,634 | 967,635 | u077971896 | cpp |
p03163 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 967,654 | 967,655 | u819300485 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
using namespace std;
ifstream f("test.in");
ofstream g("test.out");
int n, W, dp[100005], w[105], v[105];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> W;
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
f... | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
using namespace std;
ifstream f("test.in");
ofstream g("test.out");
ll n, W, dp[100005], w[105], v[105];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> W;
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
fo... | [
"variable_declaration.type.change"
] | 967,664 | 967,665 | u842916328 | cpp |
p03163 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define loop(i, a, b) for (int i = a; i < (l... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define loop(i, a, b) for (int i = a; i < (l... | [
"expression.operation.binary.add"
] | 967,666 | 967,667 | u129315407 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, W;
cin >> n >> W;
vector<int> dp(1 << 17, 0);
fill(dp.begin() + 1, dp.end(), -(1ll << 60));
dp[0] = 0;
for (int i = 1; i <= n; ++i) {
int w, v;
cin >> w >> v;
for (int j = W; j >=... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, W;
cin >> n >> W;
vector<long long> dp(1 << 17, 0);
fill(dp.begin() + 1, dp.end(), -(1ll << 60));
dp[0] = 0;
for (int i = 1; i <= n; ++i) {
int w, v;
cin >> w >> v;
for (int j = W... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,682 | 967,683 | u459737327 | cpp |
p03162 | #include <bits/stdc++.h>
using i64 = long long;
using std::cin;
using std::cout;
using std::endl;
int main() {
int n;
scanf("%d", &n);
std::vector<std::vector<int>> dp(n + 1, std::vector<int>(3, 0));
for (int i = 0; i < n; i++) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
dp[i + 1][0] = a + std::max... | #include <bits/stdc++.h>
using i64 = long long;
using std::cin;
using std::cout;
using std::endl;
int main() {
int n;
scanf("%d", &n);
std::vector<std::vector<int>> dp(n + 1, std::vector<int>(3, 0));
for (int i = 0; i < n; i++) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
dp[i + 1][0] = a + std::max... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 967,684 | 967,685 | u424655672 | cpp |
p03162 | #include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#else
#define TEST(n) ((void)0)
#endif
using namespace std;
int D[3][100000], A[100000], B[100000], C[100000];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("outpu... | #include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#else
#define TEST(n) ((void)0)
#endif
using namespace std;
int D[3][100000], A[100000], B[100000], C[100000];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("outpu... | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 967,686 | 967,687 | u548859367 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
ll a, b, c, d, dp[10000][10000], cost[10000000], weight[1000000];
ll func(ll i, ll w) {
if (i > a) {
return 0;
}
ll p = 0, q = 0;
if (dp[i][w] != -1) {
return dp[i][w];
}
if (w + weight[i] <= b) {
p = cost[i] + func(i ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
ll a, b, c, d, dp[105][100005], cost[100005], weight[100005];
ll func(ll i, ll w) {
if (i > a) {
return 0;
}
ll p = 0, q = 0;
if (dp[i][w] != -1) {
return dp[i][w];
}
if (w + weight[i] <= b) {
p = cost[i] + func(i + 1,... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 967,700 | 967,701 | u863370423 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define cc(x) cout << #x << " = " << x << endl
#define ok cout << "ok" << endl
#define endl '\n'
typedef long long ll;
typedef pair<int, int> ii;
const int INF = 0x3f3f3f3... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define cc(x) cout << #x << " = " << x << endl
#define ok cout << "ok" << endl
#define endl '\n'
typedef long long ll;
typedef pair<int, int> ii;
const int INF = 0x3f3f3f3... | [
"variable_declaration.type.change"
] | 967,702 | 967,703 | u863370423 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7, A = 1e2 + 5;
int n, w, weight[A], val[A];
ll dp[A][100005];
int build() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
ll ret = dp[i - 1][j];
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7, A = 1e2 + 5;
int n, w, weight[A], val[A];
ll dp[A][100005];
ll build() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
ll ret = dp[i - 1][j];
... | [] | 967,714 | 967,715 | u018679195 | cpp |
p03163 | #pragma GCC optimize("O3")
#include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#define forr(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define input \
ios_bas... | #pragma GCC optimize("O3")
#include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#define forr(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define input \
ios_bas... | [
"variable_declaration.type.change"
] | 967,718 | 967,719 | u922603181 | cpp |
p03163 | #pragma GCC optimize("O3")
#include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#define forr(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define input \
ios_bas... | #pragma GCC optimize("O3")
#include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#define forr(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define input \
ios_bas... | [
"variable_declaration.type.change"
] | 967,720 | 967,719 | u922603181 | cpp |
p03163 | /// *** --- ||| In the name of ALLAH ||| --- *** ///
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<... | /// *** --- ||| In the name of ALLAH ||| --- *** ///
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<... | [] | 967,724 | 967,725 | u724640452 | cpp |
p03163 | /// *** --- ||| In the name of ALLAH ||| --- *** ///
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<... | /// *** --- ||| In the name of ALLAH ||| --- *** ///
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 967,726 | 967,725 | u724640452 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
int dp[n][k + 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= k; j++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
ll dp[n][k + 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= k; j++) {
... | [
"variable_declaration.type.change"
] | 967,734 | 967,735 | u990236540 | cpp |
p03163 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//======================================================
#define for1(i,... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//======================================================
#define for1(i,... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"expression.operation.binary.change"
] | 967,740 | 967,741 | u816631826 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.