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;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
input_from_file;
// int t; cin>>t;
// while(t--){
ll n, sum;
cin >> n >> su... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
// input_from_file;
// int t; cin>>t;
// while(t--){
ll n, sum;
cin >> n >>... | [] | 965,119 | 965,120 | u066630187 | cpp |
p03163 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//~ using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//~ using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}... | [
"call.arguments.change",
"variable_declaration.type.change"
] | 965,122 | 965,123 | u986555878 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pi;
typedef long long ll;
const int MAX_INT = 2000000000;
int maxVal[100001];
int m... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pi;
typedef long long ll;
const int MAX_INT = 2000000000;
ll maxVal[100001];
int ma... | [
"variable_declaration.type.change"
] | 965,124 | 965,125 | u117022482 | cpp |
p03163 | #include <bits/stdc++.h>
typedef long long ll;
#define pb push_back;
using namespace std;
int main() {
ll n, w, a, b;
cin >> n >> w;
pair<ll, ll> l[n];
for (ll i = 0; i < n; i++) {
cin >> a >> b;
l[i] = {a, b};
}
ll m[n][w];
for (int x = 1; x <= w; x++) {
for (int i = 0; i < n; i++) {
if... | #include <bits/stdc++.h>
typedef long long ll;
#define pb push_back;
using namespace std;
int main() {
ll n, w, a, b;
cin >> n >> w;
pair<ll, ll> l[n];
for (ll i = 0; i < n; i++) {
cin >> a >> b;
l[i] = {a, b};
}
ll m[n][w];
for (int x = 0; x <= w; x++) {
for (int i = 0; i < n; i++) {
if... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 965,126 | 965,127 | u834471595 | cpp |
p03163 | #include <bits/stdc++.h>
typedef long long ll;
#define pb push_back;
using namespace std;
int main() {
ll n, w, a, b;
cin >> n >> w;
pair<ll, ll> l[n];
for (ll i = 0; i < n; i++) {
cin >> a >> b;
l[i] = {a, b};
}
ll m[n][w];
for (int x = 1; x <= w; x++) {
for (int i = 0; i < n; i++) {
if... | #include <bits/stdc++.h>
typedef long long ll;
#define pb push_back;
using namespace std;
int main() {
ll n, w, a, b;
cin >> n >> w;
pair<ll, ll> l[n];
for (ll i = 0; i < n; i++) {
cin >> a >> b;
l[i] = {a, b};
}
ll m[n][w];
for (int x = 0; x <= w; x++) {
for (int i = 0; i < n; i++) {
if... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 965,128 | 965,127 | u834471595 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a) * (a)
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugv(v) \
cerr << #v << " : ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a) * (a)
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugv(v) \
cerr << #v << " : ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 965,135 | 965,136 | u167869723 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a) * (a)
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugv(v) \
cerr << #v << " : ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a) * (a)
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugv(v) \
cerr << #v << " : ... | [
"identifier.change",
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 965,137 | 965,138 | u167869723 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// nt a[100000];
int dp[100][100001];
int solve(vector<pair<int, int>> &ar, int n, int w) {
dp[0][ar[0].first] = ar[0].second;
for (int i = 1; i < n; ++i) {
for (int weight = 0; weight <= w; ++weight) {
dp[i][weight] = dp[i - 1][weight];... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// nt a[100000];
int dp[100][100001];
int solve(vector<pair<int, int>> &ar, int n, int w) {
dp[0][ar[0].first] = ar[0].second;
for (int i = 1; i < n; ++i) {
for (int weight = 0; weight <= w; ++weight) {
dp[i][weight] = dp[i - 1][weight];... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,141 | 965,142 | u103697897 | cpp |
p03163 | // Author - Saikat_7
#include <bits/stdc++.h>
using namespace std;
#define fl(i, a, b) for (int i = a; i < b; i++)
#define trav(i, cont) for (const auto &i : cont)
#define cs(x) cout << x << " "
#define cn(x) cout << x << " " << endl
#define ll long long int
#define endl '\n'
#define pb push_back
#define ff first
#defi... | // Author - Saikat_7
#include <bits/stdc++.h>
using namespace std;
#define fl(i, a, b) for (int i = a; i < b; i++)
#define trav(i, cont) for (const auto &i : cont)
#define cs(x) cout << x << " "
#define cn(x) cout << x << " " << endl
#define ll long long int
#define endl '\n'
#define pb push_back
#define ff first
#defi... | [
"variable_declaration.type.change"
] | 965,143 | 965,144 | u426260736 | cpp |
p03163 | /*input
6 15
6 5
5 6
6 4
6 6
3 5
7 2
*/
// sometimes it's the people who no one imagines anything of
// who do the things that no one can imagine.
// code author: iamxlr8
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define off ... | /*input
6 15
6 5
5 6
6 4
6 6
3 5
7 2
*/
// sometimes it's the people who no one imagines anything of
// who do the things that no one can imagine.
// code author: iamxlr8
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define off ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 965,145 | 965,146 | u788930704 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[155][100055];
signed main() {
int n, w;
cin >> n >> w;
vector<int> inn(n), inw(n);
for (int i = 1; i <= n; i++)
cin >> inw[i] >> inn[i];
for (int k = 1; k <= n; k++)
for (int i = 0; i <= w; i++) {
dp[k][i] =
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[105][100005];
signed main() {
int n, w;
cin >> n >> w;
vector<int> inn(n + 1), inw(n + 1);
for (int i = 1; i <= n; i++)
cin >> inw[i] >> inn[i];
for (int k = 1; k <= n; k++)
for (int i = 0; i <= w; i++) {
dp[k][i] =
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 965,151 | 965,152 | u578026104 | cpp |
p03163 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[102][100005];
signed main() {
int n, w;
cin >> n >> w;
vector<int> inn(n), inw(n);
for (int i = 1; i <= n; i++)
cin >> inw[i] >> inn[i];
for (int k = 1; k <= n; k++)
for (int i = 1; i <= w; i++) {
dp[k][i] =
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[105][100005];
signed main() {
int n, w;
cin >> n >> w;
vector<int> inn(n + 1), inw(n + 1);
for (int i = 1; i <= n; i++)
cin >> inw[i] >> inn[i];
for (int k = 1; k <= n; k++)
for (int i = 0; i <= w; i++) {
dp[k][i] =
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 965,153 | 965,152 | u578026104 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int n, W, v[107], w[107];
long long dp[107][107];
int main() {
ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 1; i <= n; i++) {
for (int wt = 1; wt <= W; wt++) {
... | #include <bits/stdc++.h>
using namespace std;
int n, W, v[107], w[107];
long long dp[107][100007];
int main() {
ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 1; i <= n; i++) {
for (int wt = 1; wt <= W; wt++) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 965,165 | 965,164 | u005436314 | cpp |
p03163 | //
// Created by Harshit on 20-08-2020.
//
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> weight(n);
vector<int> value(n);
for (int i = 0; i < n; i++) {
cin >> weight[i] >> value[i];
}
vector<vector<int>> dp(n + 1, vector<int>(W + 1, 0));
/*for(int i... | //
// Created by Harshit on 20-08-2020.
//
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> weight(n);
vector<int> value(n);
for (int i = 0; i < n; i++) {
cin >> weight[i] >> value[i];
}
vector<vector<long long>> dp(n + 1, vector<long long>(W + 1, 0));
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 964,890 | 964,891 | u241916882 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
struct item {
int wt;
int val;
};
ll solve(vector<item> arr, int n, int W) {
int dp[n + 1][W + 1];
for (int w = 0; w <= W; w++) {
dp[1][w] = 0;
}
dp[1][arr[1].wt] = arr[1].val;
for (int i = 2; i <= ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
struct item {
int wt;
int val;
};
ll solve(vector<item> arr, int n, int W) {
ll dp[n + 1][W + 1];
for (int w = 0; w <= W; w++) {
dp[1][w] = 0;
}
dp[1][arr[1].wt] = arr[1].val;
for (int i = 2; i <= n... | [
"variable_declaration.type.change"
] | 964,904 | 964,905 | u186820109 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, W;
cin >> N >> W;
ll v[N], w[N];
for (ll i = 0; i < N; i++)
cin >> v[i] >> w[i];
ll dp[N + 1][W + 1];
for (ll i = 0; i <= N; i++) {
for (ll j = 0; j <= W; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, W;
cin >> N >> W;
ll v[N], w[N];
for (ll i = 0; i < N; i++)
cin >> w[i] >> v[i];
ll dp[N + 1][W + 1];
for (ll i = 0; i <= N; i++) {
for (ll j = 0; j <= W; j++) {
if (i == 0 || j == 0)
dp[i][j] = 0;
... | [
"expression.operation.binary.remove"
] | 964,906 | 964,907 | u590450959 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | [
"variable_declaration.type.change"
] | 964,910 | 964,911 | u531461815 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define REV(i, a, n) for (int i = a; i >= n; i--)
#define all(a) a.begin(), a.end()
#define UB upper_bou... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define REV(i, a, n) for (int i = a; i >= n; i--)
#define all(a) a.begin(), a.end()
#define UB upper_bou... | [
"expression.operation.binary.remove"
] | 964,912 | 964,913 | u041777697 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
int main() {
ll n, w;
cin >> n >> w;
ll value[n];
ll weight[n];
for (int i = 0; i < n; i++) {
cin >> weight[i];
cin >> value[i];
}
ll dp[n][w + 1] = {0};
for (ll i = 0; i < n; i++) {
dp[i][0] = 0;
}... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
int main() {
ll n, w;
cin >> n >> w;
ll value[n];
ll weight[n];
for (int i = 0; i < n; i++) {
cin >> weight[i];
cin >> value[i];
}
ll dp[n][w + 1] = {0};
for (ll i = 0; i < n; i++) {
dp[i][0] = 0;
}... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 964,916 | 964,917 | u844027714 | cpp |
p03163 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long int n;
long int a[100005][3];
long int dp[100005][5];
long int Func(int i, int wt_left) {
if (i >= n)
return 0;
if (dp[i][wt_left] != -1)
return dp[i][wt_left];
if (wt_left == 0)
return 0;
dp[i][wt_left] = Func(i + 1, wt_left);
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long int n;
long int a[100005][3];
long int dp[102][100005];
long int Func(int i, int wt_left) {
if (i >= n)
return 0;
if (dp[i][wt_left] != -1)
return dp[i][wt_left];
if (wt_left == 0)
return 0;
dp[i][wt_left] = Func(i + 1, wt_left)... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,920 | 964,921 | u395649803 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
struct item {
int wt;
int val;
};
ll solve(vector<item> ar, int n, int W) {
int dp[n + 1][W + 1];
// for first item other than weight of item is zero
for (int w = 0; w <= W; w++)
dp[1][w] = 0;
dp[1][ar[1].wt] = ar[1].val;
// botto... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
struct item {
int wt;
int val;
};
ll solve(vector<item> ar, int n, int W) {
ll dp[n + 1][W + 1];
// for first item other than weight of item is zero
for (int w = 0; w <= W; w++)
dp[1][w] = 0;
dp[1][ar[1].wt] = ar[1].val;
// bottom... | [
"variable_declaration.type.change"
] | 964,922 | 964,923 | u658097643 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int solve() {
int n, w;
cin >> n >> w;
int wt[n], val[n];
for (int i = 0; i < n; ++i) {
cin >> wt[i] >> val[i];
}
int dp[w + 1][n + 1];
for (int i = 0; i <= n; ++i) {
dp[0][i] = 0;
}
for (int i = 0; i <= w; ++i) {
dp[i][0] = 0;
}
for (int i... | #include <bits/stdc++.h>
using namespace std;
long long solve() {
int n, w;
cin >> n >> w;
long long wt[n], val[n];
for (int i = 0; i < n; ++i) {
cin >> wt[i] >> val[i];
// cout<<wt[i]<<" "<<val[i]<<endl;
}
long long dp[w + 1][n + 1];
for (int i = 0; i <= n; ++i) {
dp[0][i] = 0;
}
for (int... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 964,924 | 964,925 | u697483609 | cpp |
p03163 | #include <bits/stdc++.h>
#define line cout << endl;
#define space cout << " ";
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define line cout << endl;
#define space cout << " ";
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,926 | 964,927 | u478482513 | cpp |
p03163 | #include <bits/stdc++.h>
#define line cout << endl;
#define space cout << " ";
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define line cout << endl;
#define space cout << " ";
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 964,928 | 964,929 | u943964167 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define io \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define io \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie... | [
"type_conversion.add"
] | 964,930 | 964,931 | u372058452 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
int n, w;
cin >> n >> w;
int weight[n];
int prices[n];
for (int i = 0; i < n; i++) {
cin >> weight[i] >> prices[i];
}
int dp[n + 1][w + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= n; i++) {
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
int n, w;
cin >> n >> w;
ll weight[n];
ll prices[n];
for (int i = 0; i < n; i++) {
cin >> weight[i] >> prices[i];
}
ll dp[n + 1][w + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= n; i++) {
for (int ... | [
"variable_declaration.type.change"
] | 964,934 | 964,935 | u806692883 | cpp |
p03163 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int dp[n + 1][w + 1];
int W[n], V[n];
for (int i = 0; i < n; i++) {
cin >> W[i] >> V[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long dp[n + 1][w + 1];
int W[n], V[n];
for (int i = 0; i < n; i++) {
cin >> W[i] >> V[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0) {
... | [
"variable_declaration.type.primitive.change"
] | 964,944 | 964,945 | u794552329 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, W;
scanf("%d %d", &n, &W);
vector<ll> dp(n + 1, 0);
for (int k = 0; k < n; k++) {
int w, val;
scanf("%d%d", &w, &val);
for (auto x = W - w; x >= 0; --x) {
dp[x + w] = max(dp[x + w], dp[x] + ... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, W;
scanf("%d %d", &n, &W);
vector<ll> dp(W + 1, 0);
for (int k = 0; k < n; k++) {
int w, val;
scanf("%d%d", &w, &val);
for (int x = W - w; x >= 0; x--) {
dp[x + w] = max(dp[x + w], dp[x] + v... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 964,946 | 964,947 | u371777495 | cpp |
p03163 | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
const int maxn = 1e5 + 10;
int n, w;
int dp[105][maxn];
int val[105];
int wet[105];
int32_t main() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> wet[i] >> val[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) ... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
const LL maxn = 1e5 + 10;
LL n, w;
LL dp[105][maxn];
int val[105];
int wet[105];
int32_t main() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> wet[i] >> val[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
... | [
"variable_declaration.type.change"
] | 964,952 | 964,953 | u283484070 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dlog(x) cerr << #x << '=' << x << endl
#define f first
#define s second
#define endl '\n'
#define sq(x) (x) * (x)*1ll
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int weight[100], value[100], dp[10... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dlog(x) cerr << #x << '=' << x << endl
#define f first
#define s second
#define endl '\n'
#define sq(x) (x) * (x)*1ll
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll weight[100], value[100], dp[100... | [
"variable_declaration.type.change"
] | 965,171 | 965,172 | u093681822 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define WEIGHTSUM weight + i
#define VALUESUM maxValue[i] + value
using namespace std;
ll maxValue[100005];
int main() {
ll n, w, weight, value;
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> weight >> value;
for (int i = w; i >= 0; i--)
if (max... | #include <bits/stdc++.h>
#define ll long long
#define WEIGHTSUM weight + i
#define VALUESUM maxValue[i] + value
using namespace std;
ll maxValue[100005];
int main() {
ll n, w, weight, value;
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> weight >> value;
for (int i = w; i >= 0; i--)
if (WEI... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 965,173 | 965,174 | u684798281 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> dp(W + 1, 0);
for (int i = 0; i < n; i++) {
int w, v;
cin >> w >> v;
for (int wa = W - w; wa >= 0; wa--) {
dp[wa + w] = max(dp[wa + w], dp[wa] + v);
}
}
int maxi = 0;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<long long> dp(W + 1, 0);
for (int i = 0; i < n; i++) {
int w, v;
cin >> w >> v;
for (int wa = W - w; wa >= 0; wa--) {
dp[wa + w] = max(dp[wa + w], dp[wa] + v);
}
}
long long maxi = 0;
for (... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,180 | 965,181 | u001462978 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, w;
cin >> n >> w;
ll W[n + 1];
ll V[n + 1];
for (ll i = 1; i <= n; i++)
cin >> W[i] >> V[i];
ll M[n + 1][w + 1];
memset(M, 0, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, w;
cin >> n >> w;
ll W[n + 1];
ll V[n + 1];
for (ll i = 1; i <= n; i++)
cin >> W[i] >> V[i];
ll M[n + 1][w + 1];
memset(M, 0, ... | [
"assignment.change"
] | 965,184 | 965,185 | u241586777 | cpp |
p03163 | #include <bits/stdc++.h>
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];
cin >> v[i];
}
vector<long long> dp(w + 1, 0);
for (int i = 0; i < n; i++) {
for (int j = w - i; j >= 0; j--) {
dp[j + wt[i]] = max(dp[j + wt... | #include <bits/stdc++.h>
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];
cin >> v[i];
}
vector<long long> dp(w + 1, 0);
for (int i = 0; i < n; i++) {
for (long long j = w - wt[i]; j >= 0; j--) {
dp[j + wt[i]] = max... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,190 | 965,191 | u335562906 | cpp |
p03163 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, we;
cin >> n >> we;
vector<int> dp(we + 1, 0), w(n), v(n);
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (int j = 0; j < n; j++) {
for (int i = we; i > 0; i--) {
if (i >= w[j]) {
dp[i] = m... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
int n, we;
cin >> n >> we;
vector<ll int> dp(we + 1, 0), w(n), v(n);
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (int j = 0; j < n; j++) {
for (int i = we; i > 0; i--) {
if (i >= w[... | [] | 965,192 | 965,193 | u275249182 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long long int dp[w + 1][n + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][j] = 0;
}
}
for (int i = 1; i <= n; i++) {
int w1;
long long int c;
cin >> w1 >> c;
for (int j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long long int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][j] = 0;
}
}
for (int i = 1; i <= n; i++) {
int w1;
long long int c;
cin >> w1 >> c;
for (in... | [
"identifier.change",
"expression.operation.binary.change"
] | 965,194 | 965,195 | u427759487 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long long int dp[w + 1][n + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][j] = 0;
}
}
for (int i = 1; i <= n; i++) {
int w1;
long long int c;
cin >> w1 >> c;
for (int j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long long int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][j] = 0;
}
}
for (int i = 1; i <= n; i++) {
int w1;
long long int c;
cin >> w1 >> c;
for (in... | [
"identifier.change",
"expression.operation.binary.change"
] | 965,197 | 965,195 | u427759487 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][j] = 0;
}
}
for (int i = 1; i <= n; i++) {
int w1, c;
cin >> w1 >> c;
for (int j = 1; j <= w; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long long int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
dp[i][j] = 0;
}
}
for (int i = 1; i <= n; i++) {
int w1;
long long int c;
cin >> w1 >> c;
for (in... | [
"variable_declaration.type.widen.change"
] | 965,199 | 965,195 | u427759487 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, w;
cin >> n >> w;
vector<ll> weight(n), value(n);
for (ll i = 1; i <= n; ++i) {
cin >> weight[i] >> value[i];
}
ll arr[n + 1][w + 1];
for (ll i = 0; i < n + 1; ++i) {
for (ll j = 0; j < w + 1; ++j)
arr... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, w;
cin >> n >> w;
vector<ll> weight(101), value(101);
for (ll i = 1; i <= n; ++i) {
cin >> weight[i] >> value[i];
}
ll arr[n + 1][w + 1];
for (ll i = 0; i < n + 1; ++i) {
for (ll j = 0; j < w + 1; ++j)
... | [] | 965,203 | 965,204 | u027630431 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, w;
cin >> n >> w;
vector<ll> weight(n), value(n);
for (ll i = 1; i <= n; ++i) {
cin >> weight[i] >> value[i];
}
ll arr[n + 24][w + 51];
for (ll i = 0; i < n + 24; ++i) {
for (ll j = 0; j < w + 51; ++j)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, w;
cin >> n >> w;
vector<ll> weight(101), value(101);
for (ll i = 1; i <= n; ++i) {
cin >> weight[i] >> value[i];
}
ll arr[n + 1][w + 1];
for (ll i = 0; i < n + 1; ++i) {
for (ll j = 0; j < w + 1; ++j)
... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 965,205 | 965,204 | u027630431 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int max(int a, int b) { return (a > b ? a : b); }
int main() {
// code
int t;
t = 1;
while (t--) {
int n;
cin >> n;
int W;
cin >> W;
int wt[n], val[n];
for (int i = 0; i < n; i++)
cin >> wt[i] >> val[i];
int dp[n + 1][W + 1];
fo... | #include <bits/stdc++.h>
using namespace std;
int max(int a, int b) { return (a > b ? a : b); }
int main() {
// code
int t;
t = 1;
while (t--) {
int n;
cin >> n;
int W;
cin >> W;
int wt[n], val[n];
for (int i = 0; i < n; i++)
cin >> wt[i] >> val[i];
long dp[n + 1][W + 1];
f... | [
"variable_declaration.type.primitive.change"
] | 965,208 | 965,209 | u205212925 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> wt(N), score(N);
for (int i = 0; i < N; ++i) {
cin >> wt[i] >> score[i];
}
long long dp[N + 1][W + 1];
for (int i = 0; i <= N; ++i) {
for (int w = 0; w <= W; ++w) {
if (i == 0 || w... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> wt(N), score(N);
for (int i = 0; i < N; ++i) {
cin >> wt[i] >> score[i];
}
long long dp[N + 1][W + 1];
for (int i = 0; i <= N; ++i) {
for (int w = 0; w <= W; ++w) {
if (i == 0 || w... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,216 | 965,217 | u767425163 | cpp |
p03163 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> wt(N), score(N);
for (int i = 0; i < N; ++i) {
cin >> wt[i] >> score[i];
}
int dp[N + 1][W + 1];
for (int i = 0; i <= N; ++i) {
for (int w = 0; w <= W; ++w) {
if (i == 0 || w == 0)... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> wt(N), score(N);
for (int i = 0; i < N; ++i) {
cin >> wt[i] >> score[i];
}
long long dp[N + 1][W + 1];
for (int i = 0; i <= N; ++i) {
for (int w = 0; w <= W; ++w) {
if (i == 0 || w... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,218 | 965,217 | u767425163 | cpp |
p03163 | #include <iostream>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int *wt = new int[n];
int *val = new int[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
int dp[n + 1][w + 1];
for (int item = 0; item <= n; item++) {
for (int weight = 0; weight <= w; weight++) {
i... | #include <iostream>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
int *wt = new int[n];
int *val = new int[n];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
long long dp[n + 1][w + 1];
for (int item = 0; item <= n; item++) {
for (int weight = 0; weight <= w; weight++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"io.output.newline.add"
] | 965,225 | 965,226 | u186994371 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define all(c) c.begin(), c.end()
#define pb push_back
#define F first
#define S second
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
int k, w;
cin >> n >> w;
vector<pair<int, int>> arr(n);... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define all(c) c.begin(), c.end()
#define pb push_back
#define F first
#define S second
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
int k, w;
cin >> n >> w;
vector<pair<int, ll>> arr(n);
... | [
"variable_declaration.type.change"
] | 965,237 | 965,238 | u287226050 | cpp |
p03163 | #include <bits/stdc++.h>
#define rep(i, n) \
; \
for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> sta... | #include <bits/stdc++.h>
#define rep(i, n) \
; \
for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> sta... | [
"variable_declaration.type.change"
] | 965,243 | 965,244 | u239316561 | cpp |
p03162 | /*author : Yashvardhan
Saturday, January 12, 2019
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define make_pair mp
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#pragma comment(linker, "/stack:... | /*author : Yashvardhan
Saturday, January 12, 2019
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define make_pair mp
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#pragma comment(linker, "/stack:... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 965,245 | 965,246 | u368039995 | cpp |
p03162 | #include <cstdlib>
#include <iostream>
#include <vector>
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;
}
const long l... | #include <cstdlib>
#include <iostream>
#include <vector>
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;
}
const long l... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 965,247 | 965,248 | u334656323 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int dt[100001][3], n;
int main() {
scanf("%d", &n);
scanf("%d %d %d", &dt[1][0], &dt[1][1], &dt[1][2]);
for (int i = 2; i <= n; i++) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
dt[i][0] = max(dt[i - 1][1], dt[i - 1][2]) + a;
dt[i][1] = max(dt[i - 1... | #include <bits/stdc++.h>
using namespace std;
int dt[100001][3], n;
int main() {
scanf("%d", &n);
scanf("%d %d %d", &dt[1][0], &dt[1][1], &dt[1][2]);
for (int i = 2; i <= n; i++) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
dt[i][0] = max(dt[i - 1][1], dt[i - 1][2]) + a;
dt[i][1] = max(dt[i - 1... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 965,249 | 965,250 | u426432817 | cpp |
p03162 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (obj).be... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (obj).be... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 965,253 | 965,254 | u789417951 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <complex>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
#define ll long long int
#define ld long double
#def... | #include <algorithm>
#include <cmath>
#include <complex>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
#define ll long long int
#define ld long double
#def... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 965,260 | 965,261 | u920844524 | cpp |
p03162 | #include <iostream>
#include <limits>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a, b, c;
for (int i = 0; i < n; ++i) {
int aa, bb, cc;
cin >> aa >> bb >> cc;
a.emplace_back(aa);
b.emplace... | #include <iostream>
#include <limits>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a, b, c;
for (int i = 0; i < n; ++i) {
int aa, bb, cc;
cin >> aa >> bb >> cc;
a.emplace_back(aa);
b.emplace... | [
"misc.opposites",
"identifier.change",
"call.arguments.change"
] | 965,262 | 965,263 | u403618885 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int dp[N][4];
int arr[N][3];
int n;
int solve(int idx, int prev) {
if (idx == n)
return 0;
int &ans = dp[idx][prev];
if (ans != -1)
return ans;
ans = 0;
for (int i = 0; i < 3; i++) {
if (i + 1 != prev)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int dp[N][4];
int arr[N][3];
int n;
int solve(int idx, int prev) {
if (idx == n)
return 0;
int &ans = dp[idx][prev];
if (ans != -1)
return ans;
ans = 0;
for (int i = 0; i < 3; i++) {
if (i + 1 != prev)
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.change",
"variable_access.subscript.index.change"
] | 965,264 | 965,265 | u173976156 | cpp |
p03162 | #include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define __ \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define __ \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,270 | 965,271 | u404706753 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define MX_N 100000
#define MX 1000000000
int n, k;
int tab[MX_N + 5][5];
long long dp[MX_N + 5][3];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> tab[i][0] >> tab[i][1] >> tab[i][2];
dp[0][0] = tab[0][0];
dp[0][1] = tab[0][2];
dp[0][2] = tab[0... | #include <bits/stdc++.h>
using namespace std;
#define MX_N 100000
#define MX 1000000000
int n;
int tab[MX_N + 5][5];
long long dp[MX_N + 5][3];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> tab[i][0] >> tab[i][1] >> tab[i][2];
dp[0][0] = tab[0][0];
dp[0][1] = tab[0][1];
dp[0][2] = tab[0][2... | [
"variable_declaration.remove",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 965,275 | 965,276 | u718303016 | cpp |
p03162 | /*author:anshumanc007
created on:05/01/2019
*/
#include <bits/stdc++.h>
#include <queue>
#include <stack>
using namespace std;
#define first fi
#define second se
typedef pair<long long int, long long int> pa;
#define MAX 100005
long long int MOD = 1e9 + 7;
long long int INF = 1e18;
long long int dp[MAX]... | /*author:anshumanc007
created on:05/01/2019
*/
#include <bits/stdc++.h>
#include <queue>
#include <stack>
using namespace std;
#define first fi
#define second se
typedef pair<long long int, long long int> pa;
#define MAX 100005
long long int MOD = 1e9 + 7;
long long int INF = 1e18;
long long int dp[MAX]... | [
"expression.operation.binary.remove"
] | 965,281 | 965,282 | u422347032 | cpp |
p03162 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,283 | 965,284 | u898651494 | cpp |
p03162 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,283 | 965,285 | u898651494 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long LL;
typedef pair<LL, LL> P;
const LL mod = 1e9 + 7;
const LL LINF = 1LL << 62;
const int ... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long LL;
typedef pair<LL, LL> P;
const LL mod = 1e9 + 7;
const LL LINF = 1LL << 62;
const int ... | [
"assignment.change"
] | 965,286 | 965,287 | u640323045 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll const mod = 1000000007;
ll const md = 998244353;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ifstream in("txt.in");
ofs... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll const mod = 1000000007;
ll const md = 998244353;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ifstream in("txt.in");
ofs... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 965,290 | 965,291 | u635511681 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll const mod = 1000000007;
ll const md = 998244353;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ifstream in("txt.in");
ofs... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll const mod = 1000000007;
ll const md = 998244353;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ifstream in("txt.in");
ofs... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 965,292 | 965,291 | u635511681 | cpp |
p03162 | #include <iostream>
using namespace std;
int A[100009] = {};
int B[100009] = {};
int C[100009] = {};
int main() {
int N;
cin >> N;
for (int in = 1; in <= N; in++) {
cin >> A[in] >> B[in] >> C[in];
}
int dp[100009][3];
dp[0][0] = 0;
dp[0][1] = 0;
dp[0][2] = 0;
for (int day = 1; day <= N; day++) {... | #include <iostream>
using namespace std;
int A[100009] = {};
int B[100009] = {};
int C[100009] = {};
int main() {
int N;
cin >> N;
for (int in = 1; in <= N; in++) {
cin >> A[in] >> B[in] >> C[in];
}
int dp[100009][3];
dp[0][0] = 0;
dp[0][1] = 0;
dp[0][2] = 0;
for (int day = 1; day <= N; day++) {... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 965,296 | 965,297 | u617525345 | cpp |
p03163 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl "\n"
#define ll long long
#define pb emplace_back
#define fi first
#define se second
#define pll pair<ll, ll>
#define ull unsigned long long
#define ld long double
#define debug(x) cout << #x << " :: " ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl "\n"
#define int ll
#define ll long long
#define pb emplace_back
#define fi first
#define se second
#define pll pair<ll, ll>
#define ull unsigned long long
#define ld long double
#define debug(x) cout <... | [] | 965,302 | 965,303 | u298511956 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, w, sol = 0;
int weight[101];
int value[101];
int dp[101][100005];
int main() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> weight[i];
cin >> value[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, w, sol = 0;
int weight[101];
int value[101];
ll dp[101][100005];
int main() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> weight[i];
cin >> value[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
... | [
"variable_declaration.type.change"
] | 965,306 | 965,307 | u787597250 | cpp |
p03163 | //
#include <algorithm>
#include <array>
#include <bitset>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <set>
#include <vector>
//
using ll = long long;
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
inline void yes(bool cond) { cond ? puts("Yes") : puts("No"... | //
#include <algorithm>
#include <array>
#include <bitset>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <set>
#include <vector>
//
using ll = long long;
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
inline void yes(bool cond) { cond ? puts("Yes") : puts("No"... | [
"literal.number.change",
"call.arguments.change"
] | 965,308 | 965,309 | u337949146 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int v[n], w[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
int dp[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0) {
dp[i][j] = 0;
} e... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, W;
cin >> n >> W;
long long int v[n], w[n];
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
long long int dp[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0 || j == 0) {
... | [
"variable_declaration.type.widen.change"
] | 965,313 | 965,314 | u466076667 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
int i, j;
cin >> N >> W;
vector<int> w(N);
vector<int> v(N);
vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
for (i = 0; i < N; i++)
cin >> w[i] >> v[i];
for (i = 0; i < N; i++)
for (j = 0; j <= W; j++) {
if (j >= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, W;
int i, j;
cin >> N >> W;
vector<long> w(N);
vector<long> v(N);
vector<vector<long>> dp(N + 1, vector<long>(W + 1, 0));
for (i = 0; i < N; i++)
cin >> w[i] >> v[i];
for (i = 0; i < N; i++)
for (j = 0; j <= W; j++) {
if (j... | [
"variable_declaration.type.primitive.change"
] | 965,318 | 965,319 | u900753971 | cpp |
p03163 | /*
Educational DP Contest - D - Knapsack 1
https://atcoder.jp/contests/dp/tasks/dp_d
*/
#include <bits/stdc++.h>
using namespace std;
#define FAST_INP \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef... | /*
Educational DP Contest - D - Knapsack 1
https://atcoder.jp/contests/dp/tasks/dp_d
*/
#include <bits/stdc++.h>
using namespace std;
#define FAST_INP \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 965,322 | 965,323 | u040094338 | cpp |
p03163 | /*
Educational DP Contest - D - Knapsack 1
https://atcoder.jp/contests/dp/tasks/dp_d
*/
#include <bits/stdc++.h>
using namespace std;
#define FAST_INP \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef... | /*
Educational DP Contest - D - Knapsack 1
https://atcoder.jp/contests/dp/tasks/dp_d
*/
#include <bits/stdc++.h>
using namespace std;
#define FAST_INP \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 965,322 | 965,324 | u040094338 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forr(i, n) for (ll i = 0; i < n; i++)
#define f(i, a, b) for (ll i = a; i < b; i++)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define endl '\n'
#define ce(ele) cout << ele << ' '
#define cs... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forr(i, n) for (ll i = 0; i < n; i++)
#define f(i, a, b) for (ll i = a; i < b; i++)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define endl '\n'
#define ce(ele) cout << ele << ' '
#define cs... | [
"variable_declaration.type.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change"
] | 965,330 | 965,331 | u987274574 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n, wt;
cin >> n >> wt;
vector<int> w(n), v(n), t(wt + 1, 0);
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> val(n + 1, t);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= wt; j++) {
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, wt;
cin >> n >> wt;
vector<ll> w(n), v(n), t(wt + 1, 0);
for (ll i = 0; i < n; i++)
cin >> w[i] >> v[i];
vector<vector<ll>> val(n + 1, t);
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= wt; j++) {
val... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 965,332 | 965,333 | u987274574 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<int> dp(w + 1, 0);
for (int i = 0; i < n; i++) {
int weight, value;
cin >> weight >> value;
for (int j = w - weight; j >= 0; j--) {
dp[j + weight] = max(dp[j + weight], dp[j] + ... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<ll> dp(w + 1, 0);
for (int i = 0; i < n; i++) {
int weight, value;
cin >> weight >> value;
for (int j = w - weight; j >= 0; j--) {
dp[j + weight] = max(dp[j + weight], dp[j] + v... | [
"variable_declaration.type.change"
] | 965,334 | 965,335 | u987274574 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <vector>
#define INF 1e9
using namespace std;
struct item {
int wt;
int val;
};
// Bottom Up Approach
long long int knapsackBottomUp(vector<item> arr, int n, int W) {
int dp[n + 1][W + 1]; // Memory
// Base Case
for (int w = 0; w <= W; w++)
dp[1][w] = 0;... | #include <algorithm>
#include <iostream>
#include <vector>
#define INF 1e9
using namespace std;
struct item {
int wt;
int val;
};
// Bottom Up Approach
long long int knapsackBottomUp(vector<item> arr, int n, int W) {
long long int dp[n + 1][W + 1]; // Memory
// Base Case
for (int w = 0; w <= W; w++)
dp[... | [
"variable_declaration.type.widen.change"
] | 965,346 | 965,347 | u148301183 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n;
int w;
cin >> n >> w;
int arr[n][2];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
cin >> arr[i][j];
}
}
long long int dp[n + 1][w + 1];
// dp1[0]=max(dp[0][0],max(dp[0][1],dp[0][2]));... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n;
int w;
cin >> n >> w;
int arr[n][2];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
cin >> arr[i][j];
}
}
long long int dp[n + 1][w + 1];
// dp1[0]=max(dp[0][0],max(dp[0][1],dp[0][2]));... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 965,348 | 965,349 | u859645287 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <queue>
#include <stack>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(x, y) for (ll i = x; i <= y; i++)
#define repi(x, y) for (ll i = x; i >= y; i--)
priority_queue<l... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <queue>
#include <stack>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(x, y) for (ll i = x; i <= y; i++)
#define repi(x, y) for (ll i = x; i >= y; i--)
priority_queue<l... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 965,350 | 965,351 | u320525899 | cpp |
p03163 | // Knapsack
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define req(i, a, b) for (int i = (int)b - 1; i >= a; i--)
#define all(a) (a).begin(), (a).end()
#define ret... | // Knapsack
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define req(i, a, b) for (int i = (int)b - 1; i >= a; i--)
#define all(a) (a).begin(), (a).end()
#define ret(x)... | [] | 965,352 | 965,353 | u765321936 | cpp |
p03163 | /* _________________________________________________________________________________________________
| | | Author : Aditya Ahuja | | Date :
Sun, 4th Aug 2019 |
|_____________________________________________________________________________... | /* _________________________________________________________________________________________________
| | | Author : Aditya Ahuja | | Date :
Sun, 4th Aug 2019 |
|_____________________________________________________________________________... | [] | 965,354 | 965,355 | u765321936 | cpp |
p03163 | /* _________________________________________________________________________________________________
| | | Author : Aditya Ahuja | | Date :
Thu, 20th Jun 2019 |
|_____________________________________________________________________________... | /* _________________________________________________________________________________________________
| | | Author : Aditya Ahuja | | Date :
Thu, 20th Jun 2019 |
|_____________________________________________________________________________... | [] | 965,356 | 965,357 | u765321936 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, capacity;
cin >> n >> capacity;
int wt[n], val[n];
for (int i = 0; i < n; i++)
cin >> wt[i] >> val[i];
int dp[n + 1][capacity + 1] = {};
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= capacity; j++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, capacity;
cin >> n >> capacity;
ll wt[n], val[n];
for (int i = 0; i < n; i++)
cin >> wt[i] >> val[i];
ll dp[n + 1][capacity + 1] = {};
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= capacity; j++) {
l... | [
"variable_declaration.type.change"
] | 965,358 | 965,359 | u659210268 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, w;
cin >> n >> w;
ll arr[n], wt[n];
for (int i = 0; i < n; i++) {
cin >> arr[i] >> wt[i];
}
ll dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, w;
cin >> n >> w;
ll arr[n], wt[n];
for (int i = 0; i < n; i++) {
cin >> arr[i] >> wt[i];
}
ll dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
... | [
"variable_declaration.type.change"
] | 965,360 | 965,361 | u659210268 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int n, w;
cin >> n >> w;
int arr[n], wt[n];
for (int i = 0; i < n; i++) {
cin >> arr[i] >> wt[i];
}
int dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, w;
cin >> n >> w;
ll arr[n], wt[n];
for (int i = 0; i < n; i++) {
cin >> arr[i] >> wt[i];
}
ll dp[n + 1][w + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
... | [
"variable_declaration.type.change"
] | 965,362 | 965,361 | u659210268 | cpp |
p03163 | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(... | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 965,369 | 965,370 | u344194703 | cpp |
p03163 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
const double eps = 1e-9;
int n;
const int N = 103, nax = 1e5 + 3;
ll W, w[N], v[N];
ll dp[N][nax];
ll rec(int ind, ll s) {
if (ind == n && s >= 0)
return 0;
else if (ind == n ... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
const double eps = 1e-9;
int n;
const int N = 103, nax = 1e5 + 3;
ll W, w[N], v[N];
ll dp[N][nax];
ll rec(int ind, ll s) {
if (ind == n && s >= 0)
return 0;
else if (ind == n ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 965,371 | 965,372 | u215674898 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, wt;
cin >> n >> wt;
int value[n], weight[n];
for (int i = 0; i < n; i++) {
cin >> weight[i] >> value[i];
}
int dp[n + 1][wt + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= n; i++) {
for (int w = 0; w <= wt; w++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, wt;
cin >> n >> wt;
long long int value[n], weight[n];
for (int i = 0; i < n; i++) {
cin >> weight[i] >> value[i];
}
long long int dp[n + 1][wt + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= n; i++) {
for (int w = 0; w... | [
"variable_declaration.type.widen.change"
] | 965,373 | 965,374 | u364129544 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
// map<int,int> m;
int w[n], v[n];
for (int i{}; i < n; i++) {
cin >> w[i] >> v[i];
}
int dp[W + 1]{};
// for(int i{};i<=W;i++){
// cout<<i<<"\t";
// }
//
for (int i = 0; i < n; i++) {
for (int j = W; w[... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, W;
cin >> n >> W;
// map<int,int> m;
long long w[n], v[n];
for (int i{}; i < n; i++) {
cin >> w[i] >> v[i];
}
long long dp[W + 1]{};
// for(int i{};i<=W;i++){
// cout<<i<<"\t";
// }
//
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,375 | 965,376 | u752124256 | cpp |
p03163 | #include <bits/stdc++.h>
#include <string.h>
#define ll long long
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <string.h>
#define ll long long
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"variable_declaration.type.change"
] | 965,378 | 965,379 | u375055372 | cpp |
p03163 | #include <bits/stdc++.h>
#include <string.h>
#define ll long long
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <string.h>
#define ll long long
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"call.arguments.add",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 965,380 | 965,379 | u375055372 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <vector>
#define lli long long int
#define INF 1e9 + 5
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<int> dp(W + 1, 0);
// dp[i] max value so that total weight is i
for (int i = 0; i < n; i++) {
int w, v;
cin >> w >> v;
// weig... | #include <algorithm>
#include <iostream>
#include <vector>
#define lli long long int
#define INF 1e9 + 5
using namespace std;
int main() {
int n, W;
cin >> n >> W;
vector<lli> dp(W + 1, 0);
// dp[i] max value so that total weight is i
for (int i = 0; i < n; i++) {
lli w, v;
cin >> w >> v;
// weig... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 965,381 | 965,382 | u375055372 | cpp |
p03163 | #include <bits/stdc++.h>
#define ll long long
#define vi vector<ll>
#define vii vector<vector<int>>
#define mii map<int, int>
#define pb push_back
#define mod 1e9 + 7;
const int INF = 1e9 + 5;
#define PQ priority_queue<int>
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
int knap(ll... | #include <bits/stdc++.h>
#define ll long long int
#define vi vector<ll>
#define vii vector<vector<int>>
#define mii map<int, int>
#define pb push_back
#define mod 1e9 + 7;
const int INF = 1e9 + 5;
#define PQ priority_queue<int>
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
ll knap... | [] | 965,386 | 965,387 | u402611027 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, w;
cin >> n >> w;
vector<vector<int>> dp(n + 1, vector<int>(w + 1));
vector<pair<int, int>> data(n + 1);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
data[i + 1] = {a, b};
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, w;
cin >> n >> w;
vector<vector<long long>> dp(n + 1, vector<long long>(w + 1));
vector<pair<int, int>> data(n + 1);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
data[i + 1] = ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 965,388 | 965,389 | u897417872 | cpp |
p03163 | #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)... | [
"variable_declaration.type.change"
] | 965,390 | 965,391 | u915716225 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, wt;
cin >> n >> wt;
int w[n + 1], v[n + 1], dp[wt + 1];
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= wt; i++)
dp[i] = 0;
for (int j = 1; j <= n; j++)
for (int i = wt; i >= 1; i--)
if (w[j] <= i)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, wt;
cin >> n >> wt;
int w[n + 1], v[n + 1];
long long int dp[wt + 1];
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= wt; i++)
dp[i] = 0;
for (int j = 1; j <= n; j++)
for (int i = wt; i >= 0; i--)
if... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 965,393 | 965,394 | u659211619 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, wt;
cin >> n >> wt;
int w[n + 1], v[n + 1], dp[wt + 1];
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= wt; i++)
dp[i] = 0;
for (int j = 1; j <= n; j++)
for (int i = wt; i >= 1; i--)
if (w[j] <= i)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, wt;
cin >> n >> wt;
long long int w[n + 1], v[n + 1], dp[wt + 1];
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= wt; i++)
dp[i] = 0;
for (int j = 1; j <= n; j++)
for (int i = wt; i >= 0; i--)
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 965,393 | 965,395 | u659211619 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, wt;
cin >> n >> wt;
int w[n + 1], v[n + 1], dp[wt + 1];
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= wt; i++)
dp[i] = 0;
for (int j = 1; j <= n; j++)
for (int i = wt; i >= 1; i--)
if (w[j] <= i)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, wt;
cin >> n >> wt;
long long int w[n + 1], v[n + 1], dp[wt + 1];
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= wt; i++)
dp[i] = 0;
for (int j = 1; j <= n; j++)
for (int i = wt; i >= 1; i--)
... | [
"variable_declaration.type.widen.change"
] | 965,393 | 965,396 | u659211619 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N), v(N);
vector<vector<int>> NW(N + 1, vector<int>(W + 1));
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
f... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
long N, W;
cin >> N >> W;
vector<long> w(N), v(N);
vector<vector<long>> NW(N + 1, vector<long>(W + 1));
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}... | [
"variable_declaration.type.primitive.change"
] | 965,397 | 965,398 | u659211619 | cpp |
p03163 | #include <bits/stdc++.h>
using namespace std;
void print_err() { cerr << "\n"; }
template <class T, class... Arg> void print_err(T x, Arg &&...args) {
cerr << x << " ";
print_err(args...);
}
#ifdef local
#define debug(...) print_err(__VA_ARGS__)
#else
#define debug(...)
#endif
// #include <ext/pb_ds/assoc_container... | #include <bits/stdc++.h>
using namespace std;
void print_err() { cerr << "\n"; }
template <class T, class... Arg> void print_err(T x, Arg &&...args) {
cerr << x << " ";
print_err(args...);
}
#ifdef local
#define debug(...) print_err(__VA_ARGS__)
#else
#define debug(...)
#endif
// #include <ext/pb_ds/assoc_container... | [] | 965,402 | 965,403 | u950979790 | cpp |
p03163 | // author:satwik_bhv1
#include <bits/stdc++.h>
// datatypes
#define ll long long
#define ld long double
// loops
#define fr(i, z, n) for (ll i = z; i < n; i++)
#define br(i, z, n) for (ll i = z; i > n; i--)
// operations
#define mp make_pair
#define ff first
#define ss second
#define pub push_back
#define all(v) v.begi... | // author:satwik_bhv1
#include <bits/stdc++.h>
// datatypes
#define ll long long
#define ld long double
// loops
#define fr(i, z, n) for (ll i = z; i < n; i++)
#define br(i, z, n) for (ll i = z; i > n; i--)
// operations
#define mp make_pair
#define ff first
#define ss second
#define pub push_back
#define all(v) v.begi... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 965,407 | 965,406 | u136100045 | cpp |
p03163 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int rec(vector<int> val, vector<int> weight, int i, int w) {
if (i == 0 || w == 0)
return 0;
// if(w < 0) return 0;
if (weight[i - 1] > w) {
rec(val, weight, i - 1, w);
}
return max(val[i - 1] + rec(val... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int rec(vector<int> val, vector<int> weight, int i, int w) {
if (i == 0 || w == 0)
return 0;
// if(w < 0) return 0;
if (weight[i - 1] > w) {
rec(val, weight, i - 1, w);
}
return max(val[i - 1] + rec(val... | [
"variable_declaration.type.primitive.change"
] | 965,408 | 965,409 | u782653321 | cpp |
p03163 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<int> val(n), wt(n);
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
vector<vector<int>> knap(n + 1, vector<int>(w + 1));
for (int i = 1; i <= n; i++) {
for (in... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<int> val(n), wt(n);
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
}
vector<vector<long long int>> knap(n + 1, vector<long long int>(w + 1));
for (int i = 1; i <= n... | [
"variable_declaration.type.widen.change"
] | 965,410 | 965,411 | u754088473 | cpp |
p03163 | // بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيم
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define el cout << '\n';
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | // بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيم
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define el cout << '\n';
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 965,414 | 965,413 | u454940171 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.