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 |
|---|---|---|---|---|---|---|---|
p03164 | #include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define fs first
#define sc second
#define pb push_back
#define len(x) ((int)(x).size())
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef pair<int, int> pii;
type... | #include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define fs first
#define sc second
#define pb push_back
#define len(x) ((int)(x).size())
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef pair<int, int> pii;
type... | [
"assignment.change"
] | 970,215 | 970,216 | u567661286 | cpp |
p03164 | // Author: Ishaan Gupta
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
#define endl '\n'
#define pb push_back
#define DEB(x) cout << '>' << #x << ':' << x << endl;
inline ll add(ll a, ll b) { return (a % MOD + b % MOD) % MOD; }
inline ll sub(ll a,... | // Author: Ishaan Gupta
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
#define endl '\n'
#define pb push_back
#define DEB(x) cout << '>' << #x << ':' << x << endl;
inline ll add(ll a, ll b) { return (a % MOD + b % MOD) % MOD; }
inline ll sub(ll a,... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 970,217 | 970,218 | u090137556 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, w;
cin >> n >> w;
int v = 1e5;
vector<long long> dp(v + 1, INT_MAX);
dp[0] = 0;
int weight, value;
for (int i = 0; i < n; i++) {
cin >> weight >> value;
for (int j = v - value; j... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, w;
cin >> n >> w;
int v = 1e5;
vector<long long> dp(v + 1, INT_MAX);
dp[0] = 0;
int weight, value;
for (int i = 0; i < n; i++) {
cin >> weight >> value;
for (int j = v - value; j... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 970,227 | 970,228 | u499126356 | cpp |
p03164 | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#includ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#includ... | [
"literal.number.change",
"assignment.value.change"
] | 970,250 | 970,251 | u265392294 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long n, W, w, v;
long long d[N], use[N];
int main() {
cin >> n >> W;
use[0] = 1;
for (int i = 1; i <= N; i++) {
d[i] = 1e12;
}
for (int i = 1; i <= n; i++) {
cin >> w >> v;
for (int u = 1e5 + 10; u >= 0; u--) {
if (... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long n, W, w, v;
long long d[N], use[N];
int main() {
cin >> n >> W;
use[0] = 1;
for (int i = 1; i <= N; i++) {
d[i] = 1e12;
}
for (int i = 1; i <= n; i++) {
cin >> w >> v;
for (int u = 1e5 + 10; u >= 0; u--) {
if (... | [
"expression.operation.binary.remove"
] | 970,258 | 970,259 | u561495734 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using names... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using names... | [
"identifier.change",
"io.output.change"
] | 970,260 | 970,261 | u275797573 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 970,273 | 970,274 | u195054737 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 970,275 | 970,274 | u195054737 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 970,273 | 970,277 | u195054737 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 970,275 | 970,277 | u195054737 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 970,278 | 970,277 | u195054737 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 970,275 | 970,279 | u195054737 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 970,278 | 970,279 | u195054737 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 970,275 | 970,280 | u195054737 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 970,278 | 970,280 | u195054737 | cpp |
p03164 | #include <bits/stdc++.h>
#include <cmath>
#include <string>
using namespace std;
#define f first
#define s second
#define MOD 1000000007
#define fast ios::sync_with_stdio(0), cout.tie(0), cin.tie(0)
#define pb push_back
#define fo(i, a, b) for (i = a; i < b; i++)
#define foe(i, a, b) for (i = a; i <= b; i++)
#define mp... | #include <bits/stdc++.h>
#include <cmath>
#include <string>
using namespace std;
#define f first
#define s second
#define MOD 1000000007
#define fast ios::sync_with_stdio(0), cout.tie(0), cin.tie(0)
#define pb push_back
#define fo(i, a, b) for (i = a; i < b; i++)
#define foe(i, a, b) for (i = a; i <= b; i++)
#define mp... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 970,302 | 970,303 | u972597110 | cpp |
p03164 | #include "bits/stdc++.h"
#include <math.h>
#include <time.h>
using namespace std;
const long long mod = 1000000007;
#define ll long long
#define dump(x) \
if (dbg) { \
cout << #x << " =... | #include "bits/stdc++.h"
#include <math.h>
#include <time.h>
using namespace std;
const long long mod = 1000000007;
#define ll long long
#define dump(x) \
if (dbg) { \
cout << #x << " =... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 970,307 | 970,308 | u938841444 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
int main() {
int n;
long long int W;
cin >> n >> W;
vector<long long int> w(n), v(n);
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
// dp[i][j] = max_value among realization of value <= j, using up to i-th
// ite... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
int main() {
int n;
long long int W;
cin >> n >> W;
vector<long long int> w(n), v(n);
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
// dp[i][j] = max_value among realization of value <= j, using up to i-th
// ite... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 970,317 | 970,318 | u180716041 | cpp |
p03164 | #include <algorithm>
#include <iostream>
using namespace std;
const long long INF = 100000000;
int w[110], v[110];
long long dp[110][100010];
int main() {
int n, W;
long long res = 0;
cin >> n >> W;
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < 110; ++i)
for (int j = 0; j ... | #include <algorithm>
#include <iostream>
using namespace std;
const long long INF = 1000000100;
int w[110], v[110];
long long dp[110][100010];
int main() {
int n, W;
long long res = 0;
cin >> n >> W;
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < 110; ++i)
for (int j = 0; j... | [
"literal.number.change",
"variable_declaration.value.change"
] | 970,325 | 970,326 | u590427200 | cpp |
p03164 | #include <algorithm>
#include <iostream>
using namespace std;
const long long INF = 100000000;
int w[110], v[110];
long long dp[110][100010];
int main() {
int n, W, res = 0;
cin >> n >> W;
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < 110; ++i)
for (int j = 0; j < 100010; ++... | #include <algorithm>
#include <iostream>
using namespace std;
const long long INF = 1000000100;
int w[110], v[110];
long long dp[110][100010];
int main() {
int n, W;
long long res = 0;
cin >> n >> W;
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < 110; ++i)
for (int j = 0; j... | [
"literal.number.change",
"variable_declaration.value.change"
] | 970,327 | 970,326 | u590427200 | cpp |
p03164 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define print(x) cout << (x) << endl;
#define printa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " "; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define print(x) cout << (x) << endl;
#define printa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " "; ... | [
"variable_declaration.type.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 970,344 | 970,345 | u174509352 | cpp |
p03164 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long MOD = 1e9 + 7;
const long long INF = 1LL << 60;
using namespace std;
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 < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long MOD = 1e9 + 7;
const long long INF = 1LL << 60;
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | [] | 970,346 | 970,347 | u138597672 | cpp |
p03164 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long MOD = 1e9 + 7;
const long long INF = 1LL << 60;
using namespace std;
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 < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long MOD = 1e9 + 7;
const long long INF = 1LL << 60;
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | [
"expression.operation.binary.remove"
] | 970,348 | 970,349 | u138597672 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub up... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub up... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.remove"
] | 970,355 | 970,356 | u426777622 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub up... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub up... | [
"assignment.value.change",
"identifier.change"
] | 970,357 | 970,358 | u426777622 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
long long w[n + 1], v[n + 1];
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
long long dp[n + 1][1000005];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= 1000000; j++) {
if (j == 0) {
dp[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
long long w[n + 1], v[n + 1];
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
long long dp[n + 1][100005];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= 100000; j++) {
if (j == 0) {
dp[i][... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 970,373 | 970,374 | u658960571 | cpp |
p03164 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 970,381 | 970,382 | u908318580 | cpp |
p03164 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
ret... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
ret... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 970,392 | 970,393 | u318042557 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
const long INF = LONG_MAX / 2;
int main() {
long N, W;
cin >> N >> W;
vector<vector<long>> dp(N + 1, vector<long>(100001, INF));
dp[0][0] = 0;
for (int i = 0; i < N; i++) {
int w, v;
cin >> w >> v;
for (int j = 0; j < 100001; j++) {
if (j - v >... | #include <bits/stdc++.h>
using namespace std;
const long INF = LONG_MAX / 2;
int main() {
long N, W;
cin >> N >> W;
vector<vector<long>> dp(N + 1, vector<long>(100001, INF));
dp[0][0] = 0;
for (int i = 0; i < N; i++) {
long w, v;
cin >> w >> v;
for (int j = 0; j < 100001; j++) {
if (j - v ... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.else.remove",
"assignment.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 970,394 | 970,395 | u777258731 | cpp |
p03164 | #include <bits/stdc++.h>
long long int dp[100001][100] = {};
bool tf[100001][100] = {};
long int dpcalc(long int v, int i, long int a[][2], long int n) {
if (v <= 0)
return 0;
if (i == 0)
return 100000000001;
if (tf[v][i])
return dp[v][i];
tf[v][i] = 1;
dp[v][i] = std::min(dpcalc(v, i - 1, a, n),
... | #include <bits/stdc++.h>
long long int dp[100001][100] = {};
bool tf[100001][100] = {};
long int dpcalc(long int v, int i, long int a[][2], long int n) {
if (v <= 0)
return 0;
if (i == -1)
return 100000000001;
if (tf[v][i])
return dp[v][i];
tf[v][i] = 1;
dp[v][i] = std::min(dpcalc(v, i - 1, a, n),... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 970,398 | 970,399 | u125115181 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define xxx int32_t
#define fuck_u return 0;
const int inf = 1e18L + 5;
xxx main() {
int n, w;
scanf("%lld%lld", &n, &w);
vector<int> weight(n), value(n);
for (int i = 0; i < n; ++i) {
scanf("%lld%lld", &weight[i], &value[i]);
}
int s... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define xxx int32_t
#define fuck_u return 0;
const int inf = 1e18L + 5;
xxx main() {
int n, w;
scanf("%lld %lld", &n, &w);
vector<int> weight(n), value(n);
for (int i = 0; i < n; ++i) {
scanf("%lld %lld", &weight[i], &value[i]);
}
int... | [
"literal.string.change",
"call.arguments.change"
] | 970,405 | 970,406 | u395200313 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define ld long double
#define si(x) (ll)((x).size())
#define pb push_back
#define F first
#define S second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define rep1(i, n) for (ll i = 1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define ld long double
#define si(x) (ll)((x).size())
#define pb push_back
#define F first
#define S second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define rep1(i, n) for (ll i = 1... | [
"literal.number.change",
"call.arguments.change"
] | 970,407 | 970,408 | u149999193 | cpp |
p03164 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll INF = 1e18L + 5;
int main() {
ll n, W, sum = 0;
cin >> n >> W;
vector<ll> wt(n), v(n);
for (ll i = 1; i <= n; i++) {
cin >> wt[i] >> v[i];
sum += v[i];
}
vector<ll> dp(sum + 1, INF);
dp[0] = 0;
for (ll i = 1; i <= n... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll INF = 1e18L + 5;
int main() {
ll n, W, sum = 0;
cin >> n >> W;
vector<ll> wt(n + 1), v(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> wt[i] >> v[i];
sum += v[i];
}
vector<ll> dp(sum + 1, INF);
dp[0] = 0;
for (ll i = 1... | [
"assignment.change"
] | 970,412 | 970,413 | u051784225 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef lo... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef lo... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 970,416 | 970,417 | u034671639 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = INT64_MAX;
int main() {
ll n, W;
cin >> n >> W;
vector<ll> w(n), v(n);
for (ll i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
ll v_sum = 0;
for (ll i = 0; i < n; i++)
v_sum += v[i];
vector<ll> dp(v_sum + 1, IN... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = INT32_MAX;
int main() {
ll n, W;
cin >> n >> W;
vector<ll> w(n), v(n);
for (ll i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
ll v_sum = 0;
for (ll i = 0; i < n; i++)
v_sum += v[i];
vector<ll> dp(v_sum + 1, IN... | [
"variable_declaration.value.change",
"identifier.change"
] | 970,427 | 970,428 | u151251720 | cpp |
p03164 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < b; i++)
ll N, W, V = 1000;
int main() {
scanf("%lld%lld", &N, &W);... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < b; i++)
ll N, W, V = 1000;
int main() {
scanf("%lld%lld", &N, &W);... | [
"assignment.change"
] | 970,429 | 970,430 | u128572736 | cpp |
p03164 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (in... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (in... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 970,447 | 970,448 | u708568341 | cpp |
p03164 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define mod 1000000007
#define do double
#define loop(i, n) for (int i = 0; i < n; i++)
#define lop(a, b) for (int i = a; i <= b; i++)
#define pb push_back
#define mkp make_pair
typedef vector<int> vi;
typedef map<in... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define mod 1000000007
#define do double
#define loop(i, n) for (int i = 0; i < n; i++)
#define lop(a, b) for (int i = a; i <= b; i++)
#define pb push_back
#define mkp make_pair
typedef vector<int> vi;
typedef map<in... | [
"literal.number.change",
"variable_declaration.value.change"
] | 970,453 | 970,454 | u580376304 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
long long int dp[100001][101], vmax = 0;
long long int sol(long long int j, long long int i, long long int w[],
long long int v[], long long int n) {
if (j == 0)
return 0;
if (i == n)
return 1000000009;
if (dp[j][i] != -1)
return dp[j][i]... | #include <bits/stdc++.h>
using namespace std;
long long int dp[100005][105], vmax = 0;
long long int sol(long long int j, long long int i, long long int w[],
long long int v[], long long int n) {
if (j <= 0)
return 0;
if (i == n)
return 10000000009;
if (dp[j][i] != -1)
return dp[j][i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"function.return_value.change"
] | 970,455 | 970,456 | u373316701 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test() \
ll t; \
cin >> t; \
while (t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test() \
ll t; \
cin >> t; \
while (t... | [
"literal.number.change",
"assignment.value.change"
] | 970,457 | 970,458 | u573901279 | cpp |
p03164 | #include <bits/stdc++.h>
#define ll long long
#define ss second
#define ff first
#define pb push_back
using namespace std;
const int N = 1e6 + 69;
ll n, answer, w;
ll dp[N], W[N], V[N];
int main() {
ios ::sync_with_stdio(0);
cin >> n >> w;
for (int i = 0; i <= 1e5; i++) {
dp[i] = 1e9;
}
dp[0] = ... | #include <bits/stdc++.h>
#define ll long long
#define ss second
#define ff first
#define pb push_back
using namespace std;
const int N = 1e6 + 69;
ll n, answer, w;
ll dp[N], W[N], V[N];
int main() {
ios ::sync_with_stdio(0);
cin >> n >> w;
for (int i = 0; i <= 1e5; i++) {
dp[i] = 1e9;
}
dp[0] = ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 970,471 | 970,472 | u954494895 | cpp |
p03164 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
typedef vector<ll> vi; // Vector of long long
typedef vector<vi> vvi; // Vector of vi
typedef vector<pai... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
typedef vector<ll> vi; // Vector of long long
typedef vector<vi> vvi; // Vector of vi
typedef vector<pai... | [
"control_flow.loop.for.initializer.change"
] | 970,478 | 970,479 | u584989818 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
ll dp[110000];
const ll INF = 10010010010;
int main() {
int n;
ll W;
cin >> n >> W;
rep(i, 1100) dp[i] = INF;
dp[0] = 0;
rep(i, n) {
int w, v;
cin >> w >> v;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
ll dp[110005];
const ll INF = 10010010010;
int main() {
int n;
ll W;
cin >> n >> W;
rep(i, 110000) dp[i] = INF;
dp[0] = 0;
rep(i, n) {
int w, v;
cin >> w >> ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change"
] | 970,486 | 970,487 | u818349438 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e12 + 7;
long long dp[103][100004];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, w;
cin >> n >> w;
int a[103], b[103];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
for (int i = 0; i < n + 1; i++)
for (int j =... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e11 + 7;
long long dp[103][100004];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, w;
cin >> n >> w;
int a[103], b[103];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
for (int i = 0; i < n + 1; i++)
for (int j =... | [
"literal.number.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 970,497 | 970,498 | u986025116 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
long long w[105], v[105];
long long dp[105][100005];
int main() {
int N, W;
cin >> N >> W;
for (int i = 1; i <= N; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= N; i++)
for (int j = 1; j <= 100000; j++)
dp[i][j] = 1e18;
dp[0][0] = 0;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
long long w[105], v[105];
long long dp[105][100005];
int main() {
int N;
long long W;
cin >> N >> W;
for (int i = 1; i <= N; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= N; i++)
for (int j = 1; j <= 100000; j++)
dp[i][j] = 1e18;
dp[0][0] = 0;
f... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 970,501 | 970,500 | u953180133 | cpp |
p03164 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 970,508 | 970,509 | u136342563 | cpp |
p03164 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 970,510 | 970,509 | u136342563 | cpp |
p03164 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 970,511 | 970,509 | u136342563 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k, mx = -1;
cin >> n >> k;
ll a[n][2];
ll ts = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
ts += a[i][1];
}
ll dp[ts + 1];
for (ll i = 0; i <= ts; i++)
dp[i] = LLONG_MAX;
dp[0] = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k, mx = -1;
cin >> n >> k;
ll a[n][2];
ll ts = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
ts += a[i][1];
}
ll dp[ts + 1];
for (ll i = 0; i <= ts; i++)
dp[i] = INT_MAX;
dp[0] = 0;
fo... | [
"assignment.value.change",
"identifier.change"
] | 970,514 | 970,515 | u674523856 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
ll W;
cin >> N >> W;
vector<ll> w(N), v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
// dp[i][j]はi番目までの品物から選択し、価値がj以下の時の最小のw
vector<vector<ll>> dp(110, vector<ll>(100100, 1000000000));
dp[0][0] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
ll W;
cin >> N >> W;
vector<ll> w(N), v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
// dp[i][j]はi番目までの品物から選択し、価値がj以下の時の最小のw
vector<vector<ll>> dp(110, vector<ll>(100100, 1000000000000000));
dp[... | [
"literal.number.change",
"call.arguments.change"
] | 970,521 | 970,522 | u964763428 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
ll W;
cin >> N >> W;
vector<ll> w(N), v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
// dp[i][j]はi番目までの品物から選択し、価値がj以下の時の最小のw
vector<vector<ll>> dp(110, vector<ll>(100100, 1000000000));
dp[0][0] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
ll W;
cin >> N >> W;
vector<ll> w(N), v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
// dp[i][j]はi番目までの品物から選択し、価値がj以下の時の最小のw
vector<vector<ll>> dp(110, vector<ll>(100100, 1000000000000000));
dp[... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 970,523 | 970,522 | u964763428 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n); (i) >= 0; (i)--)
const ll MOD = 1e9 + 7;
const int INF = (int)1e9 + 7;
// vector<tuple<long,long>> items; // (value, weight)
// auto item = items[i];
// long v ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n); (i) >= 0; (i)--)
const ll MOD = 1e9 + 7;
const int INF = (int)1e9 + 7;
// vector<tuple<long,long>> items; // (value, weight)
// auto item = items[i];
// long v ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 970,534 | 970,535 | u068277996 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
int n, w, a[100][2], dp[100][100001];
int f(int i, int v) {
int &d = dp[i][v];
if (v == 0)
return 0;
if (i == n)
return 1e9;
if (d != -1)
return d;
return d = min(f(i + 1, v), f(i + 1, v - a[i][1]) + a[i][0]);
}
int main() {
memset(dp, -1, sizeof dp... | #include <bits/stdc++.h>
using namespace std;
int n, w, a[100][2], dp[100][100001];
int f(int i, int v) {
int &d = dp[i][v];
if (v == 0)
return 0;
if (i == n)
return 1e9 + 1;
if (d != -1)
return d;
return d = min(f(i + 1, v), f(i + 1, v - a[i][1]) + a[i][0]);
}
int main() {
memset(dp, -1, sizeo... | [
"expression.operation.binary.add"
] | 970,542 | 970,543 | u148496542 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
const int N = 110, V = 1e5 + 10;
long long n, W, i, j, ans;
long long w[N], v[N];
long long dp[N][V];
main() {
cin >> n >> W;
for (i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (i = 0; i <= n; i++) {
for (j = 0; j <= 100001; j++)
dp[i][j] = 1e9;
}
dp[... | #include <bits/stdc++.h>
using namespace std;
const int N = 110, V = 1e5 + 10;
long long n, W, i, j, ans;
long long w[N], v[N];
long long dp[N][V];
main() {
cin >> n >> W;
for (i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (i = 0; i <= n; i++) {
for (j = 0; j <= 100001; j++)
dp[i][j] = 1e18;
}
dp... | [
"literal.number.change",
"assignment.value.change"
] | 970,547 | 970,548 | u049755721 | cpp |
p03164 | #include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main() {
int N, W;
int64_t ans = 0;
cin >> N >> W;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i].first >> A[i].second;
}
vector<vector<int64_t>> dp(N + 1, vector<int64_t>(1e5 + 1));
// for(int i=0;i<=N... | #include <bits/stdc++.h>
#define INF 1000000000000
using namespace std;
int main() {
int N, W;
int64_t ans = 0;
cin >> N >> W;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i].first >> A[i].second;
}
vector<vector<int64_t>> dp(N + 1, vector<int64_t>(1e5 + 1));
// for(int i=0;i... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 970,551 | 970,552 | u207948013 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ll N, W;
cin >> N >> W;
vector<ll> w(N), v(N);
rep(i, N) cin >> w[i] >> v[i];
vector<vector<ll>> dp(N + 1, vector<ll>(1e5 + 1, 1e9));
dp[0][0] = 0;
for (int i = 0; i < N; i++)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ll N, W;
cin >> N >> W;
vector<ll> w(N), v(N);
rep(i, N) cin >> w[i] >> v[i];
vector<vector<ll>> dp(N + 1, vector<ll>(1e5 + 1, 1e18));
dp[0][0] = 0;
for (int i = 0; i < N; i++... | [
"literal.number.change",
"call.arguments.change"
] | 970,557 | 970,558 | u923105140 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using v = vector<ll>;
void dpA() {
int n;
cin >> n;
auto h = vector<ll>(n, 0);
for (ll i = 0; i < n; i++)
cin >> h[i];
auto dp = vector<ll>(n + 2, 1e9);
dp[0] = 0;
dp[1] = 0;
for (ll i = 1; i < n; i++) {
if (i >= 2)
dp[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using v = vector<ll>;
void dpA() {
int n;
cin >> n;
auto h = vector<ll>(n, 0);
for (ll i = 0; i < n; i++)
cin >> h[i];
auto dp = vector<ll>(n + 2, 1e9);
dp[0] = 0;
dp[1] = 0;
for (ll i = 1; i < n; i++) {
if (i >= 2)
dp[i... | [
"assignment.change"
] | 970,566 | 970,567 | u533749093 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 970,584 | 970,583 | u828388155 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <c... | [
"identifier.change",
"call.function.change"
] | 970,585 | 970,586 | u828388155 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define sze 1000005
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define sze 1000005
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 970,593 | 970,594 | u770316523 | cpp |
p03164 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define INF 1e9
int main() {
ll n, w;
cin >> n >> w;
ll v[n], wt[n];
for (ll i = 0; i < n; i++)
cin >> wt[i] >> v[i];
ll sum = 0;
for (int i = 1; i < n; i++)
sum += v[i];
ll dp[n + 5][sum + 5];
for (int i = 0; i <= n; i... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define INF 1e9
int main() {
ll n, w;
cin >> n >> w;
ll v[n], wt[n];
for (ll i = 0; i < n; i++)
cin >> wt[i] >> v[i];
ll sum = 0;
for (int i = 0; i < n; i++)
sum += v[i];
ll dp[n + 5][sum + 5];
for (int i = 0; i <= n; i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 970,610 | 970,611 | u370388551 | cpp |
p03164 | // #pragma GCC optimize("O3")
// #pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define __FOR3(i, a, n, inc) \
for (int i = (a); (inc) > 0 ? i < (n) : i >= (n); i += (inc))
#define __FOR2(i... | // #pragma GCC optimize("O3")
// #pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define __FOR3(i, a, n, inc) \
for (int i = (a); (inc) > 0 ? i < (n) : i >= (n); i += (inc))
#define __FOR2(i... | [
"expression.operation.binary.add"
] | 970,650 | 970,651 | u691350599 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (int)(a); i++)
#define REP1(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
typedef long long LL;
const int MAX_N = 105, MAX_V = 105, MAX_W = 1e9 + 7;
int n, W;
int v[MAX_N], w[MAX_N];
LL dp[MAX_V];
void input() {
scanf("%d %d",... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (int)(a); i++)
#define REP1(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
typedef long long LL;
const int MAX_N = 105, MAX_V = 100005, MAX_W = 1e9 + 7;
int n, W;
int v[MAX_N], w[MAX_N];
LL dp[MAX_V];
void input() {
scanf("%d %... | [
"literal.number.change",
"variable_declaration.value.change"
] | 970,659 | 970,660 | u385825353 | cpp |
p03164 | #include <bits/stdc++.h>
#define INF 900000000000
#define MAXN 110
#define MAXV 1100
using namespace std;
long long N, W;
long long dp[MAXV];
int v[MAXN];
int w[MAXN];
int main() {
fill(dp, dp + MAXV, INF);
cin >> N >> W;
int maxx = 0;
for (int i = 1; i <= N; i++) {
cin >> w[i] >> v[i];
maxx = max(v[i... | #include <bits/stdc++.h>
#define INF 900000000000
#define MAXN 110
#define MAXV 110000
using namespace std;
long long N, W;
long long dp[MAXV];
int v[MAXN];
int w[MAXN];
int main() {
fill(dp, dp + MAXV, INF);
cin >> N >> W;
int maxx = 0;
for (int i = 1; i <= N; i++) {
cin >> w[i] >> v[i];
maxx = max(v... | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 970,684 | 970,685 | u393584172 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 + 4e3;
typedef long long LL;
typedef pair<int, int> II;
typedef pair<int, II> III;
int n, m;
int main() {
#define TASK "ABC"
// freopen(TASK".inp","r",stdin);
// freopen(TASK".out","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 + 4e3;
typedef long long LL;
typedef pair<int, int> II;
typedef pair<int, II> III;
int n, m;
int main() {
#define TASK "ABC"
// freopen(TASK".inp","r",stdin);
// freopen(TASK".out","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.... | [
"literal.number.change",
"control_flow.loop.for.initializer.change"
] | 970,688 | 970,689 | u241126472 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 + 4e3;
typedef long long LL;
typedef pair<int, int> II;
typedef pair<int, II> III;
int n, m;
int main() {
#define TASK "ABC"
// freopen(TASK".inp","r",stdin);
// freopen(TASK".out","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cou... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 + 4e3;
typedef long long LL;
typedef pair<int, int> II;
typedef pair<int, II> III;
int n, m;
int main() {
#define TASK "ABC"
// freopen(TASK".inp","r",stdin);
// freopen(TASK".out","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 970,691 | 970,689 | u241126472 | cpp |
p03164 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 970,706 | 970,704 | u340293807 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) lower_bound(all(v), k) - v.begin()
#define ch... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) lower_bound(all(v), k) - v.begin()
#define ch... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 970,741 | 970,742 | u422633119 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll dp[100005], a[105], b[105];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll N, W, i, j, ans;
cin >> N >> W;
for (i = 0; i < 100005; i++)
dp[i] = 99999999;
for (i = 0; i < N; i++)
cin >> a[i] >> b[i];
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define inf 99999999999999
ll dp[100005], a[105], b[105];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll N, W, i, j, ans;
cin >> N >> W;
for (i = 0; i < 100005; i++)
dp[i] = inf;
for (i = 0; i < N; i++)
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 970,752 | 970,753 | u665987027 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | [
"variable_declaration.type.change"
] | 970,769 | 970,770 | u127768253 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb(x) push_back(x)
#define f(i, st, n) for (i = st; i < n; i++)
#define qu queue
#define ps(x) push(x)
#define vec vector
#define ft() front()
#define mst(a, b) memset(a, b, sizeof(a))
#define mod 1000000007
#define sfl(x) scanf("%lld", &x)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb(x) push_back(x)
#define f(i, st, n) for (i = st; i < n; i++)
#define qu queue
#define ps(x) push(x)
#define vec vector
#define ft() front()
#define mst(a, b) memset(a, b, sizeof(a))
#define mod 1000000007
#define sfl(x) scanf("%lld", &x)
... | [
"assignment.variable.change",
"identifier.change",
"literal.number.change",
"variable_access.subscript.index.change"
] | 970,771 | 970,772 | u909791791 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long int w1;
cin >> n >> w1;
long long v[n];
long long w[n];
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
sum += v[i];
}
long long dp[n + 1][sum] = {};
for (int i = 0; i <= n; i++) {
for (lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long int w1;
cin >> n >> w1;
long long v[n];
long long w[n];
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
sum += v[i];
}
long long dp[n + 1][sum + 1] = {};
for (int i = 0; i <= n; i++) {
for... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 970,775 | 970,776 | u620775604 | cpp |
p03164 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | [
"literal.number.change",
"call.arguments.change"
] | 970,790 | 970,791 | u502721867 | cpp |
p03164 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | [
"literal.number.change",
"call.arguments.change"
] | 970,792 | 970,791 | u502721867 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;
constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
constexpr int V = 110;
constexpr int INF = 1 << 30;
int main() {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;
constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
constexpr int V = 100000;
constexpr int INF = 1 << 30;
int main() ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 970,794 | 970,795 | u986399983 | cpp |
p03164 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long int
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
ll N, W;
cin >> N >> W;
vector<long> wight(N);
vector<long> value(N);
for (int i = 0; i < N; i++) {
cin >> wight[i] >> value[i];
}
vect... | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long int
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
ll N, W;
cin >> N >> W;
vector<long> wight(N);
vector<long> value(N);
for (int i = 0; i < N; i++) {
cin >> wight[i] >> value[i];
}
vect... | [
"literal.number.change",
"call.arguments.change"
] | 970,800 | 970,801 | u468862268 | cpp |
p03164 | /*
tarun360
IIT Indore
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ll_s long
#define mod 1000000007
#define forn(i, start, lim) for (ll i = start; i < lim; i++)
#define forn_d(i, start, lim) for (ll i = start; i >= lim; i--)
#define forn_s(i, start, lim) for (ll_s i = start; i < lim; i... | /*
tarun360
IIT Indore
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ll_s long
#define mod 1000000007
#define forn(i, start, lim) for (ll i = start; i < lim; i++)
#define forn_d(i, start, lim) for (ll i = start; i >= lim; i--)
#define forn_s(i, start, lim) for (ll_s i = start; i < lim; i... | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 970,806 | 970,807 | u772514767 | cpp |
p03164 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 970,812 | 970,813 | u117734686 | cpp |
p03164 | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#if __cplusplus >= 201103L
#include <chrono>
using namespace std::chrono;
#endif
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#ifdef LOCAL
#d... | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#if __cplusplus >= 201103L
#include <chrono>
using namespace std::chrono;
#endif
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#ifdef LOCAL
#d... | [
"io.output.change"
] | 970,816 | 970,817 | u625893557 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef RED
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
const int N = (int)1e6 + 5;
const ll inf = (ll)1e18;
int n, W;
ll w[N], v[N];
ll dp[N];
int main() {
#ifdef RED
freopen("a.i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef RED
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
const int N = (int)1e6 + 5;
const ll inf = (ll)1e18;
int n, W;
ll w[N], v[N];
ll dp[N];
int main() {
#ifdef RED
freopen("a.i... | [
"assignment.change"
] | 970,831 | 970,832 | u854902988 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int w[N + 1], v[N + 1];
for (int i = 1; i <= N; i += 1) {
cin >> w[i] >> v[i];
}
int dp[W + 1];
for (int i = 0; i <= W; i += 1) {
dp[i] = 0;
}
for (int i = 1; i <= N; i += 1) {
for (int j = W; j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int w[N + 1], v[N + 1];
for (int i = 1; i <= N; i += 1) {
cin >> w[i] >> v[i];
}
long long int dp[W + 1];
for (int i = 0; i <= W; i += 1) {
dp[i] = 0;
}
for (int i = 1; i <= N; i += 1) {
for (in... | [
"io.output.newline.add"
] | 970,837 | 970,838 | u054986947 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 5;
ll a, b, dp[N], n, m, ans = -1;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
for (int j = m - a; j >= 0; j--)
dp[j + a] = max(dp[j + a], dp[j] + b);
}
for (int i = 0; i < m; i++)
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 5;
ll a, b, dp[N], n, m, ans = -1;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
for (int j = m - a; j >= 0; j--)
dp[j + a] = max(dp[j + a], dp[j] + b);
}
for (int i = 0; i <= m; i++)
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 970,843 | 970,844 | u785897267 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long n, W;
cin >> n >> W;
long long weight[n], values[n];
long long dp[n][W + 1];
for (int i = 0; i < n; ++i) {
cin >> weight[i] >> values[i];
}
for (int i = 0; i <= n; i++) {
for (int w = 0; w <= W; w++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long n, W;
cin >> n >> W;
long long weight[n], values[n];
long long dp[n + 1][W + 1];
for (int i = 0; i < n; ++i) {
cin >> weight[i] >> values[i];
}
for (int i = 0; i <= n; i++) {
for (int w = 0; w <= W; w++)... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 970,851 | 970,852 | u955269787 | cpp |
p03163 | /*
For the brave souls who are here: You are the chosen ones, the valiant
knights of coding who toil away, without rest, fixing my most awful
code. To you, true saviors, kings of men, I say this:
never gonna give you up, never gonna let you down,
never gonna run around and desert you. Never gonna make you cry,
never go... | /*
For the brave souls who are here: You are the chosen ones, the valiant
knights of coding who toil away, without rest, fixing my most awful
code. To you, true saviors, kings of men, I say this:
never gonna give you up, never gonna let you down,
never gonna run around and desert you. Never gonna make you cry,
never go... | [] | 970,862 | 970,863 | u372798233 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100100
int n, w, a[MAXN], b[MAXN], dp[110][MAXN];
long long r;
int main() {
cin >> n >> w;
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= w; ++j) {
if (i == 0) {
if (a[i] <... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100100
long long n, w, a[MAXN], b[MAXN], dp[110][MAXN];
int main() {
cin >> n >> w;
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= w; ++j) {
if (i == 0) {
if (a[i] <= j) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.remove"
] | 970,886 | 970,887 | u463720901 | cpp |
p03163 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long i, j, n, w[100001], v[100001], W;
// freopen("INPUT.INP","r",stdin);
cin >> n >> W;
long long f[n + 1][W];
for (i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
f[0][0] = 0;
for (i = 0; i <= n; i++)
f[i][0] = 0;
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long i, j, n, w[100001], v[100001], W;
// freopen("INPUT.INP","r",stdin);
cin >> n >> W;
long long f[n + 1][W + 1];
for (i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
f[0][0] = 0;
for (i = 0; i <= n; i++)
f[i][0] = 0;... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 970,890 | 970,891 | u290380461 | cpp |
p03163 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int i, j, n, w[100001], v[100001], W;
// freopen("INPUT.INP","r",stdin);
cin >> n >> W;
long long f[n + 1][W];
for (i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
f[0][0] = 0;
for (i = 0; i <= n; i++)
f[i][0] = 0;
for (j... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long i, j, n, w[100001], v[100001], W;
// freopen("INPUT.INP","r",stdin);
cin >> n >> W;
long long f[n + 1][W + 1];
for (i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
f[0][0] = 0;
for (i = 0; i <= n; i++)
f[i][0] = 0;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 970,892 | 970,891 | u290380461 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> p;
const int maxn = 100000 + 10;
ll dp[110][maxn];
int n;
vector<p> snacks;
ll dfs(int step, int restSize) {
if (step == n or restSize == 0)
return 0;
if (dp[step][restSize] != -1)
return dp[step][restSize];
l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> p;
const int maxn = 100000 + 10;
ll dp[110][maxn];
int n;
vector<p> snacks;
ll dfs(int step, int restSize) {
if (step == n or restSize == 0)
return 0;
if (dp[step][restSize] != -1)
return dp[step][restSize];
l... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 970,893 | 970,894 | u418120992 | cpp |
p03163 | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, w;
cin >> n >> w;
vector<pair<int, int>> items;
for (int i = 0; i < n; i++) {
int a, b;
... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define int ll
using namespace std;
typedef long long ll;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, w;
cin >> n >> w;
vector<pair<int, int>> items;
for (int i = 0; i < n; i++... | [
"variable_declaration.type.primitive.change"
] | 970,902 | 970,903 | u855714015 | cpp |
p03163 | /**********************************************************************/
/******** ********/
/******** Writer:孙~~ ********/
/******** Lang:C++ ********/
/******** ... | /**********************************************************************/
/******** ********/
/******** Writer:孙~~ ********/
/******** Lang:C++ ********/
/******** ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 970,906 | 970,907 | u190596522 | cpp |
p03163 | // Author: 23forever
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
typedef long long LL;
const int MAXN = 100;
const int MAXM = 100000;
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = ' ';
while (c < '0' || c > '9') {
c = getc... | // Author: 23forever
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
typedef long long LL;
const int MAXN = 100;
const int MAXM = 100000;
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = ' ';
while (c < '0' || c > '9') {
c = getc... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 970,908 | 970,909 | u794477892 | cpp |
p03163 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FORE(i, a, b) for (int i = a; i <= b; i++)
#define ll long lo... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FORE(i, a, b) for (int i = a; i <= b; i++)
#define ll long lo... | [
"variable_declaration.type.change"
] | 970,910 | 970,911 | u191452571 | cpp |
p03163 | #include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
const int maxN = 110, maxW = 1e5 + 10;
int w[maxN], v[maxN], W, n;
long long f[maxN][maxW];
// Max value chon tu i -> n with capacity weight
long long calculate(int i, int weight) {
if (i > n)
return 0;
if (f[i][weight] != -1)
... | #include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
const int maxN = 110, maxW = 1e5 + 10;
int w[maxN], v[maxN], W, n;
long long f[maxN][maxW];
// Max value chon tu i -> n with capacity weight
long long calculate(int i, int weight) {
if (i > n)
return 0;
if (f[i][weight] != -1)
... | [
"literal.string.change",
"call.arguments.change"
] | 970,921 | 970,922 | u722318795 | cpp |
p03163 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace ::std;
#define int long long
vector<int> v;
signed main() {
int n, k;
cin >> n >> k;
v.resize(k + 1, -1);
v[0] = 0;
int f = 0;
int ans = 0;
for (int i = 0; i < ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace ::std;
#define int long long
vector<int> v;
signed main() {
int n, k;
cin >> n >> k;
v.resize(k + 1, -1);
v[0] = 0;
int f = 0;
int ans = 0;
for (int i = 0; i < ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 970,923 | 970,924 | u095384223 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int w[n];
long long int v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long int knap[W + 1];
int flag[W + 1][n];
knap[0] = 0;
for (int j = 0; j < n; j++)
flag[0][j] = 0;
for (int i = 1; i <= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int w[n];
long long int v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long int knap[W + 1];
int flag[W + 1][n];
knap[0] = 0;
for (int j = 0; j < n; j++)
flag[0][j] = 0;
for (int i = 1; i <= ... | [
"variable_declaration.value.change"
] | 970,926 | 970,927 | u010432749 | cpp |
p03163 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 970,931 | 970,929 | u054106284 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[123456];
int N, W, price[123], wt[123];
int32_t main() {
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> wt[i] >> price[i];
}
for (int i = 0; i < N; i++) {
for (int j = W - wt[i]; j >= 0; j--) {
dp[j + wt[i]] = max(dp[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[123456];
int N, W, price[123], wt[123];
int32_t main() {
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> wt[i] >> price[i];
}
for (int i = 0; i < N; i++) {
for (int j = W - wt[i]; j >= 0; j--) {
dp[j + wt[i]] = max(dp[... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 970,934 | 970,935 | u745631549 | cpp |
p03163 | #include <bits/stdc++.h>
#include <ext/hash_map>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define REP(i, n) for ((i) = 0; (i) < (n); (i)++)
#define rep(i, x, n) for ((i) = (x); (i) < (n); (i)++)
#define REV(i, n) for ((i) = (n); (i) >= 0; (i)--)
#define FORIT(it, x) for ((it) = (x).begin... | #include <bits/stdc++.h>
#include <ext/hash_map>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define REP(i, n) for ((i) = 0; (i) < (n); (i)++)
#define rep(i, x, n) for ((i) = (x); (i) < (n); (i)++)
#define REV(i, n) for ((i) = (n); (i) >= 0; (i)--)
#define FORIT(it, x) for ((it) = (x).begin... | [
"variable_declaration.type.change"
] | 970,947 | 970,948 | u362821344 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define modulo 1000000007 // 10^9 + 7
#define MAX 1000000000 // 10^9
int w[100 ... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define modulo 1000000007 // 10^9 + 7
#define MAX 1000000000 // 10^9
int w[100 ... | [
"variable_declaration.type.change"
] | 970,951 | 970,952 | u774652316 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w1;
cin >> n >> w1;
std::vector<int> w(n + 1);
std::vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
vector<vector<int>> f(n + 1, vector<int>(w1 + 1, 0));
// for(int i=0;i<=w1;i++)f[0][i]=0;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w1;
cin >> n >> w1;
std::vector<int> w(n + 1);
std::vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
vector<vector<long>> f(n + 1, vector<long>(w1 + 1, 0));
// for(int i=0;i<=w1;i++)f[0][i]=0;
for (int i ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 970,953 | 970,954 | u765576524 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.