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 |
|---|---|---|---|---|---|---|---|
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
vector<long> a(n + 1);
for (long i = 1; i <= n; i++) {
cin >> a[i];
}
vector<long> dp(k + 1);
for (long i = 1; i <= k + 1; i++) {
for (long j = 1; j <= n + 1; j++) {
if (i - a[j] >= 0 && dp[i - a[j]] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
vector<long> a(n + 1);
for (long i = 1; i <= n; i++) {
cin >> a[i];
}
vector<long> dp(k + 2);
for (long i = 1; i <= k + 1; i++) {
for (long j = 1; j <= n; j++) {
if (i - a[j] >= 0 && dp[i - a[j]] == 0)... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.off_by_one",
"io.output.change"
] | 978,553 | 978,552 | u229596090 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
vector<long> a(n + 1);
for (long i = 1; i <= n; i++) {
cin >> a[i];
}
vector<long> dp(k + 1);
for (long i = 1; i <= k; i++) {
for (long j = 1; j <= n; j++) {
if (i - a[j] >= 0 && dp[i - a[j]] == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
vector<long> a(n + 1);
for (long i = 1; i <= n; i++) {
cin >> a[i];
}
vector<long> dp(k + 2);
for (long i = 1; i <= k + 1; i++) {
for (long j = 1; j <= n; j++) {
if (i - a[j] >= 0 && dp[i - a[j]] == 0)... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.off_by_one",
"io.output.change"
] | 978,554 | 978,552 | u229596090 | cpp |
p03170 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll n, k, x, i, j, dp[200005];
set<ll> s;
vector<ll> v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cerr.tie(0);
cout.tie(0);
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> x;
v.pb(x);
}
for (i =... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll n, k, x, i, j, dp[200005];
set<ll> s;
vector<ll> v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cerr.tie(0);
cout.tie(0);
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> x;
v.pb(x);
}
for (i =... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,557 | 978,558 | u111912627 | cpp |
p03170 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll n, k, x, i, j, dp[200005];
set<ll> s;
vector<ll> v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cerr.tie(0);
cout.tie(0);
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> x;
v.pb(x);
}
for (i =... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll n, k, x, i, j, dp[200005];
set<ll> s;
vector<ll> v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cerr.tie(0);
cout.tie(0);
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> x;
v.pb(x);
}
for (i =... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,559 | 978,558 | u111912627 | cpp |
p03170 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<bool> dp(n + 1, 0);
for (int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<bool> dp(k + 1, 0);
for (int... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 978,564 | 978,565 | u724012411 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x <<... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x <<... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 978,572 | 978,573 | u929582923 | cpp |
p03170 |
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#define pb push_back
#define IOS \
ios_base::... |
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#define pb push_back
#define IOS \
ios_base::... | [
"expression.operation.binary.remove"
] | 978,580 | 978,581 | u524492594 | cpp |
p03170 | #include <cstdio>
#include <cstring>
#define N 110
using namespace std;
int n, k;
int dp[N][2];
int a[N];
bool dfs(int k, int t) {
if (dp[k][t] >= 0)
return dp[k][t];
int ans = 0;
for (int i = 1; i <= n; i++)
if (k >= a[i])
ans |= !dfs(k - a[i], !t);
return dp[k][t] = ans;
}
signed main() {
m... | #include <cstdio>
#include <cstring>
#define N 100010
using namespace std;
int n, k;
int dp[N][2];
int a[N];
bool dfs(int k, int t) {
if (dp[k][t] >= 0)
return dp[k][t];
int ans = 0;
for (int i = 1; i <= n; i++)
if (k >= a[i])
ans |= !dfs(k - a[i], !t);
return dp[k][t] = ans;
}
signed main() {
... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 978,586 | 978,587 | u251934001 | cpp |
p03170 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define REPvec(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007 // 1e9+7
using namespace std;
typedef long long ll;
typedef vector<bool> vecbool;
typedef vector<int> vecint;
t... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define REPvec(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007 // 1e9+7
using namespace std;
typedef long long ll;
typedef vector<bool> vecbool;
typedef vector<int> vecint;
t... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 978,592 | 978,593 | u138062788 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k, A[200000], dp[200000];
cin >> n >> k;
rep(i, n) cin >> A[i];
dp[0] = 2;
rep(i, n) {
int z = 0;
rep(j, n) if (dp[i + 1 - A[j]] != 2) z++;
if (z == n)
dp[i + 1] = 2;
else
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k, A[200000], dp[200000];
cin >> n >> k;
rep(i, n) cin >> A[i];
dp[0] = 2;
rep(i, k) {
int z = 0;
rep(j, n) if (dp[i + 1 - A[j]] != 2) z++;
if (z == n)
dp[i + 1] = 2;
else
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 978,596 | 978,597 | u441296840 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
#define mp make_pair
#define pb push_back
#define ii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define vl vector<vector<ll>>
#define eb emplace_back
int main() {
int n, k;
... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
#define mp make_pair
#define pb push_back
#define ii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define vl vector<vector<ll>>
#define eb emplace_back
int main() {
int n, k;
... | [
"expression.operation.binary.remove"
] | 978,600 | 978,601 | u416354178 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
#define mp make_pair
#define pb push_back
#define ii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define vl vector<vector<ll>>
#define eb emplace_back
int main() {
int n, k;
... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
#define mp make_pair
#define pb push_back
#define ii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define vl vector<vector<ll>>
#define eb emplace_back
int main() {
int n, k;
... | [
"expression.operation.binary.remove"
] | 978,602 | 978,601 | u416354178 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
#define mp make_pair
#define pb push_back
#define ii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define vl vector<vector<ll>>
#define eb emplace_back
int main() {
int n, k;
... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
#define mp make_pair
#define pb push_back
#define ii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define vl vector<vector<ll>>
#define eb emplace_back
int main() {
int n, k;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 978,603 | 978,601 | u416354178 | cpp |
p03170 | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 978,604 | 978,605 | u167683777 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); ... | [
"assignment.change"
] | 978,610 | 978,611 | u167282925 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, n, imin = 0;
int minn = INT_MAX;
int maxx = INT_MIN;
cin >> n >> k;
int dp[k + 1];
int arr[n];
for (i = 0; i <= k; i++) {
dp[i] = 1;
}
for (i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] < minn) {
imin = i;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, n, imin = 0;
int minn = INT_MAX;
int maxx = INT_MIN;
cin >> n >> k;
int dp[k + 1];
int arr[n];
for (i = 0; i <= k; i++) {
dp[i] = 1;
}
for (i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] < minn) {
imin = i;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 978,615 | 978,616 | u531129785 | cpp |
p03170 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define endl '\n'
#define N 200005
ll a[N], dp[N], n, k;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
cin >> n >> k;
for (ll i = 1; i <= n; i++)
cin >> a[i];
for (ll i = 1; i <= k; i++) {
for (ll j = 1; j <= n; j++)... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define endl '\n'
#define N 200005
ll a[N], dp[N], n, k;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
cin >> n >> k;
for (ll i = 1; i <= n; i++)
cin >> a[i];
for (ll i = 1; i <= k; i++) {
for (ll j = 1; j <= n; j++)... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"assignment.variable.change"
] | 978,617 | 978,618 | u822543121 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
bool dp[k + 1];
memset(dp, false, sizeof(dp));
for (int i = 1; i < k + 1; i++) {
for (int j = 0; j < n; j++) {
if (i == arr[j]) {
dp[i] = true;
... | #include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
bool dp[k + 1];
memset(dp, false, sizeof(dp));
for (int i = 1; i < k + 1; i++) {
for (int j = 0; j < n; j++) {
if (i == arr[j]) {
dp[i] = true;
... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 978,623 | 978,624 | u227478170 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define all(s) s.begin(), s.end()
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const int INF = 1e18... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define all(s) s.begin(), s.end()
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const int INF = 1e18... | [
"variable_declaration.value.change"
] | 978,625 | 978,626 | u885523920 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
int i;
for (i = 0; i < n; i++)
cin >> a[i];
int dp[n + 1];
memset(dp, 0, sizeof(dp));
for (i = 0; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (i >= a[j] && dp[i - a[j]] == 0)
dp[i] = 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
int i;
for (i = 0; i < n; i++)
cin >> a[i];
int dp[k + 1];
memset(dp, 0, sizeof(dp));
for (i = 0; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (i >= a[j] && dp[i - a[j]] == 0)
dp[i] = 1... | [
"identifier.change",
"expression.operation.binary.change"
] | 978,627 | 978,628 | u931624197 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main() {
fastio;
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[k + 1] = {0};
for (int i = 0; i <= k; i++) {
for (int j = 0; j < n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main() {
fastio;
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[k + 1] = {0};
for (int i = 0; i <= k; i++) {
for (int j = 0; j < n; j++) {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 978,629 | 978,630 | u719855312 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n + 1] = {0};
for (int i = 1; i <= k; i++)
for (int j = 0; j < n; j++) {
if (i - a[j] < 0)
continue;
else if (dp[i - a[j]] == 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[k + 1] = {0};
for (int i = 1; i <= k; i++)
for (int j = 0; j < n; j++) {
if (i - a[j] < 0)
continue;
else if (dp[i - a[j]] == 0)
... | [
"identifier.change",
"expression.operation.binary.change"
] | 978,631 | 978,632 | u647025182 | cpp |
p03170 | // stay hungry, stay foolish
//#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define ld long double
#define loopi(stop) for (int i = 0; i < stop; i++)
#define loopj(stop2) for (int j = 0; j < stop2; j++)
#define loopk(stop3) for (int k = 0; k < stop3; k++)
#define loopi1(stop) for (int i = 1; i <= ... | // stay hungry, stay foolish
//#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define ld long double
#define loopi(stop) for (int i = 0; i < stop; i++)
#define loopj(stop2) for (int j = 0; j < stop2; j++)
#define loopk(stop3) for (int k = 0; k < stop3; k++)
#define loopi1(stop) for (int i = 1; i <= ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 978,645 | 978,646 | u532629518 | cpp |
p03170 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 978,649 | 978,650 | u136342563 | cpp |
p03170 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 978,656 | 978,657 | u484274300 | cpp |
p03170 | // Date: 2020-03-13
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define FIO \
ios::sync_with_stdio(false); ... | // Date: 2020-03-13
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define FIO \
ios::sync_with_stdio(false); ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 978,658 | 978,659 | u896441219 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool dp[100005] = {};
int main() {
int n, k;
scanf("%d%d.0", &n, &k);
vector<int> arr(n);
for (int &x : arr)
scanf("%d", &x);
sort(arr.begin(), arr.end());
// dp[i] - true if first one wins after moving optimally
for (int stones = 0;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool dp[100005] = {};
int main() {
int n, k;
scanf("%d%d.0", &n, &k);
vector<int> arr(n);
for (int &x : arr)
scanf("%d", &x);
sort(arr.begin(), arr.end());
// dp[i] - true if first one wins after moving optimally
for (int stones = 0;... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 978,660 | 978,661 | u645596292 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int n, k, dp[105][2];
int a[105];
bool dfs(int k, int t) {
if (dp[k][t] >= 0)
return dp[k][t];
int ans = 0;
for (int i = 1; i <= n; i++)
if (k >= a[i])
ans |= !dfs(k - a[i], !t);
return dp[k][t] = ans;
}
int main() {
memset(dp, -1, sizeof(dp));
sca... | #include <bits/stdc++.h>
using namespace std;
int n, k, dp[1000005][2];
int a[10000005];
bool dfs(int k, int t) {
if (dp[k][t] >= 0)
return dp[k][t];
int ans = 0;
for (int i = 1; i <= n; i++)
if (k >= a[i])
ans |= !dfs(k - a[i], !t);
return dp[k][t] = ans;
}
int main() {
memset(dp, -1, sizeof(dp... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 978,667 | 978,668 | u891911133 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef int in;
in a[105], n, k, mik, dp[10000005];
in fun(in k) {
if (k < mik)
return 1;
for (in i = 0; i < n; ++i)
if (k - a[i] >= 0) {
if (dp[k - a[i]] == -1) {
dp[k - a[i]] = fun(k - a[i]);
}
if (dp[k - a[i]] == 2)
retu... | #include <bits/stdc++.h>
using namespace std;
typedef int in;
in a[105], n, k, mik, dp[10000005];
in fun(in k) {
if (k < mik)
return 1;
for (in i = 0; i < n; ++i)
if (k - a[i] >= 0) {
if (dp[k - a[i]] == -1) {
dp[k - a[i]] = fun(k - a[i]);
}
if (dp[k - a[i]] == 2)
retu... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,677 | 978,678 | u371767259 | cpp |
p03170 | #include <bits/stdc++.h>
#define ll long long
#define fop(i, m, n) for (ll i = m; i < n; i++)
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v;
fop(i, 0, n) {
ll x;
cin >> x;
v.push_back(x);
}
bool win[k + 1] = {};
fop(i, 1, k + 1) {
fop(j, 0, n) {
if (i >= v[j]... | #include <bits/stdc++.h>
#define ll long long
#define fop(i, m, n) for (ll i = m; i < n; i++)
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v;
fop(i, 0, n) {
ll x;
cin >> x;
v.push_back(x);
}
bool win[k + 1] = {};
fop(i, 1, k + 1) {
fop(j, 0, n) {
if (i >= v[j]... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,681 | 978,682 | u494192771 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 978,689 | 978,690 | u277556971 | cpp |
p03170 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 978,697 | 978,698 | u043443359 | cpp |
p03170 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define ins insert
#define pob pop_back
#define er erase
#define emp empty
#define f first
#define s second
#define ff f.f
#define fs f.s
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define ins insert
#define pob pop_back
#define er erase
#define emp empty
#define f first
#define s second
#define ff f.f
#define fs f.s
... | [
"literal.number.change",
"expression.operation.binary.change"
] | 978,699 | 978,700 | u979412452 | cpp |
p03170 |
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[k + 1] = {0};
for (int i = 1; i < k + 1; i++) {
for (int j = 0; j < i; j++) {
if (a[j] <= i) {
if (b[i - a[j]] == 0) {
b[i] = 1;
... |
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[k + 1] = {0};
for (int i = 1; i < k + 1; i++) {
for (int j = 0; j < n; j++) {
if (a[j] <= i) {
if (b[i - a[j]] == 0) {
b[i] = 1;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 978,701 | 978,702 | u990119031 | cpp |
p03170 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i <= g; i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int N, K;
int main() {
int i, j, k;
vector<bool> dp(100010, false);
int a[105];
int MIN = 9999999;
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i <= g; i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int N, K;
int main() {
int i, j, k;
vector<bool> dp(100010, false);
int a[105];
int MIN = 9999999;
... | [
"expression.operation.binary.remove"
] | 978,708 | 978,709 | u880221923 | cpp |
p03170 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i <= g; i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int N, K;
int main() {
int i, j, k;
vector<bool> dp(100010, false);
int a[105];
int MIN = 9999999;
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i <= g; i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int N, K;
int main() {
int i, j, k;
vector<bool> dp(100010, false);
int a[105];
int MIN = 9999999;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 978,710 | 978,709 | u880221923 | cpp |
p03170 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i <= g; i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int N, K;
int main() {
int i, j, k;
vector<int> dp(100010, -1);
int a[105];
int MIN = 9999999;
ci... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i <= g; i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int N, K;
int main() {
int i, j, k;
vector<int> dp(200010, -1);
int a[105];
int MIN = 9999999;
int... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.add"
] | 978,711 | 978,712 | u880221923 | cpp |
p03170 | #include <bits/stdc++.h>
#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(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#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(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define limit(... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 978,718 | 978,719 | u850516963 | cpp |
p03170 | #include <iostream>
using namespace std;
int A[110];
bool F[100100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 1; i <= K; i++)
for (int j = 0; j < N; j++)
if (i >= A[j])
F[i] |= F[i - A[j]];
if (F[K])
puts("First");
else
puts("S... | #include <iostream>
using namespace std;
int A[110];
bool F[100100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 1; i <= K; i++)
for (int j = 0; j < N; j++)
if (i >= A[j])
F[i] |= (1 - F[i - A[j]]);
if (F[K])
puts("First");
else
p... | [] | 978,720 | 978,721 | u538921909 | cpp |
p03170 | #include <iostream>
using namespace std;
int n, k;
const int MAXN = 100 + 10;
const int MAXK = 100000 + 100;
int a[MAXN];
int dp[MAXK];
int main() {
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= n; j++) {
if (a[j] <= i) {
... | #include <iostream>
using namespace std;
int n, k;
const int MAXN = 100 + 10;
const int MAXK = 100000 + 100;
int a[MAXN];
int dp[MAXK];
int main() {
cin >> n;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= n; j++) {
if (a[j] <= i) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 978,728 | 978,729 | u803932112 | cpp |
p03170 | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P std::pair<int, int>
#define PiP std::pair<int, std::pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp std::m... | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P std::pair<int, int>
#define PiP std::pair<int, std::pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp std::m... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 978,730 | 978,731 | u147049801 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
bool dp[k + 1];
memset(dp, false, sizeof(dp));
for (int i = 0; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (i - arr[j] >= 0 && d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
bool dp[k + 1];
memset(dp, false, sizeof(dp));
for (int i = 0; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (i - arr[j] >= 0 && dp... | [
"expression.operation.binary.remove"
] | 978,837 | 978,838 | u934892029 | cpp |
p03170 | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
f... | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
f... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,841 | 978,842 | u560322763 | cpp |
p03170 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size();
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size();
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.unary.add"
] | 978,843 | 978,844 | u264405855 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << '=' << x << ' '
typedef long long ll;
typedef pair<int, int> pi;
// dp(i) = 1 if first player wins with i stones remaining
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> A(N + 5);
for (... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << '=' << x << ' '
typedef long long ll;
typedef pair<int, int> pi;
// dp(i) = 1 if first player wins with i stones remaining
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> A(N + 5);
for (... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 978,847 | 978,848 | u435691768 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define mp make_pair
#define pb(x) push_back(x)
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define vs vector<string>
#define pii pair<int,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define mp make_pair
#define pb(x) push_back(x)
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define vs vector<string>
#define pii pair<int,... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,852 | 978,853 | u754279713 | cpp |
p03170 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define he... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define he... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 978,863 | 978,864 | u306782289 | cpp |
p03170 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define rfor(i, n) for (int i = n - 1; i >= 0; --i)
#define rmod(x, y) (((x % y) + y) % y)
using namespace std;
typedef vector<int>::iterator vit;
typedef unsigned int uint;
typedef unsigned short ushort;
typedef long long ll;
const int MAXN =... | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define rfor(i, n) for (int i = n - 1; i >= 0; --i)
#define rmod(x, y) (((x % y) + y) % y)
using namespace std;
typedef vector<int>::iterator vit;
typedef unsigned int uint;
typedef unsigned short ushort;
typedef long long ll;
const int MAXN =... | [
"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.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.cha... | 978,867 | 978,868 | u558825435 | cpp |
p03170 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define rfor(i, n) for (int i = n - 1; i >= 0; --i)
#define rmod(x, y) (((x % y) + y) % y)
using namespace std;
typedef vector<int>::iterator vit;
typedef unsigned int uint;
typedef unsigned short ushort;
typedef long long ll;
const int MAXN =... | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define rfor(i, n) for (int i = n - 1; i >= 0; --i)
#define rmod(x, y) (((x % y) + y) % y)
using namespace std;
typedef vector<int>::iterator vit;
typedef unsigned int uint;
typedef unsigned short ushort;
typedef long long ll;
const int MAXN =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 978,869 | 978,870 | u558825435 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int dp[N];
int main() {
int n, k;
cin >> n >> k;
int a[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
dp[0] = 2;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= n; j++) {
if (i - a[j... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int dp[N];
int main() {
int n, k;
cin >> n >> k;
int a[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
dp[0] = 2;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= n; j++) {
if (i - a[j... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,879 | 978,880 | u109008163 | cpp |
p03170 | #include <bits/stdc++.h>
typedef long long int ll;
#define vaibhavv06 \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define end... | #include <bits/stdc++.h>
typedef long long int ll;
#define vaibhavv06 \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define end... | [
"variable_declaration.value.change"
] | 978,881 | 978,882 | u699580536 | cpp |
p03170 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <limits>
#include <queue>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
#define INF 1100000000000
#define MaX 100000
#define MOD 1000000007
typedef lon... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <limits>
#include <queue>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
#define INF 1100000000000
#define MaX 100000
#define MOD 1000000007
typedef lon... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,883 | 978,884 | u591914971 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> array(n);
int sum = 0;
for (int i = 0; i < n; i++)
cin >> array[i];
vector<bool> dp(k + 1, false);
for (int stones = 0; stones <= k; ++stones) {
for (int i = 0; i < n; ++i) {
if (stones >= array[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> array(n);
int sum = 0;
for (int i = 0; i < n; i++)
cin >> array[i];
vector<bool> dp(k + 1, false);
for (int stones = 0; stones <= k; ++stones) {
for (int i = 0; i < n; ++i) {
if (stones >= array[i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,889 | 978,890 | u073062346 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> array(n);
int sum = 0;
for (int i = 0; i < n; i++)
cin >> array[i];
vector<bool> dp(k + 1, 0);
for (int stones = 0; stones <= k; ++stones) {
for (int i = 0; i < n; ++i) {
if (stones >= array[i] &&... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> array(n);
int sum = 0;
for (int i = 0; i < n; i++)
cin >> array[i];
vector<bool> dp(k + 1, false);
for (int stones = 0; stones <= k; ++stones) {
for (int i = 0; i < n; ++i) {
if (stones >= array[i... | [
"call.arguments.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,891 | 978,890 | u073062346 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int INF = 1e9 + 5;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
int main() {
int n, k;
cin >> n >> k;
v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int INF = 1e9 + 5;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
int main() {
int n, k;
cin >> n >> k;
v... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 978,892 | 978,893 | u163673196 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
void solve() {
int n, k;
cin >> n >> k;
vector<int> s(n), dp(k + 1);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i <= k; i++) {
for (auto x : s) {
if (i >= x && !dp[i - x])
dp[x]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
void solve() {
int n, k;
cin >> n >> k;
vector<int> s(n), dp(k + 1);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i <= k; i++) {
for (auto x : s) {
if (i >= x && !dp[i - x])
dp[i]... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 978,894 | 978,895 | u958501859 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
void solve() {
int n, k;
cin >> n >> k;
vector<int> s(n), dp(n + 1);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i <= n; i++) {
for (auto x : s) {
if (i >= x && !dp[i - x])
dp[x]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
void solve() {
int n, k;
cin >> n >> k;
vector<int> s(n), dp(k + 1);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i <= k; i++) {
for (auto x : s) {
if (i >= x && !dp[i - x])
dp[i]... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 978,896 | 978,895 | u958501859 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define NIL -(long long)(1e9)
#define ll long long
// long long n,w;
bool dp[3005] = {0}; // true if cur player wins
int datas[3005];
int n, k;
int main() {
// memset(dp,-1,sizeof(dp));
// freopen("a.in","r",stdin); freopen("a.out","w",stdout);
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define NIL -(long long)(1e9)
#define ll long long
// long long n,w;
bool dp[100005] = {0}; // true if cur player wins
long long datas[3005];
int n, k;
int main() {
// memset(dp,-1,sizeof(dp));
// freopen("a.in","r",stdin); freopen("a.out","w",std... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 978,899 | 978,900 | u258931378 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fri(i, a, b) for (int i = a; i <= b; ++i)
#define fro(i, a, b) for (int i = a; i >= b; --i)
#define debug(P) cout << #P << " = " << P << endl;
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x, y)... | #include <bits/stdc++.h>
using namespace std;
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fri(i, a, b) for (int i = a; i <= b; ++i)
#define fro(i, a, b) for (int i = a; i >= b; --i)
#define debug(P) cout << #P << " = " << P << endl;
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x, y)... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 978,903 | 978,904 | u011179282 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// graph
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll)1e9 + 7;
const int MAX_INT = 1 << 17;
const long long INF_LL ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// graph
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll)1e9 + 7;
const int MAX_INT = 1 << 17;
const long long INF_LL ... | [
"assignment.value.change"
] | 978,907 | 978,908 | u181806820 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | [
"identifier.change",
"variable_access.subscript.index.change",
"function.return_value.change"
] | 978,915 | 978,916 | u052332717 | cpp |
p03170 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define out16(X) cout << setprecision(16) << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define out16(X) cout << setprecision(16) << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 978,919 | 978,920 | u086672186 | cpp |
p03170 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 978,923 | 978,924 | u366676780 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int dp[N], a[N];
int n, k;
int play(int l) {
if (dp[l] != -1)
return dp[n];
if (l == 0)
return 0;
int state = 0;
for (int i = 1; i <= n; i++) {
if (a[i] > l)
continue;
if (play(l - a[i]) == 0) {
state = 1;
bre... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int dp[N], a[N];
int n, k;
int play(int l) {
if (dp[l] != -1)
return dp[l];
if (l == 0)
return 0;
int state = 0;
for (int i = 1; i <= n; i++) {
if (a[i] > l)
continue;
if (play(l - a[i]) == 0) {
state = 1;
bre... | [
"identifier.change",
"variable_access.subscript.index.change",
"function.return_value.change"
] | 978,925 | 978,926 | u377964143 | cpp |
p03170 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,927 | 978,928 | u366125603 | cpp |
p03170 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,929 | 978,928 | u366125603 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, m, n) for (int i = m; i < n; i++)
ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n, k;
int a[n];
rep(i, 0, n) cin >> a[i];
bool p[k + 1];
p[0] = false;
rep(i, 0, k + 1) {
bool q = false;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, m, n) for (int i = m; i < n; i++)
ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, 0, n) cin >> a[i];
bool p[k + 1];
p[0] = false;
rep(i, 1, k + 1) {
bool q = false;
... | [
"literal.number.change",
"call.arguments.change"
] | 978,734 | 978,735 | u356701928 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define vec(x) vector<x>
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define matrix(x) vector<vector<x>>
#define all(v) v.begin(), v.end()
#define mem(a, b) memset(a, b, s... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define vec(x) vector<x>
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define matrix(x) vector<vector<x>>
#define all(v) v.begin(), v.end()
#define mem(a, b) memset(a, b, s... | [
"expression.operation.unary.add"
] | 978,740 | 978,741 | u088871523 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
bool dp[k + 1];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= k; i++) {
for (int val : a) {
if (val > i)
continue;
if (dp[i - val] ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
bool dp[k + 1];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= k; i++) {
for (int val : a) {
if (val > i)
continue;
if (dp[i - val] == 0)
... | [
"expression.operation.binary.remove"
] | 978,746 | 978,747 | u962801933 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
bool dp[k + 1];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= k; i++) {
for (int val : a) {
if (val > i)
continue;
else if (dp[i - va... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
bool dp[k + 1];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= k; i++) {
for (int val : a) {
if (val > i)
continue;
if (dp[i - val] == 0)
... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow... | 978,748 | 978,747 | u962801933 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int dp[100001][2];
int a[100], n, min_val = INT_MAX;
int dfs(int k, int level) {
if (k < min_val)
return level;
if (dp[k][level] != -1)
return dp[k][level];
if (level == 0) {
int mx = 0;
for (int i = 0; i < n; i++) {
if (k >= a[i])
mx = m... | #include <bits/stdc++.h>
using namespace std;
int dp[100001][2];
int a[100], n, min_val = INT_MAX;
int dfs(int k, int level) {
if (k < min_val)
return level;
if (dp[k][level] != -1)
return dp[k][level];
if (level == 0) {
int mx = 0;
for (int i = 0; i < n; i++) {
if (k >= a[i])
mx = m... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,749 | 978,750 | u230341913 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 978,753 | 978,754 | u877494916 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define loop(i, a, b) for (ll i = a; i < b; i++)
#define rloop(i, a, b) for (ll i = a; i > b; i--)
const int inf = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
loop(i, 0, n) { cin >> a[i]; }
bool dp[k + 1];
dp[0] = false;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define loop(i, a, b) for (ll i = a; i < b; i++)
#define rloop(i, a, b) for (ll i = a; i > b; i--)
const int inf = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
loop(i, 0, n) { cin >> a[i]; }
bool dp[k + 1];
dp[0] = false;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,758 | 978,759 | u933095385 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define faster \
cin.tie(0); \
ios_base::sync_with_stdio(0)
#define ll long long
// # setprecision doubt
int n, k;
int main() {
int temp;... | #include <bits/stdc++.h>
using namespace std;
#define faster \
cin.tie(0); \
ios_base::sync_with_stdio(0)
#define ll long long
// # setprecision doubt
int n, k;
int main() {
int temp;... | [
"control_flow.branch.if.condition.change"
] | 978,760 | 978,761 | u829903680 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(101);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<bool> dp(k + 1, 0);
for (int i = 1; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (a[j] > i) {
continue;
}
if (dp[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(101);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<bool> dp(k + 1, 0);
for (int i = 1; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (a[j] > i) {
continue;
}
if (dp[... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,766 | 978,767 | u997276644 | cpp |
p03170 | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
const int INF = 1e9;
#define ll long long
#define int ll
#define fast ... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
const int INF = 1e9;
#define ll long long
#define int ll
#define fast ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 978,768 | 978,769 | u556783345 | cpp |
p03170 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
int a[n];
bool dp[k + 1];
// memset(dp,false,sizeof(dp));
dp[0] = false;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i <= k; i++) {
dp[i] = false;
for (int j = 0; j < n; j++) {
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
bool dp[k + 1];
// memset(dp,false,sizeof(dp));
dp[0] = false;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i <= k; i++) {
dp[i] = false;
for (int j = 0; j < n; j++) ... | [
"expression.operation.binary.add"
] | 978,772 | 978,773 | u842473278 | cpp |
p03170 | #include <bits/stdc++.h>
#define pb push_back
#define int long long int
#define f(i, a, b) for (int i = a; i < b; ++i)
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[k + 1] = {... | #include <bits/stdc++.h>
#define pb push_back
#define int long long int
#define f(i, a, b) for (int i = a; i < b; ++i)
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[k + 1] = {... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,776 | 978,777 | u971247494 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n, 0), dp(k + 1, 0);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
for (int i = 1; i <= k; i++) {
bool win = 0;
for (int j = 0; j < n; j++) {
if (i - arr[j] >= 0) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n, 0), dp(k + 1, 0);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
for (int i = 1; i <= k; i++) {
bool win = 0;
for (int j = 0; j < n; j++) {
if (i - arr[j] >= 0) {
if... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,784 | 978,785 | u492789403 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int dp[k + 1];
dp[0] = 2;
int c;
for (i = 1; i < k + 1; i++) {
c = 0;
for (j = 0; j < n; j++) {
if (i - a[j] >= 0 && dp[i - a[j]] == 2) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int dp[k + 1];
dp[0] = 2;
int c;
for (i = 1; i < k + 1; i++) {
c = 0;
for (j = 0; j < n; j++) {
if (i - a[j] >= 0 && dp[i - a[j]] == 2) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,797 | 978,798 | u639413043 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vvi vector<vector<int>>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vi a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vi dp(k + 1, 0);
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vvi vector<vector<int>>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vi a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vi dp(k + 1, 0);
for (int i = 0;... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 978,799 | 978,800 | u111302286 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vvi vector<vector<int>>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vi a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vi dp(k + 1);
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vvi vector<vector<int>>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vi a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vi dp(k + 1, 0);
for (int i = 0;... | [
"call.arguments.add",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 978,801 | 978,800 | u111302286 | cpp |
p03170 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack... | [
"expression.operation.binary.remove"
] | 978,802 | 978,803 | u469426472 | cpp |
p03170 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 978,804 | 978,803 | u469426472 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
bool dp[20005];
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < k; ++i) {
for (int j = 0; j < n; ++j) {
if (!dp[i])
dp[i + a[j]] = true;
}
}
if (dp[k]) {
... | #include <bits/stdc++.h>
using namespace std;
bool dp[200011];
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < k; ++i) {
for (int j = 0; j < n; ++j) {
if (!dp[i])
dp[i + a[j]] = true;
}
}
if (dp[k]) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 978,807 | 978,806 | u144029820 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<bool> dp(n + 5);
for (int stone = 0; stone <= k; stone++) {
for (int x : a) // Foreach stones in array a
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<bool> dp(k + 5);
for (int stone = 0; stone <= k; stone++) {
for (int x : a) // Foreach stones in array a
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 978,823 | 978,824 | u963948625 | cpp |
p03170 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 30)
bool dp[110000];
int a[110];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 30)
bool dp[110000];
int a[110];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 978,825 | 978,826 | u503228842 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int dp[300001];
int ar[300001];
int i, j, k, l, m, n;
int solve(int x) {
if (x == 0)
return 0;
if (dp[x] != -1)
return dp[x];
int ans = 0;
for (i = 0; i < n; i++) {
if (ar[i] > x)
continue;
if (solve(x - ar[i]) == 0) {
ans = 1;
... | #include <bits/stdc++.h>
using namespace std;
int dp[300001];
int ar[300001];
int j, k, l, m, n;
int solve(int x) {
if (x == 0)
return 0;
if (dp[x] != -1)
return dp[x];
int ans = 0;
for (int i = 0; i < n; i++) {
if (ar[i] > x)
continue;
if (solve(x - ar[i]) == 0) {
ans = 1;
... | [
"variable_declaration.remove"
] | 978,829 | 978,830 | u313897800 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int dp[300001];
int ar[300001];
int i, j, k, l, m, n;
int solve(int x) {
if (dp[x] != -1)
return dp[x];
if (x == 0)
return dp[x] = 0;
int ans = 0;
for (i = 0; i < n; i++) {
if (ar[i] > x)
continue;
if (solve(x - ar[i]) == 0) {
ans = 1... | #include <bits/stdc++.h>
using namespace std;
int dp[300001];
int ar[300001];
int j, k, l, m, n;
int solve(int x) {
if (dp[x] != -1)
return dp[x];
if (x == 0)
return dp[x] = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
if (ar[i] > x)
continue;
if (solve(x - ar[i]) == 0) {
ans = ... | [
"variable_declaration.remove"
] | 978,831 | 978,832 | u313897800 | cpp |
p03170 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define FOR(n) for (int i = 0; i < n; i++)
#define till(n) for (int i = 1; i <= n; i++)
#define mod 1000000007
using namespace std;
int main() {
// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define FOR(n) for (int i = 0; i < n; i++)
#define till(n) for (int i = 1; i <= n; i++)
#define mod 1000000007
using namespace std;
int main() {
// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,836 | 978,942 | u800717823 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
string solve(int arr[], int k, int n) {
vector<bool> dp(k + 1, 0);
for (int i = 1; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (i >= j) {
if (dp[i - arr[j]] == 0)
dp[i] = 1;
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
string solve(int arr[], int k, int n) {
vector<bool> dp(k + 1, 0);
for (int i = 1; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (i >= arr[j]) {
if (dp[i - arr[j]] == 0)
dp[i] = 1;
}
}... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 978,947 | 978,948 | u723953059 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
string solve(int arr[], int k, int n) {
vector<int> dp(k + 1, 0);
for (int i = 1; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (i >= j) {
if (dp[i - arr[j]] == 0)
dp[i] = 1;
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
string solve(int arr[], int k, int n) {
vector<bool> dp(k + 1, 0);
for (int i = 1; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (i >= arr[j]) {
if (dp[i - arr[j]] == 0)
dp[i] = 1;
}
}... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 978,949 | 978,948 | u723953059 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
// dp[i] - 1 if first player can win with i stones, 0 otherwise
int N, K, a[105];
bool dp[10005];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
dp[0] = 0;
for (int i = 1; i <= K; i++) {
bool find = false;
for (int j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
// dp[i] - 1 if first player can win with i stones, 0 otherwise
int N, K, a[105];
bool dp[100005];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
dp[0] = 0;
for (int i = 1; i <= K; i++) {
bool find = false;
for (int j = 0; j... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 978,950 | 978,951 | u052165189 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 978,961 | 978,962 | u127768253 | cpp |
p03170 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
bool dp[k + 1];
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
if (i >= a[j] && !dp[i - a[j]]) {
dp[i] = 1;
}
}
}
if (dp[k... | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
bool dp[k + 1] = {0};
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
if (i >= a[j] && !dp[i - a[j]]) {
dp[i] = 1;
}
}
}
if... | [
"variable_declaration.value.change"
] | 978,969 | 978,970 | u518232099 | cpp |
p03170 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace st... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace st... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 978,973 | 978,974 | u205309198 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; i++)
cin >> A[i];
// dp[i] = True if game is winnable by Taro
vector<bool> dp(K + 1, false);
dp[0] = false; // Taro loses if zero stones initially
for (int i = 1; i <= K;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; i++)
cin >> A[i];
// dp[i] = True if game is winnable by Taro
vector<bool> dp(K + 1, false);
dp[0] = false; // Taro loses if zero stones initially
for (int i = 1; i <= K;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 978,979 | 978,980 | u275188852 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; ++i)
cin >> arr[i];
bool dp[k + 1];
memset(dp, 0, sizeof(dp));
for (int i = 1; i < k + 1; ++i) {
for (int j = 0; j < n; ++j) {
bool t = 0;
if (i >= arr[j]) {
t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; ++i)
cin >> arr[i];
bool dp[k + 1];
memset(dp, 0, sizeof(dp));
for (int i = 1; i < k + 1; ++i) {
for (int j = 0; j < n; ++j) {
bool t = 0;
if (i >= arr[j]) {
t... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 978,985 | 978,986 | u562275919 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll T;
T = 6;
start:
while (T--) {
ll n, m;
cin >> n >> m;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll T;
T = 1;
start:
while (T--) {
ll n, m;
cin >> n >> m;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
... | [
"literal.number.change",
"assignment.value.change"
] | 978,991 | 978,992 | u772329566 | cpp |
p03170 | /***********************************************************
*This code By @1353055672(Ligen) *
*[Warning]You're not excepted to understand this code! *
*CSP-S 2019 RP++ *
***********************************************************/
// #pragma GCC... | /***********************************************************
*This code By @1353055672(Ligen) *
*[Warning]You're not excepted to understand this code! *
*CSP-S 2019 RP++ *
***********************************************************/
// #pragma GCC... | [] | 978,995 | 978,996 | u379604713 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.