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 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define omajinai \
ios::sync_with_stdio(false); ... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define omajinai \
ios::sync_with_stdio(false); ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 967,748 | 967,749 | u884476319 | cpp |
p03163 |
#include <bits/stdc++.h>
#include <iostream>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define ll long long
#define li long int
#define pp pair<int, int>
#define lb lower_bound
#defin... |
#include <bits/stdc++.h>
#include <iostream>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define ll long long
#define li long int
#define pp pair<int, int>
#define lb lower_bound
#defin... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 967,756 | 967,757 | u350009995 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mxn 100005
#define mp make_pair
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef long long int ll;
int main... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mxn 100005
#define mp make_pair
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef long long int ll;
int main... | [
"variable_declaration.type.change"
] | 967,762 | 967,763 | u737257203 | 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;
vector<int> weight(n), value(n);
rep(i, n) cin >> weight[i] >> value[i];
vector<vector<int>> dp(n + 1, vector<int>(w + 1));
for (int i = 0; i < n; i++) {... | #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;
vector<int> weight(n), value(n);
rep(i, n) cin >> weight[i] >> value[i];
vector<vector<ll>> dp(n + 1, vector<ll>(w + 1));
for (int i = 0; i < n; i++) {
... | [
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 967,766 | 967,765 | u883680855 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (long long i = 0; i < n; i++)
#define sc(x) cin >> x
#define pr(x) cout << x << endl;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x)... | #include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (long long i = 0; i < n; i++)
#define sc(x) cin >> x
#define pr(x) cout << x << endl;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x)... | [
"variable_declaration.type.change"
] | 967,769 | 967,770 | u895928005 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, string> PIS;
typedef vector<int> vec;
typedef priority_queue<int> PQ;
#define endl '\n'
#define pi 3.141592653589793
#define pb push_back
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, string> PIS;
typedef vector<int> vec;
typedef priority_queue<int> PQ;
#define endl '\n'
#define pi 3.141592653589793
#define pb push_back
#d... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 967,773 | 967,774 | u829019938 | cpp |
p03163 | /*
@uthor: Amit Kumar
user -->GitHub: drviruses ; CodeChef: dr_virus_ ;
Codeforces,AtCoder,Hackerearth,Hakerrank: dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
//#include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
//... | /*
@uthor: Amit Kumar
user -->GitHub: drviruses ; CodeChef: dr_virus_ ;
Codeforces,AtCoder,Hackerearth,Hakerrank: dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
//#include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
//... | [
"expression.operation.binary.remove"
] | 967,779 | 967,780 | u894812250 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
main() {
int n, we;
cin >> n >> we;
int w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
ll dp[n + 1][we + 1] = {0};
for (int i = 1; i < n + 1; i++) {
for (int i2 = 1; i2 < we + 1; i2++) {
if (i2 < w[i - 1]) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
main() {
int n, we;
cin >> n >> we;
int w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
ll dp[n + 1][we + 1] = {};
for (int i = 1; i < n + 1; i++) {
for (int i2 = 1; i2 < we + 1; i2++) {
if (i2 < w[i - 1]) {
... | [] | 967,785 | 967,786 | u160321725 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int fact(int x) {
if (x == 1)
return 1;
return x * fact(x - 1);
} //(x) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int fact(int x) {
if (x == 1)
return 1;
return x * fact(x - 1);
} //(x) ... | [] | 967,787 | 967,788 | u160321725 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define deb(x) cout << #x << " = " << x << "\n";
void solve() {
int n, w;
cin >> n >> w;
int val[n + 1], wt[n + 1];
for (int i = 0; i < n; i++)
cin >> wt[i] >> val[i];
int dp[w + 1];
fill(dp, dp + w + 1, 0);
for (int i = 0; i < n;... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define deb(x) cout << #x << " = " << x << "\n";
void solve() {
int n, w;
cin >> n >> w;
int val[n + 1], wt[n + 1];
for (int i = 0; i < n; i++)
cin >> wt[i] >> val[i];
int dp[w + 1];
fill(dp, dp + w + 1, 0);
for (int i = 0; i < n; ... | [] | 967,791 | 967,792 | u193862001 | cpp |
p03163 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define sz(x) ll(x.size())
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ll n, W, ans = 0;
cin >> n >> W;
vector<ve... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define sz(x) ll(x.size())
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ll n, W, ans = 0;
cin >> n >> W;
vector<ve... | [
"control_flow.branch.else.remove"
] | 967,798 | 967,799 | u059207724 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
long long int N, D;
vector<long long int> W;
vector<long long int> V;
int main() {
cin >> N >> D;
W.assign(N, 0);
V.assign(N, 0);
for (int i = 0; i < N; i++) {
cin >> W[i] >> V[i];
}
vector<vector<long long int>> dp(N + 1, vector<long long int>(... | #include <iostream>
#include <vector>
using namespace std;
long long int N, D;
vector<long long int> W;
vector<long long int> V;
int main() {
cin >> N >> D;
W.assign(N, 0);
V.assign(N, 0);
for (int i = 0; i < N; i++) {
cin >> W[i] >> V[i];
}
vector<vector<long long int>> dp(N + 1, vector<long long int>(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 967,826 | 967,827 | u226528610 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int N = 105, W = 100005;
int n, g;
int w, val, d[W];
int main() {
cin >> n >> g;
for (int i = 1; i <= n; i++) {
cin >> w >> val;
for (int j = g; j >= w; j--)
d[j] = max(d[j], d[j - w] + val);
}
cout << d[g];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 105, W = 100005;
int n, g;
int w, val;
long long d[W];
int main() {
cin >> n >> g;
for (int i = 1; i <= n; i++) {
cin >> w >> val;
for (int j = g; j >= w; j--)
d[j] = max(d[j], d[j - w] + val);
}
cout << d[g];
return 0;
} | [
"variable_declaration.type.widen.change"
] | 967,829 | 967,830 | u843952236 | cpp |
p03163 | #include <bits/stdc++.h>
#define NMAX 100001
using namespace std;
int N, W, v, w, maxx;
int a[NMAX];
int main() {
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> w >> v;
for (int j = W - w; j >= 0; j--) {
if (a[j] || !j) {
a[j + w] = max(a[j + w], a[j] + v);
maxx = max(a[j + w],... | #include <bits/stdc++.h>
#define NMAX 100001
using namespace std;
long long N, W, v, w, maxx;
long long a[NMAX];
int main() {
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> w >> v;
for (int j = W - w; j >= 0; j--) {
if (a[j] || !j) {
a[j + w] = max(a[j + w], a[j] + v);
maxx = m... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,834 | 967,835 | u988262055 | cpp |
p03163 | #include <iostream>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int w[n];
int v[n];
int dp[W + 1];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= W; i++)
dp[i] = 0;
for (int i = 0; i < n; i++) {
for (int j = W; j >= w[i]; j--) {
dp[j] = max(dp[j],... | #include <iostream>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int w[n];
long v[n];
long dp[W + 1];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= W; i++)
dp[i] = 0;
for (int i = 0; i < n; i++) {
for (int j = W; j >= w[i]; j--) {
dp[j] = max(dp[j... | [
"variable_declaration.type.primitive.change"
] | 967,840 | 967,841 | u314470965 | cpp |
p03163 | #define _USE_MATH_DEFINES
#define rep(i, n) for (int i = 0; i < n; i++)
#define repx(i, a, n) for (int i = a; i < n; i++)
#define loop while (1)
#define lli long long int
#define aryout(ary) \
rep(i, ary.size()) cout << ary[i] << (i < ary.size() - 1 ? " " : ... | #define _USE_MATH_DEFINES
#define rep(i, n) for (int i = 0; i < n; i++)
#define repx(i, a, n) for (int i = a; i < n; i++)
#define loop while (1)
#define lli long long int
#define aryout(ary) \
rep(i, ary.size()) cout << ary[i] << (i < ary.size() - 1 ? " " : ... | [
"call.arguments.change",
"variable_declaration.type.change"
] | 967,856 | 967,857 | u785521224 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
int main() {
int n, W;
cin >> n >> W;
int v[n + 1], w[n + 1];
rep(i, 1, n) { cin >> w[i] >> v[i]; }
vector<vector<int>> dp(n + 1, vector<int>(W + 1, 0));
rep(i, 1, W) {
rep(j, 1, n) {
dp[j][i] = dp[j -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
int main() {
int n, W;
cin >> n >> W;
long long int v[n + 1], w[n + 1];
rep(i, 1, n) { cin >> w[i] >> v[i]; }
vector<vector<long long int>> dp(n + 1, vector<long long int>(W + 1, 0));
rep(i, 1, W) {
rep(j, 1... | [
"variable_declaration.type.widen.change"
] | 967,860 | 967,861 | u650022504 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int knapsack(long long int W, long long int wt[], long long int val[],
long long int n) {
long long int i, w;
long long int k[n + 1][W + 1] = {0};
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
k[i][w] = 0;... | #include <bits/stdc++.h>
using namespace std;
long long int knapsack(long long int W, long long int wt[], long long int val[],
long long int n) {
long long int i, w;
long long int k[n + 1][W + 1] = {0};
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
... | [
"variable_declaration.type.widen.change"
] | 967,862 | 967,863 | u135798926 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
/*
long long int knapsack(long long int W, long long int wt[], long long int val[],
long long int n)
{
long long int i, w;
long long int k[n+1][W+1] = {0};
for (i = 0; i <= n; i++)
{
for (w = 0; w <= W; w++)
{
if (i==0 || w==0)
... | #include <bits/stdc++.h>
using namespace std;
long long int knapsack(long long int W, long long int wt[], long long int val[],
long long int n) {
long long int i, w;
long long int k[n + 1][W + 1] = {0};
for (i = 0; i <= n; i++) {
for (w = 0; w <= W; w++) {
if (i == 0 || w == 0)
... | [
"variable_declaration.type.widen.change"
] | 967,864 | 967,863 | u135798926 | cpp |
p03163 | #include <algorithm>
#include <cmath> // sqrt
#include <iostream>
#include <map>
#include <numeric> // accumulate
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1000000010;
int dp[110][100010];
int main() {
int N, W;
cin >> N >> W;
for (int i = 0... | #include <algorithm>
#include <cmath> // sqrt
#include <iostream>
#include <map>
#include <numeric> // accumulate
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1000000010;
ll dp[110][100010];
int main() {
int N, W;
cin >> N >> W;
for (int i = 0;... | [
"variable_declaration.type.change"
] | 967,865 | 967,866 | u270681687 | cpp |
p03163 | #include <iostream>
#include <limits>
using namespace std;
struct item {
int w;
int v;
};
int findMin(item items[], int n, int w) {
int cost[n + 1][w + 1];
for (int i = 0; i < n; i++)
cost[i][0] = 0;
for (int i = 0; i <= w; i++)
cost[0][i] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j... | #include <iostream>
#include <limits>
using namespace std;
struct item {
int w;
int v;
};
long long int findMin(item items[], int n, int w) {
long long int cost[n + 1][w + 1];
for (int i = 0; i < n; i++)
cost[i][0] = 0;
for (int i = 0; i <= w; i++)
cost[0][i] = 0;
for (int i = 1; i <= n; i++) {
... | [
"variable_declaration.type.widen.change"
] | 967,892 | 967,893 | u460700503 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long n, w;
long long wr[10005], ar[10005];
long long mem[10005][10005];
long long solve(long long ind, long long curw) {
if (ind == n) {
return 0;
}
if (mem[ind][curw] != -1) {
return mem[ind][curw];
}
long long ch1 = solve(ind + 1, curw), ch2 = 0;
... | #include <bits/stdc++.h>
using namespace std;
long long n, w;
long long wr[105], ar[105];
long long mem[105][100005];
long long solve(long long ind, long long curw) {
if (ind == n) {
return 0;
}
if (mem[ind][curw] != -1) {
return mem[ind][curw];
}
long long ch1 = solve(ind + 1, curw), ch2 = 0;
if ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 967,909 | 967,908 | u288989709 | cpp |
p03163 | #include <iostream>
using namespace std;
typedef long long ll;
ll max(ll a, ll b) { return a > b ? a : b; }
int N, W;
int main(void) {
// Your code here!
cin >> N >> W;
ll w[N];
ll v[N];
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
ll dp[N + 1][W + 1];
dp[0][0] = 0;
for (int i = 1; i ... | #include <iostream>
using namespace std;
typedef long long ll;
ll max(ll a, ll b) { return a > b ? a : b; }
int N, W;
int main(void) {
// Your code here!
cin >> N >> W;
ll w[N];
ll v[N];
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
ll dp[N + 1][W + 1];
dp[0][0] = 0;
for (int i = 0; i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 967,911 | 967,912 | u279137361 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod 1... | #include <bits/stdc++.h>
#define ll long long
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod 1... | [
"variable_declaration.type.change"
] | 967,917 | 967,918 | u703899606 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<i... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<i... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 967,919 | 967,920 | u052025289 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tu... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tu... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 967,921 | 967,922 | u155416173 | cpp |
p03163 | // Example program
#include <bits/stdc++.h>
using namespace std;
int n, w, a, b, value;
int dp[101][100009];
vector<int> wt(101, 0);
vector<int> val(101, 0);
// vector<int> ans(100009,-1);
// set<int> raand;
int main() {
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> a >> b;
wt[i] = a;
val[i] = b... | // Example program
#include <bits/stdc++.h>
using namespace std;
int n, w, a, b, value;
long long int dp[101][100009];
vector<long long int> wt(101, 0);
vector<long long int> val(101, 0);
// vector<int> ans(100009,-1);
// set<int> raand;
int main() {
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> a >> b;... | [
"variable_declaration.type.widen.change"
] | 967,931 | 967,932 | u674113611 | cpp |
p03163 | //
// | | | ,---. o |
//,---.,---.,---.,---.|---.|__/ ,---.,---.,---.' ,---.
//`---.,---..,---.,---.,---.|---
//|---'| || | || || \ ,---|| |,---| `---. || ||| ||
//||---'|
//`---'|---'`---'` '` '` ``---^|---'`---^ `---' `---'`
//'`|-... | //
// | | | ,---. o |
//,---.,---.,---.,---.|---.|__/ ,---.,---.,---.' ,---.
//`---.,---..,---.,---.,---.|---
//|---'| || | || || \ ,---|| |,---| `---. || ||| ||
//||---'|
//`---'|---'`---'` '` '` ``---^|---'`---^ `---' `---'`
//'`|-... | [
"variable_declaration.type.change"
] | 967,935 | 967,936 | u058612320 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long memo[10005][10005];
long long w[1005], v[1005];
long long sum, pos;
long long N, W;
long long knap(long long pos, long long sum) {
if (memo[pos][sum] != -1)
return memo[pos][sum];
if (pos == N) {
return 0;
} else if (sum + w[pos] > W) {
return me... | #include <bits/stdc++.h>
using namespace std;
long long memo[105][100005];
long long w[105], v[105];
long long sum, pos;
long long N, W;
long long knap(long long pos, long long sum) {
if (memo[pos][sum] != -1)
return memo[pos][sum];
if (pos == N) {
return 0;
} else if (sum + w[pos] > W) {
return memo[... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 967,946 | 967,947 | u935028161 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
#define MAX_N 100
#define MAX_W 100000
int dp[MAX_N + 1][MAX_W + 1];
signed main() {
int ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
#define MAX_N 100
#define MAX_W 100000
ll dp[MAX_N + 1][MAX_W + 1];
signed main() {
int N... | [
"variable_declaration.type.change"
] | 967,948 | 967,949 | u366398972 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL i, j, k, l, m, n, w;
cin >> n >> w;
LL cost[n + 10], wt[n + 10];
LL dp[n + 10][w + 10];
memset(dp, 0, sizeof dp);
for (i = 1; i <= n; i++)
cin >> wt[i] >> cost[i];
for (i = 1; i <= n; i++) {
for (j = 1; j <= w;... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL i, j, k, l, m, n, w;
cin >> n >> w;
LL cost[n + 10], wt[n + 10];
LL dp[n + 10][w + 10];
memset(dp, 0, sizeof dp);
for (i = 1; i <= n; i++)
cin >> wt[i] >> cost[i];
for (i = 1; i <= n; i++) {
for (j = 1; j <= w;... | [] | 967,952 | 967,953 | u313897800 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, W;
cin >> n >> W;
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
int dp[n + 1][W + 1];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; ++i) ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, W;
cin >> n >> W;
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
int dp[n + 1][W + 1];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; ++i)... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 967,954 | 967,955 | u006970274 | cpp |
p03163 | using namespace std;
#include <iostream>
#include <vector>
int N, M;
int ans = 1;
const int maxW = 100001;
const int maxN = 101;
long DP[maxW][maxN];
long w[maxN];
long v[maxN];
int main() {
int N, W;
int a, b;
cin >> N >> W;
for (int i = 1; i < N; i++) {
cin >> a >> b;
w[i] = a;
v[i] = b;
}
f... | using namespace std;
#include <iostream>
#include <vector>
int N, M;
int ans = 1;
const int maxW = 100001;
const int maxN = 101;
long DP[maxW][maxN];
long w[maxN];
long v[maxN];
int main() {
int N, W;
int a, b;
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> a >> b;
w[i] = a;
v[i] = b;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 967,963 | 967,964 | u068692021 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long dp[123][123456];
int main() {
int N;
int W;
cin >> N >> W;
vector<int> w(N);
vector<long long> v(N);
memset(dp, -1, sizeof dp);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
dp[0][w[0]] = v[0];
for (int i = 1; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
long long dp[123][123456];
int main() {
int N;
int W;
cin >> N >> W;
vector<int> w(N);
vector<long long> v(N);
memset(dp, -1, sizeof dp);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
dp[0][w[0]] = v[0];
for (int i = 1; i < N; i++) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 967,972 | 967,973 | u097325550 | cpp |
p03163 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forr(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define ford(i, n) for (int i = n; i > 0; i--)
#define forin(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define all(a) a... | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forr(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define ford(i, n) for (int i = n; i > 0; i--)
#define forin(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define all(a) a... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 967,980 | 967,979 | u333759455 | cpp |
p03163 | // knapsack 0-1
#include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; ... | // knapsack 0-1
#include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; ... | [
"variable_declaration.type.change"
] | 967,981 | 967,982 | u390664767 | cpp |
p03163 | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | [
"variable_declaration.type.change"
] | 967,983 | 967,984 | u390664767 | cpp |
p03163 | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 967,985 | 967,984 | u390664767 | cpp |
p03163 | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 967,986 | 967,987 | u390664767 | cpp |
p03163 | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 967,988 | 967,987 | u390664767 | cpp |
p03163 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using na... | [
"variable_declaration.type.change"
] | 967,992 | 967,993 | u841131859 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int memo[102][100002] = {-1};
long long compute(int n, int w, int item, int total, int weight[],
long long value[]) {
if (item >= n) {
return 0;
}
if (memo[item][total] != -1) {
ret... | #include <bits/stdc++.h>
#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
long long memo[102][100002] = {-1};
long long compute(int n, int w, int item, int total, int weight[],
long long value[]) {
if (item >= n) {
return 0;
}
if (memo[item][total] != -1) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 967,994 | 967,995 | u058597183 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <iostream>
#define SIZE 100002
#define INF INT_MAX >> 1
using namespace std;
typedef long long ll;
ll dp[101][SIZE]; // dp[n][w] := max_value
int main(void) {
ll n, w;
cin >> n >> w;
pair<ll, ll> p[101]; //(w, v)
for (int i = 0; i < n; i++) {
cin >> p[i].... | #include <algorithm>
#include <climits>
#include <iostream>
#define SIZE 100002
#define INF INT_MAX >> 1
using namespace std;
typedef long long ll;
ll dp[101][SIZE]; // dp[n][w] := max_value
int main(void) {
ll n, w;
cin >> n >> w;
pair<ll, ll> p[101]; //(w, v)
for (int i = 0; i < n; i++) {
cin >> p[i].... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 968,000 | 968,001 | u117734686 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <iostream>
#define SIZE 100002
#define INF INT_MAX >> 1
using namespace std;
typedef long long ll;
ll dp[101][SIZE]; // dp[n][w] := max_value
int main(void) {
ll n, w;
cin >> n >> w;
pair<ll, ll> p[101]; //(w, v)
for (int i = 0; i < n; i++) {
cin >> p[i].... | #include <algorithm>
#include <climits>
#include <iostream>
#define SIZE 100002
#define INF INT_MAX >> 1
using namespace std;
typedef long long ll;
ll dp[101][SIZE]; // dp[n][w] := max_value
int main(void) {
ll n, w;
cin >> n >> w;
pair<ll, ll> p[101]; //(w, v)
for (int i = 0; i < n; i++) {
cin >> p[i].... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 968,002 | 968,001 | u117734686 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <iostream>
#define SIZE 100002
#define INF INT_MAX >> 1
using namespace std;
typedef long long ll;
ll dp[101][SIZE]; // dp[n][w] := max_value
int main(void) {
ll n, w;
cin >> n >> w;
pair<ll, ll> p[101]; //(w, v)
for (int i = 0; i < n; i++) {
cin >> p[i].... | #include <algorithm>
#include <climits>
#include <iostream>
#define SIZE 100002
#define INF INT_MAX >> 1
using namespace std;
typedef long long ll;
ll dp[101][SIZE]; // dp[n][w] := max_value
int main(void) {
ll n, w;
cin >> n >> w;
pair<ll, ll> p[101]; //(w, v)
for (int i = 0; i < n; i++) {
cin >> p[i].... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 968,002 | 968,003 | u117734686 | cpp |
p03163 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
// typedef vector<... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
// typedef vector<... | [
"call.arguments.change"
] | 968,009 | 968,010 | u493750228 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int w[N + 1], v[N + 1], dp[N + 1][W + 1];
for (int i = 1; i <= N; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= N; i++)
dp[i][0] = 0;
for (int i = 0; i <= W; i++)
dp[0][i] = 0;
for (int i = 1; i <= N; i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
long long w[N + 1], v[N + 1], dp[N + 1][W + 1];
for (int i = 1; i <= N; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= N; i++)
dp[i][0] = 0;
for (int i = 0; i <= W; i++)
dp[0][i] = 0;
for (int i = 1; i <= N; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,013 | 968,014 | u122034453 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
const int N = 105;
const int M = 100050;
int dp[N][M], w[N], v[N];
int main() {
int n, W;
scanf("%i %i", &n, &W);
for (int i = 1; i <= n; i++)
scanf("%i %i", &w[i], &v[i]);
for (int i = 1; i <= n; i+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
const int N = 105;
const int M = 100050;
ll dp[N][M], w[N], v[N];
int main() {
int n, W;
scanf("%i %i", &n, &W);
for (int i = 1; i <= n; i++)
scanf("%lld %lld", &w[i], &v[i]);
for (int i = 1; i <= n;... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,022 | 968,023 | u939096624 | cpp |
p03163 | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
long long a[105], b[100005], c[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i] >> c[i];
for (int i = 1; i <= n; i++) {
for (int j = m; j >= a[i]; j--) {
b[j] = max(b[j - a[i]] + c[i... | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
long long a[105], b[100005], c[105];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i] >> c[i];
for (int i = 1; i <= n; i++) {
for (int j = m; j >= a[i]; j--) {
b[j] = max(b[j - a[i]] + c[i], ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 968,030 | 968,031 | u798562499 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N);
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int N, W;
cin >> N >> W;
vector<ll> w(N);
vector<ll> v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
vector<vector<ll>> dp(N + 1, vector<ll>(W + 1, 0));
for (int i = 1; i <= N; i++) {
for (int j = 1; j... | [
"call.arguments.change"
] | 968,035 | 968,036 | u741856489 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int w;
cin >> w;
vector<int> wt(n), val(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++) {
for (int j = 1; j <= w; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int w;
cin >> w;
vector<int> wt(n), val(n);
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
vector<vector<long long>> dp(n + 1, vector<long long>(w + 1, 0));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <=... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,037 | 968,038 | u415096441 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int w;
cin >> w;
vector<int> wt(n), val(n);
for (int i = 0; i < n; i++) {
cin >> val[i] >> wt[i];
}
vector<vector<int>> dp(n + 1, vector<int>(w + 1, 0));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int w;
cin >> w;
vector<int> wt(n), val(n);
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
vector<vector<long long>> dp(n + 1, vector<long long>(w + 1, 0));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <=... | [
"identifier.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,039 | 968,038 | u415096441 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int W;
cin >> W;
int w[n];
int v[n];
for (int i = 0; i < n; i++) {
cin >> w[i];
cin >> v[i];
}
int dp[n][W + 1];
for (int i = 0; i < n; i++) {
dp[i][0] = 0;
}
for (int i = 0; i < W + 1; i++) {
if (i <... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
int W;
cin >> W;
int w[n];
int v[n];
for (int i = 0; i < n; i++) {
cin >> w[i];
cin >> v[i];
}
int dp[n][W + 1];
for (int i = 0; i < n; i++) {
dp[i][0] = 0;
}
for (int i = 0; i < W... | [
"variable_declaration.type.widen.change"
] | 968,055 | 968,056 | u236295472 | cpp |
p03163 | #include <fstream>
#include <iostream>
#include <utility>
using namespace std;
int n, w, f[109][100009];
pair<int, int> p[109];
int main() {
// freopen("knapsack1.inp", "r", stdin);
// freopen("knapsack1.out", "w", stdout);
cin >> n >> w;
for (int i = 1; i <= n; i++)
cin >> p[i].first >> p[i].second;
for ... | #include <fstream>
#include <iostream>
#include <utility>
using namespace std;
int n, w;
long long f[109][100009];
pair<int, int> p[109];
int main() {
// freopen("knapsack1.inp", "r", stdin);
// freopen("knapsack1.out", "w", stdout);
cin >> n >> w;
for (int i = 1; i <= n; i++)
cin >> p[i].first >> p[i].seco... | [
"variable_declaration.type.widen.change"
] | 968,057 | 968,058 | u154608739 | cpp |
p03163 | // be name khoda \\
// #define stream_enable
// #define long_enable
#define debug_enable
#include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <v... | // be name khoda \\
// #define stream_enable
#define long_enable
#define debug_enable
#include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vect... | [] | 968,059 | 968,060 | u780597450 | cpp |
p03163 | #include <bits/stdc++.h>
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define rep(i, n) REP(i, 0, n)
#define rep1(i, n) REP(i, 1, n)
#define repe(i, n) for (auto &&i : n)
#define all(v) (v).begin(), (v).end()
#define decimal fixed << setprecision(20)
#define fastcin() ... | #include <bits/stdc++.h>
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define rep(i, n) REP(i, 0, n)
#define rep1(i, n) REP(i, 1, n)
#define repe(i, n) for (auto &&i : n)
#define all(v) (v).begin(), (v).end()
#define decimal fixed << setprecision(20)
#define fastcin() ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 968,067 | 968,068 | u996252264 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int LL;
#define pb push_back
#define mp make_pair
#define scan(n) scanf("%d", &n)
#define print(n) printf("%d\n", n)
#define longscan(n) scanf("%lld", &n)
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int LL;
#define pb push_back
#define mp make_pair
#define scan(n) scanf("%d", &n)
#define print(n) printf("%d\n", n)
#define longscan(n) scanf("%lld", &n)
... | [
"variable_declaration.type.widen.change"
] | 968,073 | 968,074 | u947521398 | cpp |
p03163 | //$g++ -std=c++11 Template.cpp
//#include <bits/stdc++.h>
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | //$g++ -std=c++11 Template.cpp
//#include <bits/stdc++.h>
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 968,078 | 968,076 | u783861517 | cpp |
p03163 | #include <bits/stdc++.h>
#define f(I, a, b) for (int I = a; I <= b; I++)
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
f(i, 0, N - 1) cin >> w[i] >> v[i];
int dp[N + 1][W + 1] = {};
f(i, 0, N - 1) {
f(j, 0, W) {
if (j - w[i] >= 0) {
dp[i + 1][j] = max(dp[i][j]... | #include <bits/stdc++.h>
#define f(I, a, b) for (int I = a; I <= b; I++)
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int w[N], v[N];
f(i, 0, N - 1) cin >> w[i] >> v[i];
long long dp[N + 1][W + 1] = {};
f(i, 0, N - 1) {
f(j, 0, W) {
if (j - w[i] >= 0) {
dp[i + 1][j] = max(dp... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,079 | 968,080 | u733608212 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define _ ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define sll(x) scanf("%I64d", &x)
#define sd(x) scanf("%d", &x)
#define pll(x) printf("%I64d", x)
#define pd(x) p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define _ ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define sll(x) scanf("%I64d", &x)
#define sd(x) scanf("%d", &x)
#define pll(x) printf("%I64d", x)
#define pd(x) p... | [
"variable_declaration.type.change"
] | 968,083 | 968,084 | u113936857 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vs = vector<string>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vb = vector<bool>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vs = vector<string>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vb = vector<bool>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#... | [] | 968,087 | 968,088 | u278566247 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); ... | [
"variable_declaration.type.change"
] | 968,094 | 968,095 | u710527399 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111... | [
"assignment.change"
] | 968,096 | 968,097 | u532573979 | cpp |
p03163 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | [
"call.arguments.change"
] | 968,102 | 968,103 | u941028483 | cpp |
p03163 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int dp[101][100001];
pair<int, int> c[101];
int main() {
int n, W;
cin >> n >> W;
for (int i = 1; i <= n; i++) {
int w, v;
cin >> w >> v;
c[i].first = w;
c[i].second = v;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= W... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
long long dp[101][100001];
pair<int, long long> c[101];
int main() {
int n, W;
cin >> n >> W;
for (int i = 1; i <= n; i++) {
int w, v;
cin >> w >> v;
c[i].first = w;
c[i].second = v;
}
for (int i = 1; i <= n; i++) {
for (int j... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,104 | 968,105 | u726841392 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000007
using namespace std;
using P = pair<int, int>;
using ll = long long;
int ma... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000007
using namespace std;
using P = pair<int, int>;
using ll = long long;
int ma... | [
"assignment.change"
] | 968,110 | 968,111 | u033620890 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 1e5 + 10;
int N, W, A[MAX], B[MAX], C[MAX], dp[105][MAX];
int solve(int idx, int w) {
if (idx > N)
return 0;
if (dp[idx][w] != -1)
return dp[idx][w];
int res = 0;
if (w + A[idx] <= W)
res = max(res, solve(idx + 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 1e5 + 10;
ll N, W, A[MAX], B[MAX], C[MAX], dp[105][MAX];
ll solve(int idx, int w) {
if (idx > N)
return 0;
if (dp[idx][w] != -1)
return dp[idx][w];
ll res = 0;
if (w + A[idx] <= W)
res = max(res, solve(idx + 1, w... | [
"variable_declaration.type.change"
] | 968,114 | 968,115 | u205197147 | cpp |
p03163 | #include <climits>
#include <iostream>
#include <vector>
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];
cin >> v[i];
}
vector<vector<int>> KS(n + 1, vector<int>(W + 1));
for (int i = 0; i <= n; ++i) {
KS[i][0] = 0... | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long int n, W;
cin >> n >> W;
vector<int> w(n), v(n);
for (int i = 0; i < n; ++i) {
cin >> w[i];
cin >> v[i];
}
vector<vector<long int>> KS(n + 1, vector<long int>(W + 1));
for (int i = 0; i <= n; ++i) {
... | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,116 | 968,117 | u555640897 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int a[n][2];
for (int i = 0; i < n; i++)
cin >> a[i][0] >> a[i][1];
int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
else i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int a[n][2];
for (int i = 0; i < n; i++)
cin >> a[i][0] >> a[i][1];
long long dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,120 | 968,121 | u200439351 | cpp |
p03163 | #include <algorithm>
#include <iostream>
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 60;
using namespace std;
int dp[110][100100] = {0};
int main() {
int N, W;
cin >> N >> W;
... | #include <algorithm>
#include <iostream>
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 60;
using namespace std;
long long dp[110][100100] = {0};
int main() {
int N, W;
cin >> N ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 968,122 | 968,123 | u863957421 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
t... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
t... | [
"control_flow.loop.for.condition.change"
] | 968,131 | 968,132 | u612271542 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_set>
#include <vector>
#define m7 1000000007
#define m9 1000000009
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
using names... | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_set>
#include <vector>
#define m7 1000000007
#define m9 1000000009
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
using names... | [] | 968,133 | 968,134 | u096424346 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int dp[100][100000];
long long solve(vector<int> &w, vector<int> &p, int i, int j) {
if (i == w.size())
return 0;
if (dp[i][j] != -1)
return dp[i][j];
if (j - w[i] >= 0)
dp[i][j] = ma... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
long long dp[100][100000];
long long solve(vector<int> &w, vector<int> &p, int i, int j) {
if (i == w.size())
return 0;
if (dp[i][j] != -1)
return dp[i][j];
if (j - w[i] >= 0)
dp[i][j... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,135 | 968,136 | u490032848 | cpp |
p03163 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,137 | 968,138 | u554989002 | cpp |
p03163 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#ifdef _debug
#define dout(i) cout << #i << ' ' << i << ' '
#else
#define dout(i) //
#endif
using ll = long long;
using ull = unsigned long long;
using ul = unsigned;
using db = double;
const int maxn = 101;
const int maxw = 100001;
int dp[maxw];
... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#ifdef _debug
#define dout(i) cout << #i << ' ' << i << ' '
#else
#define dout(i) //
#endif
using ll = long long;
using ull = unsigned long long;
using ul = unsigned;
using db = double;
const int maxn = 101;
const int maxw = 100001;
ll dp[maxw];
i... | [
"variable_declaration.type.change"
] | 968,139 | 968,140 | u233690053 | cpp |
p03163 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 968,145 | 968,146 | u135572611 | cpp |
p03163 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [
"control_flow.branch.else.remove"
] | 968,156 | 968,157 | u135572611 | cpp |
p03163 | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
... | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 968,160 | 968,161 | u170650966 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 968,176 | 968,177 | u460819600 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int dp[101][100005];
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];
}
for (int i = 0; i < n; i++)
for (int j = 0; j <= w; j++) {
if (i == 0) {
if (weight[i] <= j)
... | #include <bits/stdc++.h>
using namespace std;
long long int dp[101][100005];
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];
}
for (int i = 0; i < n; i++)
for (int j = 0; j <= w; j++) {
if (i == 0) {
if (weight[... | [
"variable_declaration.type.widen.change"
] | 968,180 | 968,181 | u316078299 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vec;
#define vecc vector<vector<ll>>
#define LM LLONG_MAX
#define int long long int
#define P pair<ll, ll>
#define ff first
#define ss second
#define FAST ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vec;
#define vecc vector<vector<ll>>
#define LM LLONG_MAX
#define int long long int
#define P pair<ll, ll>
#define ff first
#define ss second
#define FAST ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 968,188 | 968,189 | u439272053 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vec;
#define vecc vector<vector<ll>>
#define LM LLONG_MAX
#define int long long int
#define P pair<ll, ll>
#define ff first
#define ss second
#define FAST ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vec;
#define vecc vector<vector<ll>>
#define LM LLONG_MAX
#define int long long int
#define P pair<ll, ll>
#define ff first
#define ss second
#define FAST ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 968,190 | 968,189 | u439272053 | cpp |
p03163 | #include <algorithm>
#include <cstdio>
#include <vector>
typedef long long int ll;
struct state {
ll aw;
ll av;
state(ll aw = 0, ll av = 0) : aw(aw), av(av) {}
};
struct item {
int w;
int v;
double d;
item(int w, int v) : w(w), v(v), d((double)v / w) {}
};
int n, w;
ll lower;
std::vector<item> is;
s... | #include <algorithm>
#include <cstdio>
#include <vector>
typedef long long int ll;
struct state {
ll aw;
ll av;
state(ll aw = 0, ll av = 0) : aw(aw), av(av) {}
};
struct item {
int w;
int v;
double d;
item(int w, int v) : w(w), v(v), d((double)v / w) {}
};
int n, w;
ll lower;
std::vector<item> is;
s... | [
"identifier.change",
"call.arguments.change"
] | 968,191 | 968,192 | u858107870 | cpp |
p03163 | // https://atcoder.jp/contests/dp/tasks/dp_e
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PL... | // https://atcoder.jp/contests/dp/tasks/dp_e
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PL... | [
"variable_declaration.type.change"
] | 968,193 | 968,194 | u858107870 | cpp |
p03163 | #include <iostream>
using namespace std;
int N, W;
long long int w[100001], v[100001];
long long int dp[10001][10001];
int main() {
cin >> N >> W;
long long int ans;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= N; i++)
dp[i][0] = 0;
for (int j = 0; j <= W; j++)
dp[0][j]... | #include <iostream>
using namespace std;
int N, W;
long long int w[100001], v[100001];
long long int dp[101][100001];
int main() {
cin >> N >> W;
long long int ans;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= N; i++)
dp[i][0] = 0;
for (int j = 0; j <= W; j++)
dp[0][j] ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 968,200 | 968,201 | u570124150 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int weight[N];
int value[N];
for (int i = 0; i < N; i++) {
cin >> weight[i] >> value[i];
}
int dp[N + 1][W + 1];
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
long long weight[N];
long long value[N];
for (int i = 0; i < N; i++) {
cin >> weight[i] >> value[i];
}
long long dp[N + 1][W + 1];
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 |... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,202 | 968,203 | u991501953 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
// typedef long long ll;
long long n, w, a[105], b[105], d[105][100005];
int main(void) {
cin >> n >> w;
for (int i = 1; i < n; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (j >= a[i])
d[i][j] = max(... | #include <bits/stdc++.h>
using namespace std;
// typedef long long ll;
long long n, w, a[105], b[105], d[105][100005];
int main(void) {
cin >> n >> w;
for (int i = 1; i <= n; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (j >= a[i])
d[i][j] = max... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 968,204 | 968,205 | u540547607 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
// typedef long long ll;
long long n, w, a[105], v[105], d[105][100005];
int main(void) {
cin >> n >> w;
for (int i = 1; i < n; i++)
cin >> a[i] >> v[i];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (j >= a[i])
d[i][j] = max(... | #include <bits/stdc++.h>
using namespace std;
// typedef long long ll;
long long n, w, a[105], b[105], d[105][100005];
int main(void) {
cin >> n >> w;
for (int i = 1; i <= n; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (j >= a[i])
d[i][j] = max... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 968,206 | 968,205 | u540547607 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int n, m, a[102], b[102], d[102][100005];
int main(void) {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= n; i++)
for (int j = 0; j <= m; j++)
if (j >= a[i])
d[i][j] = max(d[i - 1][j], d[i - 1][j - a[i]] + ... | #include <bits/stdc++.h>
using namespace std;
long long n, m, a[102], b[102], d[102][100005];
int main(void) {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= n; i++)
for (int j = 0; j <= m; j++)
if (j >= a[i])
d[i][j] = max(d[i - 1][j], d[i - 1][j - a[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,207 | 968,208 | u540547607 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int dp[100005];
int main() {
int v, c, n, i, maxim = 0, w;
cin >> n >> w;
for (int t = 1; t <= n; t++) {
cin >> c >> v;
for (i = w; i >= c; i--) {
dp[i] = max(dp[i], dp[i - c] + v);
maxim = max(maxim, dp[i]);
}
}
cout << maxim;
return 0;... | #include <bits/stdc++.h>
using namespace std;
long long dp[100005];
int main() {
long long v, c, n, i, maxim = 0, w;
cin >> n >> w;
for (long long t = 1; t <= n; t++) {
cin >> c >> v;
for (i = w; i >= c; i--) {
dp[i] = max(dp[i], dp[i - c] + v);
maxim = max(maxim, dp[i]);
}
}
cout << ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 968,209 | 968,210 | u966446815 | cpp |
p03163 | #include <iostream>
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 dp[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
else if (j >= w[... | #include <iostream>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
long v[n], w[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long dp[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
else if (j >= ... | [
"variable_declaration.type.primitive.change"
] | 968,211 | 968,212 | u474674098 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
signed main() {
int n, w;
cin >> n >> w;
vector<int> x(n, 0), v(n, 0);
for (int i = 1; i <= n; i++)
cin >> x[i] >> v[i];
vector<vector<long long>> f(n + 1, vector<long long>(w * 2 + 5, 0));
for (int i = 1; i <= n; i++) {
for (int j = 0; j <... | #include <iostream>
#include <vector>
using namespace std;
signed main() {
int n, w;
cin >> n >> w;
vector<int> x(n + 1, 0), v(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> x[i] >> v[i];
vector<vector<long long>> f(n + 1, vector<long long>(w * 2 + 5, 0));
for (int i = 1; i <= n; i++) {
for (int j ... | [
"assignment.change"
] | 968,213 | 968,214 | u803450165 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
main() {
ll n, w;
cin >> n >> w;
vector<ll> weight(n), value(n);
for (ll i = 0; i < n; ++i)
cin >> weight[i] >> value[i];
vector<vector<ll>> dp(n + 1, vector<ll>(w));
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j <= w; ++j) {
i... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
main() {
ll n, w;
cin >> n >> w;
vector<ll> weight(n), value(n);
for (ll i = 0; i < n; ++i)
cin >> weight[i] >> value[i];
vector<vector<ll>> dp(200, vector<ll>(200000));
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j <= w; ++j) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 968,215 | 968,216 | u423624748 | cpp |
p03163 | #include <bits/stdc++.h>
#define m ((long long)1e9 + 7)
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, w;
cin >> n >> w;
ll dp[n + 1][w + 1], a[n][2];
for (ll i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
}
for (ll i = 0; i < n + 1; ... | #include <bits/stdc++.h>
#define m ((long long)1e9 + 7)
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, w;
cin >> n >> w;
ll dp[n + 1][w + 1], a[n][2];
for (ll i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
}
for (ll i = 0; i < n + 1; ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 968,226 | 968,227 | u997340502 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w, i, j;
cin >> n >> w;
long long dp[n + 1][w + 1];
long long wt[n];
long long v[n];
for (i = 0; i < n; i++) {
int w1, v1;
cin >> w1 >> v1;
wt[i] = w1;
v[i] = v1;
}
for (i = 0; i <= n; i++) {
for (j = 0; j <= w; j++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w, i, j;
cin >> n >> w;
long long dp[n + 1][w + 1];
long long wt[n];
long long v[n];
for (i = 0; i < n; i++) {
int w1, v1;
cin >> w1 >> v1;
wt[i] = w1;
v[i] = v1;
}
for (i = 0; i <= n; i++) {
for (j = 0; j <= w; j++) {... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 968,236 | 968,237 | u953182071 | cpp |
p03163 | // In the Name of ̲A̲l̲l̲a̲h̲
#define pb push_back
#define F first
#define S second
#define sz size()
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int n, w[101], v[101], mx, dp[100001][101];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> mx;
for (int i = 0; i < n; i++) {
cin... | // In the Name of ̲A̲l̲l̲a̲h̲
#define pb push_back
#define F first
#define S second
#define sz size()
#define ll long long
#include <bits/stdc++.h>
using namespace std;
ll n, w[101], v[101], mx, dp[100001][101];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> mx;
for (int i = 0; i < n; i++) {
cin ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 968,241 | 968,242 | u947459087 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
void solve(int w[], int v[], int W, int n) {
int dp[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
else if (w[i - 1] <= j)
dp[i][j] = max(dp[i - 1][j], v[i - 1] + dp[i - ... | #include <bits/stdc++.h>
using namespace std;
void solve(int w[], int v[], int W, int n) {
long dp[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
else if (w[i - 1] <= j)
dp[i][j] = max(dp[i - 1][j], v[i - 1] + dp[i -... | [
"variable_declaration.type.primitive.change"
] | 968,243 | 968,244 | u589502773 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define tezina first
#define vrednost second
using namespace std;
int n, w;
pair<int, ll> predmeti[110];
ll dp[100010][110];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> w;
int t, v;
for (int i = 1; i <= n; i++) {
cin >> t >> v;
pr... | #include <bits/stdc++.h>
#define ll long long
#define tezina first
#define vrednost second
using namespace std;
int n, w;
pair<int, ll> predmeti[110];
ll dp[100010][110];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> w;
int t, v;
for (int i = 1; i <= n; i++) {
cin >> t >> v;
pr... | [
"assignment.change"
] | 968,248 | 968,249 | u433582964 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
signed main() {
int n, x;
cin >> n >> x;
int w[n];
int v[n];
for (int i = 0; i < n; ++i) {
cin >> w[i];
cin >> v[i];
}
int dp[n + 1][x + 1];
for (int i = 0; i < n + 1; ++i) {
dp[i][0] = 0;
}
for (int i = 0; i < x + 1;... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
signed main() {
int n, x;
cin >> n >> x;
int w[n];
int v[n];
for (int i = 0; i < n; ++i) {
cin >> w[i];
cin >> v[i];
}
int dp[n + 1][x + 1];
for (int i = 0; i < n + 1; ++i) {
dp[i][0] = 0;
}
for (int i = 0; i < x + 1... | [
"identifier.change"
] | 968,252 | 968,253 | u072555549 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
signed main() {
int n, x;
cin >> n >> x;
int w[n];
int v[n];
for (int i = 0; i < n; ++i) {
cin >> w[i];
cin >> v[i];
}
int dp[n + 1][x + 1];
for (int i = 0; i < n + 1; ++i) {
dp[i][0] = 0;
}
for (int i = 0; i < x + 1;... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
signed main() {
int n, x;
cin >> n >> x;
int w[n];
int v[n];
for (int i = 0; i < n; ++i) {
cin >> w[i];
cin >> v[i];
}
int dp[n + 1][x + 1];
for (int i = 0; i < n + 1; ++i) {
dp[i][0] = 0;
}
for (int i = 0; i < x + 1... | [
"identifier.change"
] | 968,254 | 968,253 | u072555549 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.