problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int weight[n + 1];
int value[n + 1];
int dp[n + 1][w + 1];
weight[0] = 0;
value[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> weight[i] >> value[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;
int weight[n + 1];
long int value[n + 1];
long int dp[n + 1][w + 1];
weight[0] = 0;
value[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> weight[i] >> value[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; ... | [
"variable_declaration.type.widen.change"
] | 968,261 | 968,262 | u504035134 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int weight[n + 1];
int value[n + 1];
int dp[n + 1][w + 1];
weight[0] = 0;
value[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> weight[i] >> value[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;
int weight[n + 1];
long int value[n + 1];
long int dp[n + 1][w + 1];
weight[0] = 0;
value[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> weight[i] >> value[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; ... | [
"variable_declaration.type.widen.change"
] | 968,263 | 968,262 | u504035134 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int val[n], weight[n];
for (int i = 0; i < n; i++) {
cin >> weight[i] >> val[i];
}
int knapsack[n + 1][w + 1];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= w; j++) {
if (i == 0 or j == 0)
knapsac... | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long
int n, w;
cin >> n >> w;
int val[n], weight[n];
for (int i = 0; i < n; i++) {
cin >> weight[i] >> val[i];
}
int knapsack[n + 1][w + 1];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= w; j++) {
if (i == 0 or j... | [] | 968,271 | 968,272 | u727469412 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int a[n + 1][w + 1];
int x[n + 1], y[n + 1];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 or j == 0) {
a[i][j] = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long
int n, w;
cin >> n >> w;
int a[n + 1][w + 1];
int x[n + 1], y[n + 1];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 or j == 0) {... | [] | 968,273 | 968,274 | u727469412 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#defi... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#defi... | [
"variable_declaration.type.change"
] | 968,283 | 968,284 | u026594048 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long dp[100001], v[101], w[101];
int main() {
int n, W;
cin >> n >> W;
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
/*for(int i=0;i<n;i++)
{
for(int j=0;j<=W;j++)
{
if(w[i]>j)
dp[(i+1)&1][j]=dp[i&1][j];
el... | #include <bits/stdc++.h>
using namespace std;
long long dp[100001], v[101], w[101];
int main() {
int n, W;
cin >> n >> W;
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < n; i++) {
for (int j = W; j >= 0; j--) {
if (w[i] > j)
break;
dp[j] = max(dp[j], dp[j - w[i]]... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 968,293 | 968,294 | u133348271 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long dp[100001], v[101], w[101];
int main() {
int n, W;
cin >> n >> W;
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
/*for(int i=0;i<n;i++)
{
for(int j=0;j<=W;j++)
{
if(w[i]>j)
dp[(i+1)&1][j]=dp[i&1][j];
el... | #include <bits/stdc++.h>
using namespace std;
long long dp[100001], v[101], w[101];
int main() {
int n, W;
cin >> n >> W;
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
/*for(int i=0;i<n;i++)
{
for(int j=0;j<=W;j++)
{
if(w[i]>j)
dp[(i+1)&1][j]=dp[i&1][j];
el... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 968,293 | 968,295 | u133348271 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n;
cin >> w;
int ww[n];
int vv[n];
for (int i = 0; i < n; i++) {
cin >> ww[i];
cin >> vv[i];
}
int d[w + 1];
for (int i = 0; i < ww[0]; i++)
d[i] = 0;
for (int i = ww[0]; i... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n;
cin >> w;
int ww[n];
long long int vv[n];
for (int i = 0; i < n; i++) {
cin >> ww[i];
cin >> vv[i];
}
long long int d[w + 1];
for (int i = 0; i < ww[0]; i++)
d[i] = 0;
f... | [
"variable_declaration.type.widen.change"
] | 968,300 | 968,301 | u868863576 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int wt[n + 1], v[n + 1];
for (int i = 0; i < n; i++) {
cin >> wt[i];
cin >> v[i];
}
int val[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0) {
va... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long long wt[n + 1], v[n + 1];
for (int i = 0; i < n; i++) {
cin >> wt[i];
cin >> v[i];
}
long long val[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0) ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,316 | 968,317 | u916257071 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int max(int a, int b) { return (a > b) ? a : b; }
// Returns the maximum value that can be put in a knapsack of capacity W
int knapSack(int W, int wt[], int val[], int n) {
int i, w;
int K[n + 1][W + 1];
// Build table K[][] in bottom up manner
for (i = 0; i <= n... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int max(int a, int b) { return (a > b) ? a : b; }
// Returns the maximum value that can be put in a knapsack of capacity W
int knapSack(int W, int wt[], int val[], int n) {
int i, w;
int K[n + 1][W + 1];
// Build table K[][] in bottom up manner... | [
"variable_declaration.type.primitive.change"
] | 968,320 | 968,321 | u916064357 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, tar;
cin >> n >> tar;
long long w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long dp[n + 1][tar + 1];
for (int i = 0; i < n; i++)
dp[i][0] = 0;
for (int i = 0; i < tar; i++)
dp[0][i] = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, tar;
cin >> n >> tar;
long long w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long dp[n + 1][tar + 1];
for (int i = 0; i <= n; i++)
dp[i][0] = 0;
for (int i = 0; i <= tar; i++)
dp[0][i] = 0;
for... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 968,322 | 968,323 | u885511677 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, tar;
cin >> n >> tar;
long long w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long dp[n + 1][tar + 1];
for (int i = 0; i < n; i++)
dp[i][0] = 0;
for (int i = 0; i < tar; i++)
dp[0][i] = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, tar;
cin >> n >> tar;
long long w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long dp[n + 1][tar + 1];
for (int i = 0; i <= n; i++)
dp[i][0] = 0;
for (int i = 0; i <= tar; i++)
dp[0][i] = 0;
for... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 968,324 | 968,323 | u885511677 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, tar;
cin >> n >> tar;
long long w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long dp[n + 1][tar + 1];
for (int i = 0; i < n; i++)
dp[i][0] = 0;
for (int i = 0; i < tar; i++)
dp[0][i] = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, tar;
cin >> n >> tar;
long long w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long dp[n + 1][tar + 1];
for (int i = 0; i <= n; i++)
dp[i][0] = 0;
for (int i = 0; i <= tar; i++)
dp[0][i] = 0;
for... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 968,325 | 968,323 | u885511677 | cpp |
p03163 | #include <iostream>
using namespace std;
const int MAXN = 20000000 + 10;
int w[MAXN], v[MAXN], f[MAXN];
int main() {
int n, m, ans = -1;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = m; j >= w[i]; j--) {
f[j] = max(f[j], f[j - w[i]... | #include <iostream>
using namespace std;
const int MAXN = 2000000 + 10;
long long w[MAXN], v[MAXN], f[MAXN];
int main() {
long long n, m, ans = -1;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = m; j >= w[i]; j--) {
f[j] = max(f[j],... | [
"literal.number.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,326 | 968,327 | u723879945 | cpp |
p03163 | #include <iostream>
using namespace std;
const int MAXN = 20000 + 10;
int w[MAXN], v[MAXN], f[MAXN];
int main() {
int n, m, ans = -1;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = m; j >= w[i]; j--) {
f[j] = max(f[j], f[j - w[i]] +... | #include <iostream>
using namespace std;
const int MAXN = 2000000 + 10;
long long w[MAXN], v[MAXN], f[MAXN];
int main() {
long long n, m, ans = -1;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = m; j >= w[i]; j--) {
f[j] = max(f[j],... | [
"literal.number.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,328 | 968,327 | u723879945 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define speed ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define speed ... | [
"variable_declaration.type.change"
] | 968,353 | 968,354 | u843739531 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int W;
cin >> N;
cin >> W;
int dp[N][W + 1] = {};
int w;
int v;
cin >> w;
cin >> dp[0][w];
for (int i = 0; i < N; i++) {
cin >> w;
cin >> v;
for (int j = 0; j < W + 1; j++) {
dp[i + 1][j] = max(dp[i + 1][j], dp[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int W;
cin >> N;
cin >> W;
long long int dp[N][W + 1] = {};
int w;
int v;
cin >> w;
cin >> dp[0][w];
for (int i = 0; i < N - 1; i++) {
cin >> w;
cin >> v;
for (int j = 0; j < W + 1; j++) {
dp[i + 1][j] = max(dp[i... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 968,359 | 968,360 | u856586005 | cpp |
p03163 | #include <bits/stdc++.h>
#define lli long long
using namespace std;
typedef std::vector<lli> vi;
int main() {
lli n, w;
cin >> n >> w;
vi dp(w + 1, 0);
for (lli i = 0; i < n; i++) {
lli a, b;
cin >> a >> b;
for (lli j = w - a; j >= 0; j--) {
dp[j] = max(dp[j], dp[j] + b);
}
}
lli an... | #include <bits/stdc++.h>
#define lli long long
using namespace std;
typedef std::vector<lli> vi;
int main() {
lli n, w;
cin >> n >> w;
vi dp(w + 1, 0);
for (lli i = 0; i < n; i++) {
lli a, b;
cin >> a >> b;
for (lli j = w - a; j >= 0; j--) {
dp[j + a] = max(dp[j + a], dp[j] + b);
}
}
... | [
"assignment.change"
] | 968,361 | 968,362 | u864207035 | cpp |
p03163 | ///"Bismillahir Rahmanir Raheem"///
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef vector<pii> vii;
typedef vector<pil> vil;
typedef vector<pli> vli;
#d... | ///"Bismillahir Rahmanir Raheem"///
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef vector<pii> vii;
typedef vector<pil> vil;
typedef vector<pli> vli;
#d... | [] | 968,367 | 968,368 | u818791965 | cpp |
p03163 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
long long int W[a + 1], V[a + 1], DP[a + 1][b + 1];
// DP[i][j] i番目までの品物を、重さがj以下になるように選んだ時の価値の最大値
for (int i = 0... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
long long int W[a + 1], V[a + 1], DP[a + 1][b + 1];
// DP[i][j] i番目までの品物を、重さがj以下になるように選んだ時の価値の最大値
for (int i = 0... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 968,373 | 968,374 | u041282550 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> v(n), w(n);
vector<vector<int>> dp;
dp.assign(n + 1, vector<int>(W + 1, 0));
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < n; i++)
for (int k = 0; k <= W; k++)
if (k < w[i])... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> v(n), w(n);
vector<vector<long long int>> dp;
dp.assign(n + 1, vector<long long int>(W + 1, 0));
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < n; i++)
for (int k = 0; k <= W; k++)... | [
"variable_declaration.type.widen.change"
] | 968,382 | 968,383 | u307571140 | cpp |
p03163 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int d... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int d... | [
"identifier.change",
"expression.operation.binary.change"
] | 968,386 | 968,387 | u621104964 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pr;
#define fr(i, n) for (int i = 0; i < n; i++)
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (typeof ((c).begi... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pr;
#define fr(i, n) for (int i = 0; i < n; i++)
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (typeof ((c).begi... | [
"variable_declaration.type.change"
] | 968,406 | 968,407 | u279511029 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
size_t n, wmax;
std::cin >> n >> wmax;
std::vector<size_t> w(n);
std::vector<size_t> v(n);
for (size_t i = 0; i < n; ++i)
std::cin >> w[i] >> v[i];
std::vector<size_t> dp1(wmax + 1, 0);
std::vector<size_t> dp... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
size_t n, wmax;
std::cin >> n >> wmax;
std::vector<size_t> w(n);
std::vector<size_t> v(n);
for (size_t i = 0; i < n; ++i)
std::cin >> w[i] >> v[i];
std::vector<size_t> dp1(wmax + 1, 0);
std::vector<size_t> dp... | [
"identifier.change",
"expression.operation.binary.change"
] | 968,416 | 968,417 | u217344789 | cpp |
p03163 | // naru-hodo
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#define ff first
#define ss second
#define ll long long
#define lli long long int
#define ull unsigned long long int
#define ... | // naru-hodo
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#define ff first
#define ss second
#define ll long long
#define lli long long int
#define ull unsigned long long int
#define ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 968,420 | 968,421 | u223929716 | cpp |
p03163 | #include <iostream>
using namespace std;
int main() {
long long n, w;
cin >> n >> w;
long long items[n][2];
for (int i = 0; i < n; i++) {
cin >> items[i][0] >> items[i][1];
}
long long dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][j] = -1;
}
}
... | #include <iostream>
using namespace std;
int main() {
long long n, w;
cin >> n >> w;
long long items[n][2];
for (int i = 0; i < n; i++) {
cin >> items[i][0] >> items[i][1];
}
long long dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][j] = -1;
}
}
... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 968,427 | 968,428 | u132035173 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
int weight[100], value[100];
int dp[110][100010] = {0}; // [item][weight]
int main() {
int n, w;
cin >> n >> w;
for (int i = 0; i < n; i++)
cin >> weight[i] >> value[i];
for (int i = 0; i < n; i++) {
for (int sum_w = 0; sum_w <= w;... | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 60)
long long weight[100], value[100];
long long dp[110][100010] = {0}; // [item][weight]
int main() {
int n, w;
cin >> n >> w;
for (int i = 0; i < n; i++)
cin >> weight[i] >> value[i];
for (int i = 0; i < n; i++) {
for (int sum_w = 0;... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,432 | 968,433 | u055447809 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> p;
int dp[200][200000];
int main() {
ios::sync_with_stdio(fal... | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> p;
ll dp[200][200000];
int main() {
ios::sync_with_stdio(fals... | [
"variable_declaration.type.change"
] | 968,436 | 968,437 | u916743460 | cpp |
p03163 | // WA
#include <bits/stdc++.h>
#define REV(v) reverse(v.begin(), v.end());
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(... | #include <bits/stdc++.h>
#define REV(v) reverse(v.begin(), v.end());
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(v, v +... | [
"literal.number.change",
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 968,447 | 968,448 | u908349502 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 101;
const int MAX_W = 114514;
int N, W;
int dp[MAX_N][MAX_W];
int main() {
for (int i = 0; i < MAX_W; i++) {
dp[0][i] = 0;
}
cin >> N >> W;
for (int i = 1; i < N + 1; i++) {
int w, v;
cin >> w >> v;
for (int j = 0; j < W + 1; j... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 101;
const int MAX_W = 114514;
int N, W;
long long int dp[MAX_N][MAX_W];
int main() {
for (int i = 0; i < MAX_W; i++) {
dp[0][i] = 0;
}
cin >> N >> W;
for (int i = 1; i < N + 1; i++) {
int w, v;
cin >> w >> v;
for (int j = 0; j ... | [
"variable_declaration.type.widen.change"
] | 968,449 | 968,450 | u751675422 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#include <queue>
#include <vector>
#define ll long long
#define inf INT_MAX
ll int d[20000][20000];
/*ll int solve(ll int a[][2],ll int n,ll int w,ll int i)
{
if(w>=0&&i>=n)
return 0;
if(a[i][0]>w)
{
return solve(a,n,w,i+1)... | #include <bits/stdc++.h>
using namespace std;
#include <queue>
#include <vector>
#define ll long long
#define inf INT_MAX
ll int d[101][200000];
/*ll int solve(ll int a[][2],ll int n,ll int w,ll int i)
{
if(w>=0&&i>=n)
return 0;
if(a[i][0]>w)
{
return solve(a,n,w,i+1);... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 968,455 | 968,456 | u131565555 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#include <queue>
#include <vector>
#define ll long long
#define inf INT_MAX
ll int d[200][20000];
/*ll int solve(ll int a[][2],ll int n,ll int w,ll int i)
{
if(w>=0&&i>=n)
return 0;
if(a[i][0]>w)
{
return solve(a,n,w,i+1);
... | #include <bits/stdc++.h>
using namespace std;
#include <queue>
#include <vector>
#define ll long long
#define inf INT_MAX
ll int d[101][200000];
/*ll int solve(ll int a[][2],ll int n,ll int w,ll int i)
{
if(w>=0&&i>=n)
return 0;
if(a[i][0]>w)
{
return solve(a,n,w,i+1);... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 968,458 | 968,456 | u131565555 | 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;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const... | #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 < (int)(n); i++)
const... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 968,459 | 968,460 | u747087681 | cpp |
p03163 | #include <iostream>
#define ll unsigned long long int
using namespace std;
int main() {
ll n, w, v1, w1;
cin >> n >> w;
ll dp[n + 1][w + 1];
ll weights[n];
ll values[n];
for (int i = 0; i < n; i++) {
cin >> w1 >> v1;
weights[i] = w1;
values[i] = v1;
}
for (int i = 0; i <= n; i++) {
for (... | #include <iostream>
#define ll unsigned long long int
using namespace std;
int main() {
ll n, w, v1, w1;
cin >> n >> w;
ll dp[n + 1][w + 1];
ll weights[n];
ll values[n];
for (int i = 0; i < n; i++) {
cin >> w1 >> v1;
weights[i] = w1;
values[i] = v1;
}
for (int i = 0; i <= n; i++) {
for (... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 968,461 | 968,462 | u476305950 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, w;
cin >> n >> w;
int arr[n][2];
for (int idx = 0; idx < n; idx++) {
cin >> arr[idx][0] >> arr[idx][1];
}
int result[n + 1][w + 1];
for (int val = 0; val <= n; val++) {
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, w;
cin >> n >> w;
long long int arr[n][2];
for (int idx = 0; idx < n; idx++) {
cin >> arr[idx][0] >> arr[idx][1];
}
long long int result[n + 1][w + 1];
for (int val = 0; val <= n; va... | [
"variable_declaration.type.widen.change"
] | 968,467 | 968,468 | u735679698 | cpp |
p03163 | #include <iostream>
using namespace std;
int knapSack(int W, int wt[], int val[], int n) {
int i, w;
int K[n + 1][W + 1];
// Build table K[][] in bottom up manner
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (wt[i - 1] <= w)
... | #include <iostream>
using namespace std;
long int knapSack(int W, long int wt[], long int val[], int n) {
int i, w;
long int K[n + 1][W + 1];
// Build table K[][] in bottom up manner
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
K[i][w] = 0;
else if (wt[i... | [
"variable_declaration.type.widen.change"
] | 968,469 | 968,470 | u735679698 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, W;
cin >> N >> W;
vector<ll> w(N + 1), v(N + 1);
for (int i = 1; i <= N; i++)
cin >> w[i] >> v[i];
vector<vector<ll>> dp;
dp = vector<vector<ll>>(N + 1, vector<ll>(W + 1, 0));
for (int j = 0; j <= W; j++) { // (1)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, W;
cin >> N >> W;
vector<ll> w(N + 1), v(N + 1);
for (int i = 1; i <= N; i++)
cin >> w[i] >> v[i];
vector<vector<ll>> dp;
dp = vector<vector<ll>>(N + 1, vector<ll>(W + 1, 0));
for (int j = 0; j <= W; j++) { // (1)... | [
"assignment.change"
] | 968,474 | 968,475 | u119098168 | cpp |
p03163 | #include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FASTIO \
ios_base::sync_with_stdio(0); \
cin.tie... | #include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FASTIO \
ios_base::sync_with_stdio(0); \
cin.tie... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 968,478 | 968,479 | u030635914 | cpp |
p03163 | #include <bits/stdc++.h>
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 chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll n;
ll w;
ll weight[... | #include <bits/stdc++.h>
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 chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll n;
ll w;
ll weight[... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"variable_declaration.value.change"
] | 968,501 | 968,502 | u257960005 | 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... | [
"variable_declaration.type.change"
] | 968,503 | 968,504 | u455493734 | 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... | [
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 968,505 | 968,504 | u455493734 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
}
return a > b;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
}
return a < b;
}
int weight[1... | #include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
}
return a > b;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
}
return a < b;
}
int weight[1... | [] | 968,506 | 968,507 | u439265517 | cpp |
p03163 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, w;
cin >> n >> w;
vector<pair<int, int>> v;
v.push_back(make_pair(-1, -1));
for (int i = 0... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, w;
cin >> n >> w;
vector<pair<int, int>> v;
v.push_back(make_pair(-1, -1));
for (int i = 0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,513 | 968,514 | u717021668 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define vi vector<ll>
typedef long long ll;
void read() { freopen("in.txt", "r", stdin); }
ll ks(ll num_items, ll cap, const vector<ll> &w, const vector<ll> &v) {
ll dp[num_items + 1][cap + 1];
for (ll i = 0; i <= num_items; i++) {
dp[i][0] = 0;
}
for (ll i ... | #include <bits/stdc++.h>
using namespace std;
#define vi vector<ll>
typedef long long ll;
void read() { freopen("in.txt", "r", stdin); }
ll ks(ll num_items, ll cap, const vector<ll> &w, const vector<ll> &v) {
ll dp[num_items + 1][cap + 1];
for (ll i = 0; i <= num_items; i++) {
dp[i][0] = 0;
}
for (ll i ... | [
"call.remove"
] | 968,520 | 968,521 | u136933076 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pll pair<ll, ll>
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pll pair<ll, ll>
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 968,524 | 968,525 | u005899600 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
/// The greatest enemy of knowledge is not ignorance, it is illusion of
/// knowledge
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
/// The greatest enemy of knowledge is not ignorance, it is illusion of
/// knowledge
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<... | [
"variable_declaration.type.change"
] | 968,528 | 968,529 | u109245895 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int w[100];
int v[100];
int dp[101][100001];
int main() {
int n, W;
cin >> n >> W;
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= W; j++) {
if (j >= w[i]) {
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int w[100];
int v[100];
long long dp[101][100001];
int main() {
int n, W;
cin >> n >> W;
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= W; j++) {
if (j >= w[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,530 | 968,531 | u804999113 | cpp |
p03163 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
temp... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
temp... | [
"assignment.change"
] | 968,532 | 968,533 | u824337972 | cpp |
p03163 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
temp... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
temp... | [
"assignment.change",
"expression.operation.binary.add"
] | 968,534 | 968,533 | u824337972 | cpp |
p03163 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
temp... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
temp... | [
"assignment.change",
"expression.operation.binary.add"
] | 968,535 | 968,533 | u824337972 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
int main() {
int W, N, wi, vi;
std::cin >> N >> W;
int w[N + 1];
int v[N + 1];
int dp[N + 1][W + 1];
memset(dp, 0, sizeof(dp));
w[0] = 0;
v[0] = 0;
dp[0][0] = 0;
for (int i = 1; i < N + 1; i++) {
st... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
int main() {
int W, N, wi, vi;
std::cin >> N >> W;
int w[N + 1];
int v[N + 1];
long dp[N + 1][W + 1];
memset(dp, 0, sizeof(dp));
w[0] = 0;
v[0] = 0;
dp[0][0] = 0;
for (int i = 1; i < N + 1; i++) {
s... | [
"variable_declaration.type.primitive.change"
] | 968,536 | 968,537 | u816587940 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long n, w1, w[105], v[105];
long long f[105][100005];
main() {
cin >> n >> w1;
for (long long i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (long long i = 1; i <= w1; i++) {
for (long long j = 1; j <= n; j++) {
if (i >= w[j])
f[j][i] = max(... | #include <bits/stdc++.h>
using namespace std;
long long n, w1, w[105], v[105];
long long f[105][100005];
main() {
cin >> n >> w1;
for (long long i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (long long i = 1; i <= w1; i++) {
for (long long j = 1; j <= n; j++) {
if (i >= w[j])
f[j][i] = max(... | [
"assignment.change"
] | 968,540 | 968,541 | u036688765 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long n, k, v[10005], w[10005], f[10005][10005];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= k; j++) {
if (w[i] <= j)
f[i][j] = max(f[i - 1][j], f[i - ... | #include <bits/stdc++.h>
using namespace std;
long long n, k, v[105], w[105], f[105][100005];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= k; j++) {
if (w[i] <= j)
f[i][j] = max(f[i - 1][j], f[i - 1][j ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 968,543 | 968,544 | u119908442 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define fr \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define fr \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cou... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 968,545 | 968,546 | u162913456 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, W;
cin >> N >> W;
ll wt[N];
ll val[N];
for (ll i = 0; i < N; i++) {
cin >> wt[i] >> val[i];
}
ll dp[W + 1][N + 1];
for (ll w = 0; w <= W; w++) {
for (ll i = 0; i <= N; i++) {
if (... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, W;
cin >> N >> W;
ll wt[N];
ll val[N];
for (ll i = 0; i < N; i++) {
cin >> wt[i] >> val[i];
}
ll dp[W + 1][N + 1];
for (ll w = 0; w <= W; w++) {
for (ll i = 0; i <= N; i++) {
if (... | [
"assignment.change"
] | 968,547 | 968,548 | u771978844 | cpp |
p03163 | #include <iostream>
#include <set>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
long n, w;
scanf("%ld %ld", &n, &w);
vector<long> values(n, 0);
vector<long> weights(n, 0);
for (int i = 0; scanf("%ld %ld", &weights[i], &values[i]) != EOF; i++) {
}
vector<long long> arr(n * w, 0);... | #include <iostream>
#include <set>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
long n, w;
scanf("%ld %ld", &n, &w);
vector<long> values(n, 0);
vector<long> weights(n, 0);
for (int i = 0; scanf("%ld %ld", &weights[i], &values[i]) != EOF; i++) {
}
vector<long long> arr(n * w, 0);... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 968,553 | 968,554 | u935678852 | cpp |
p03163 | #include <iostream>
#include <set>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
long n, w;
scanf("%ld %ld", &n, &w);
vector<long> values(n, 0);
vector<long> weights(n, 0);
for (int i = 0; scanf("%ld %ld", &weights[i], &values[i]) != EOF; i++) {
}
vector<long> arr(n * w, 0);
f... | #include <iostream>
#include <set>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
long n, w;
scanf("%ld %ld", &n, &w);
vector<long> values(n, 0);
vector<long> weights(n, 0);
for (int i = 0; scanf("%ld %ld", &weights[i], &values[i]) != EOF; i++) {
}
vector<long long> arr(n * w, 0);... | [
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,555 | 968,554 | u935678852 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define PER(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pf push_front
#define pb push_back
#define mk make_pair
#define S ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define PER(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pf push_front
#define pb push_back
#define mk make_pair
#define S ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,558 | 968,559 | u991534398 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define PER(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pf push_front
#define pb push_back
#define mk make_pair
#define S ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define PER(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pf push_front
#define pb push_back
#define mk make_pair
#define S ... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,560 | 968,559 | u991534398 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
// int dp[104][100005];
int dp[100005];
int main() {
int n, we, i, j;
cin >> n >> we;
int w[n + 1], v[n + 1];
for (i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
// 2d dp
/*for(i=1;i<=n;i++)
{
for(j=we;j>=w[i];j--)
{
dp[i][j]=max(dp[i-1][... | #include <bits/stdc++.h>
using namespace std;
// int dp[104][100005];
long long dp[100005];
int main() {
long long n, we, i, j;
cin >> n >> we;
long long w[n + 1], v[n + 1];
for (i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
// 2d dp
/*for(i=1;i<=n;i++)
{
for(j=we;j>=w[i];j--)
{
dp[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,565 | 968,566 | u228402731 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, max_w;
cin >> n >> max_w;
vector<int> dp(max_w + 1, 0);
vector<vector<int>> a(n, vector<int>(2));
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, max_w;
cin >> n >> max_w;
vector<ll> dp(max_w + 1, 0);
vector<vector<int>> a(n, vector<int>(2));
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i... | [] | 968,567 | 968,568 | u415754428 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<vector<long long>> tab(n + 1);
vector<long long> temp(w + 1);
for (int i = 1; i <= w; i++)
temp[i] = -1;
for (int i = 0; i <= n; i++)
tab... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<vector<long long>> tab(n + 1);
vector<long long> temp(w + 1);
for (int i = 1; i <= w; i++)
temp[i] = -1;
for (int i = 0; i <= n; i++)
tab... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,569 | 968,570 | u297798194 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define lPair pair<ll, ll>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define lPair pair<ll, ll>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1,... | [
"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",
"control_flow.branch.if.condition.change",
"misc.of... | 968,571 | 968,572 | u342051078 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, k, n) for (int i = k; i <= n; i++)
#define per(i, n, k) for (int i = n; i >= k; i--)
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define mp make_pair
#define ll long long
using namespace std;
const int maxn = 100005;
int f[maxn];
int n, w, a... | #include <bits/stdc++.h>
#define rep(i, k, n) for (int i = k; i <= n; i++)
#define per(i, n, k) for (int i = n; i >= k; i--)
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define mp make_pair
#define ll long long
using namespace std;
const int maxn = 100005;
ll f[maxn];
ll n, w, ans... | [
"variable_declaration.type.change"
] | 968,578 | 968,579 | u052685836 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int v[n], w[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
int a[n][W + 1];
for (int i = 0; i < W + 1; i++)
a[0][i] = (i < w[0]) ? 0 : v[0];
for (int i = 1; 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;
int v[n], w[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long a[n][W + 1];
for (int i = 0; i < W + 1; i++)
a[0][i] = (i < w[0]) ? 0 : v[0];
for (int i = 1; i < n; i++) {
for (int j = 0; j <= W; j+... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,585 | 968,586 | u387025271 | cpp |
p03163 | #include <bits/stdc++.h> // Tomasz Nowak
using namespace std; // XIII LO Szczecin
using L = long long;
#define FOR(i, l, r) for (int i = l; i <= r; ++i)
#define REP(i, n) FOR(i, 0, n - 1)
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, W;
cin >> n >> W;
vector<int> dp(W + 1), prev_dp(W + ... | #include <bits/stdc++.h> // Tomasz Nowak
using namespace std; // XIII LO Szczecin
using L = long long;
#define FOR(i, l, r) for (int i = l; i <= r; ++i)
#define REP(i, n) FOR(i, 0, n - 1)
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, W;
cin >> n >> W;
vector<L> dp(W + 1), prev_dp(W + 1)... | [] | 968,591 | 968,592 | u412965895 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, W;
cin >> N >> W;
vector<vector<int>> dp(N + 10, vector<int>(W, 0));
int v, w;
for (int i = 0; i < N; i++) {
cin >> w >> v;
for (int j = 0; j <= W; j++) {
if (j - w < 0) {
dp[i + 1][j] = dp[i][j];... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, W;
cin >> N >> W;
vector<vector<int>> dp(110, vector<int>(100010, 0));
int v, w;
for (int i = 0; i < N; i++) {
cin >> w >> v;
for (int j = 0; j <= W; j++) {
if (j - w < 0) {
dp[i + 1][j] = dp[i][j... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 968,602 | 968,603 | u045811375 | cpp |
p03163 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int static const N_MAX = 1000;
i... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int static const N_MAX = 100 + 1... | [
"literal.number.change"
] | 968,616 | 968,617 | u061804469 | cpp |
p03163 | //#include <bits/stdc++.h>/*
#include <algorithm> //sort
#include <array>
#include <cassert>
#include <cctype> //isaplha, tolower
#include <cmath> //sqrt, sin
#include <complex>
#include <cstdio>
#include <cstring> //memset
#include <ctime>
#include <deque>
#include <functional> //greater
#include <iostream>
#include ... | //#include <bits/stdc++.h>/*
#include <algorithm> //sort
#include <array>
#include <cassert>
#include <cctype> //isaplha, tolower
#include <cmath> //sqrt, sin
#include <complex>
#include <cstdio>
#include <cstring> //memset
#include <ctime>
#include <deque>
#include <functional> //greater
#include <iostream>
#include ... | [] | 968,618 | 968,619 | u235860954 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, W;
cin >> n >> W;
vector<int> dp(W + 1);
for (int i = 0; i < n; ++i) {
int w, v;
cin >> w >> v;
for (int j = W - w; j >= 0; --j) {
dp[j... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, W;
cin >> n >> W;
vector<ll> dp(W + 1);
for (int i = 0; i < n; ++i) {
ll w, v;
cin >> w >> v;
for (int j = W - w; j >= 0; --j) {
dp[j +... | [
"variable_declaration.type.change"
] | 968,620 | 968,621 | u855388123 | cpp |
p03163 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, m, n) for (ll ... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, m, n) for (ll ... | [
"expression.operation.binary.remove"
] | 968,624 | 968,625 | u409872261 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll max(ll a, ll b) { return (a >= b ? a : b); }
int main(void) {
ll n, w;
cin >> n >> w;
ll remw = w;
ll we[n], val[n];
for (ll i = 0; i < n; ++i) {
cin >> we[i] >> val[i];
}
ll dp[n + 1][w + 1] = {0};
for (ll i = 1; i <= n; ++i) {
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll max(ll a, ll b) { return (a >= b ? a : b); }
int main(void) {
ll n, w;
cin >> n >> w;
ll remw = w;
ll we[n], val[n];
for (ll i = 0; i < n; ++i) {
cin >> we[i] >> val[i];
}
ll dp[n + 1][w + 1] = {0};
for (ll i = 1; i <= w; ++i) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 968,626 | 968,627 | u707655771 | cpp |
p03163 | #include <bits/stdc++.h>
#include <string>
using namespace std;
#include <string>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef long long ll;
#define MAX 1000000000
ll abs(ll a, l... | #include <bits/stdc++.h>
#include <string>
using namespace std;
#include <string>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef long long ll;
#define MAX 1000000000
ll abs(ll a, l... | [
"variable_declaration.type.change"
] | 968,632 | 968,633 | u347064817 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
const int maxn = 105;
const int maxw = 1e5 + 5;
int w[maxn], v[maxn];
int n, W;
int dp[maxw];
int main() {
scanf("%d %d", &n, &W);
for (int i = 1; i <= n; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
const int maxn = 105;
const int maxw = 1e5 + 5;
int w[maxn], v[maxn];
int n, W;
ll dp[maxw];
int main() {
scanf("%d %d", &n, &W);
for (int i = 1; i <= n; i++)
... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,634 | 968,635 | u905710781 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
#define ri register int
#define endl "\n"
using namespace std;
ll dp[102][(int)1e5 + 2] = {};
int main() {
ios_base::sync_with_stdio(false);
ll n, w;
cin >> n >> w;
vector<pair<ll, ll>> items(n + 1);
for (ri i = 1; i <= n; i++)
cin >> items[i].first >... | #include <bits/stdc++.h>
#define ll long long int
#define ri register int
#define endl "\n"
using namespace std;
ll dp[102][(int)1e5 + 2] = {};
int main() {
ios_base::sync_with_stdio(false);
ll n, w;
cin >> n >> w;
vector<pair<ll, ll>> items(n + 1);
for (ri i = 1; i <= n; i++)
cin >> items[i].first >... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 968,636 | 968,637 | u938926508 | cpp |
p03163 | /*author : Yashvardhan
Saturday, January 12, 2019
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#pragma comment(linker, "/stack:200000000")
#pragma G... | /*author : Yashvardhan
Saturday, January 12, 2019
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#pragma comment(linker, "/stack:200000000")
#pragma G... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 968,645 | 968,646 | u368039995 | cpp |
p03163 | /*author : Yashvardhan
Saturday, January 12, 2019
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#pragma comment(linker, "/stack:200000000")
#pragma G... | /*author : Yashvardhan
Saturday, January 12, 2019
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#pragma comment(linker, "/stack:200000000")
#pragma G... | [
"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"
] | 968,647 | 968,648 | u368039995 | cpp |
p03163 | #include <bits/stdc++.h>
using lli = long long int;
template <typename T> bool chmax(T &a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
lli n, w;
std::vector<std::pair<lli, lli>> vec;
std::vector<std::vector<lli>> dp;
int main() {
std::cin >> n >> w;
vec.assign(n + 1, {0, 0});
for (l... | #include <bits/stdc++.h>
using lli = long long int;
template <typename T> bool chmax(T &a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
lli n, w;
std::vector<std::pair<lli, lli>> vec;
std::vector<std::vector<lli>> dp;
int main() {
std::cin >> n >> w;
vec.assign(n + 1, {0, 0});
for (l... | [
"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"
] | 968,653 | 968,654 | u537538698 | cpp |
p03163 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) RE... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) RE... | [] | 968,655 | 968,656 | u139235669 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int v[110], w[110];
int dp[110][100010] = {};
int main() {
int N, W;
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; j++) {
if (j - w[i] >= 0) {
dp[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL v[110], w[110];
LL dp[110][100010] = {};
int main() {
int N, W;
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; j++) {
if (j - w[i] >= 0) {
dp[i +... | [
"variable_declaration.type.change"
] | 968,657 | 968,658 | u392423112 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rfor(i, a, b) for (int i = a; i < (int)b; i++)
#define all(ary) (ary).begin(), (ary).end()
#define debug(x) cerr << #x << ": " << x << '\n'
const long long INF = 1LL << 60;
const int MOD = 1000000007;
using namespace std;
using vec = ve... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rfor(i, a, b) for (int i = a; i < (int)b; i++)
#define all(ary) (ary).begin(), (ary).end()
#define debug(x) cerr << #x << ": " << x << '\n'
const long long INF = 1LL << 60;
const int MOD = 1000000007;
using namespace std;
using vec = ve... | [
"control_flow.branch.else.remove"
] | 968,659 | 968,660 | u924820636 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define rep(i, n) for (int i(0); i < n; i++)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define mod 1000000007
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i(0); i < n; i++)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define mod 1000000007
#define ... | [] | 968,661 | 968,662 | u821240599 | cpp |
p03163 | #include <cstring>
#include <iostream>
using namespace std;
const int W = 100010, N = 105;
int w[N], v[N], dp[N][W], n, m;
int main() {
memset(dp, 0, sizeof(dp));
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 = 0; j <= m; j++) {
dp[i][j]... | #include <cstring>
#include <iostream>
using namespace std;
const int W = 100010, N = 105;
long long w[N], v[N], dp[N][W], n, m;
int main() {
memset(dp, 0, sizeof(dp));
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 = 0; j <= m; j++) {
dp... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,667 | 968,668 | u251934001 | cpp |
p03163 | #include <cstring>
#include <iostream>
using namespace std;
const int W = 100010, N = 105;
int w[N], v[N], dp[N][W], n, m;
int main() {
memset(dp, 0, sizeof(dp));
cin >> m >> n;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; i++)
for (int j = 0; j <= m; j++) {
dp[i][j]... | #include <cstring>
#include <iostream>
using namespace std;
const int W = 100010, N = 105;
long long w[N], v[N], dp[N][W], n, m;
int main() {
memset(dp, 0, sizeof(dp));
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 = 0; j <= m; j++) {
dp... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 968,669 | 968,668 | u251934001 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define M 9... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define M 9... | [
"call.arguments.add"
] | 968,676 | 968,677 | u760200622 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
ll dp[100100];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
ll dp[100100];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0... | [
"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"
] | 968,680 | 968,681 | u626595726 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
ll dp[100100];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
ll dp[100100];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 968,680 | 968,682 | u626595726 | cpp |
p03163 | #include <bits/stdc++.h>
#define range 100005
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define ALL(V) V.begin(), V.end()
#define _ << " " <<
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
#define range 100005
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define ALL(V) V.begin(), V.end()
#define _ << " " <<
using namespace std;
typedef long long ll;
t... | [
"variable_declaration.type.change"
] | 968,685 | 968,686 | u235034547 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
// fastio
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, W;
cin >> n >> W;
ll weg[n];
ll val[n];
ll dp[n + 1][W + 1];
for (ll i = 0; i < n; i++) {
cin >> weg[i] >> val[i];
}
for ... | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
// fastio
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, W;
cin >> n >> W;
ll weg[n];
ll val[n];
ll dp[n + 1][W + 1];
for (ll i = 0; i < n; i++) {
cin >> weg[i] >> val[i];
}
for ... | [
"expression.operation.binary.remove"
] | 968,691 | 968,692 | u358609371 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
long long *va... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
long long *va... | [
"expression.operation.binary.remove"
] | 968,693 | 968,694 | u511167544 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define DIM 100007
#define INF 2E60
#define MAXN 1023
#define LG 18
typedef long long ll;
typedef long double ld;
typedef ll arr[DIM];
typedef vector<ll> vec;
typedef vector<ll> graph[DIM];
typedef pair<ll, ll> pll;
typedef pll parr[DIM];
struct pp {
ll a, b;
bool ope... | #include <bits/stdc++.h>
using namespace std;
#define DIM 100007
#define INF 2E60
#define MAXN 1023
#define LG 18
typedef long long ll;
typedef long double ld;
typedef ll arr[DIM];
typedef vector<ll> vec;
typedef vector<ll> graph[DIM];
typedef pair<ll, ll> pll;
typedef pll parr[DIM];
struct pp {
ll a, b;
bool ope... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 968,702 | 968,703 | u980798691 | cpp |
p03163 | #include <bits/stdc++.h>
using lli = long long int;
template <typename T> bool chmax(T &a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
lli n, w;
std::vector<std::pair<lli, lli>> vec;
std::vector<std::vector<lli>> dp;
int main() {
std::cin >> n >> w;
vec.assign(n + 1, {0, 0});
for (l... | #include <bits/stdc++.h>
using lli = long long int;
template <typename T> bool chmax(T &a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
lli n, w;
std::vector<std::pair<lli, lli>> vec;
std::vector<std::vector<lli>> dp;
int main() {
std::cin >> n >> w;
vec.assign(n + 1, {0, 0});
for (l... | [
"expression.operation.binary.add"
] | 968,710 | 968,711 | u222293734 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long dp[110][100100]; // do[i][j]=i番目のものまでで重さjのときの価値の最大値
int main(void) {
long long N, W;
cin >> N >> W;
long long w[N], v[N];
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; j++) {
// i番目の... | #include <bits/stdc++.h>
using namespace std;
long long dp[110][100100]; // do[i][j]=i番目のものまでで重さjのときの価値の最大値
int main(void) {
long long N, W;
cin >> N >> W;
long long w[N], v[N];
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; j++) {
// i番目の... | [] | 968,712 | 968,713 | u168774513 | cpp |
p03163 | #include <stdio.h>
const int W = 1e5 + 10;
long long int max(long long int a, long long int b) { return a > b ? a : b; }
int main() {
int n, w, p, v;
long long int a[W], ans = 0;
scanf("%d%d", &n, &w);
for (int i = 0; i <= w; i++)
a[i] = 0;
for (int i = 0; i < n; i++) {
scanf("%d%d", &p, &v);
for ... | #include <stdio.h>
const int W = 1e5 + 10;
long long int max(long long int a, long long int b) { return a > b ? a : b; }
int main() {
int n, w, p, v;
long long int a[W], ans = 0;
scanf("%d%d", &n, &w);
for (int i = 0; i <= w; i++)
a[i] = 0;
for (int i = 0; i < n; i++) {
scanf("%d%d", &p, &v);
for ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 968,714 | 968,715 | u241347678 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int n, v[101], w[101], W;
int dp[100100];
void solve() {
for (int i = 0; i < n; i++)
for (int j = W; j >= w[i]; j--)
dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
printf("%d", dp[W]);
}
int main() {
cin >> n;
cin >> W;
for (int i = 0; i < n; i++)
cin ... | #include <bits/stdc++.h>
using namespace std;
int n, v[101], w[101], W;
long long dp[100100];
void solve() {
for (int i = 0; i < n; i++)
for (int j = W; j >= w[i]; j--)
dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
printf("%lld", dp[W]);
}
int main() {
cin >> n;
cin >> W;
for (int i = 0; i < n; i++)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,722 | 968,723 | u785442356 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int n, v[101], w[101], W;
int dp[100100];
void solve() {
for (int i = 0; i < n; i++)
for (int j = W; j >= w[i]; j--)
dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
printf("%d", dp[W]);
}
int main() {
cin >> n;
cin >> W;
for (int i = 1; i <= n; i++)
cin... | #include <bits/stdc++.h>
using namespace std;
int n, v[101], w[101], W;
long long dp[100100];
void solve() {
for (int i = 0; i < n; i++)
for (int j = W; j >= w[i]; j--)
dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
printf("%lld", dp[W]);
}
int main() {
cin >> n;
cin >> W;
for (int i = 0; i < n; i++)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expressi... | 968,724 | 968,723 | u785442356 | cpp |
p03163 | // verma_ankit484
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n, wt;
vector<ll> v;
vector<ll> w;
vector<vector<ll>> dp;
void knap() {
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= wt; j++) {
if (j < w[i]) {
dp[i][j] = dp[i - 1][j];
} else {
dp[i][j] ... | // verma_ankit484
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n, wt;
vector<ll> v;
vector<ll> w;
vector<vector<ll>> dp;
void knap() {
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= wt; j++) {
if (j < w[i]) {
dp[i][j] = dp[i - 1][j];
} else {
dp[i][j] =... | [
"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"
] | 968,725 | 968,726 | u090859759 | cpp |
p03163 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
void pairsort(int a[], int b[], int n) {
pair<int, int> pairt[n];
for (int i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
sort(pairt, pairt + n);
for (int i = 0; i < n; i++) {
a[i] = pai... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
void pairsort(int a[], int b[], int n) {
pair<int, int> pairt[n];
for (int i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
sort(pairt, pairt + n);
for (int i = 0; i < n; i++) {
a[i] = pai... | [
"variable_declaration.type.widen.change"
] | 968,737 | 968,738 | u278938713 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
const int mod = (int)1e9 + 7;
const int MANY = 1 << 30;
const int N = (int)1e5 + 10;
int a[N][3], n, m;
int... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
const int mod = (int)1e9 + 7;
const int MANY = 1 << 30;
const int N = (int)1e5 + 10;
int a[N][3], n, m;
int... | [
"variable_declaration.type.primitive.change"
] | 968,742 | 968,743 | u407516534 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<pair<int, int>> all(n);
for (int i = 0; i < n; i++) {
cin >> all[i].first >> all[i].second;
}
sort(all.begin(), all.end())... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<pair<int, int>> all(n);
for (int i = 0; i < n; i++) {
cin >> all[i].first >> all[i].second;
}
sort(all.begin(), all.end())... | [
"variable_declaration.type.primitive.change"
] | 968,748 | 968,749 | u416986249 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.