problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03163 | #include <bits/stdc++.h>
using namespace std;
pair<int, int> sac[105]; // first : poids, second : valeur
int dp[2][100010];
int main() {
int nItem;
scanf("%d", &nItem);
int iCapacite;
scanf("%d", &iCapacite);
for (int i = 0; i < nItem; i++) {
scanf("%d %d", &sac[i].first, &sac[i].second);
}
for (int i... | #include <bits/stdc++.h>
using namespace std;
pair<int, int> sac[105]; // first : poids, second : valeur
long long dp[2][100010];
int main() {
int nItem;
scanf("%d", &nItem);
int iCapacite;
scanf("%d", &iCapacite);
for (int i = 0; i < nItem; i++) {
scanf("%d %d", &sac[i].first, &sac[i].second);
}
for ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,750 | 968,751 | u202771336 | cpp |
p03163 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
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... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
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... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 968,760 | 968,761 | u183971632 | cpp |
p03163 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
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... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
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... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 968,762 | 968,761 | u183971632 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, W;
cin >> n >> W;
long long w[n + 1], v[n + 1];
for (long long i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
long long mat[n + 1][W + 1];
memset(mat, 0, sizeof(mat));
for (long long i = 1; i <= n; i++) {
for (long long j = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, W;
cin >> n >> W;
long long w[n + 1], v[n + 1];
for (long long i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
long long mat[n + 1][W + 1];
memset(mat, 0, sizeof(mat));
for (long long i = 1; i <= n; i++) {
for (long long j = ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 968,763 | 968,764 | u430341757 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
inline void Boost() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
typedef long long int ll;
typedef long double ld;
int main() {
Boost();
int n, w;
cin >> n >> w;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i]... | #include <bits/stdc++.h>
using namespace std;
inline void Boost() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
typedef long long int ll;
typedef long double ld;
int main() {
Boost();
int n, w;
cin >> n >> w;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i]... | [] | 968,765 | 968,766 | u721819880 | cpp |
p03163 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, h;
cin >> n >> h;
int w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
int z[n + 1][h + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= h; j++) {
if (i == 0 || j == 0)
z[i][j] = 0;
e... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, h;
cin >> n >> h;
int w[n], v[n];
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
long long int z[n + 1][h + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= h; j++) {
if (i == 0 || j == 0)
z[i][j] = ... | [
"variable_declaration.type.widen.change"
] | 968,773 | 968,774 | u193815565 | cpp |
p03163 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int v[n], wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> v[i];
}
int dp[n + 1][W + 1] = {0};
for (int i = 0; i <= n; i++) {
for (int w = 0; w <= W; w++) {
if (i == 0 || w == 0)
d... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int v[n], wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> v[i];
}
long dp[n + 1][W + 1] = {0};
for (int i = 0; i <= n; i++) {
for (int w = 0; w <= W; w++) {
if (i == 0 || w == 0)
... | [
"variable_declaration.type.primitive.change"
] | 968,775 | 968,776 | u241428352 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long int n, W, weight[101], value[101], dp[101][N];
long long int calc(int index, int w) {
if (w < 0)
return -1e12; // base case 1
if (index == n)
return 0; // base case 2
if (dp[index][w] !=
-1) // if we already calculate... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long int n, W, weight[101], value[101], dp[101][N];
long long int calc(int index, int w) {
if (w < 0)
return -2e12; // base case 1
if (index == n)
return 0; // base case 2
if (dp[index][w] !=
-1) // if we already calculate... | [
"literal.number.change",
"function.return_value.change"
] | 968,779 | 968,780 | u221592478 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long int n, W, weight[101], value[101], dp[101][N];
long long int calc(int index, int w) {
if (w < 0)
return -1e17; // base case 1
if (index == n)
return 0; // base case 2
if (dp[index][w] !=
-1) // if we already calculate... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long int n, W, weight[101], value[101], dp[101][N];
long long int calc(int index, int w) {
if (w < 0)
return -2e12; // base case 1
if (index == n)
return 0; // base case 2
if (dp[index][w] !=
-1) // if we already calculate... | [
"literal.number.change",
"function.return_value.change"
] | 968,781 | 968,780 | u221592478 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long int n, W, weight[101], value[101], dp[101][N];
long long int calc(int index, int w) {
if (w < 0)
return -1e9; // base case 1
if (index == n)
return 0; // base case 2
if (dp[index][w] !=
-1) // if we already calculated... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long int n, W, weight[101], value[101], dp[101][N];
long long int calc(int index, int w) {
if (w < 0)
return -2e12; // base case 1
if (index == n)
return 0; // base case 2
if (dp[index][w] !=
-1) // if we already calculate... | [
"literal.number.change",
"function.return_value.change"
] | 968,782 | 968,780 | u221592478 | cpp |
p03163 | #include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define mk make_pair
#define pb push_back
#define pp pop_back
using namespace std;
const ll N = 1e5 + 100;
ll a[N], b[N], n, w, dp[101][N];
vector<vector<int>> v;
int cal(int index, int sum) {
if (sum > w) {
return -1e6;
}
if (ind... | #include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define mk make_pair
#define pb push_back
#define pp pop_back
using namespace std;
const ll N = 1e5 + 100;
ll a[N], b[N], n, w, dp[101][N];
vector<vector<int>> v;
ll cal(int index, int sum) {
if (sum > w) {
return -1e12;
}
if (ind... | [
"literal.number.change",
"function.return_value.change",
"variable_declaration.type.change"
] | 968,786 | 968,784 | u463187227 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 123456;
ll dp[110][maxn];
int w[110], v[110];
const int inf = 0x7f7f7f7f;
int main() {
// freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, W;
cin >> n >> W;
memset(dp, 0, sizeof(dp));
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 123456;
ll dp[110][maxn];
int w[110], v[110];
const int inf = 0x7f7f7f7f;
int main() {
// freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, W;
cin >> n >> W;
memset(dp, 0, sizeof(dp));
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 968,797 | 968,798 | u608624039 | cpp |
p03163 | // knapsack
#include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define pb push_back
#define ll long long int
#define mod 1000000007
const int N = ... | // knapsack
#include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define pb push_back
#define int long long int
#define mod 1000000007
const int N =... | [
"identifier.change",
"literal.number.change",
"function.return_value.change"
] | 968,799 | 968,800 | u534846896 | cpp |
p03163 | // knapsack
#include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define pb push_back
#define ll long long int
#define mod 1000000007
const int N = ... | // knapsack
#include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define pb push_back
#define int long long int
#define mod 1000000007
const int N =... | [
"identifier.change"
] | 968,801 | 968,800 | u534846896 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
const int N = 100007;
int A[N], W[N];
int main() {
int n, w;
cin >> n >> w;
int dp[n + 1][w + 1];
for (int i = 0; i < n; ++i)
cin >> W[i] >> A[i];
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= w; ++j) {
if (i == 0 || j == 0)
dp[i][j] = ... | #include <bits/stdc++.h>
using namespace std;
const int N = 100007;
long long A[N], W[N];
int main() {
int n, w;
cin >> n >> w;
long long dp[n + 1][w + 1];
for (int i = 0; i < n; ++i)
cin >> W[i] >> A[i];
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= w; ++j) {
if (i == 0 || j == 0)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,811 | 968,812 | u588613695 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
W++;
vector<int> v(N), w(N);
vector<vector<int>> dp(N, vector<int>(W, 0));
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
for (int s = w[0]; s < W; s++) {
dp[0][s] = v[0];
}
for (int i = 1; i < N; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
W++;
vector<int> v(N), w(N);
vector<vector<long>> dp(N, vector<long>(W, 0));
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
for (int s = w[0]; s < W; s++) {
dp[0][s] = v[0];
}
for (int i = 1; i < N;... | [
"variable_declaration.type.primitive.change"
] | 968,822 | 968,823 | u506320030 | cpp |
p03163 | #include <bits/stdc++.h>
#define Nmax 100005
#include <cmath>
#define INF 0x3f3f3f3f
using namespace std;
ifstream f("1.in");
ofstream g("1.out");
int n, k, dp[105][Nmax];
int w, v, W, ans;
int main() {
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w >> v;
for (int j = 0; j <= W; j++)
if (... | #include <bits/stdc++.h>
#define Nmax 100005
#include <cmath>
#define INF 0x3f3f3f3f
using namespace std;
ifstream f("1.in");
ofstream g("1.out");
long long n, k, dp[105][Nmax];
long long w, v, W, ans;
int main() {
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w >> v;
for (int j = 0; j <= W; j++... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,824 | 968,825 | u275238097 | cpp |
p03163 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, w;
cin >> n >> w;
int d[n], v[n];
int a[w + 1];
for (int i = 0; i < w + 1; i++)
a[i] = 0;
for (int i = 0; i < n; i++)
cin >> d[i] >> v[i];
for (int i = 0; i < n; i++)
... | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, w;
cin >> n >> w;
long long d[n], v[n];
long long a[w + 1];
for (int i = 0; i < w + 1; i++)
a[i] = 0;
for (int i = 0; i < n; i++)
cin >> d[i] >> v[i];
for (int i = 0; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,826 | 968,827 | u276066929 | cpp |
p03163 | /*
solution by :
Beksultan Almazbekov
;
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int w[3546], v[3546], q[123123];
int main() {
int mx = INT_MIN, n, m, i, j;
cin >> n >> m;
for (i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (i = 0; i < ... | /*
solution by :
Beksultan Almazbekov
;
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll w[3546], v[3546], q[123123];
int main() {
ll mx = 0, n, m, i, j;
cin >> n >> m;
for (i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (i = 0; i < n; ++i) ... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 968,828 | 968,829 | u330398764 | cpp |
p03163 | // finish date: 2019/2/22
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector... | // finish date: 2019/2/22
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 968,832 | 968,833 | u285660186 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int w;
cin >> w;
vector<int> wt;
vector<int> val;
for (int i = 0; i < n; i++) {
int u;
cin >> u;
wt.push_back(u);
cin >> u;
val.push_back(u);
}
int dp[n + 1][w + 1];
memset(dp, 0, sizeof(dp));
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int w;
cin >> w;
vector<int> wt;
vector<int> val;
for (int i = 0; i < n; i++) {
int u;
cin >> u;
wt.push_back(u);
cin >> u;
val.push_back(u);
}
long long int dp[n + 1][w + 1];
memset(dp, 0, sizeof... | [
"variable_declaration.type.widen.change"
] | 968,834 | 968,835 | u988725912 | cpp |
p03163 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
typedef long long ll;
using namespace std;
int n, w;
int wei[101], val[100001];
int dp[101][100001];
ll napzac(int i, int j) {
if (dp[i][j] >= 0) {
return dp[i][j];
}
ll res;
if (i == n) ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
typedef long long ll;
using namespace std;
int n, w;
int wei[101], val[100001];
ll dp[101][100001];
ll napzac(int i, int j) {
if (dp[i][j] >= 0) {
return dp[i][j];
}
ll res;
if (i == n) {... | [
"variable_declaration.type.change"
] | 968,836 | 968,837 | u629194491 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
long long f[101][100001] = {0};
int w[101], v[101];
int main() {
int n, W, i, j;
scanf("%d %d", &n, &W);
for (i = 1; i <= n; i++)
scanf("%d %d", &w[i], &v[i]);
for (i = 1; i <= n; i++) {
for (j = 1; j <= W; j++) {
if (j < w[i])
f[i][j] = f[i - ... | #include <bits/stdc++.h>
using namespace std;
long long f[101][100001] = {0};
int w[101], v[101];
int main() {
int n, W, i, j;
scanf("%d %d", &n, &W);
for (i = 1; i <= n; i++)
scanf("%d %d", &w[i], &v[i]);
for (i = 1; i <= n; i++) {
for (j = 1; j <= W; j++) {
if (j < w[i])
f[i][j] = f[i - ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,849 | 968,850 | u379393519 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int f[101][100001] = {0}, w[101], v[101];
int main() {
int n, W, i, j;
scanf("%d %d", &n, &W);
for (i = 1; i <= n; i++)
scanf("%d %d", &w[i], &v[i]);
for (i = 1; i <= n; i++) {
for (j = 1; j <= W; j++) {
if (j < w[i])
f[i][j] = f[i - 1][j];
... | #include <bits/stdc++.h>
using namespace std;
long long f[101][100001] = {0};
int w[101], v[101];
int main() {
int n, W, i, j;
scanf("%d %d", &n, &W);
for (i = 1; i <= n; i++)
scanf("%d %d", &w[i], &v[i]);
for (i = 1; i <= n; i++) {
for (j = 1; j <= W; j++) {
if (j < w[i])
f[i][j] = f[i - ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,851 | 968,850 | u379393519 | cpp |
p03163 | #include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ri(x) scanf("%d", &(x))
#define ri2(x, y) scanf("%d %d", &(x), &(y))
#define ri3(x, y, z) scanf("%d %d %d", &(x), &(y), &(z))
#define rll(x) scanf("%lld", &(x))
#define rll2(x, y) scanf(... | #include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ri(x) scanf("%d", &(x))
#define ri2(x, y) scanf("%d %d", &(x), &(y))
#define ri3(x, y, z) scanf("%d %d %d", &(x), &(y), &(z))
#define rll(x) scanf("%lld", &(x))
#define rll2(x, y) scanf(... | [
"variable_declaration.type.change",
"literal.number.type.widen.change",
"literal.number.change",
"expression.operation.binary.change"
] | 968,852 | 968,853 | u200221740 | cpp |
p03163 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | [
"variable_declaration.type.change"
] | 968,858 | 968,859 | u750436322 | cpp |
p03163 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | [
"variable_declaration.type.change"
] | 968,860 | 968,859 | u750436322 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
long long ww;
cin >> ww;
long long w[n];
long long v[n];
for (int i = 0; i < n; i++) {
cin >> v[i] >> w[i];
}
long long dp[ww + 1][n + 1];
long long x, y;
mems... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
int ww;
cin >> ww;
long long w[n];
long long v[n];
for (int i = 0; i < n; i++) {
cin >> v[i] >> w[i];
}
long long dp[n + 1][ww + 1];
long long x, y;
memset(dp,... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"identifier.change",
"expression.operation.binary.change"
] | 968,861 | 968,862 | u401648470 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(v) v.b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(v) v.b... | [
"variable_declaration.type.change"
] | 968,863 | 968,864 | u817703858 | cpp |
p03163 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
#define MAX_DOUBLE 40000000000.0
#include <math.h>
#include <unistd.h>
using namespace std;
int min(int a, int b) {
if (a > b)
r... |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
#define MAX_DOUBLE 40000000000.0
#include <math.h>
#include <unistd.h>
using namespace std;
int min(int a, int b) {
if (a > b)
r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,872 | 968,873 | u492909866 | cpp |
p03163 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
#define MAX_DOUBLE 40000000000.0
#include <math.h>
#include <unistd.h>
using namespace std;
int min(int a, int b) {
if (a > b)
r... |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
#define MAX_DOUBLE 40000000000.0
#include <math.h>
#include <unistd.h>
using namespace std;
int min(int a, int b) {
if (a > b)
r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,874 | 968,873 | u492909866 | cpp |
p03163 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"expression.unary.arithmetic.add"
] | 968,875 | 968,876 | u118846704 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#incl... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#incl... | [
"call.arguments.change"
] | 968,877 | 968,878 | u966854856 | cpp |
p03163 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, m, n) for (int i = m; i < n; i++)
using namespace std;
using ll = long long;
const ll inf = 1LL << 5... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, m, n) for (int i = m; i < n; i++)
using namespace std;
using ll = long long;
const ll inf = 1LL << 5... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 968,897 | 968,898 | u724732842 | cpp |
p03163 | #include <algorithm>
#include <iostream>
using namespace std;
long long
dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
... | #include <algorithm>
#include <iostream>
using namespace std;
long long
dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 968,906 | 968,907 | u010393289 | cpp |
p03163 | #include <algorithm>
#include <iostream>
using namespace std;
int dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
for (int... | #include <algorithm>
#include <iostream>
using namespace std;
long long
dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,908 | 968,907 | u010393289 | cpp |
p03163 | #include <algorithm>
#include <iostream>
using namespace std;
int dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
for (int... | #include <algorithm>
#include <iostream>
using namespace std;
long long
dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 968,909 | 968,907 | u010393289 | cpp |
p03163 | #include <algorithm>
#include <iostream>
using namespace std;
int dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
for (int... | #include <algorithm>
#include <iostream>
using namespace std;
long long
dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,910 | 968,907 | u010393289 | cpp |
p03163 | #include <algorithm>
#include <iostream>
using namespace std;
int dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 1; i <= N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
for (in... | #include <algorithm>
#include <iostream>
using namespace std;
long long
dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"... | 968,912 | 968,907 | u010393289 | cpp |
p03163 | #include <algorithm>
#include <iostream>
using namespace std;
int dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 1; j <= W; j++)
dp[0][j] = 0;
for (int... | #include <algorithm>
#include <iostream>
using namespace std;
long long
dp[110][100010]; // dp[i][j]はi番目までの品物を重さjまでに入れたときの最大値
int main() {
int N;
int W;
int v[110], w[110];
cin >> N >> W;
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
// dp初期条件
for (int j = 0; j <= W; j++)
dp[0][j] = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 968,913 | 968,907 | u010393289 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | [
"variable_declaration.type.change"
] | 968,914 | 968,915 | u141378465 | cpp |
p03163 | /* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
* if you have no idea just guess the appropriate well-known algo instead of
* doing nothing :/
*/
// Author:: Subash Singha Roy
// Institution:: Jalpaiguri Government En... | /* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
* if you have no idea just guess the appropriate well-known algo instead of
* doing nothing :/
*/
// Author:: Subash Singha Roy
// Institution:: Jalpaiguri Government En... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 968,921 | 968,922 | u569396461 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int d[101][100001];
int main() {
memset(d, 0, sizeof(d));
int n, wt;
cin >> n >> wt;
for (int i = 1; i <= n; i++) {
int w, v;
cin >> w >> v;
for (int j = 1; j < w; j++)
d[i][j] = d[i - 1][j];
for (int j... | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
long long d[101][100001];
int main() {
memset(d, 0, sizeof(d));
int n, wt;
cin >> n >> wt;
for (int i = 1; i <= n; i++) {
int w, v;
cin >> w >> v;
for (int j = 1; j < w; j++)
d[i][j] = d[i - 1][j];
for ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,923 | 968,924 | u597243424 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
//#define int ll
int N, W, w[101], v[101], dp[101][100001];
signed main() {
ios_base::sync_with_stdio(0);
cin.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define int ll
int N, W, w[101], v[101], dp[101][100001];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(... | [] | 968,925 | 968,926 | u192208612 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> f(m + 1, 0);
while (n--) {
int cw, cv;
cin >> cw >> cv;
for (int j = cw; j >= cw; j--)
f[j] = max(f[j], f[j - cw] + cv);
}
cout << *max_element(f.begin(), f.end());
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> f(m + 1, 0);
while (n--) {
int cw, cv;
cin >> cw >> cv;
for (int j = m; j >= cw; j--)
f[j] = max(f[j], f[j - cw] + cv);
}
cout << *max_element(f.begin(), f.end());
}
| [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 968,929 | 968,930 | u596976719 | cpp |
p03163 | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 100100;
const long long mod = 1e9 + 9;
using namespace std;
int n;
int k;
int d[N];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin >> n >> k;
for (int i =... | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 100100;
const long long mod = 1e9 + 9;
using namespace std;
int n;
int k;
long long d[N];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin >> n >> k;
for (i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,950 | 968,951 | u941977569 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cps CLOCKS_PER_SEC
#define mod (ll)1000000007
#define f first
#define s second
#define debug1(x) cerr << x << "\n"
#define debug2(x, y) cerr << x << " " << y << "\n"
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cps CLOCKS_PER_SEC
#define mod (ll)1000000007
#define f first
#define s second
#define debug1(x) cerr << x << "\n"
#define debug2(x, y) cerr << x << " " << y << "\n"
#de... | [
"variable_declaration.type.change"
] | 968,965 | 968,966 | u450036612 | cpp |
p03163 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <queue>
#define qmin(x, y) (x = min(x, y))
#define qmax(x, y) (x = max(x, y))
using namespace std;
inline char gc() {
// static char buf[100000],*p1,*p2;
// return
//(p1==p2)&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <queue>
#define qmin(x, y) (x = min(x, y))
#define qmax(x, y) (x = max(x, y))
using namespace std;
inline char gc() {
// static char buf[100000],*p1,*p2;
// return
//(p1==p2)&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,970 | 968,971 | u360800499 | cpp |
p03163 | #include <algorithm>
#include <stdio.h>
using namespace std;
const int MAX_N = 105;
struct item {
int v, m;
};
int F[MAX_N][100005];
int n, M;
item save[MAX_N];
int main() {
scanf("%d %d", &n, &M);
for (int i = 1; i <= n; i++)
scanf("%d %d", &save[i].m, &save[i].v);
for (int i = 1; i <= n; i++)
f... | #include <algorithm>
#include <stdio.h>
using namespace std;
const int MAX_N = 105;
struct item {
int v, m;
};
long long F[MAX_N][100005];
int n, M;
item save[MAX_N];
int main() {
scanf("%d %d", &n, &M);
for (int i = 1; i <= n; i++)
scanf("%d %d", &save[i].m, &save[i].v);
for (int i = 1; i <= n; i++)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,972 | 968,973 | u799820634 | cpp |
p03163 | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define vi vector<int>
#define pii pai... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define vi vector<int>
#define pii pai... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,983 | 968,984 | u298360432 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
// using lint = long long;
struct P {
int x, y;
bool operator<(const P &a) const {
if (x != a.x)
return x > a.x;
return y > a.y;
}
};
vector<int> v[111111], v1;
// bitset<4001000> b;
int i, n, d, m, k, a, b, c, h;
int o[111];
long long l[111][111115... | #include <bits/stdc++.h>
using namespace std;
// using lint = long long;
struct P {
int x, y;
bool operator<(const P &a) const {
if (x != a.x)
return x > a.x;
return y > a.y;
}
};
vector<int> v[111111], v1;
// bitset<4001000> b;
int i, n, d, m, k, a, b, c, h;
int o[111];
long long l[111][111115... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"function.return_value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 968,991 | 968,992 | u428070871 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int n, W;
int w[155], v[155];
int dp[100055];
int main() {
cin >> n >> W;
for (int i = 0; i < n; i++) {
scanf("%d %d", &w[i], &v[i]);
}
for (int i = 0; i < n; i++) {
for (int j = W; j >= w[i]; j--) {
dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
}
... | #include <bits/stdc++.h>
using namespace std;
int n, W;
int w[155], v[155];
long long dp[100055];
int main() {
cin >> n >> W;
for (int i = 0; i < n; i++) {
scanf("%d %d", &w[i], &v[i]);
}
for (int i = 0; i < n; i++) {
for (int j = W; j >= w[i]; j--) {
dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 968,997 | 968,998 | u542172770 | cpp |
p03163 | #include <iostream>
#define int long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
// const int MOD = 10e9+7;
const int INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
retur... | #include <iostream>
#define int long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
// const int MOD = 10e9+7;
const int INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
retur... | [
"expression.operation.binary.add"
] | 968,999 | 969,000 | u904833081 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<vector<int>> dp(N, vector<int>(W + 1, 0));
vector<pair<int, int>> a(N);
for (auto &x : a)
cin >> x.first >> x.second;
for (int i = 0; i < N; i++) {
for (... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<vector<long>> dp(N, vector<long>(W + 1, 0));
vector<pair<int, int>> a(N);
for (auto &x : a)
cin >> x.first >> x.second;
for (int i = 0; i < N; i++) {
for... | [
"variable_declaration.type.primitive.change"
] | 969,005 | 969,006 | u598869726 | cpp |
p03163 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define LL long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
in... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define LL long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
LL... | [
"variable_declaration.type.change"
] | 969,013 | 969,014 | u170464980 | cpp |
p03163 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; 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 = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; 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 = ma... | [
"variable_declaration.type.change"
] | 969,023 | 969,024 | u791593901 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 969,027 | 969,028 | u504142483 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 969,027 | 969,029 | u504142483 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long int
#define vi vector<int>
#define pii pair<long long, long long>
#define pll pair<int, int>
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb push_back
#define ff first
#defin... | #include <bits/stdc++.h>
#define int long long int
#define vi vector<int>
#define pii pair<long long, long long>
#define pll pair<int, int>
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb push_back
#define ff first
#defin... | [
"assignment.change"
] | 969,030 | 969,031 | u959659903 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long int
#define vi vector<int>
#define pii pair<long long, long long>
#define pll pair<int, int>
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb push_back
#define ff first
#defin... | #include <bits/stdc++.h>
#define int long long int
#define vi vector<int>
#define pii pair<long long, long long>
#define pll pair<int, int>
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb push_back
#define ff first
#defin... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 969,032 | 969,031 | u959659903 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
ll dp[101][100001];
int n, w;
ll s[101][3];
int go(int idx, int rem) {
if (idx == n)
return 0;
ll &ret = dp[idx][rem];
if (ret != -1)
return ret;
ret = 0;
if (rem - s[idx][0] >= 0) {
ret = max(re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
ll dp[101][100001];
ll n, w;
ll s[101][3];
ll go(int idx, int rem) {
if (idx >= n)
return 0;
ll &ret = dp[idx][rem];
if (ret != -1) {
return ret;
}
ret = 0;
if (rem - s[idx][0] >= 0) {
ret = ma... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 969,033 | 969,034 | u188000196 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
ll dp[101][100001];
int n, w;
ll s[101][3];
int go(int idx, int rem) {
if (idx == n)
return 0;
ll &ret = dp[idx][rem];
if (ret != -1)
return ret;
ret = 0;
if (rem - s[idx][0] >= 0) {
ret = max(re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
ll dp[101][100001];
ll n, w;
ll s[101][3];
ll go(int idx, int rem) {
if (idx >= n)
return 0;
ll &ret = dp[idx][rem];
if (ret != -1) {
return ret;
}
ret = 0;
if (rem - s[idx][0] >= 0) {
ret = ma... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change"
] | 969,035 | 969,034 | u188000196 | cpp |
p03163 | //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case (t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) ... | //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case (t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) ... | [
"preprocessor.define.value.change"
] | 969,038 | 969,039 | u270920804 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int dp[101][100001];
int n, k;
int we[101], val[101];
long long go(int i, int k) {
if (i >= n || k < 0)
return 0;
else {
if (dp[i][k] == -1) {
if (we[i] > k)
dp[i][k] = go(i + 1, k);
else
dp[i][k] = max(val[i] + go(i + 1, k - we[i])... | #include <bits/stdc++.h>
using namespace std;
long long dp[101][100001];
int n, k;
int we[101], val[101];
long long go(int i, int k) {
if (i >= n || k < 0)
return 0;
else {
if (dp[i][k] == -1) {
if (we[i] > k)
dp[i][k] = go(i + 1, k);
else
dp[i][k] = max(val[i] + go(i + 1, k - ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 969,053 | 969,054 | u221519228 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
// basic knap question
vector<int> lw(N);
vector<int> lv(N);
for (int i = 0; i < N; i++)
cin >> lw[i] >> lv[i];
vector<vector<long long>> f(W + 1, vector<long long>(N + 1));
for (int i = 1; i <= W; i++)... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
// basic knap question
vector<int> lw(N);
vector<int> lv(N);
for (int i = 0; i < N; i++)
cin >> lw[i] >> lv[i];
vector<vector<long long>> f(W + 1, vector<long long>(N + 1));
for (int i = 1; i <= W; i++)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 969,067 | 969,068 | u905802918 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
// basic knap question
vector<int> lw(N);
vector<int> lv(N);
for (int i = 0; i < N; i++)
cin >> lw[i] >> lv[i];
vector<vector<int>> f(W + 1, vector<int>(N + 1));
for (int i = 1; i <= W; i++) {
for (... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
// basic knap question
vector<int> lw(N);
vector<int> lv(N);
for (int i = 0; i < N; i++)
cin >> lw[i] >> lv[i];
vector<vector<long long>> f(W + 1, vector<long long>(N + 1));
for (int i = 1; i <= W; i++)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 969,069 | 969,068 | u905802918 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, W;
cin >> n >> W;
long w[n], v[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
long dp[n][W];
for (int i = 0; i <= W; i++) {
dp[0][i] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= W; j++) {
if (j... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, W;
cin >> n >> W;
long w[n], v[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
long dp[n + 1][W + 1];
for (int i = 0; i <= W; i++) {
dp[0][i] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= W; j++) {
... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 969,074 | 969,075 | u911147723 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#include <vector>
int max(int a, int b) { return (a > b) ? a : b; };
int main() {
int N, W, a, b;
cin >> N >> W;
vector<int> v;
vector<int> wt;
for (int i = 0; i < N; ++i) {
cin >> a;
wt.push_back(a);
cin >> b;
v.push_back(b);
}
int i, w;
int... | #include <bits/stdc++.h>
using namespace std;
#include <vector>
int max(int a, int b) { return (a > b) ? a : b; };
int main() {
long long int N, W, a, b;
cin >> N >> W;
vector<int> v;
vector<int> wt;
for (int i = 0; i < N; ++i) {
cin >> a;
wt.push_back(a);
cin >> b;
v.push_back(b);
}
long ... | [
"variable_declaration.type.widen.change"
] | 969,080 | 969,081 | u343520219 | cpp |
p03164 | #include <bits/stdc++.h>
// DEEP
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)... | #include <bits/stdc++.h>
// DEEP
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 969,094 | 969,095 | u915716225 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
ll max_val = 1e5;
int main() {
ll n, w, a, b;
cin >> n >> w;
vector<ll> val, wgt;
for (int i = 0; i < n; i++) {
cin >> a >> b;
wgt.pb(a);
val.pb(b);
}
vector<vector<ll>> dp(n + 1, vector<ll>(max_val + 1));
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
ll max_val = 1e5;
int main() {
ll n, w, a, b;
cin >> n >> w;
vector<ll> val, wgt;
for (int i = 0; i < n; i++) {
cin >> a >> b;
wgt.pb(a);
val.pb(b);
}
vector<vector<ll>> dp(n + 1, vector<ll>(max_val + 1));
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.change"
] | 969,106 | 969,107 | u010088425 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
ll n, w, tv = 0;
ll weights[101];
ll values[101];
// unordered_map<string,int> dpmap;
// ll dp(int pos, ll weight)
// {
// if(weight<0)
// return INT_MIN;
// if(pos<0||weight==0)
// return 0;
// string key = to_str... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
ll n, w, tv = 0;
ll weights[101];
ll values[101];
// unordered_map<string,int> dpmap;
// ll dp(int pos, ll weight)
// {
// if(weight<0)
// return INT_MIN;
// if(pos<0||weight==0)
// return 0;
// string key = to_str... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 969,110 | 969,109 | u337353034 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
ll n, w, tv = 0;
ll weights[101];
ll values[101];
// unordered_map<string,int> dpmap;
// ll dp(int pos, ll weight)
// {
// if(weight<0)
// return INT_MIN;
// if(pos<0||weight==0)
// return 0;
// string key = to_str... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
ll n, w, tv = 0;
ll weights[101];
ll values[101];
// unordered_map<string,int> dpmap;
// ll dp(int pos, ll weight)
// {
// if(weight<0)
// return INT_MIN;
// if(pos<0||weight==0)
// return 0;
// string key = to_str... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 969,111 | 969,109 | u337353034 | cpp |
p03164 | #include <bits/stdc++.h>
#define Mx 1000000000005
#define ll long long
#define pi 3.141592653
#define vi vector<ll>
#define Mo 1000000007
#define mp make_pair
#define M map<ll, ll>
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define vii vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#de... | #include <bits/stdc++.h>
#define Mx 1000000000005
#define ll long long
#define pi 3.141592653
#define vi vector<ll>
#define Mo 1000000007
#define mp make_pair
#define M map<ll, ll>
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define vii vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#de... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 969,112 | 969,113 | u966249394 | cpp |
p03164 | #include <bits/stdc++.h>
#define Mx 1000000000005
#define ll long long
#define pi 3.141592653
#define vi vector<ll>
#define Mo 1000000007
#define mp make_pair
#define M map<ll, ll>
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define vii vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#de... | #include <bits/stdc++.h>
#define Mx 1000000000005
#define ll long long
#define pi 3.141592653
#define vi vector<ll>
#define Mo 1000000007
#define mp make_pair
#define M map<ll, ll>
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define vii vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#de... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 969,112 | 969,114 | u966249394 | cpp |
p03164 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ma... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ma... | [
"literal.number.change",
"call.arguments.change"
] | 969,115 | 969,116 | u651314218 | cpp |
p03164 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<vector<int>> items(n, vector<int>(2)); // 0 = weight 1 = value
for (int i = 0; i < n; i++) {
cin >> items[i][0];
cin >> items[i][1];
}
vector<vector<int>> dp(n, vector<int>(10... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<vector<int>> items(n, vector<int>(2)); // 0 = weight 1 = value
for (int i = 0; i < n; i++) {
cin >> items[i][0];
cin >> items[i][1];
}
vector<vector<long long int>> dp(n,
... | [
"literal.number.change",
"call.arguments.change"
] | 969,155 | 969,156 | u884496139 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxi = 100005;
ll cost[105][maxi];
ll val[105], w[105];
int main() {
ll n, W;
cin >> n >> W;
for (int i = 0; i <= n; i++)
for (int j = 0; j < 100001; j++)
cost[i][j] = 100000000000L;
cost[0][0] = 0;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxi = 100005;
ll cost[105][maxi];
ll val[105], w[105];
int main() {
ll n, W;
cin >> n >> W;
for (int i = 0; i <= n; i++)
for (int j = 0; j <= 100001; j++)
cost[i][j] = 100000000000L;
cost[0][0] = 0;
for (int i = 1; i ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 969,159 | 969,160 | u051846813 | cpp |
p03164 | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <unordered_map>
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define ll long long
#define pb push_back
#define mp make_pair
#define gcd __gcd
#define F first
#define S second
#define PI 3.14159265... | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <unordered_map>
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define ll long long
#define pb push_back
#define mp make_pair
#define gcd __gcd
#define F first
#define S second
#define PI 3.14159265... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 969,165 | 969,166 | u203251523 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18L + 5;
int main() {
int n, w;
cin >> n >> w;
vector<int> wt(n), val(n);
int sum_val = 0;
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
sum_val += val[i];
}
vector<long long> dp(sum_val + 1, INF);
dp[0] = 0;
// dp[i... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18L + 5;
int main() {
int n, w;
cin >> n >> w;
vector<int> wt(n), val(n);
int sum_val = 0;
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
sum_val += val[i];
}
vector<long long> dp(sum_val + 1, INF);
dp[0] = 0;
// dp[i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 969,170 | 969,171 | u061594873 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
ll n, w;
cin >> n >> w;
vector<ll> W(110), V(110); //余裕をもって
vector<vector<ll>> dp(110, vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
ll n, w;
cin >> n >> w;
vector<ll> W(110), V(110); //余裕をもって
vector<vector<ll>> dp(110, vector<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"call.arguments.change"
] | 969,176 | 969,177 | u650236619 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, w;
ll dp[105][100005];
const ll INF = 1LL << 60;
int main() {
cin >> n >> w;
ll weight[n];
ll value[n];
for (ll i = 0; i < n; i++)
cin >> weight[i] >> value[i];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j <= 100000; j++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, w;
ll dp[105][100005];
const ll INF = 1LL << 60;
int main() {
cin >> n >> w;
ll weight[n];
ll value[n];
for (ll i = 0; i < n; i++)
cin >> weight[i] >> value[i];
for (ll i = 0; i <= n; i++) {
for (ll j = 0; j <= 100000; j++)
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change",
"literal.number.change"
] | 969,182 | 969,179 | u955282280 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, W;
cin >> n >> W;
ll w[n], v[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += v[i];
}
ll dp[sum... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, W;
cin >> n >> W;
ll w[n], v[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
int sum = 1;
for (int i = 0; i < n; i++) {
sum += v[i];
}
ll dp[sum... | [
"literal.number.change",
"variable_declaration.value.change"
] | 969,191 | 969,192 | u180171323 | cpp |
p03164 | #include <iostream>
using namespace std;
#define ll long long
#define pb push_back
#define ins insert
#define mp make_pair
#define pii pair<int, int>
#define pil pair<int, ll>
#define pib pair<int, bool>
#define SET(a, c) memset(a, c, sizeof(a))
#define MOD 1000000007
#define enld endl
#define endl "\n"
#define fi fir... | #include <iostream>
using namespace std;
#define ll long long
#define pb push_back
#define ins insert
#define mp make_pair
#define pii pair<int, int>
#define pil pair<int, ll>
#define pib pair<int, bool>
#define SET(a, c) memset(a, c, sizeof(a))
#define MOD 1000000007
#define enld endl
#define endl "\n"
#define fi fir... | [
"literal.number.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 969,195 | 969,194 | u599578478 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define FORN(i, x, y) for (int i = x; i <= y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define scan1(X) scanf("%d", &X)
#define scan2(X, Y) scanf("%d%d", &X, &Y)
#define scan3(X, Y, Z) scanf("%d%d%d", &X, &Y, &Z... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define FORN(i, x, y) for (int i = x; i <= y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define scan1(X) scanf("%d", &X)
#define scan2(X, Y) scanf("%d%d", &X, &Y)
#define scan3(X, Y, Z) scanf("%d%d%d", &X, &Y, &Z... | [
"literal.number.change",
"assignment.value.change"
] | 969,217 | 969,218 | u732471139 | cpp |
p03164 | #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int lon... | #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int lon... | [
"literal.number.change",
"variable_declaration.value.change"
] | 969,221 | 969,222 | u314476982 | cpp |
p03164 | #include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e18L + 5;
void min_self(ll &a, ll b) { a = min(a, b); }
int main() {
ll n, w;
cin >> n >> w;
vector<ll> weight(n), ... | #include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e18L + 5;
void min_self(ll &a, ll b) { a = min(a, b); }
int main() {
ll n, w;
cin >> n >> w;
vector<ll> weight(n), ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 969,257 | 969,258 | u772397797 | cpp |
p03164 | #include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e18L + 5;
void min_self(ll &a, ll b) { a = min(a, b); }
int main() {
ll n, w;
cin >> n >> w;
vector<ll> weight(n), ... | #include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e18L + 5;
void min_self(ll &a, ll b) { a = min(a, b); }
int main() {
ll n, w;
cin >> n >> w;
vector<ll> weight(n), ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 969,259 | 969,258 | u772397797 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
int N;
int W;
cin >> N >> W;
vector<vector<int>> dp(N + 1, vector<int>(1e5 + 1, 1e9 + 1));
dp[0][0] = 0;
vector<int> weight(N + 1, 0);
vector<int> value(N + 1, 0);
int temp_w, temp_v;
for (int i = 1; i < N + 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
int N;
int W;
cin >> N >> W;
vector<vector<int>> dp(N + 1, vector<int>(1e5 + 1, 1e9 + 1));
dp[0][0] = 0;
vector<int> weight(N + 1, 0);
vector<int> value(N + 1, 0);
int temp_w, temp_v;
for (int i = 1; i < N + 1; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 969,266 | 969,267 | u840310460 | cpp |
p03164 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
vector<vector<int>> graph;
bool sort_sec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second < b.second) {
return true;
}
return false;
}
void swap(int *a, int *b) {
int ... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
vector<vector<int>> graph;
bool sort_sec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second < b.second) {
return true;
}
return false;
}
void swap(int *a, int *b) {
int ... | [] | 969,275 | 969,276 | u150155436 | cpp |
p03164 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
vector<vector<int>> graph;
bool sort_sec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second < b.second) {
return true;
}
return false;
}
void swap(int *a, int *b) {
int ... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
vector<vector<int>> graph;
bool sort_sec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second < b.second) {
return true;
}
return false;
}
void swap(int *a, int *b) {
int ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 969,277 | 969,276 | u150155436 | cpp |
p03164 | /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad... | /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad... | [] | 969,283 | 969,284 | u232873057 | cpp |
p03164 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int w;
cin >> w;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
cin >> b[i];
}
vector<int> dp(100001, 1e10);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 100000;... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int w;
cin >> w;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
cin >> b[i];
}
vector<long int> dp(100001, 1e10);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 10... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 969,285 | 969,286 | u430302520 | cpp |
p03164 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | [
"literal.number.change",
"assignment.value.change"
] | 969,302 | 969,303 | u266399570 | cpp |
p03164 | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
#define fo(i, a, n) for (int i = a; i < n; i++)
#define ll long long int
#define li long int
using namespace std;
int n;
li weight;
vector<int> w(101);
vector<int> v(101);
vector<vector<ll>> dp(101, vector<ll>(100005, -1));
int sum = 0;
ll cost(int in... | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
#define fo(i, a, n) for (int i = a; i < n; i++)
#define ll long long int
#define li long int
using namespace std;
int n;
li weight;
vector<int> w(101);
vector<int> v(101);
vector<vector<ll>> dp(101, vector<ll>(100005, -1));
int sum = 0;
ll cost(int in... | [
"identifier.change",
"function.return_value.change"
] | 969,310 | 969,311 | u765828490 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define pb push_back
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using vst = vector<string>;
u... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define pb push_back
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using vst = vector<string>;
u... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 969,312 | 969,313 | u531461815 | cpp |
p03164 | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
/* range: ± 3.27 * 10... | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
/* range: ± 3.27 * 10... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 969,316 | 969,317 | u865044045 | cpp |
p03164 | #include <bits/stdc++.h>
#define ll long long int
#define lld long double
#define pb push_back
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define vec vector<ll>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define mod 1000000007
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repi... | #include <bits/stdc++.h>
#define ll long long int
#define lld long double
#define pb push_back
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define vec vector<ll>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define mod 1000000007
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repi... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 969,331 | 969,332 | u334773822 | cpp |
p03164 | #include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define mll map<ll, ll>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define deb(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout <... | #include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define mll map<ll, ll>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define deb(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout <... | [
"assignment.change"
] | 969,339 | 969,340 | u731601480 | cpp |
p03164 | #include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define mll map<ll, ll>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define deb(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout <... | #include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define mll map<ll, ll>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define deb(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 969,341 | 969,340 | u731601480 | cpp |
p03164 | #include "bits/stdc++.h"
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
// wierd debugging stuff
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) ... | #include "bits/stdc++.h"
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
// wierd debugging stuff
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) ... | [
"variable_declaration.type.change"
] | 969,370 | 969,371 | u161309389 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.