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;
vector<int> dp(w + 1);
for (int i = 0; i < n; ++i) {
int sz, cst;
cin >> sz >> cst;
for (int wt = w; wt >= 0; --wt) {
dp[wt + sz] = max(dp[wt + sz], dp[wt] + cst);
}
}
cout << *max_element(dp.begin(),... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<long long> dp(w + 1);
for (int i = 0; i < n; ++i) {
long long sz, cst;
cin >> sz >> cst;
for (int wt = w - sz; wt >= 0; --wt) {
dp[wt + sz] = max(dp[wt + sz], dp[wt] + cst);
}
}
cout << *max_el... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 966,313 | 966,314 | u048764593 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long int ll;
#define MOD 1000000007
#define INF 1e18
#include <ctime>
#define rep(i, x, n) for (ll i = x; i < n; i++)
#define rev(i, n, x) for (ll i = n; i > x; i--)
#define endl "\n"
#define all(c) (c).begin(), (c).end()
#define int long l... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long int ll;
#define MOD 1000000007
#define INF 1e18
#include <ctime>
#define rep(i, x, n) for (ll i = x; i < n; i++)
#define rev(i, n, x) for (ll i = n; i > x; i--)
#define endl "\n"
#define all(c) (c).begin(), (c).end()
#define int long l... | [
"variable_declaration.type.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 966,318 | 966,317 | u868958206 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long int ll;
#define MOD 1000000007
#define INF 1e18
#include <ctime>
#define rep(i, x, n) for (ll i = x; i < n; i++)
#define rev(i, n, x) for (ll i = n; i > x; i--)
#define endl "\n"
#define all(c) (c).begin(), (c).end()
#define int long l... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long int ll;
#define MOD 1000000007
#define INF 1e18
#include <ctime>
#define rep(i, x, n) for (ll i = x; i < n; i++)
#define rev(i, n, x) for (ll i = n; i > x; i--)
#define endl "\n"
#define all(c) (c).begin(), (c).end()
#define int long l... | [
"control_flow.break.remove",
"control_flow.continue.add",
"control_flow.branch.if.condition.change"
] | 966,319 | 966,317 | u868958206 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long int ll;
#define MOD 1000000007
#define INF 1e18
#include <ctime>
#define rep(i, x, n) for (ll i = x; i < n; i++)
#define rev(i, n, x) for (ll i = n; i > x; i--)
#define endl "\n"
#define all(c) (c).begin(), (c).end()
#define int long l... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long int ll;
#define MOD 1000000007
#define INF 1e18
#include <ctime>
#define rep(i, x, n) for (ll i = x; i < n; i++)
#define rev(i, n, x) for (ll i = n; i > x; i--)
#define endl "\n"
#define all(c) (c).begin(), (c).end()
#define int long l... | [
"control_flow.branch.if.condition.change"
] | 966,319 | 966,320 | u868958206 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, w, j;
cin >> n >> w;
long long A[n][2];
for (int i = 0; i < n; i++) {
cin >> A[i][0] >> A[i][1];
}
long long dp[w + 5] = {0};
for (long long i = 0; i < n; i++) {
for (j = w - A[i][0]; j >= 0; j--) {
dp[j + A[i][0]] = ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, w, j;
cin >> n >> w;
long long A[n][2];
for (int i = 0; i < n; i++) {
cin >> A[i][0] >> A[i][1];
}
long long dp[w + 5] = {0};
for (long long i = 0; i < n; i++) {
for (j = w - A[i][0]; j >= 0; j--) {
dp[j + A[i][0]] = ma... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 966,321 | 966,322 | u044427591 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, w, j;
cin >> n >> w;
int A[n][2];
for (int i = 0; i < n; i++) {
cin >> A[i][0] >> A[i][1];
}
long long dp[w + 5] = {0};
for (long long i = 0; i < n; i++) {
for (j = w - A[i][0]; j >= 0; j--) {
dp[j + A[i][0]] = max(dp[j... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, w, j;
cin >> n >> w;
long long A[n][2];
for (int i = 0; i < n; i++) {
cin >> A[i][0] >> A[i][1];
}
long long dp[w + 5] = {0};
for (long long i = 0; i < n; i++) {
for (j = w - A[i][0]; j >= 0; j--) {
dp[j + A[i][0]] = ma... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 966,323 | 966,322 | u044427591 | cpp |
p03163 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <typename T> void print(T vec) {
for (auto d : vec)
cout << d << ' ';
cout << '\n';
}
template <typename T> void print2D(T mat) {
for (auto vec : mat)
print(vec);
}
int64_t n, W;
vector<ll> weight(n), value(n);
ll knapSack(ll ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <typename T> void print(T vec) {
for (auto d : vec)
cout << d << ' ';
cout << '\n';
}
template <typename T> void print2D(T mat) {
for (auto vec : mat)
print(vec);
}
int64_t n, W;
vector<ll> weight(n), value(n);
ll knapSack(ll ... | [
"call.arguments.change"
] | 966,336 | 966,337 | u153967106 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
const int maxv = 1e5 + 10;
int w[maxn], c[maxn];
int dp[maxv];
int main() {
int n, v;
cin >> n >> v;
for (int i = 1; i <= n; i++)
cin >> w[i] >> c[i];
for (int i = 1; i <= n; i++) {
for (int j = v; j >= w[i]; j--) {
dp[j] = max(dp... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
const int maxv = 1e5 + 10;
long long w[maxn], c[maxn];
long long dp[maxv];
int main() {
int n, v;
cin >> n >> v;
for (int i = 1; i <= n; i++)
cin >> w[i] >> c[i];
for (int i = 1; i <= n; i++) {
for (int j = v; j >= w[i]; j--) {
d... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,340 | 966,341 | u775877429 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W, i, x, y;
cin >> N >> W;
vector<int> dp(W + 1, 0);
for (i = 0; i < N; i++) {
cin >> x >> y; // x is weight and y is value
for (int weight = W; weight >= x; weight--) {
dp[weight] = max(dp[weight], dp[weight - x] + y);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W, i, x, y;
cin >> N >> W;
vector<long long> dp(W + 1, 0);
for (i = 0; i < N; i++) {
cin >> x >> y; // x is weight and y is value
for (int weight = W; weight >= x; weight--) {
dp[weight] = max(dp[weight], dp[weight - x] + y);
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,344 | 966,345 | u345094009 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int weight[N], value[N];
for (int i = 0; i < N; i++) {
cin >> weight[i] >> value[i];
}
long long int dp[N + 1][W + 1] = {0};
for (int i = 0; i < N; i++) {
for (int sum_w = 0; sum_w <= W; sum_w++) {
if (sum_w... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int weight[N], value[N];
for (int i = 0; i < N; i++) {
cin >> weight[i] >> value[i];
}
long long int dp[N + 1][W + 1] = {};
for (int i = 0; i < N; i++) {
for (int sum_w = 0; sum_w <= W; sum_w++) {
if (sum_w ... | [] | 966,351 | 966,352 | u384300282 | cpp |
p03163 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int w[n], v[n];
for (auto i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
int ans[n + 1][s + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= s; j++) {
if (i == 0 || j == 0) {
ans[i][j] = 0;
... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long int n, s;
cin >> n >> s;
long long int w[n], v[n];
for (auto i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
long long int ans[n + 1][s + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= s; j++) {
if (i == 0 || j == 0) {... | [
"variable_declaration.type.widen.change"
] | 966,353 | 966,354 | u096449099 | cpp |
p03163 | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int dp[105][100100];
int main() {
int n, W;
int v[105];
int w[105];
cin >> n >> W;
rep(i, n) cin >> w[i] >> v[i];
rep(i, n) {
for (int sum_w = 0; sum_w <= W; ++su... | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll dp[105][100100];
int main() {
int n, W;
int v[105];
int w[105];
cin >> n >> W;
rep(i, n) cin >> w[i] >> v[i];
rep(i, n) {
for (int sum_w = 0; sum_w <= W; ++sum... | [
"variable_declaration.type.change"
] | 966,355 | 966,356 | u256459711 | cpp |
p03163 | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int dp[105][10010];
int main() {
int n, W;
int v[105];
int w[105];
cin >> n >> W;
rep(i, n) cin >> w[i] >> v[i];
rep(i, n) {
for (int sum_w = 0; sum_w <= W; ++sum... | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll dp[105][100100];
int main() {
int n, W;
int v[105];
int w[105];
cin >> n >> W;
rep(i, n) cin >> w[i] >> v[i];
rep(i, n) {
for (int sum_w = 0; sum_w <= W; ++sum... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 966,357 | 966,356 | u256459711 | cpp |
p03163 | //----AUTHOR:kkdrummer----/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<int> C;
#define X real()
#define Y imag()
// typedef unordered_set<l... | //----AUTHOR:kkdrummer----/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<int> C;
#define X real()
#define Y imag()
// typedef unordered_set<l... | [
"variable_declaration.type.change"
] | 966,358 | 966,359 | u452240501 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int find_max_profit_momo(int v[], int w[], int wt, int n) {
// cout<<wt<<" "<<n<<endl;
// return 1;
ll int dp[n + 1][wt + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= wt; j++) {
// cout<<i<<" "<<j<<endl;
if (i == 0 |... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll find_max_profit_momo(int v[], int w[], int wt, int n) {
// cout<<wt<<" "<<n<<endl;
// return 1;
ll int dp[n + 1][wt + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= wt; j++) {
// cout<<i<<" "<<j<<endl;
if (i == 0 ||... | [] | 966,360 | 966,361 | u082850638 | cpp |
p03163 | /*
@author: Charan Sai
*/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | /*
@author: Charan Sai
*/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [] | 966,364 | 966,365 | u895093067 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define MAX 10000000
using namespace std;
int main() {
ll n, W, w, v;
cin >> n >> W;
vector<pair<ll, ll>> knap;
for (int i = 0; i < n; i++) {
cin >> w >> v;
knap.push_back({w, v});
}
ll k[n + 1][W + 1];
for (int i = 0; i <= ... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define MAX 10000000
using namespace std;
int main() {
ll n, W, w, v;
cin >> n >> W;
vector<pair<ll, ll>> knap;
for (int i = 0; i < n; i++) {
cin >> w >> v;
knap.push_back({w, v});
}
ll k[n + 1][W + 1];
for (int i = 0; i <= ... | [
"assignment.change"
] | 966,366 | 966,367 | u768421127 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> dp(2005, vector<int>(2005, -1));
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t, s;
cin >> t >> s;
vector<pair<int, int>> vec;
for (int i = 0; i < t; i++) {
int a, b;
cin >> a >> b;
vec.pu... | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> dp(2005, vector<int>(2005, -1));
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t, s;
cin >> t >> s;
vector<pair<int, int>> vec;
for (int i = 0; i < t; i++) {
int a, b;
cin >> a >> b;
vec.pu... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,371 | 966,372 | u990110497 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int wt[n + 1], v[n + 1];
wt[0] = 0, v[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> wt[i] >> v[i];
}
int mat[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
mat[i][0] = 0;
}
for (int i = 0; i <= w; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int wt[n + 1], v[n + 1];
wt[0] = 0, v[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> wt[i] >> v[i];
}
long long int mat[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
mat[i][0] = 0;
}
for (int i = 0; i <= w... | [
"variable_declaration.type.widen.change"
] | 966,373 | 966,374 | u426221901 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, W;
cin >> n >> W;
int w[n];
int val[n];
// cout<<"\n";
for (int i = 0; i < n; i++) {
cin >> w[i] >> val[i];
}
int dp[n + 1][W + 1];
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, W;
cin >> n >> W;
int w[n];
int val[n];
// cout<<"\n";
for (int i = 0; i < n; i++) {
cin >> w[i] >> val[i];
}
long long int dp[n + 1][W + 1];
for (int i = 0; i < n + 1; i++) {
for (int j... | [
"variable_declaration.type.widen.change"
] | 966,379 | 966,380 | u604419417 | cpp |
p03163 | /*
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
| |
| author : thanos1399 Language : C ++ |
| college : MSIT |
| _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _... | /*
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
| |
| author : thanos1399 Language : C ++ |
| college : MSIT |
| _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _... | [
"call.remove"
] | 966,393 | 966,394 | u332867154 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, n, ans = 0;
cin >> n >> w;
vector<int> weight(w + 1);
for (int item = 0; item < n; item++) {
int ni, wi;
cin >> ni >> wi;
for (int i = w - ni; i >= 0; i--) {
weight[i + ni] = max(weight[i + ni], weight[i] + wi);
}
}
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, n, ans = 0;
cin >> n >> w;
vector<long long> weight(w + 1);
for (int item = 0; item < n; item++) {
int ni, wi;
cin >> ni >> wi;
for (int i = w - ni; i >= 0; i--) {
weight[i + ni] = max(weight[i + ni], weight[i] + wi);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,395 | 966,396 | u436793326 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long int dp[101][100001];
int knapSack(int wt[], int val[], int W, int n) {
if (n == 0 || W == 0)
return 0;
if (dp[n][W] != -1)
return dp[n][W];
if (wt[n - 1] <= W) {
dp[n][W] = max(val[n - 1] + knapSack(wt, val, W - wt[n - 1], n - 1),
... | #include <bits/stdc++.h>
using namespace std;
long long int dp[101][100001];
long long int knapSack(int wt[], int val[], int W, int n) {
if (n == 0 || W == 0)
return 0;
if (dp[n][W] != -1)
return dp[n][W];
if (wt[n - 1] <= W) {
dp[n][W] = max(val[n - 1] + knapSack(wt, val, W - wt[n - 1], n - 1),
... | [
"variable_declaration.type.widen.change"
] | 966,400 | 966,401 | u545355464 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (ll i = 0; i < n; i++)
#define endl "\n"
#define of(i, n) for (ll i = n - 1; i >= 0; i--)
#define ll long long
#define vec vector<ll>
#define fio \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (ll i = 0; i < n; i++)
#define endl "\n"
#define of(i, n) for (ll i = n - 1; i >= 0; i--)
#define ll long long
#define vec vector<ll>
#define fio \
ios_base::sync_with_stdio(false); ... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 966,409 | 966,410 | u744956225 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
int N;
lo... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
int N;
lo... | [
"control_flow.branch.else.remove"
] | 966,426 | 966,427 | u731665172 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define endl '\n'
#define mod 998244353
#define inf 1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define endl '\n'
#define mod 998244353
#define inf 1... | [
"call.arguments.change"
] | 966,428 | 966,429 | u083831049 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define frst first
#define sec second
#define fast cin.tie(0), ios_base ::sync_with_stdio(0)
#define db double
#define mod 1000000007
void online_judge() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define frst first
#define sec second
#define fast cin.tie(0), ios_base ::sync_with_stdio(0)
#define db double
#define mod 1000000007
void online_judge() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.t... | [
"call.remove"
] | 966,435 | 966,436 | u723601567 | cpp |
p03163 | /*
╔═══╦═══╦═══╗
║╔═╗║╔══╩╗╔╗║
║║░║║╚══╗║║║║
║║░║║╔══╝║║║║
║╚═╝║╚══╦╝╚╝║
╚══╗╠═══╩═══╝
░░░╚╝░░░░░░░░
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s,... | /*
╔═══╦═══╦═══╗
║╔═╗║╔══╩╗╔╗║
║║░║║╚══╗║║║║
║║░║║╔══╝║║║║
║╚═╝║╚══╦╝╚╝║
╚══╗╠═══╩═══╝
░░░╚╝░░░░░░░░
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s,... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 966,437 | 966,438 | u288568295 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using vi = vector<int>;
using vll = vector<ll>;
ll fast_exp(ll base, ll e) {
ll r = 1;
while (e > 0) {
if (e % 2)
r = (r * base);
base = base * base;
e /= 2;
}
return r;
}
ll gcd(ll a, ll b) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using vi = vector<int>;
using vll = vector<ll>;
ll fast_exp(ll base, ll e) {
ll r = 1;
while (e > 0) {
if (e % 2)
r = (r * base);
base = base * base;
e /= 2;
}
return r;
}
ll gcd(ll a, ll b) {
... | [
"assignment.change"
] | 966,439 | 966,440 | u338222575 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using vi = vector<int>;
using vll = vector<ll>;
ll fast_exp(ll base, ll e) {
ll r = 1;
while (e > 0) {
if (e % 2)
r = (r * base);
base = base * base;
e /= 2;
}
return r;
}
ll gcd(ll a, ll b) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using vi = vector<int>;
using vll = vector<ll>;
ll fast_exp(ll base, ll e) {
ll r = 1;
while (e > 0) {
if (e % 2)
r = (r * base);
base = base * base;
e /= 2;
}
return r;
}
ll gcd(ll a, ll b) {
... | [
"assignment.change"
] | 966,441 | 966,440 | u338222575 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, mx = 0, m;
cin >> n;
cin >> m;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
cin >> b[i];
}
int dp[n + 1][m + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if (i == 0 || j == 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, mx = 0, m;
cin >> n;
cin >> m;
long long int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
cin >> b[i];
}
long long int dp[n + 1][m + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
... | [
"variable_declaration.type.widen.change"
] | 966,442 | 966,443 | u561103039 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long int mat[101][100001];
int main() {
#ifdef EVAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int N, W;
cin >> N >> W;
int val[N];
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i] >> val[i];
}
for (int i = p[0... | #include <bits/stdc++.h>
using namespace std;
long long int mat[101][100001];
int main() {
#ifdef EVAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int N, W;
cin >> N >> W;
int val[N];
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i] >> val[i];
}
for (int i = p[0... | [
"expression.operation.binary.remove"
] | 966,451 | 966,452 | u101297813 | cpp |
p03163 | #define ll long long int
#define fr(i, x, n) for (ll i = (ll)(x); i < (ll)(n); ++i)
#include <bits/stdc++.h>
// https://atcoder.jp/contests/dp/submissions/12796237
using namespace std;
int main() {
int N, W;
cin >> N;
cin >> W;
int arr1[N][2];
fr(i, 0, N) {
cin >> arr1[i][0];
cin >> arr1[i][1];
}
... | #define ll long long int
#define fr(i, x, n) for (ll i = (ll)(x); i < (ll)(n); ++i)
#include <bits/stdc++.h>
// https://atcoder.jp/contests/dp/submissions/12796237
using namespace std;
int main() {
ll N, W;
cin >> N;
cin >> W;
int arr1[N][2];
fr(i, 0, N) {
cin >> arr1[i][0];
cin >> arr1[i][1];
}
... | [
"variable_declaration.type.change"
] | 966,453 | 966,454 | u174584859 | cpp |
p03163 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
double PI = 3.14159265;
using namespace std;
using Graph = vector<vector<int>>;
using Field = vector<string>;
using DGraph = vector<vector<pair<int, int>>>;
const long long INF ... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
double PI = 3.14159265;
using namespace std;
using Graph = vector<vector<int>>;
using Field = vector<string>;
using DGraph = vector<vector<pair<int, int>>>;
const long long INF ... | [] | 966,455 | 966,456 | u116995735 | cpp |
p03163 | #include <iostream>
using namespace std;
int main() {
long n, W;
cin >> n;
cin >> W;
long val[n], wt[n], dp[n][W + 1];
for (long i = 0; i < n; i++) {
cin >> wt[i];
cin >> val[i];
}
for (long i = 0; i < n; i++) {
for (long w = 0; w <= W; w++) {
if (w == 0)
dp[i][w] = 0;
e... | #include <iostream>
using namespace std;
int main() {
long n, W;
cin >> n;
cin >> W;
long val[n], wt[n], dp[n][W + 1];
for (long i = 0; i < n; i++) {
cin >> wt[i];
cin >> val[i];
}
for (long i = 0; i < n; i++) {
for (long w = 0; w <= W; w++) {
if (w == 0)
dp[i][w] = 0;
e... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 966,457 | 966,458 | u519699168 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
vector<vector<ll>> adjlist;
ll max(ll x, ll y) { return (x > y) ? x : y; }
ll min(ll x, ll y) { return (x > y) ? y : x; }
#define sfor(a, n, i) for (ll i = a; i < n; i++)
#define rfor(n, a, i) for (ll i = n; i >= a; i--)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
vector<vector<ll>> adjlist;
ll max(ll x, ll y) { return (x > y) ? x : y; }
ll min(ll x, ll y) { return (x > y) ? y : x; }
#define sfor(a, n, i) for (ll i = a; i < n; i++)
#define rfor(n, a, i) for (ll i = n; i >= a; i--)
#d... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 966,462 | 966,463 | u448528861 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int N, W;
int v[110], w[110];
int dp[110][110000];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++)
cin >> w[i] >> ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int N, W;
int v[110], w[110];
ll dp[110][110000];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++)
cin >> w[i] >> v... | [
"variable_declaration.type.change"
] | 966,464 | 966,465 | u503228842 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
// ll dp[100001];
void knapsack(int n, ll *w, ll *v, int W) {
ll dp[n][W + 1];
for (int i = 0; i <= W; i++) {
if (i >= w[i]) {
dp[0][i] = v[0];
} else
dp[0][i] = 0;
// cout<<i<<dp[0][i]<<endl;
}
for (int i = 1; i <... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
// ll dp[100001];
void knapsack(int n, ll *w, ll *v, int W) {
ll dp[n][W + 1];
for (int i = 0; i <= W; i++) {
if (i >= w[0]) {
dp[0][i] = v[0];
} else
dp[0][i] = 0;
// cout<<i<<dp[0][i]<<endl;
}
for (int i = 1; i <... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 966,468 | 966,469 | u539406723 | cpp |
p03163 | #include <iostream>
using namespace std;
const int mxN = 1e5 + 5, mxM = 105;
int dp[mxM][mxN], w[mxM], v[mxM];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (j >= w[i])
dp[i][j] = ma... | #include <iostream>
using namespace std;
const int mxN = 1e5 + 5, mxM = 105;
long long dp[mxM][mxN], w[mxM], v[mxM];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (j >= w[i])
dp[i][j... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,474 | 966,475 | u106978087 | cpp |
p03163 | #include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n, W;
cin >> n >> W;
vector<ll> w(n), v(n);
vector<vector<ll>> dp(n, vector<ll>(W + 1, 0));
for (ll i = 0; i < n; i++)
cin >> w.at(i) >> v.at(i);
for (ll i = w.at(0); i < n; i++)
dp.at... | #include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n, W;
cin >> n >> W;
vector<ll> w(n), v(n);
vector<vector<ll>> dp(n, vector<ll>(W + 1, 0));
for (ll i = 0; i < n; i++)
cin >> w.at(i) >> v.at(i);
for (ll i = w.at(0); i < W + 1; i++)
d... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one"
] | 966,478 | 966,479 | u415370212 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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... | [
"call.arguments.change"
] | 966,481 | 966,482 | u809212443 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int N, W, weight[101], v[101], dp[101][100001];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> weight[i] >> v[i];
}
for (int w = 0; w <= W; w++)
dp[0][w] = 0;
for (int i = 0; i <= N; i++)
dp[i][0] = 0;
for (int i = 1; i <= N; i++)... | #include <bits/stdc++.h>
using namespace std;
int N, W, weight[101];
long long v[101], dp[101][100001];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> weight[i] >> v[i];
}
for (int w = 0; w <= W; w++)
dp[0][w] = 0;
for (int i = 0; i <= N; i++)
dp[i][0] = 0;
for (int i = 1; i ... | [
"io.output.newline.add"
] | 966,487 | 966,488 | u052165189 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define max(a, b) ((a > b) ? a : b)
int main() {
int n, w;
cin >> n >> w;
int cost, val;
vector<int> dp(w + 1, 0);
for (int i = 0; i < n; i++) {
cin >> cost >> val;
for (int cost_i = w; cost_i >= cost; cost_i--)
dp[cost_... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define max(a, b) ((a > b) ? a : b)
int main() {
int n, w;
cin >> n >> w;
int cost, val;
vector<ll> dp(w + 1, 0);
for (int i = 0; i < n; i++) {
cin >> cost >> val;
for (int cost_i = w; cost_i >= cost; cost_i--)
dp[cost_i... | [] | 966,494 | 966,495 | u157193081 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
typedef long long int lld;
typedef unsigned long long int llu;
using namespace std;
const int m = 1e9;
int main() {
int n, w, i;
cin >> n >> w;
int wt[n], v[n];
for (i = 0; i < n; i++)
cin >> wt[i] >> v... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
typedef long long int lld;
typedef unsigned long long int llu;
using namespace std;
const int m = 1e9;
int main() {
llu n, w, i;
cin >> n >> w;
llu wt[n], v[n];
for (i = 0; i < n; i++)
cin >> wt[i] >> v... | [
"variable_declaration.type.change"
] | 966,496 | 966,497 | u408298796 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
typedef long long int lld;
typedef unsigned long long int llu;
using namespace std;
const int m = 1e9;
int main() {
int n, w, i;
cin >> n >> w;
int wt[n], v[n];
for (i = 0; i < n; i++)
cin >> wt[i] >> v... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
typedef long long int lld;
typedef unsigned long long int llu;
using namespace std;
const int m = 1e9;
int main() {
int n, w, i;
cin >> n >> w;
int wt[n], v[n];
for (i = 0; i < n; i++)
cin >> wt[i] >> v... | [
"variable_declaration.type.change"
] | 966,496 | 966,498 | u408298796 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long a[1000 + 100][2], b[10 + 10000][10010] = {0};
long long sol(int n, int i, int j) {
if (i == n - 1) {
long long m = -8;
for (int t = 0; t < 3; t++) {
if (t != j)
m = max(m, a[i][t]);
}
return m;
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long a[1000 + 100][2], b[10 + 100][100000 + 100] = {0};
long long sol(int n, int i, int j) {
if (i == n - 1) {
long long m = -8;
for (int t = 0; t < 3; t++) {
if (t != j)
m = max(m, a[i][t]);
}
return m;... | [
"literal.number.change",
"expression.operation.binary.change"
] | 966,504 | 966,505 | u543080241 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
const int N = 100005;
void solve() {
int i, j, k, n, m, ans = 0, cnt = 0, sum = 0;
cin >> n >> m;
int w[n + 1], v[n + 1];
w[0] = v[0] ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
const int N = 100005;
void solve() {
int i, j, k, n, m, ans = 0, cnt = 0, sum = 0;
cin >> n >> m;
int w[n + 1], v[n + 1];
w[0] = v[0] ... | [
"control_flow.branch.if.add"
] | 966,522 | 966,523 | u064488844 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
long long dp[105][100005] = {};
int main() {
int n, weight;
cin >> n >> weight;
vector<int> W(n), V(n);
for (int i = 0; i < n; ++i)
cin >> W[i] >> V[i];
for (int i = 1; i <= n; ++i) {
for (int w = 1; w <= weight; ++w) {
if (w >= W[i])... | #include <iostream>
#include <vector>
using namespace std;
long long dp[105][100005] = {};
int main() {
int n, weight;
cin >> n >> weight;
vector<int> W(n + 1), V(n + 1);
for (int i = 1; i <= n; ++i)
cin >> W[i] >> V[i];
for (int i = 1; i <= n; ++i) {
for (int w = 1; w <= weight; ++w) {
if (w... | [
"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"
] | 966,526 | 966,527 | u706786134 | cpp |
p03163 | /**
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*/
#include <bits/stdc++.h>
#define ll long long
using namespace std;
long long gcd(long long a, long long b) { retu... | /**
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*/
#include <bits/stdc++.h>
#define ll long long
using namespace std;
long long gcd(long long a, long long b) { retu... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 966,542 | 966,543 | u220730975 | cpp |
p03163 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n, w;
cin >> n >> w;
ll weight[n], value[n];
for (int i = 0; i < n; i++) {
cin >> weight[i] >> value[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 =... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n, w;
cin >> n >> w;
ll weight[n], value[n];
for (int i = 0; i < n; i++) {
cin >> weight[i] >> value[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 =... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 966,561 | 966,562 | u051114039 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, cap;
cin >> n >> cap;
int w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
int dp[n... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, cap;
cin >> n >> cap;
int w[n], v[n];
for (ll i = 0; i < n; i++)
cin >> w[i] >> v[i];
ll dp[n + ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 966,563 | 966,564 | u051114039 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<int> weight(n);
vector<int> value(n);
for (int i = 0; i < n; i++)
cin >> weight[i] >> value[i];
vector<vector<int>> value_sum(n, vector<int>(w + 1));
for (int i = 0; i < n; i++) {
for (int j = 0; j <= w;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<int> weight(n);
vector<int> value(n);
for (int i = 0; i < n; i++)
cin >> weight[i] >> value[i];
vector<vector<int64_t>> value_sum(n, vector<int64_t>(w + 1));
for (int i = 0; i < n; i++) {
for (int j = 0;... | [
"variable_declaration.type.primitive.change"
] | 966,565 | 966,566 | u592961584 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
main() {
ll N;
ll W;
cin >> N >> W;
ll wt[N];
ll val[N];
for (ll i = 0; i < N; i++) {
cin >> wt[i] >> val[i];
}
ll dp[N + 1][W + 1];
for (ll i = 0; i < W; i++)
dp[0][i] = 0;
for (ll i = 0; i < N; i++) {
for (ll j = 0; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
main() {
ll N;
ll W;
cin >> N >> W;
ll wt[N];
ll val[N];
for (ll i = 0; i < N; i++) {
cin >> wt[i] >> val[i];
}
ll dp[N + 1][W + 1];
for (ll i = 0; i <= W; i++)
dp[0][i] = 0;
for (ll i = 0; i < N; i++) {
for (ll j = 0;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 966,581 | 966,582 | u934544507 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define m 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(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define m 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(... | [
"variable_declaration.type.change"
] | 966,583 | 966,584 | u987273922 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, n, m) for (int i = n; i < m; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
templ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, n, m) for (int i = n; i < m; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
templ... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 966,588 | 966,589 | u154148649 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
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 (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
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 (... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 966,592 | 966,593 | u989306199 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<ll>> dp(200, vector<ll>(1000000, -1));
ll ans(ll a[][2], ll w, ll i) {
if (dp[i][w] != -1)
return dp[i][w];
if (i == 0 || w == 0) {
dp[i][w] = 0;
return dp[i][w];
}
if (w - a[i - 1][0] >= 0) {
dp[i][w] =
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<ll>> dp(108, vector<ll>(100009, -1));
ll ans(ll a[][2], ll w, ll i) {
if (dp[i][w] != -1)
return dp[i][w];
if (i == 0 || w == 0) {
dp[i][w] = 0;
return dp[i][w];
}
if (w - a[i - 1][0] >= 0) {
dp[i][w] =
m... | [
"literal.number.change",
"call.arguments.change"
] | 966,596 | 966,597 | u951060638 | cpp |
p03163 | #include <climits>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int dp[101][100005] = {0};
int main() {
int n, W;
cin >> n >> W;
long long arr[n + 1][2];
for (int i = 1; i <= n; ++i) {
cin >> arr[i][0] >> arr[i][1];
}
for (int item = 1; item <= n; ++item) {
for (int ... | #include <climits>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
long long dp[101][100005] = {0};
int main() {
int n, W;
cin >> n >> W;
long long arr[n + 1][2];
for (int i = 1; i <= n; ++i) {
cin >> arr[i][0] >> arr[i][1];
}
for (int item = 1; item <= n; ++item) {
for... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,607 | 966,608 | u794871368 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int inf = 1ll << 30;
int main() {
int n, w;
ci... | #include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int inf = 1ll << 30;
int main() {
int n, w;
ci... | [
"literal.number.change",
"call.arguments.change"
] | 966,611 | 966,612 | u529089914 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int inf = 1ll << 30;
int main() {
int n, w;
ci... | #include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int inf = 1ll << 30;
int main() {
int n, w;
ci... | [] | 966,613 | 966,612 | u529089914 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int dp[101][100010];
int w[101], v[101];
int main() {
int n, W;
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
for (int j = 0; j <= W; j++) {
//容量不够
if (j < w[i]) {
dp[i][j] = dp[i - 1][j];
//容量足够
} else {... | #include <bits/stdc++.h>
using namespace std;
long dp[101][100010];
int w[101], v[101];
int main() {
int n, W;
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
for (int j = 0; j <= W; j++) {
//容量不够
if (j < w[i]) {
dp[i][j] = dp[i - 1][j];
//容量足够
} else ... | [
"variable_declaration.type.primitive.change"
] | 966,614 | 966,615 | u337802798 | cpp |
p03163 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define endl... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define endl... | [
"variable_declaration.value.change"
] | 966,616 | 966,617 | u021844224 | cpp |
p03163 | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define pb push_back
#define mp make_pair
#define ll long long
#define pr pair<int, int>
#define vpr vector<pr>
#define vi std... | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define pb push_back
#define mp make_pair
#define ll long long
#define pr pair<int, int>
#define vpr vector<pr>
#define vi std... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 966,618 | 966,619 | u526278960 | cpp |
p03163 | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
const int Inf = (int)2e9 + 5;
const ll Lnf = (ll)2e18 + 5;
const int N = 4e5 + 5;
int solve() {
int n, w;
cin >> n >> w;
int val[n + 1], wt[n + 1];
/*... | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
const int Inf = (int)2e9 + 5;
const ll Lnf = (ll)2e18 + 5;
const int N = 4e5 + 5;
int solve() {
ll n, w;
cin >> n >> w;
ll val[n + 1], wt[n + 1];
/*fo... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 966,620 | 966,621 | u526278960 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, w;
cin >> n >> w;
ll wt[n];
ll val[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
ll dp[n + 1][w + 1];
for (int i = 0; i < n + 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, w;
cin >> n >> w;
ll wt[n];
ll val[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
ll dp[n + 1][w + 1];
for (int i = 0; i < n + 1; i++) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 966,624 | 966,625 | u507641224 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using G = vector<vector<int>>;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using G = vector<vector<int>>;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;... | [
"literal.number.change",
"call.arguments.change"
] | 966,633 | 966,634 | u106635407 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 1e2 + 10, Maxw = 1e5 + 10;
int N, W;
int w[Maxn], v[Maxn];
int Dp[Maxn][Maxw];
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 = 0; j <= W; j++) {
Dp[i][j] = Dp[i - 1]... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int Maxn = 1e2 + 10, Maxw = 1e5 + 10;
int N, W;
int w[Maxn], v[Maxn];
int Dp[Maxn][Maxw];
signed 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 = 0; j <= W; j++) {
... | [
"variable_declaration.type.primitive.change"
] | 966,643 | 966,644 | u701136990 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N), v(N);
vector<vector<int>> dp(N + 1, vector<int>(W + 1));
for (int i = 0; i < N; i++) {
cin >> w.at(i) >> v.at(i);
}
dp[0][0] = 0;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N), v(N);
vector<vector<long long int>> dp(N + 1, vector<long long int>(W + 1, 0));
for (int i = 0; i < N; i++) {
cin >> w.at(i) >> v.at(i);
}
dp[0][0] = 0;
for (int i ... | [
"call.arguments.add"
] | 966,645 | 966,646 | u113960459 | cpp |
p03163 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n), v(n);
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
vector<vector<long>> M(W, vector<long>(n));
for (int i = 0; i < W; i++) {
if (i > w[0]) {
M[i][0] = v[0];... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n), v(n);
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
vector<vector<long>> M(W, vector<long>(n));
for (int i = 0; i < W; i++) {
if (i + 1 >= w[0]) {
M[i][0] = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 966,647 | 966,648 | u806417535 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
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;
}
typedef long long ll;
#... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
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;
}
typedef long long ll;
#... | [
"variable_declaration.type.change"
] | 966,655 | 966,656 | u614875193 | cpp |
p03163 | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | [
"control_flow.branch.else.remove"
] | 966,657 | 966,658 | u407213771 | cpp |
p03163 | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | [
"call.arguments.change",
"control_flow.branch.else.remove"
] | 966,659 | 966,658 | u407213771 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <utility> //swapでaとbの値を入れ替える
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define Yes(a) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <utility> //swapでaとbの値を入れ替える
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define Yes(a) ... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 966,660 | 966,661 | u407213771 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
const int INF = 1001001001;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, W;
cin >> n >> W;
vector<int> w(n + 1), v(n + 1);
rep(i, n) cin >> w[i + 1] >> v[i + 1];
vector... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
const int INF = 1001001001;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, W;
cin >> n >> W;
vector<int> w(n + 1), v(n + 1);
rep(i, n) cin >> w[i + 1] >> v[i + 1];
vector... | [
"call.arguments.change"
] | 966,662 | 966,663 | u026421211 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
struct edge {
int to;
};
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
struct edge {
int to;
};
... | [
"literal.number.change",
"call.arguments.change"
] | 966,664 | 966,665 | u092269433 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
struct edge {
int to;
};
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
struct edge {
int to;
};
... | [
"literal.number.change",
"call.arguments.change"
] | 966,666 | 966,665 | u092269433 | cpp |
p03163 | // Om Sree Sai Ram
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
using namespace std;
vector<int> dp;
int main() {
int n, W;
cin >> n >> W;
vector<int> dp(W + 1);
// dp[i] represents maximum value obtained with exactly i amount of weight
// j means weight already there in the knapsack
dp... | // Om Sree Sai Ram
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
using namespace std;
vector<int> dp;
int main() {
int n, W;
cin >> n >> W;
vector<long long> dp(W + 1);
// dp[i] represents maximum value obtained with exactly i amount of weight
// j means weight already there in the knapsac... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 966,673 | 966,674 | u279912110 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define fastt \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define enl "\n"
#define ll long long
#define pb push_back
#define fi first
#define se second
#... | #include <bits/stdc++.h>
using namespace std;
#define fastt \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define enl "\n"
#define ll long long
#define pb push_back
#define fi first
#define se second
#... | [
"assignment.change"
] | 966,679 | 966,680 | u064688560 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int my_max(int a, int b) { return a > b ? a : b; }
int my_abs(int x) { return x < 0 ? -x : x; }
unsigned long long dp[110][100010];
int main() {
int n, w;
int datas[100][2];
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> datas[i][0] >> datas[i][1];
... | #include <bits/stdc++.h>
using namespace std;
int my_max(int a, int b) { return a > b ? a : b; }
int my_abs(int x) { return x < 0 ? -x : x; }
unsigned long long dp[110][100010];
int main() {
int n, w;
int datas[100][2];
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> datas[i][0] >> datas[i][1];
... | [
"expression.operation.binary.remove"
] | 966,681 | 966,682 | u341846697 | cpp |
p03163 | #include <bits/stdc++.h>
#define INP (a << 50)
using namespace std;
int main() {
int a, b, c, i, j;
cin >> a >> b;
int s[a + 5], ss[a + 5];
long long int sss[a + 5][a + 5];
for (i = 1; i <= a; i++) {
cin >> s[i] >> ss[i];
}
memset(sss, 0, sizeof(sss));
for (i = 1; i <= a; i++) {
for (j = 1; j <=... | #include <bits/stdc++.h>
#define INP (a << 50)
using namespace std;
int main() {
int a, b, c, i, j;
cin >> a >> b;
int s[a + 5], ss[b + 5];
long long int sss[a + 5][b + 5];
for (i = 1; i <= a; i++) {
cin >> s[i] >> ss[i];
}
memset(sss, 0, sizeof(sss));
for (i = 1; i <= a; i++) {
for (j = 1; j <=... | [
"identifier.change",
"expression.operation.binary.change"
] | 966,683 | 966,684 | u711204934 | cpp |
p03163 | #include <bits/stdc++.h>
#define INP (a << 50)
using namespace std;
int main() {
int a, b, c, i, j;
cin >> a >> b;
int s[a + 5], ss[b + 5];
long long int sss[a + 5][a + 5];
for (i = 1; i <= a; i++) {
cin >> s[i] >> ss[i];
}
memset(sss, 0, sizeof(sss));
for (i = 1; i <= a; i++) {
for (j = 1; j <=... | #include <bits/stdc++.h>
#define INP (a << 50)
using namespace std;
int main() {
int a, b, c, i, j;
cin >> a >> b;
int s[a + 5], ss[b + 5];
long long int sss[a + 5][b + 5];
for (i = 1; i <= a; i++) {
cin >> s[i] >> ss[i];
}
memset(sss, 0, sizeof(sss));
for (i = 1; i <= a; i++) {
for (j = 1; j <=... | [
"identifier.change",
"expression.operation.binary.change"
] | 966,685 | 966,684 | u711204934 | cpp |
p03163 | #include <bits/stdc++.h>
#define INP (a << 50)
using namespace std;
int main() {
int a, b, c, i, j;
cin >> a >> b;
int s[a + 1], ss[b + 1];
long long int sss[a + 5][a + 5];
for (i = 1; i <= a; i++) {
cin >> s[i] >> ss[i];
}
memset(sss, 0, sizeof(sss));
for (i = 1; i <= a; i++) {
for (j = 1; j <=... | #include <bits/stdc++.h>
#define INP (a << 50)
using namespace std;
int main() {
int a, b, c, i, j;
cin >> a >> b;
int s[a + 5], ss[b + 5];
long long int sss[a + 5][b + 5];
for (i = 1; i <= a; i++) {
cin >> s[i] >> ss[i];
}
memset(sss, 0, sizeof(sss));
for (i = 1; i <= a; i++) {
for (j = 1; j <=... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change"
] | 966,686 | 966,684 | u711204934 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int N, W;
cin >> N >> W;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int N, W;
cin >> N >> W;
... | [
"call.arguments.change"
] | 966,689 | 966,690 | u455067221 | cpp |
p03163 | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a... | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a... | [
"variable_declaration.type.change"
] | 966,695 | 966,696 | u850140043 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
//#define ll long long
long long int dp[10005][10005];
// int val[100005];
// int wt[100005];
long long int fun(long long int w, long long int n, long long int val[],
long long int wt[]) {
if (w == 0 || n == 0)
return 0;
if (wt[n - 1] > w)
ret... | #include <bits/stdc++.h>
using namespace std;
//#define ll long long
long long int dp[100005][105];
// int val[100005];
// int wt[100005];
long long int fun(long long int w, long long int n, long long int val[],
long long int wt[]) {
if (w == 0 || n == 0)
return 0;
if (wt[n - 1] > w)
retu... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 966,702 | 966,703 | u901562101 | cpp |
p03163 | //
// Created by 13783 on 2020/4/2.
//
#include <iostream>
using namespace std;
const int MAX_N = 101;
const int MAX_W = 1e5 + 2;
int N, W;
int w[MAX_N];
int v[MAX_N];
int dp[MAX_N][MAX_W];
void solve() {
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= W; j++) {
if (j >= w[i]) {
dp[i][j] = max(d... | //
// Created by 13783 on 2020/4/2.
//
#include <iostream>
using namespace std;
const int MAX_N = 101;
const int MAX_W = 1e5 + 2;
typedef long long ll;
int N, W;
int w[MAX_N];
int v[MAX_N];
ll dp[MAX_N][MAX_W];
void solve() {
// dp[i][j]为前i种物品，总总量为j的最大价值
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= W; j+... | [
"variable_declaration.type.change"
] | 966,704 | 966,705 | u524496896 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define endl "\n"
int main() {
int n, w;
cin >> n >> w;
vector<int> val(n), wt(n);
for (int i = 0; i < n; i++)
cin >> wt[i] >> val[i];
vector<vector<int>> dp(n + 1, vector<int>(w + 1, 0));
for (int i = 1; i <= n; i++) {
fo... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
int32_t main() {
int n, w;
cin >> n >> w;
vector<int> val(n), wt(n);
for (int i = 0; i < n; i++)
cin >> wt[i] >> val[i];
vector<vector<int>> dp(n + 1, vector<int>(w + 1, 0));
for (int i = 1; i <= n; i++) {
... | [
"identifier.change",
"function.return_type.change"
] | 966,711 | 966,712 | u453089097 | cpp |
p03163 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stri... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stri... | [
"identifier.change",
"expression.operation.binary.change"
] | 966,715 | 966,716 | u018713014 | cpp |
p03163 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stri... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stri... | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 966,717 | 966,716 | u018713014 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll vs[10010][2];
ll dp[10010][10010];
void solve() {
int N, W;
cin >> N >> W;
for (ll i = 1; i <= N; ++i)
cin >> vs[i][0] >> vs[i][1];
for (ll i = 0; i <= W; ++i)
dp[0][i] = 0;
for (ll i = 0; i <= N; ++i)
dp[i][0] = 0;
for (ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll vs[110][2];
ll dp[110][100100];
void solve() {
int N, W;
cin >> N >> W;
for (ll i = 1; i <= N; ++i)
cin >> vs[i][0] >> vs[i][1];
for (ll i = 0; i <= W; ++i)
dp[0][i] = 0;
for (ll i = 0; i <= N; ++i)
dp[i][0] = 0;
for (ll i ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 966,718 | 966,719 | u740626584 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long int dp[109][100009];
int ansd(long long int value[], int wts[], int n, int max_wt) {
for (int i = 1; i < n + 1; i++) {
for (int j = 0; j < max_wt + 1; j++) {
if (j >= wts[i - 1])
dp[i][j] = max(dp[i - 1][j - wts[i - 1]] + value[i - 1], dp[i - ... | //#FINALLY its gonna be A.C>
#include <bits/stdc++.h>
using namespace std;
long long int dp[109][100009];
long long int ansd(long long int value[], int wts[], int n, int max_wt) {
for (int i = 1; i < n + 1; i++) {
for (int j = 0; j < max_wt + 1; j++) {
if (j >= wts[i - 1])
dp[i][j] = max(dp[i - 1]... | [
"variable_declaration.type.widen.change"
] | 966,723 | 966,724 | u697345261 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long int dp[109][100009];
int ansd(long long int value[], int wts[], int n, int max_wt) {
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < max_wt + 1; j++) {
if (j >= wts[i - 1])
dp[i][j] = max(dp[i - 1][j - wts[i - 1]] + value[i - 1], dp[i - ... | //#FINALLY its gonna be A.C>
#include <bits/stdc++.h>
using namespace std;
long long int dp[109][100009];
long long int ansd(long long int value[], int wts[], int n, int max_wt) {
for (int i = 1; i < n + 1; i++) {
for (int j = 0; j < max_wt + 1; j++) {
if (j >= wts[i - 1])
dp[i][j] = max(dp[i - 1]... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 966,725 | 966,724 | u697345261 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define ll long long
ll dp[101][100000];
int solve(int i, int W, int *w, int *v, int n) {
if (W < 0)
return INT_MIN;
if (i == n)
return 0;
if (dp[... | #include <algorithm>
#include <climits>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define ll long long
ll dp[101][100000];
ll solve(int i, int W, ll int *w, ll int *v, int n) {
if (W < 0)
return INT_MIN;
if (i == n)
return 0;
if... | [
"function.parameters.parameter.add",
"variable_declaration.type.change"
] | 966,730 | 966,731 | u634851584 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 101;
const int maxw = 1e5 + 1;
ll w[maxn], v[maxn], dp[4][9];
int main() {
#ifdef LOCAL
freopen("data.txt", "r", stdin);
#endif
ll n, W;
scanf("%lld%lld", &n, &W);
for (int i = 1; i <= n; ++i)
scanf("%lld%lld", &w[i], &v[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 101;
const int maxw = 1e5 + 1;
ll w[maxn], v[maxn], dp[maxn][maxw];
int main() {
#ifdef LOCAL
freopen("data.txt", "r", stdin);
#endif
ll n, W;
scanf("%lld%lld", &n, &W);
for (int i = 1; i <= n; ++i)
scanf("%lld%lld", &w[i... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 966,747 | 966,748 | u822306583 | cpp |
p03163 | #include <algorithm>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>... | #include <algorithm>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>... | [
"expression.operation.binary.add"
] | 966,749 | 966,750 | u878735274 | cpp |
p03163 | #include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define ll long long
using namespace std;
int dp[100002][3];
int main() {
int n, m;
cin >> n >> m;
int val[n], wt[n];
for (int i = 0; i < n; i++)
cin >> wt[i] >> val[i];
int i, w;
int K[n + 1][m + 1];
// Build table K[][... | #include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define ll long long
using namespace std;
int dp[100002][3];
int main() {
int n, m;
cin >> n >> m;
ll val[n], wt[n];
for (int i = 0; i < n; i++)
cin >> wt[i] >> val[i];
int i, w;
ll K[n + 1][m + 1];
// Build table K[][] ... | [
"variable_declaration.type.change"
] | 966,751 | 966,752 | u537150014 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define si size()
#define bk back()
#define popb pop_back()
#define fastio \
ios_base::sync_with_stdio(false);... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define si size()
#define bk back()
#define popb pop_back()
#define fastio \
ios_base::sync_with_stdio(false);... | [
"variable_declaration.type.change"
] | 966,753 | 966,754 | u397955542 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int abs(int i, int j) {
if (i - j > 0) {
return i - j;
} else {
return j - i;
}
}
int main() {
int N, W;
cin >> N >> W;
vector<int> dp(W + 1);
rep(i, N) {
int weight, value;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int abs(int i, int j) {
if (i - j > 0) {
return i - j;
} else {
return j - i;
}
}
int main() {
int N, W;
cin >> N >> W;
vector<ll> dp(W + 1);
rep(i, N) {
int weight, value;
... | [] | 966,763 | 966,764 | u065715253 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N);
vector<long long> v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<long long>> dp(N + 1, vector<long long>(W, 0));
for (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<long long> w(N);
vector<long long> v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<long long>> dp(N + 1, vector<long long>(W + 1, 0))... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 966,765 | 966,766 | u213532807 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int n, W;
cin >> n >> W;
ll dp[W + 1];
rep(i, n) {
ll w, v;
cin >> w >> v;
for (int j = W; j >= w; j--) {
dp[j] = max(dp[j - w] + v, dp[j]);
}
}
cout << dp[W]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int n, W;
cin >> n >> W;
ll dp[200005];
rep(i, n) {
ll w, v;
cin >> w >> v;
for (int j = W; j >= w; j--) {
dp[j] = max(dp[j - w] + v, dp[j]);
}
}
cout << dp[W... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 966,780 | 966,781 | u314917898 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.