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 |
|---|---|---|---|---|---|---|---|
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define flash \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define flash \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 980,347 | 980,348 | u796708160 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
const int MX = 105, MK = 1e5 + 10, MOD = 1e9;
// dp[i][j]: numbers of ways to distribute j candies to the children from 1 to i
int a[MX];
long long dp[MX][MK], prefix[MX][MK];
int main() {
// cin.sync_with_stdio(0), cin.tie(0);
// cout.sync_with_stdio(0), cout.tie(0);... | #include <bits/stdc++.h>
using namespace std;
const int MX = 105, MK = 1e5 + 10, MOD = 1e9 + 7;
// dp[i][j]: numbers of ways to distribute j candies to the children from 1 to i
int a[MX];
long long dp[MX][MK], prefix[MX][MK];
int main() {
// cin.sync_with_stdio(0), cin.tie(0);
// cout.sync_with_stdio(0), cout.tie... | [
"assignment.change"
] | 980,349 | 980,350 | u251934001 | cpp |
p03172 | #ifdef LOCAL
#pragma GCC optimize("O0")
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include... | #ifdef LOCAL
#pragma GCC optimize("O0")
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include... | [
"control_flow.return.add"
] | 980,359 | 980,360 | u331360010 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
ll dp[k + 1];
memset(dp, 0, sizeof(dp));
sort(a, a + n);
for (int i = 0; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (i + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
ll dp[k + 1];
memset(dp, 0, sizeof(dp));
sort(a, a + n);
for (int i = 0; i <= k; i++) {
for (int j = 0; j < n; j++) {
if (i + ... | [
"assignment.change"
] | 980,390 | 980,391 | u742642200 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
#define print printf("==================\n")
#define ll long long
#define pi acos(-1.0)
#define eps 1e-16
#define max3(a, b, c) max(a, max(b, c))
const ll INF = 1 << 30;
#define mod 1000000007
typedef pair<double, double> payar;
typedef struct {
ll x, y;
} point;
priority... | #include <bits/stdc++.h>
using namespace std;
#define print printf("==================\n")
#define ll long long
#define pi acos(-1.0)
#define eps 1e-16
#define max3(a, b, c) max(a, max(b, c))
const ll INF = 1 << 30;
#define mod 1000000007
typedef pair<double, double> payar;
typedef struct {
ll x, y;
} point;
priority... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 980,400 | 980,401 | u826108161 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sf(n) scanf("%lld", &n)
#define sff(n, m) scanf("%lld %lld", &n, &m)
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sf(n) scanf("%lld", &n)
#define sff(n, m) scanf("%lld %lld", &n, &m)
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0);... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 980,402 | 980,403 | u484673414 | cpp |
p03170 | #include <iostream>
using namespace std;
int main() {
int n, K;
cin >> n >> K;
int niz[n];
for (int i = 0; i < n; i++)
cin >> niz[i];
int df[K + 1];
df[0] = 2;
for (int i = 1; i < K + 1; i++) {
bool t = false;
for (int j = 0; j < n; j++) {
if (i > niz[j] && df[i - niz[j]] == 2) {
... | #include <iostream>
using namespace std;
int main() {
int n, K;
cin >> n >> K;
int niz[n];
for (int i = 0; i < n; i++)
cin >> niz[i];
int df[K + 1];
df[0] = 2;
for (int i = 1; i < K + 1; i++) {
bool t = false;
for (int j = 0; j < n; j++) {
if (i >= niz[j] && df[i - niz[j]] == 2) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 980,406 | 980,407 | u415103410 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1e9 + 5;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
int k;
cin >> k;
int a[n + 1];
for (int i = 1; i <= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1e9 + 5;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
int k;
cin >> k;
int a[n + 1];
for (int i = 1; i <= ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 980,410 | 980,411 | u327949948 | cpp |
p03170 | // in progress
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fr(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define rfr(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define PI 3.14159265
int main() {
ios_base::sync_w... | // in progress
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fr(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define rfr(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define PI 3.14159265
int main() {
ios_base::sync_w... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 980,416 | 980,417 | u760859588 | cpp |
p03170 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int n, k;
cin >> n >> k;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector<bool> win(k + 1, false);
for (int i = 1; i <= k; i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int n, k;
cin >> n >> k;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector<bool> win(k + 1, false);
for (int i = 1; i <= k; i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 980,420 | 980,421 | u304373839 | cpp |
p03170 | // Author : Rifayat Samee (Sanzee)
// Problem :
// Algorithm:
/*
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n, k;
scanf("%d %d", &n, &k);
vector<int> A(n + 1);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
... | // Author : Rifayat Samee (Sanzee)
// Problem :
// Algorithm:
/*
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n, k;
scanf("%d %d", &n, &k);
vector<int> A(n + 1);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 980,422 | 980,423 | u926505307 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define X first
#define Y second
#define pb push_back
void solve();
int main() {
// freopen("schools.in", "r", stdin);
// freopen("schools.out", "w", stdout);
ios_base::sync_with_stdio(0), cin.tie(0);
// cout << fixed ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define X first
#define Y second
#define pb push_back
void solve();
int main() {
// freopen("schools.in", "r", stdin);
// freopen("schools.out", "w", stdout);
ios_base::sync_with_stdio(0), cin.tie(0);
// cout << fixed ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 980,424 | 980,425 | u740864903 | cpp |
p03170 | // 104 solved
#include <bits/stdc++.h>
using namespace std;
int a[101];
bool dp[100005][2];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
dp[a[i]][0] = dp[a[i]][1] = 1;
}
for (int i = 0; i <= k; i++) {
for (int... | // 104 solved
#include <bits/stdc++.h>
using namespace std;
int a[101];
bool dp[100005][2];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
dp[a[i]][0] = dp[a[i]][1] = 1;
}
for (int i = 0; i <= k; i++) {
for (int... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 980,430 | 980,431 | u557558723 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 980,436 | 980,437 | u550398291 | cpp |
p03170 | #include <bits/stdc++.h>
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iter... | #include <bits/stdc++.h>
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iter... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 980,440 | 980,441 | u611336065 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int MOD = 1e9 + 7;
void add(int &a, int b) { a = (a + b) % MOD; }
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
dp[0][0] = 1;
for... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int MOD = 1e9 + 7;
void add(int &a, int b) { a = (a + b) % MOD; }
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
dp[0][0] = 1;
for... | [
"expression.operation.binary.add"
] | 980,442 | 980,443 | u020239256 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define FASTIO \
cin.tie(0); \
cout.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define FASTIO \
cin.tie(0); \
cout.tie(0); ... | [
"assignment.change"
] | 980,454 | 980,455 | u574412517 | cpp |
p03172 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mk make_pair
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vl vector<long long int>
#define vvl vector<vector<ll>>
#define fo(i, a, b) for (int i = a; i < b; i++)
#define rof(i, a, b) for (int i = b; i >= a; i-... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mk make_pair
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vl vector<long long int>
#define vvl vector<vector<ll>>
#define fo(i, a, b) for (int i = a; i < b; i++)
#define rof(i, a, b) for (int i = b; i >= a; i-... | [
"assignment.change"
] | 980,456 | 980,457 | u366949104 | cpp |
p03172 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int, int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve() {}
int main() {
... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int, int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve() {}
int main() {
... | [
"assignment.change"
] | 980,462 | 980,463 | u997146378 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
#define ll long long int
void add_self(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
void set_self(ll &a, ll b) {
a -= b;
if (a < 0)
a += mod;
}
int main() {
int n, candies;
cin >> n >> candies;
vector<int> upto(n);
for... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
#define ll long long int
void add_self(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
void set_self(ll &a, ll b) {
a -= b;
if (a < 0)
a += mod;
}
int main() {
int n, candies;
cin >> n >> candies;
vector<int> upto(n);
for... | [
"expression.operation.binary.remove"
] | 980,474 | 980,475 | u036426043 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mdl = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll ans[n + 1][k + 1];
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i <= k; i++) {
ans[1][i] = (i <= a[0]) ? 1 : 0;
}
for (int i = 2; i <= n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mdl = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll ans[n + 1][k + 1];
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i <= k; i++) {
ans[1][i] = (i <= a[0]) ? 1 : 0;
}
for (int i = 2; i <= n... | [
"assignment.change"
] | 980,476 | 980,477 | u050539031 | cpp |
p03172 | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long int
#define skip cin >> ws;
#define vll vector<ll>
#define vb vector<bool>
#define vpll vector<pair<ll, ll>>
#defi... | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long int
#define skip cin >> ws;
#define vll vector<ll>
#define vb vector<bool>
#define vpll vector<pair<ll, ll>>
#defi... | [
"call.arguments.change"
] | 980,484 | 980,485 | u345866226 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define endl "\n"
... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define endl "\n"
... | [
"assignment.change",
"expression.operation.binary.remove"
] | 980,488 | 980,489 | u764606362 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define endl "\n"
... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define endl "\n"
... | [
"assignment.change"
] | 980,490 | 980,489 | u764606362 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxN = 1e9;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll dp[n][k + 1];
memset(dp, 0, sizeof... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxN = 1e9;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll dp[n][k + 1];
memset(dp, 0, sizeof... | [
"assignment.change"
] | 980,497 | 980,498 | u108302258 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1][k + 1];
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (ll i = 1; i <= n; i++) {
ll pref[k + 1] = {0};... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1][k + 1];
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (ll i = 1; i <= n; i++) {
ll pref[k + 1] = {0};... | [
"assignment.change"
] | 980,503 | 980,504 | u780704335 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j, k;
cin >> n >> k;
ll a[n + 3];
for (i = 1; i <= n; i++)
cin >> a[i];
a[0] = 0;
sort(a, a + n + 1);
vector<vector<ll>> dp(k + 2, vector<ll>(n + 2, 1));
ll ans = 1;
ll mod = 100000000;
for (i = 1; i <= k;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j, k;
cin >> n >> k;
ll a[n + 3];
for (i = 1; i <= n; i++)
cin >> a[i];
a[0] = 0;
sort(a, a + n + 1);
vector<vector<ll>> dp(k + 2, vector<ll>(n + 2, 1));
ll ans = 1;
ll mod = 1000000007;
for (i = 1; i <= k... | [
"literal.number.change",
"variable_declaration.value.change"
] | 980,509 | 980,510 | u431812145 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
long long M = 1e9 + 7;
int solve() {
int n, K, x, y, p, q;
cin >> n >> K;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
long long dp[n][K + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= min(A[0], K); i++)
dp[0][i] = 1;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
long long M = 1e9 + 7;
int solve() {
int n, K, x, y, p, q;
cin >> n >> K;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
long long dp[n][K + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= min(A[0], K); i++)
dp[0][i] = 1;
for (int i =... | [
"assignment.change"
] | 980,515 | 980,516 | u134412007 | cpp |
p03172 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.t... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.t... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 980,519 | 980,520 | u358726523 | cpp |
p03172 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.t... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.t... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 980,521 | 980,522 | u358726523 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
long long int a[105];
#define mod 1000000007
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> prefix(k + 1, 1);
int dp[n + 1][k + 1];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= k; j++)
dp[i][j] ... | #include <bits/stdc++.h>
using namespace std;
long long int a[105];
#define mod 1000000007
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> prefix(k + 1, 1);
int dp[n + 1][k + 1];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= k; j++)
dp[i][j] ... | [
"assignment.change"
] | 980,523 | 980,524 | u229847881 | cpp |
p03172 | #include <algorithm>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define IOS ... | #include <algorithm>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define IOS ... | [
"expression.operation.binary.add"
] | 980,531 | 980,532 | u779279827 | cpp |
p03172 | #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 <random>
#include <set>
#include <stack>
#include <string>
#include <unorder... | #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 <random>
#include <set>
#include <stack>
#include <string>
#include <unorder... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 980,533 | 980,534 | u903311413 | cpp |
p03172 | #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 <random>
#include <set>
#include <stack>
#include <string>
#include <unorder... | #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 <random>
#include <set>
#include <stack>
#include <string>
#include <unorder... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 980,533 | 980,535 | u903311413 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define ordered_set \
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, ... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define ordered_set \
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, ... | [
"assignment.change"
] | 980,536 | 980,537 | u406881148 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define ordered_set \
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, ... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define ordered_set \
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, ... | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 980,538 | 980,537 | u406881148 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define int int64_t
#define ld long double
const int MOD = 1e9 + 7;
const int N = 1e6 + 5;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define int int64_t
#define ld long double
const int MOD = 1e9 + 7;
const int N = 1e6 + 5;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n... | [
"assignment.change"
] | 980,541 | 980,542 | u923152767 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long... | [
"assignment.change"
] | 980,543 | 980,544 | u023403724 | cpp |
p03172 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define ld double
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vvi vector<vector<int>>
#define pb push_back
#define mp make... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define ld double
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vvi vector<vector<int>>
#define pb push_back
#define mp make... | [] | 980,547 | 980,548 | u405346337 | cpp |
p03172 | // g++ 7.4.0
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, K;
cin >> N >> K;
ll arr[N];
for (ll i = 0; i < N; ++i)
cin >> arr[i];
ll dp[N + 1][K + 1];
memset(dp,... | // g++ 7.4.0
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, K;
cin >> N >> K;
ll arr[N];
for (ll i = 0; i < N; ++i)
cin >> arr[i];
ll dp[N + 1][K + 1];
memset(dp,... | [
"assignment.change"
] | 980,549 | 980,550 | u761195179 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
ll num_of_ways(vector<ll> &capacity, ll n, ll k) {
vector<vector<ll>> dp(n + 2, vector<ll>(k + 2));
for (ll j = 0; j <= k; j++) {
if (j > capacity[1])
dp[1][j] = 0;
else
dp[1][j] = 1;
}
for (ll j = 0; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
ll num_of_ways(vector<ll> &capacity, ll n, ll k) {
vector<vector<ll>> dp(n + 2, vector<ll>(k + 2));
for (ll j = 0; j <= k; j++) {
if (j > capacity[1])
dp[1][j] = 0;
else
dp[1][j] = 1;
}
for (ll j = 0; ... | [
"assignment.change"
] | 980,551 | 980,552 | u892221147 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1E9 + 7;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<long long> dp(k + 1);
dp[0] = 1;
for (int i = 0, w; i < n; i++) {
scanf("%d", &w);
vector<long long> pre(k + 2);
for (int a = k; a >= 0; a--) {
(pre[a + 1] += dp[a]) ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1E9 + 7;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<long long> dp(k + 1);
dp[0] = 1;
for (int i = 0, w; i < n; i++) {
scanf("%d", &w);
vector<long long> pre(k + 2);
for (int a = k; a >= 0; a--) {
(pre[a + 1] += dp[a]) ... | [
"assignment.change"
] | 980,555 | 980,556 | u093681822 | cpp |
p03172 | #include <bits/stdc++.h>
#define FORUP(i, start, end) for (int i = start; i <= end; i++)
#define FORDOWN(i, end, start) for (int i = end; i >= start; i--)
#define mem(a, v) memset(a, v, sizeof a)
#define ll long long
#define ld long double
#define pir pair<int, int>
#define fi first
#define se second
#define pb push_ba... | #include <bits/stdc++.h>
#define FORUP(i, start, end) for (int i = start; i <= end; i++)
#define FORDOWN(i, end, start) for (int i = end; i >= start; i--)
#define mem(a, v) memset(a, v, sizeof a)
#define ll long long
#define ld long double
#define pir pair<int, int>
#define fi first
#define se second
#define pb push_ba... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 980,557 | 980,558 | u034486306 | cpp |
p03172 | #include <bits/stdc++.h>
#define FORUP(i, start, end) for (int i = start; i <= end; i++)
#define FORDOWN(i, end, start) for (int i = end; i >= start; i--)
#define mem(a, v) memset(a, v, sizeof a)
#define ll long long
#define ld long double
#define pir pair<int, int>
#define fi first
#define se second
#define pb push_ba... | #include <bits/stdc++.h>
#define FORUP(i, start, end) for (int i = start; i <= end; i++)
#define FORDOWN(i, end, start) for (int i = end; i >= start; i--)
#define mem(a, v) memset(a, v, sizeof a)
#define ll long long
#define ld long double
#define pir pair<int, int>
#define fi first
#define se second
#define pb push_ba... | [
"assignment.change"
] | 980,559 | 980,558 | u034486306 | cpp |
p03172 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#define ll long long int
#define ld long double
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#define ll long long int
#define ld long double
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"assignment.change"
] | 980,560 | 980,561 | u443388180 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
const int mod = 1e9 + 7;
int n, k;
cin >> n >> k;
vector<int> v(n, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<ll> dp(k + 1, 0);
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
const int mod = 1e9 + 7;
int n, k;
cin >> n >> k;
vector<int> v(n, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<ll> dp(k + 1, 0);
for (in... | [
"assignment.change"
] | 980,566 | 980,567 | u416708985 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define mx INT_MAX
#define mn INT_MIN
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define itr set<int>::iterator
const int mod = 1e9 + 7;
vector<ll> a;
ll dp[101][100001];
int main() {
// ***... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define mx INT_MAX
#define mn INT_MIN
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define itr set<int>::iterator
const int mod = 1e9 + 7;
vector<ll> a;
ll dp[101][100001];
int main() {
// **... | [
"assignment.change"
] | 980,575 | 980,576 | u104450481 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define mx INT_MAX
#define mn INT_MIN
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define itr set<int>::iterator
const int mod = 1e9 + 7;
vector<ll> a;
ll dp[101][100001];
int main() {
// **... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define mx INT_MAX
#define mn INT_MIN
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define itr set<int>::iterator
const int mod = 1e9 + 7;
vector<ll> a;
ll dp[101][100001];
int main() {
// **... | [
"variable_declaration.type.change",
"assignment.change"
] | 980,577 | 980,576 | u104450481 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
long long int maxcandypossible(long long int *arr, int n, int k) {
long long int DP[n][k + 1];
for (int i = 0; i <= k; i++)
DP[0][i] = (arr[0] >= i) ? 1 : 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j <= k; j++) {
if (j == 0)
DP[i][j]... |
#include <bits/stdc++.h>
using namespace std;
long long int maxcandypossible(long long int *arr, int n, int k) {
long long int DP[n][k + 1];
for (int i = 0; i <= k; i++)
DP[0][i] = (arr[0] >= i) ? 1 : 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j <= k; j++) {
if (j == 0)
DP[i][... | [
"assignment.change"
] | 980,578 | 980,579 | u181548731 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
long long int dp[n + 1][k + 1];
for (int i = 0; i <= n; i++)
dp[i][0] = 1;
for (int j = 1; j <= k; j++)
dp[0][j] = 1;
for (int ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
long long int dp[n + 1][k + 1];
for (int i = 0; i <= n; i++)
dp[i][0] = 1;
for (int j = 1; j <= k; j++)
dp[0][j] = 1;
for (int ... | [
"expression.operation.binary.add"
] | 980,594 | 980,595 | u659211619 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
long long int dp[n + 1][k + 1];
for (int i = 0; i <= n; i++)
dp[i][0] = 1;
for (int j = 1; j <= k; j++)
dp[0][j] = 1;
for (int ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
long long int dp[n + 1][k + 1];
for (int i = 0; i <= n; i++)
dp[i][0] = 1;
for (int j = 1; j <= k; j++)
dp[0][j] = 1;
for (int ... | [
"expression.operation.binary.add"
] | 980,594 | 980,596 | u659211619 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
const ll mod = 1e9 + 7;
main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1][k + 1];
dp[0][0] = 1;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
const ll mod = 1e9 + 7;
main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1][k + 1];
dp[0][0] = 1;
for (int i ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 980,597 | 980,598 | u780713452 | cpp |
p03172 | #include <bits/stdc++.h>
#define int int64_t
using namespace std;
const int mod = 1e9 + 7;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> dp(k + 1), v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
dp[0] = 1;
for (int i = 0; i < n; ++i) {
vector<... | #include <bits/stdc++.h>
#define int int64_t
using namespace std;
const int mod = 1e9 + 7;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> dp(k + 1), v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
dp[0] = 1;
for (int i = 0; i < n; ++i) {
vector<... | [
"expression.operation.binary.add"
] | 980,633 | 980,634 | u980003047 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define mod 10000000007
typedef long long ll;
ll solve(ll arr[], ll n, ll k) {
ll dp[n + 1][k + 1];
for (ll i = 0; i <= k; i++)
dp[1][i] = (i <= arr[1]) ? 1 : 0;
for (ll i = 2; i <= n; i++) {
for (ll j = 0; j <= k; j++) {
if (j == 0)
dp[i][j] ... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
typedef long long ll;
ll solve(ll arr[], ll n, ll k) {
ll dp[n + 1][k + 1];
for (ll i = 0; i <= k; i++)
dp[1][i] = (i <= arr[1]) ? 1 : 0;
for (ll i = 2; i <= n; i++) {
for (ll j = 0; j <= k; j++) {
if (j == 0)
dp[i][j] =... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 980,635 | 980,636 | u257699577 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long MOD = 1000000007;
void solve(long long N, long long K, std::vector<long long> a) {
ll dp[N][K + 1] = {};
for (int i = N - 1; i >= 0; i--) {
for (int j = 0; j <= K; j++) {
// cerr << "i=" << i << "j=" <<j << endl;
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long MOD = 1000000007;
void solve(long long N, long long K, std::vector<long long> a) {
ll dp[N][K + 1] = {};
for (int i = N - 1; i >= 0; i--) {
for (int j = 0; j <= K; j++) {
// cerr << "i=" << i << "j=" <<j << endl;
i... | [
"assignment.change"
] | 980,638 | 980,639 | u943966256 | cpp |
p03172 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(k + 2, 0);
dp[0] = 1;
for (int i = 0; i < n; i++) {
int a;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(k + 2, 0);
dp[0] = 1;
for (int i = 0; i < n; i++) {
int a;
... | [
"expression.operation.binary.add"
] | 980,643 | 980,644 | u270654502 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fr(i, n) for (int i = 0; i < n; i++)
#define M 1000000007
signed main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
vector<int> dp(k + 1);
dp[0] = 1;
vector<int> presum(k + 1, 1)... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fr(i, n) for (int i = 0; i < n; i++)
#define M 1000000007
signed main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
vector<int> dp(k + 1);
dp[0] = 1;
vector<int> presum(k + 1, 1)... | [
"assignment.change"
] | 980,645 | 980,646 | u100071032 | cpp |
p03172 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <utility>
#include <vector>
using namespace std;
const int MOD = 1000000007;
inline int sub(int a, int b) {
a -= b;
if (a < 0)
a += MOD;
return a;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <utility>
#include <vector>
using namespace std;
const int MOD = 1000000007;
inline int sub(int a, int b) {
a -= b;
if (a < 0)
a += MOD;
return a;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 980,647 | 980,648 | u395287489 | cpp |
p03172 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll min(ll a, ll b) {
if (a < b)
return a;
else
return b;
}
ll max(ll a, ll b) {
if (a > b)
return a;
else
return b;
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
ll i;
ll x;
x = 1000000007;
for (i = 0; i < n; i... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll min(ll a, ll b) {
if (a < b)
return a;
else
return b;
}
ll max(ll a, ll b) {
if (a > b)
return a;
else
return b;
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
ll i;
ll x;
x = 1000000007;
for (i = 0; i < n; i... | [
"expression.operation.binary.add"
] | 980,651 | 980,650 | u541784678 | cpp |
p03172 | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <queue>
#include <string.h>
#include <vector>
#define ll long long
#define M 1000000007
#define Mo 1000000000
#define mm 998244353
using namespace std;
ll prck(ll n) {
ll f = 1;
if (n == 1)
f = 0;
else if (n == 2)
f = 1;
else if (... | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <queue>
#include <string.h>
#include <vector>
#define ll long long
#define M 1000000007
#define Mo 1000000000
#define mm 998244353
using namespace std;
ll prck(ll n) {
ll f = 1;
if (n == 1)
f = 0;
else if (n == 2)
f = 1;
else if (... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 980,658 | 980,659 | u012638328 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define... | [
"assignment.change"
] | 980,662 | 980,663 | u680707192 | cpp |
p03172 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int n, k;
vector<int> arr;
void solve() {
// number of ways to disrtibute k candies
vector<int> dp1(k + 1), dp2(k + 1);
dp1[0] = 1;
for (int i = 0; i < n; ++i) {
vector<int> pre(k + 2);
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int n, k;
vector<int> arr;
void solve() {
// number of ways to disrtibute k candies
vector<int> dp1(k + 1), dp2(k + 1);
dp1[0] = 1;
for (int i = 0; i < n; ++i) {
vector<int> pre(k + 2);
... | [
"expression.operation.binary.add"
] | 980,668 | 980,669 | u656351541 | cpp |
p03172 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PL;
typedef pair<int, int> P;
const ll INF = 1e12;
const ll MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<ll>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PL;
typedef pair<int, int> P;
const ll INF = 1e12;
const ll MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<ll>... | [
"assignment.change"
] | 980,672 | 980,673 | u561231954 | cpp |
p03172 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PL;
typedef pair<int, int> P;
const ll INF = 1e12;
const ll MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PL;
typedef pair<int, int> P;
const ll INF = 1e12;
const ll MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<ll>... | [
"call.arguments.change",
"assignment.change"
] | 980,675 | 980,673 | u561231954 | cpp |
p03172 | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
constexpr in... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
constexpr in... | [
"assignment.change"
] | 980,683 | 980,684 | u955627293 | cpp |
p03172 | // m-candies
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvll;
typedef v... | // m-candies
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvll;
typedef v... | [
"expression.operation.binary.add"
] | 980,685 | 980,686 | u068011824 | cpp |
p03172 | // m-candies
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvll;
typedef v... | // m-candies
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvll;
typedef v... | [
"expression.operation.binary.add"
] | 980,687 | 980,686 | u068011824 | cpp |
p03172 | #pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <l... | #pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <l... | [
"assignment.change"
] | 980,688 | 980,689 | u049420296 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
void pre() {}
void solve() {
long long int n, k;
cin >> n >> k;
long long int arr[n];
long long int dp[n + 1][k + 1];
for (long long int i = 0; i <= n; i++)
for (long long int j = 0; j <= k; j++)
dp[i][j] = 0;
for (long lon... | #include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
void pre() {}
void solve() {
long long int n, k;
cin >> n >> k;
long long int arr[n];
long long int dp[n + 1][k + 1];
for (long long int i = 0; i <= n; i++)
for (long long int j = 0; j <= k; j++)
dp[i][j] = 0;
for (long lon... | [
"assignment.change"
] | 980,690 | 980,691 | u902666111 | cpp |
p03172 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
typedef vector<ll> vi; // Vector of long long
typedef vector<vi> vvi; // Vector of vi
typedef vector<pai... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
typedef vector<ll> vi; // Vector of long long
typedef vector<vi> vvi; // Vector of vi
typedef vector<pai... | [
"call.add",
"call.arguments.change"
] | 980,704 | 980,705 | u584989818 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(k + 2, 0);
dp[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(k + 2, 0);
dp[... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 980,708 | 980,709 | u108540384 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
ll p = pow(10, 9) + 7;
ll phi(ll n) {
ll result = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0)
n /= i;
result -= result / i;
}
}
if (n > 1)
result -= resul... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
ll p = pow(10, 9) + 7;
ll phi(ll n) {
ll result = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0)
n /= i;
result -= result / i;
}
}
if (n > 1)
result -= resul... | [
"expression.operation.binary.add"
] | 980,716 | 980,717 | u195935121 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
const int siz = 1e5 + 7;
int n, K;
int tab[107];
ll dp[107][siz];
ll pref[107][siz];
int main() {
scanf("%d %d", &n, &K);
for (int i = 1; i <= n; i++) {
scanf("%d", &tab[i]);
}
dp[0][0] = 1LL;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
const int siz = 1e5 + 7;
int n, K;
int tab[107];
ll dp[107][siz];
ll pref[107][siz];
int main() {
scanf("%d %d", &n, &K);
for (int i = 1; i <= n; i++) {
scanf("%d", &tab[i]);
}
dp[0][0] = 1LL;
for (int i = 1; i... | [
"assignment.change",
"literal.number.type.widen.change"
] | 980,722 | 980,723 | u965973663 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 980,724 | 980,725 | u719183848 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.type.widen.change"
] | 980,726 | 980,725 | u719183848 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int M = 1e9 + 7;
ll dp[101][101010];
ll v[101];
int n;
ll amt, amt2;
ll f(int x, ll k) {
if (k < 0)
return 0;
if (dp[x][k])
return dp[x][k];
if (x == n - 1) {
if (k > v[x])
return 0;
return 1;
}
++amt;
if (amt ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int M = 1e9 + 7;
ll dp[101][101010];
ll v[101];
int n;
ll amt, amt2;
ll f(int x, ll k) {
if (k < 0)
return 0;
if (dp[x][k])
return dp[x][k];
if (x == n - 1) {
if (k > v[x])
return 0;
return 1;
}
++amt;
if (amt ... | [
"assignment.change"
] | 980,739 | 980,740 | u674625578 | cpp |
p03172 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)... | [
"assignment.change"
] | 980,748 | 980,749 | u828388155 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<pll> vpl;
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<pll> vpl;
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#... | [
"assignment.change"
] | 980,754 | 980,755 | u194908943 | cpp |
p03172 | /*
"With age, comes wisdom. With travel, comes understanding.
Remember that happiness is a way of travel – not a destination"
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#de... | /*
"With age, comes wisdom. With travel, comes understanding.
Remember that happiness is a way of travel – not a destination"
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#de... | [
"assignment.change"
] | 980,756 | 980,757 | u962714577 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
// ====================================================================
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n + 1);
for (int i = 0; i < n; i++)
cin >> v[i + 1];
ll dp[n + 1][k + 1] =
{}; //... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
// ====================================================================
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n + 1);
for (int i = 0; i < n; i++)
cin >> v[i + 1];
ll dp[n + 1][k + 1] =
{}; //... | [
"assignment.change"
] | 980,762 | 980,763 | u561186440 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k, m = 1000000007;
cin >> n >> k;
std::vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
std::vector<std::vector<ll>> dp(n, std::vector<ll>(k + 1, 0));
std::vector<std::vector<ll>> rv(n, std::vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k, m = 1000000007;
cin >> n >> k;
std::vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
std::vector<std::vector<ll>> dp(n, std::vector<ll>(k + 1, 0));
std::vector<std::vector<ll>> rv(n, std::vector<... | [
"expression.operation.binary.remove"
] | 980,779 | 980,780 | u304104630 | cpp |
p03172 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#prag... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#prag... | [
"call.arguments.change"
] | 980,795 | 980,796 | u777824330 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define ALL(a) (a).begin(), a.end()
int mod = 1e9 + 7;
int add(int a, int b) {
if (a + b >= mod)
return a + b - mod;
return a + b;
}
int sub(int a, int b) {
if (a > b)
return a - b;
return a - b + mod;
}
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define ALL(a) (a).begin(), a.end()
int mod = 1e9 + 7;
int add(int a, int b) {
if (a + b >= mod)
return a + b - mod;
return a + b;
}
int sub(int a, int b) {
if (a >= b)
return a - b;
return a - b + mod;
}
int... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 980,799 | 980,800 | u286223754 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define ALL(a) (a).begin(), a.end()
int mod = 1e9 + 7;
int add(int a, int b) {
if (a + b >= mod)
return a + b - mod;
return a + b;
}
int sub(int a, int b) {
if (a > b)
return a - b;
return a - b + mod;
}
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define ALL(a) (a).begin(), a.end()
int mod = 1e9 + 7;
int add(int a, int b) {
if (a + b >= mod)
return a + b - mod;
return a + b;
}
int sub(int a, int b) {
if (a >= b)
return a - b;
return a - b + mod;
}
int... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 980,801 | 980,800 | u286223754 | cpp |
p03172 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define N 1e6
#define K 300005
#define MOD 1e9 + 7
#define int long long
#de... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define N 1e6
#define K 300005
#define MOD 1e9 + 7
#define int long long
#de... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 980,811 | 980,812 | u269279722 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, k;
vector<int> arr;
vector<vector<int>> dp;
int main() {
cin >> n >> k;
arr.resize(n);
dp.resize(n + 1, vector<int>(k + 1, 0));
dp[0][0] = 1;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 1; i <= n; i++) {
ve... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, k;
vector<int> arr;
vector<vector<int>> dp;
int main() {
cin >> n >> k;
arr.resize(n);
dp.resize(n + 1, vector<int>(k + 1, 0));
dp[0][0] = 1;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 1; i <= n; i++) {
ve... | [
"assignment.change"
] | 980,825 | 980,826 | u556467689 | cpp |
p03172 | /*
* zyrch - Rupanshu Yadav
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include... | /*
* zyrch - Rupanshu Yadav
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include... | [
"expression.operation.binary.remove"
] | 980,827 | 980,828 | u175695110 | cpp |
p03172 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
#define mod 1000000007
using namespace std;
int niz[110];
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> dp(k + 2);
for (int i = 1; i <= n; i++)
cin >> niz[i];
dp[0] = 1;
for (int i = 1; i <= k; i++)
dp[i] += dp... | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
#define mod 1000000007
using namespace std;
int niz[110];
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> dp(k + 2);
for (int i = 1; i <= n; i++)
cin >> niz[i];
dp[0] = 1;
for (int i = 1; i <= k; i++)
dp[i] += dp... | [
"expression.operation.binary.add"
] | 980,834 | 980,835 | u628023398 | cpp |
p03172 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
usin... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
usin... | [
"assignment.change"
] | 980,838 | 980,839 | u608258653 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
c... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
c... | [
"assignment.change"
] | 980,843 | 980,844 | u334351654 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &e : a)
cin >> e;
const int mod = 1e9 + 7;
vector<vector<int>> dp(n + 1, vector<int>(k + 1));
for (int i = 0; i <= k; i++)
dp[0][i] = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &e : a)
cin >> e;
const int mod = 1e9 + 7;
vector<vector<int>> dp(n + 1, vector<int>(k + 1));
for (int i = 0; i <= k; i++)
dp[0][i] = ... | [
"expression.operation.binary.add"
] | 980,845 | 980,846 | u017770894 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define PI (acos(-1))
template <class T> inline ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define PI (acos(-1))
template <class T> inline ... | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 980,847 | 980,848 | u340010271 | cpp |
p03172 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long N, K;
cin >> N >> K;
vector<vector<long long>> dp(N + 1, ve... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long N, K;
cin >> N >> K;
vector<vector<long long>> dp(N + 1, ve... | [] | 980,863 | 980,864 | u834415466 | cpp |
p03172 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using na... | [
"assignment.change"
] | 980,870 | 980,871 | u841131859 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define all(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
const int MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
vector<int> a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define all(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
const int MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
vector<int> a... | [
"assignment.change"
] | 980,872 | 980,873 | u434282696 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
... | [
"expression.operator.change",
"assignment.change"
] | 980,874 | 980,875 | u811472478 | cpp |
p03172 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma comment(linker, "/STACK:16777216")
#pragma warning(disable : 6031)
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostr... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma comment(linker, "/STACK:16777216")
#pragma warning(disable : 6031)
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostr... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 980,884 | 980,885 | u648324897 | cpp |
p03172 | #pragma GCC optimize("O2")
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#in... | #pragma GCC optimize("O2")
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#in... | [
"call.arguments.change",
"call.arguments.add"
] | 980,888 | 980,889 | u168578024 | cpp |
p03172 | #include <bits/stdc++.h>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll MOD = 1e9 + 7;
int n;
ll k;
cin >> n >> k;
ll arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
// dp[i][j] is the # of ways to distribute j candies among... | #include <bits/stdc++.h>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll MOD = 1e9 + 7;
int n;
ll k;
cin >> n >> k;
ll arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
// dp[i][j] is the # of ways to distribute j candies among... | [
"assignment.change"
] | 980,890 | 980,891 | u710865424 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e9 + 7;
ll n, k, bd[101][200002], a;
int main() {
cin >> n >> k;
memset(bd, 0, sizeof(bd));
bd[0][k] = 1;
for (int i = 1; i <= n; i++) {
cin >> a;
bd[i][k] = 1;
for (int j = k - 1; j >= 0; j--) {
bd[i][j] = (b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e9 + 7;
ll n, k, bd[101][200001], a;
int main() {
cin >> n >> k;
memset(bd, 0, sizeof(bd));
bd[0][k] = 1;
for (int i = 1; i <= n; i++) {
cin >> a;
bd[i][k] = 1;
for (int j = k - 1; j >= 0; j--) {
bd[i][j] = (b... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 980,902 | 980,903 | u762629133 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.