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 9
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); \
cout.tie(0);
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define rep(n) for (ll j = 1; j <= n; j++)
#define loope(i, a, b) for (ll i = a; i <= b; i++)
#define loopne(i, a, b) for (ll i = a; i < b; i++)
ll mod = 1e9 + 7;
ll dp[101][100005];
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll candy[n];
rep(n) cin >> candy[j];
for (ll i = 1; i <= k; i++) {
dp[0][i] = 0;
}
dp[0][0] = 1;
for (ll i = 1; i <= n; i++) {
ll sum[k + 1];
sum[0] = dp[i - 1][0];
for (ll j = 1; j <= k; j++) {
sum[j] = ((dp[i - 1][j]) % mod + sum[j - 1] % mod + mod) % mod;
}
for (ll j = 0; j <= k; j++) {
ll ans = sum[j];
ll x = j - candy[i];
if (x >= 1) {
ans = (ans % mod) - (sum[x - 1] % mod) % mod;
}
dp[i][j] = ans % mod;
}
}
cout << dp[n][k];
return 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); \
cout.tie(0);
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define rep(n) for (ll j = 1; j <= n; j++)
#define loope(i, a, b) for (ll i = a; i <= b; i++)
#define loopne(i, a, b) for (ll i = a; i < b; i++)
ll mod = 1e9 + 7;
ll dp[101][100005];
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll candy[n];
rep(n) cin >> candy[j];
for (ll i = 1; i <= k; i++) {
dp[0][i] = 0;
}
dp[0][0] = 1;
for (ll i = 1; i <= n; i++) {
ll sum[k + 1];
sum[0] = dp[i - 1][0];
for (ll j = 1; j <= k; j++) {
sum[j] = ((dp[i - 1][j]) % mod + sum[j - 1] % mod + mod) % mod;
}
for (ll j = 0; j <= k; j++) {
ll ans = sum[j];
ll x = j - candy[i];
if (x >= 1) {
ans = (ans - sum[x - 1] + mod) % mod;
}
dp[i][j] = ans % mod;
}
}
cout << dp[n][k];
return 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);
// freopen("demo.in", "r", stdin);
// freopen("demo.out", "w", stdout);
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
for (int i = 0; i <= k; i++)
prefix[0][i] = 1;
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
prefix[i][j + 1] = (prefix[i][j] + dp[i - 1][j]) % MOD;
}
for (int j = 0; j <= k; j++) {
dp[i][j] = prefix[i][j + 1] - prefix[i][max(0, j - a[i])];
dp[i][j] = (dp[i][j] + MOD) % MOD;
}
}
printf("%lld\n", (dp[n][k] + MOD) % MOD);
return 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(0);
// freopen("demo.in", "r", stdin);
// freopen("demo.out", "w", stdout);
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
for (int i = 0; i <= k; i++)
prefix[0][i] = 1;
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
prefix[i][j + 1] = (prefix[i][j] + dp[i - 1][j]) % MOD;
}
for (int j = 0; j <= k; j++) {
dp[i][j] = prefix[i][j + 1] - prefix[i][max(0, j - a[i])];
dp[i][j] = (dp[i][j] + MOD) % MOD;
}
}
printf("%lld\n", (dp[n][k] + MOD) % MOD);
return 0;
}
| [
"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 <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VLL = vector<ll>;
using VVLL = vector<vector<ll>>;
using VB = vector<bool>;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
const int INF = 1000000007;
const ll INF_LL = 1'000'000'000'000'000'007;
#define __overload3(_1, _2, _3, name, ...) name
#define rep(...) \
__overload3(__VA_ARGS__, repFromUntil, repUntil, repeat)(__VA_ARGS__)
#define repeat(times) repFromUntil(__name##__LINE__, 0, times)
#define repUntil(name, times) repFromUntil(name, 0, times)
#define repFromUntil(name, from, until) \
for (int name = from, name##__until = (until); name < name##__until; name++)
#define repr(...) \
__overload3(__VA_ARGS__, reprFromUntil, reprUntil, repeat)(__VA_ARGS__)
#define reprUntil(name, times) reprFromUntil(name, 0, times)
#define reprFromUntil(name, from, until) \
for (int name = until - 1, name##__from = (from); name >= name##__from; \
name--)
#define EXIT(out) \
do { \
OUT(out); \
exit(0); \
} while (0)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define _1 first
#define _2 second
#ifdef LOCAL
#define debug(v) \
do { \
debugos << "L" << __LINE__ << " " << #v << " > "; \
debugos << (v) << newl; \
} while (0)
#define debugv(v) \
do { \
debugos << "L" << __LINE__ << " " << #v << " > "; \
for (auto e : (v)) { \
debugos << e << " "; \
} \
debugos << newl; \
} while (0)
#define debuga(m, w) \
do { \
debugos << "L" << __LINE__ << " " << #m << " > "; \
for (int x = 0; x < (w); x++) { \
debugos << (m)[x] << " "; \
} \
debugos << newl; \
} while (0)
#define debugaa(m, h, w) \
do { \
debugos << "L" << __LINE__ << " " << #m << " > \n"; \
for (int y = 0; y < (h); y++) { \
for (int x = 0; x < (w); x++) { \
debugos << (m)[y][x] << " "; \
} \
debugos << newl; \
} \
} while (0)
#else
#define debug(v) \
do { \
v; \
} while (0)
#define debugv(v) \
do \
; \
while (0)
#define debuga(m, w) \
do \
; \
while (0)
#define debugaa(m, h, w) \
do \
; \
while (0)
#endif
#define newl "\n"
constexpr int dr[] = {1, -1, 0, 0}; // LRUD
constexpr int dc[] = {0, 0, 1, -1};
bool inside(int r, int c, int H, int W) {
return 0 <= r and r < H and 0 <= c and c < W;
}
template <typename T> bool chmin(T &var, T x) {
if (var > x) {
var = x;
return true;
} else
return false;
}
template <typename T> bool chmax(T &var, T x) {
if (var < x) {
var = x;
return true;
} else
return false;
}
template <typename T> int sgn(T val) { return (T(0) < val) - (val < T(0)); }
ll power(ll e, int t, ll mod = INF_LL) {
ll res = 1;
while (t) {
if (t & 1)
res = (res * e) % mod;
t >>= 1;
e = (e * e) % mod;
}
return res;
}
template <typename T> T divceil(T, T);
template <typename T> T divfloor(T m, T d) {
if (sgn(m) * sgn(d) >= 0)
return m / d;
else
return -divceil(abs(m), abs(d));
}
template <typename T> T divceil(T m, T d) {
if (m >= 0 and d > 0)
return (m + d - 1) / d;
else if (m < 0 and d < 0)
return divceil(-m, -d);
else
return -divfloor(abs(m), abs(d));
}
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
string operator*(const string &s, int times) {
string res = "";
rep(times) res += s;
return res;
}
class MyScanner {
public:
int offset = 0;
char nc() {
static char buf[100000], *L = buf, *R = buf;
return L == R && (R = (L = buf) + fread(buf, 1, 100000, stdin), L == R)
? EOF
: *L++;
}
template <typename T> void input_integer(T &var) {
var = 0;
T sign = 1;
int cc = nc();
for (; cc < '0' || '9' < cc; cc = nc())
if (cc == '-')
sign = -1;
for (; '0' <= cc && cc <= '9'; cc = nc())
var = (var << 3) + (var << 1) + cc - '0';
var = var * sign;
var += offset;
}
int c() {
char c;
while (c = nc(), c == ' ' or c == '\n')
;
return c;
}
MyScanner &operator>>(char &var) {
var = c();
return *this;
}
MyScanner &operator>>(int &var) {
input_integer<int>(var);
return *this;
}
MyScanner &operator>>(ll &var) {
input_integer<ll>(var);
return *this;
}
MyScanner &operator>>(string &var) {
var = "";
int cc = nc();
for (; !isvisiblechar(cc); cc = nc())
;
for (; isvisiblechar(cc); cc = nc())
var.push_back(cc);
return *this;
}
template <typename T> operator T() {
T x;
*this >> x;
return x;
}
template <typename T> void operator()(T &t) { *this >> t; }
template <typename T, typename... Ts> void operator()(T &t, Ts &...ts) {
*this >> t;
this->operator()(ts...);
}
template <typename Iter> void iter(Iter first, Iter last) {
while (first != last)
*this >> *first, first++;
}
VI vi(int n) {
VI res(n);
iter(all(res));
return res;
}
VVI vvi(int n, int m) {
VVI res(n);
rep(i, n) res[i] = vi(m);
return res;
}
VLL vll(int n) {
VLL res(n);
iter(all(res));
return res;
}
VVLL vvll(int n, int m) {
VVLL res(n);
rep(i, n) res[i] = vll(m);
return res;
}
template <typename T> vector<T> v(int n) {
vector<T> res(n);
iter(all(res));
return res;
}
private:
int isvisiblechar(int c) { return 0x21 <= c && c <= 0x7E; }
} IN, IN1{-1};
class MyPrinter {
public:
template <typename T> void output_integer(T var) {
if (var == 0) {
putchar('0');
return;
}
if (var < 0)
putchar('-'), var = -var;
char stack[32];
int stack_p = 0;
while (var)
stack[stack_p++] = '0' + (var % 10), var /= 10;
while (stack_p)
putchar(stack[--stack_p]);
}
MyPrinter &operator<<(char c) {
putchar(c);
return *this;
}
MyPrinter &operator<<(double x) {
printf("%.10f\n", x);
return *this;
}
template <typename T> MyPrinter &operator<<(T var) {
output_integer<T>(var);
return *this;
}
MyPrinter &operator<<(char *str_p) {
while (*str_p)
putchar(*(str_p++));
return *this;
}
MyPrinter &operator<<(const char *str_p) {
while (*str_p)
putchar(*(str_p++));
return *this;
}
MyPrinter &operator<<(const string &str) {
const char *p = str.c_str();
const char *l = p + str.size();
while (p < l)
putchar(*p++);
return *this;
}
template <typename T> void operator()(T x) { *this << x << newl; }
template <typename T, typename... Ts> void operator()(T x, Ts... xs) {
*this << x << " ";
this->operator()(xs...);
}
template <typename Iter> void iter(Iter s, Iter t) {
if (s == t)
*this << "\n";
else {
for (; s != t; s++) {
*this << *s << " \n"[next(s, 1) == t];
}
}
}
template <typename Range> void range(const Range &r) {
iter(begin(r), end(r));
}
} OUT;
class DebugPrint {
public:
template <typename T> DebugPrint &operator<<(const T &v) {
#ifdef LOCAL
cerr << v;
#endif
return *this;
}
} debugos;
template <typename OutStream, typename T, typename U>
OutStream &operator<<(OutStream &out, pair<T, U> var) {
return out << var.first << " " << var.second;
}
template <typename OutStream, typename Tuple, size_t I, size_t N,
enable_if_t<I == N> * = nullptr>
OutStream &tuple_impl(OutStream &out, Tuple var) {
return out;
}
template <typename OutStream, typename Tuple, size_t I, size_t N,
enable_if_t<I != N> * = nullptr>
OutStream &tuple_impl(OutStream &out, Tuple var) {
out << get<I>(var) << " ";
return tuple_impl<Tuple, I + 1, N>(out, var);
}
template <typename OutStream, typename... Ts>
OutStream &operator<<(OutStream &out, tuple<Ts...> var) {
return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(out, var);
}
template <typename InStream, typename T, typename U>
InStream &operator>>(InStream &in, pair<T, U> &var) {
return in >> var.first >> var.second;
}
template <typename InStream, typename... Ts>
InStream &operator>>(InStream &in, tuple<Ts...> &var) {
return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(in, var);
}
template <typename InStream, typename Tuple, size_t I, size_t N,
enable_if_t<I == N> * = nullptr>
InStream &tuple_impl(InStream &in, Tuple &var) {
return in;
}
template <typename InStream, typename Tuple, size_t I, size_t N,
enable_if_t<I != N> * = nullptr>
InStream &tuple_impl(InStream &in, Tuple &var) {
in >> get<I>(var);
return tuple_impl<Tuple, I + 1, N>(in, var);
}
class modint;
constexpr modint pow(modint, size_t);
constexpr ll MOD = ll(1e9) + 7;
class modint {
public:
ll value;
constexpr modint(const ll x = 0) noexcept : value(x) {
value %= MOD;
if (value < 0)
value += MOD;
}
constexpr bool operator==(const modint &rhs) { return value == rhs.value; }
constexpr bool operator!=(const modint &rhs) { return value != rhs.value; }
constexpr modint operator-() const { return modint(0) - *this; }
constexpr modint operator+(const modint &rhs) const {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint &rhs) const {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint &rhs) const {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint &rhs) const {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint &rhs) {
value += rhs.value;
if (value >= MOD)
value -= MOD;
return *this;
}
constexpr modint &operator-=(const modint &rhs) {
if (value < rhs.value)
value += MOD;
value -= rhs.value;
return *this;
}
constexpr modint &operator*=(const modint &rhs) {
value = value * rhs.value % MOD;
return *this;
}
constexpr modint &operator/=(const modint &rhs) {
return *this *= pow(rhs, MOD - 2);
}
constexpr modint &operator++() { return *this += 1; }
constexpr modint operator++(int) {
modint tmp(*this);
++(*this);
return tmp;
}
constexpr modint &operator--() { return *this -= 1; }
constexpr modint operator--(int) {
modint tmp(*this);
--(*this);
return tmp;
}
constexpr operator int() const { return (int)value; }
constexpr operator ll() const { return value; }
};
template <typename OutStream> OutStream &operator<<(OutStream &out, modint n) {
out << n.value;
return out;
}
template <typename InStream> InStream &operator>>(InStream &in, modint &n) {
ll var;
in >> var;
n = modint(var);
return in;
}
constexpr modint pow(modint base, size_t exp) {
modint res = 1;
while (exp) {
if (exp % 2)
res *= base;
base *= base;
exp /= 2;
}
return res;
}
// O(r + log MOD)
modint choose(int n, int r) {
chmin(r, n - r);
if (r < 0)
return modint(0);
modint nu = 1, de = 1;
rep(i, r) nu *= n - i, de *= i + 1;
return nu / de;
}
#pragma GCC diagnostic ignored "-Wshadow"
template <typename T, typename Cmb, typename Upd> struct segtree {
const int n;
const T unit;
const Cmb cmb;
const Upd upd;
vector<T> data;
segtree(int n = 0, T unit = T(), Cmb cmb = Cmb(), Upd upd = Upd())
: n(n), unit(unit), cmb(cmb), upd(upd), data(n << 1, unit) {
build();
}
template <typename Iter>
segtree(Iter first, Iter last, int n, T unit = T(), Cmb cmb = Cmb(),
Upd upd = Upd())
: n(n), unit(unit), cmb(cmb), upd(upd), data(n << 1) {
assign(first, last);
}
void build() { repr(i, n) data[i] = cmb(data[i << 1], data[i << 1 | 1]); }
template <typename Iter> void assign(Iter first, Iter last) {
copy(first, last, data.begin() + n);
build();
}
void modify(int l, T v) {
l += n;
data[l] = upd(data[l], v);
for (; l > 1; l >>= 1)
data[l >> 1] = cmb(data[l & (~1)], data[l | 1]);
}
T query(int l, int r) {
if (l == r)
return unit;
if (l + 1 == r)
return data[l + n];
T resl = data[l += n], resr = data[(r += n) - 1];
for (l++, r--; l < r; l >>= 1, r >>= 1) {
if (l & 1)
resl = cmb(resl, data[l++]);
if (r & 1)
resr = cmb(data[--r], resr);
}
return cmb(resl, resr);
}
T query(int l) { query(l, n); }
};
#pragma GCC diagnostic warning "-Wshadow"
template <typename T> struct minT {
T operator()(T a, T b) const { return min(a, b); }
};
template <typename T> struct maxT {
T operator()(T a, T b) const { return max(a, b); }
};
template <typename T> struct assign {
T operator()(T a, T b) const { return b; }
};
template <typename T, typename Upd = assign<T>>
using RangeMin = segtree<T, minT<T>, Upd>;
template <typename T, typename Upd = assign<T>>
using RangeMax = segtree<T, maxT<T>, Upd>;
template <typename T, typename Upd = assign<T>>
using RangeSum = segtree<T, plus<T>, Upd>;
int main() {
int n = IN, k = IN;
auto a = IN.vi(n);
RangeSum<modint> st(k + 1);
st.modify(0, 1);
rep(i, n) repr(j, k + 1) st.modify(j, st.query(max(0, j - a[i]), j + 1));
OUT(st.query(k));
} | #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 <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VLL = vector<ll>;
using VVLL = vector<vector<ll>>;
using VB = vector<bool>;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
const int INF = 1000000007;
const ll INF_LL = 1'000'000'000'000'000'007;
#define __overload3(_1, _2, _3, name, ...) name
#define rep(...) \
__overload3(__VA_ARGS__, repFromUntil, repUntil, repeat)(__VA_ARGS__)
#define repeat(times) repFromUntil(__name##__LINE__, 0, times)
#define repUntil(name, times) repFromUntil(name, 0, times)
#define repFromUntil(name, from, until) \
for (int name = from, name##__until = (until); name < name##__until; name++)
#define repr(...) \
__overload3(__VA_ARGS__, reprFromUntil, reprUntil, repeat)(__VA_ARGS__)
#define reprUntil(name, times) reprFromUntil(name, 0, times)
#define reprFromUntil(name, from, until) \
for (int name = until - 1, name##__from = (from); name >= name##__from; \
name--)
#define EXIT(out) \
do { \
OUT(out); \
exit(0); \
} while (0)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define _1 first
#define _2 second
#ifdef LOCAL
#define debug(v) \
do { \
debugos << "L" << __LINE__ << " " << #v << " > "; \
debugos << (v) << newl; \
} while (0)
#define debugv(v) \
do { \
debugos << "L" << __LINE__ << " " << #v << " > "; \
for (auto e : (v)) { \
debugos << e << " "; \
} \
debugos << newl; \
} while (0)
#define debuga(m, w) \
do { \
debugos << "L" << __LINE__ << " " << #m << " > "; \
for (int x = 0; x < (w); x++) { \
debugos << (m)[x] << " "; \
} \
debugos << newl; \
} while (0)
#define debugaa(m, h, w) \
do { \
debugos << "L" << __LINE__ << " " << #m << " > \n"; \
for (int y = 0; y < (h); y++) { \
for (int x = 0; x < (w); x++) { \
debugos << (m)[y][x] << " "; \
} \
debugos << newl; \
} \
} while (0)
#else
#define debug(v) \
do { \
v; \
} while (0)
#define debugv(v) \
do \
; \
while (0)
#define debuga(m, w) \
do \
; \
while (0)
#define debugaa(m, h, w) \
do \
; \
while (0)
#endif
#define newl "\n"
constexpr int dr[] = {1, -1, 0, 0}; // LRUD
constexpr int dc[] = {0, 0, 1, -1};
bool inside(int r, int c, int H, int W) {
return 0 <= r and r < H and 0 <= c and c < W;
}
template <typename T> bool chmin(T &var, T x) {
if (var > x) {
var = x;
return true;
} else
return false;
}
template <typename T> bool chmax(T &var, T x) {
if (var < x) {
var = x;
return true;
} else
return false;
}
template <typename T> int sgn(T val) { return (T(0) < val) - (val < T(0)); }
ll power(ll e, int t, ll mod = INF_LL) {
ll res = 1;
while (t) {
if (t & 1)
res = (res * e) % mod;
t >>= 1;
e = (e * e) % mod;
}
return res;
}
template <typename T> T divceil(T, T);
template <typename T> T divfloor(T m, T d) {
if (sgn(m) * sgn(d) >= 0)
return m / d;
else
return -divceil(abs(m), abs(d));
}
template <typename T> T divceil(T m, T d) {
if (m >= 0 and d > 0)
return (m + d - 1) / d;
else if (m < 0 and d < 0)
return divceil(-m, -d);
else
return -divfloor(abs(m), abs(d));
}
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
string operator*(const string &s, int times) {
string res = "";
rep(times) res += s;
return res;
}
class MyScanner {
public:
int offset = 0;
char nc() {
static char buf[100000], *L = buf, *R = buf;
return L == R && (R = (L = buf) + fread(buf, 1, 100000, stdin), L == R)
? EOF
: *L++;
}
template <typename T> void input_integer(T &var) {
var = 0;
T sign = 1;
int cc = nc();
for (; cc < '0' || '9' < cc; cc = nc())
if (cc == '-')
sign = -1;
for (; '0' <= cc && cc <= '9'; cc = nc())
var = (var << 3) + (var << 1) + cc - '0';
var = var * sign;
var += offset;
}
int c() {
char c;
while (c = nc(), c == ' ' or c == '\n')
;
return c;
}
MyScanner &operator>>(char &var) {
var = c();
return *this;
}
MyScanner &operator>>(int &var) {
input_integer<int>(var);
return *this;
}
MyScanner &operator>>(ll &var) {
input_integer<ll>(var);
return *this;
}
MyScanner &operator>>(string &var) {
var = "";
int cc = nc();
for (; !isvisiblechar(cc); cc = nc())
;
for (; isvisiblechar(cc); cc = nc())
var.push_back(cc);
return *this;
}
template <typename T> operator T() {
T x;
*this >> x;
return x;
}
template <typename T> void operator()(T &t) { *this >> t; }
template <typename T, typename... Ts> void operator()(T &t, Ts &...ts) {
*this >> t;
this->operator()(ts...);
}
template <typename Iter> void iter(Iter first, Iter last) {
while (first != last)
*this >> *first, first++;
}
VI vi(int n) {
VI res(n);
iter(all(res));
return res;
}
VVI vvi(int n, int m) {
VVI res(n);
rep(i, n) res[i] = vi(m);
return res;
}
VLL vll(int n) {
VLL res(n);
iter(all(res));
return res;
}
VVLL vvll(int n, int m) {
VVLL res(n);
rep(i, n) res[i] = vll(m);
return res;
}
template <typename T> vector<T> v(int n) {
vector<T> res(n);
iter(all(res));
return res;
}
private:
int isvisiblechar(int c) { return 0x21 <= c && c <= 0x7E; }
} IN, IN1{-1};
class MyPrinter {
public:
template <typename T> void output_integer(T var) {
if (var == 0) {
putchar('0');
return;
}
if (var < 0)
putchar('-'), var = -var;
char stack[32];
int stack_p = 0;
while (var)
stack[stack_p++] = '0' + (var % 10), var /= 10;
while (stack_p)
putchar(stack[--stack_p]);
}
MyPrinter &operator<<(char c) {
putchar(c);
return *this;
}
MyPrinter &operator<<(double x) {
printf("%.10f\n", x);
return *this;
}
template <typename T> MyPrinter &operator<<(T var) {
output_integer<T>(var);
return *this;
}
MyPrinter &operator<<(char *str_p) {
while (*str_p)
putchar(*(str_p++));
return *this;
}
MyPrinter &operator<<(const char *str_p) {
while (*str_p)
putchar(*(str_p++));
return *this;
}
MyPrinter &operator<<(const string &str) {
const char *p = str.c_str();
const char *l = p + str.size();
while (p < l)
putchar(*p++);
return *this;
}
template <typename T> void operator()(T x) { *this << x << newl; }
template <typename T, typename... Ts> void operator()(T x, Ts... xs) {
*this << x << " ";
this->operator()(xs...);
}
template <typename Iter> void iter(Iter s, Iter t) {
if (s == t)
*this << "\n";
else {
for (; s != t; s++) {
*this << *s << " \n"[next(s, 1) == t];
}
}
}
template <typename Range> void range(const Range &r) {
iter(begin(r), end(r));
}
} OUT;
class DebugPrint {
public:
template <typename T> DebugPrint &operator<<(const T &v) {
#ifdef LOCAL
cerr << v;
#endif
return *this;
}
} debugos;
template <typename OutStream, typename T, typename U>
OutStream &operator<<(OutStream &out, pair<T, U> var) {
return out << var.first << " " << var.second;
}
template <typename OutStream, typename Tuple, size_t I, size_t N,
enable_if_t<I == N> * = nullptr>
OutStream &tuple_impl(OutStream &out, Tuple var) {
return out;
}
template <typename OutStream, typename Tuple, size_t I, size_t N,
enable_if_t<I != N> * = nullptr>
OutStream &tuple_impl(OutStream &out, Tuple var) {
out << get<I>(var) << " ";
return tuple_impl<Tuple, I + 1, N>(out, var);
}
template <typename OutStream, typename... Ts>
OutStream &operator<<(OutStream &out, tuple<Ts...> var) {
return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(out, var);
}
template <typename InStream, typename T, typename U>
InStream &operator>>(InStream &in, pair<T, U> &var) {
return in >> var.first >> var.second;
}
template <typename InStream, typename... Ts>
InStream &operator>>(InStream &in, tuple<Ts...> &var) {
return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(in, var);
}
template <typename InStream, typename Tuple, size_t I, size_t N,
enable_if_t<I == N> * = nullptr>
InStream &tuple_impl(InStream &in, Tuple &var) {
return in;
}
template <typename InStream, typename Tuple, size_t I, size_t N,
enable_if_t<I != N> * = nullptr>
InStream &tuple_impl(InStream &in, Tuple &var) {
in >> get<I>(var);
return tuple_impl<Tuple, I + 1, N>(in, var);
}
class modint;
constexpr modint pow(modint, size_t);
constexpr ll MOD = ll(1e9) + 7;
class modint {
public:
ll value;
constexpr modint(const ll x = 0) noexcept : value(x) {
value %= MOD;
if (value < 0)
value += MOD;
}
constexpr bool operator==(const modint &rhs) { return value == rhs.value; }
constexpr bool operator!=(const modint &rhs) { return value != rhs.value; }
constexpr modint operator-() const { return modint(0) - *this; }
constexpr modint operator+(const modint &rhs) const {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint &rhs) const {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint &rhs) const {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint &rhs) const {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint &rhs) {
value += rhs.value;
if (value >= MOD)
value -= MOD;
return *this;
}
constexpr modint &operator-=(const modint &rhs) {
if (value < rhs.value)
value += MOD;
value -= rhs.value;
return *this;
}
constexpr modint &operator*=(const modint &rhs) {
value = value * rhs.value % MOD;
return *this;
}
constexpr modint &operator/=(const modint &rhs) {
return *this *= pow(rhs, MOD - 2);
}
constexpr modint &operator++() { return *this += 1; }
constexpr modint operator++(int) {
modint tmp(*this);
++(*this);
return tmp;
}
constexpr modint &operator--() { return *this -= 1; }
constexpr modint operator--(int) {
modint tmp(*this);
--(*this);
return tmp;
}
constexpr operator int() const { return (int)value; }
constexpr operator ll() const { return value; }
};
template <typename OutStream> OutStream &operator<<(OutStream &out, modint n) {
out << n.value;
return out;
}
template <typename InStream> InStream &operator>>(InStream &in, modint &n) {
ll var;
in >> var;
n = modint(var);
return in;
}
constexpr modint pow(modint base, size_t exp) {
modint res = 1;
while (exp) {
if (exp % 2)
res *= base;
base *= base;
exp /= 2;
}
return res;
}
// O(r + log MOD)
modint choose(int n, int r) {
chmin(r, n - r);
if (r < 0)
return modint(0);
modint nu = 1, de = 1;
rep(i, r) nu *= n - i, de *= i + 1;
return nu / de;
}
#pragma GCC diagnostic ignored "-Wshadow"
template <typename T, typename Cmb, typename Upd> struct segtree {
const int n;
const T unit;
const Cmb cmb;
const Upd upd;
vector<T> data;
segtree(int n = 0, T unit = T(), Cmb cmb = Cmb(), Upd upd = Upd())
: n(n), unit(unit), cmb(cmb), upd(upd), data(n << 1, unit) {
build();
}
template <typename Iter>
segtree(Iter first, Iter last, int n, T unit = T(), Cmb cmb = Cmb(),
Upd upd = Upd())
: n(n), unit(unit), cmb(cmb), upd(upd), data(n << 1) {
assign(first, last);
}
void build() { repr(i, n) data[i] = cmb(data[i << 1], data[i << 1 | 1]); }
template <typename Iter> void assign(Iter first, Iter last) {
copy(first, last, data.begin() + n);
build();
}
void modify(int l, T v) {
l += n;
data[l] = upd(data[l], v);
for (; l > 1; l >>= 1)
data[l >> 1] = cmb(data[l & (~1)], data[l | 1]);
}
T query(int l, int r) {
if (l == r)
return unit;
if (l + 1 == r)
return data[l + n];
T resl = data[l += n], resr = data[(r += n) - 1];
for (l++, r--; l < r; l >>= 1, r >>= 1) {
if (l & 1)
resl = cmb(resl, data[l++]);
if (r & 1)
resr = cmb(data[--r], resr);
}
return cmb(resl, resr);
}
T query(int l) { return query(l, n); }
};
#pragma GCC diagnostic warning "-Wshadow"
template <typename T> struct minT {
T operator()(T a, T b) const { return min(a, b); }
};
template <typename T> struct maxT {
T operator()(T a, T b) const { return max(a, b); }
};
template <typename T> struct assign {
T operator()(T a, T b) const { return b; }
};
template <typename T, typename Upd = assign<T>>
using RangeMin = segtree<T, minT<T>, Upd>;
template <typename T, typename Upd = assign<T>>
using RangeMax = segtree<T, maxT<T>, Upd>;
template <typename T, typename Upd = assign<T>>
using RangeSum = segtree<T, plus<T>, Upd>;
int main() {
int n = IN, k = IN;
auto a = IN.vi(n);
RangeSum<modint> st(k + 1);
st.modify(0, 1);
rep(i, n) repr(j, k + 1) st.modify(j, st.query(max(0, j - a[i]), j + 1));
OUT(st.query(k));
} | [
"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 + a[j] <= k)
dp[i + a[j]] = max(dp[i], 1 - dp[i]);
}
}
if (dp[k])
cout << "First" << endl;
else
cout << "Second" << endl;
} | #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 + a[j] <= k)
dp[i + a[j]] = max(dp[i + a[j]], 1 - dp[i]);
}
}
if (dp[k])
cout << "First" << endl;
else
cout << "Second" << endl;
} | [
"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_queue<payar, vector<payar>, greater<payar>> pq; /// accending
vector<pair<double, payar>> vpp;
vector<payar> vp;
int n, k;
int arr[100005];
int dp[1000005];
int rec(int x) {
if (dp[x] != -1)
return dp[x];
int check = 0;
for (int i = 0; i < n; i++) {
if (x + arr[i] <= k) {
if (rec(x + arr[i]) == 0)
check = 1;
}
}
return dp[x] = check;
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i <= n; i++)
dp[i] = -1;
if (rec(0) == 1) {
cout << "First";
} else {
cout << "Second";
}
return 0;
}
| #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_queue<payar, vector<payar>, greater<payar>> pq; /// accending
vector<pair<double, payar>> vpp;
vector<payar> vp;
int n, k;
int arr[100005];
int dp[1000005];
int rec(int x) {
if (dp[x] != -1)
return dp[x];
int check = 0;
for (int i = 0; i < n; i++) {
if (x + arr[i] <= k) {
if (rec(x + arr[i]) == 0)
check = 1;
}
}
return dp[x] = check;
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i <= k; i++)
dp[i] = -1;
if (rec(0) == 1) {
cout << "First";
} else {
cout << "Second";
}
return 0;
}
| [
"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); \
cout.tie(0);
#define PLL pair<ll, ll>
#define mod 1000000007
#define mx 1000002
#define FILE freopen("input.txt", "r", stdin)
ll n;
ll a[102];
ll dp[102];
ll F(ll x) {
if (dp[x] != -1)
return dp[x];
ll ret = 0;
for (ll i = 1; i <= n; i++) {
if (a[i] <= x)
ret = ret | F(x - a[i]);
}
return dp[x] = !ret;
}
int main() {
ll k;
sff(n, k);
for (ll i = 1; i <= n; i++) {
sf(a[i]);
}
memset(dp, -1, sizeof dp);
if (!F(k))
cout << "First" << endl;
else
cout << "Second" << endl;
return 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); \
cout.tie(0);
#define PLL pair<ll, ll>
#define mod 1000000007
#define mx 1000002
#define FILE freopen("input.txt", "r", stdin)
ll n;
ll a[102];
ll dp[mx];
ll F(ll x) {
if (dp[x] != -1)
return dp[x];
ll ret = 0;
for (ll i = 1; i <= n; i++) {
if (a[i] <= x)
ret = ret | F(x - a[i]);
}
return dp[x] = !ret;
}
int main() {
ll k;
sff(n, k);
for (ll i = 1; i <= n; i++) {
sf(a[i]);
}
memset(dp, -1, sizeof dp);
if (!F(k))
cout << "First" << endl;
else
cout << "Second" << endl;
return 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) {
t = true;
break;
}
}
if (t == true)
df[i] = 1;
else
df[i] = 2;
}
// for(int i=0; i<K+1; i++) cout<<df[i]<<" ";
if (df[K] == 1)
cout << "First" << endl;
else
cout << "Second" << endl;
return 0;
}
| #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) {
t = true;
break;
}
}
if (t == true)
df[i] = 1;
else
df[i] = 2;
}
// for(int i=0; i<K+1; i++) cout<<df[i]<<" ";
if (df[K] == 1)
cout << "First" << endl;
else
cout << "Second" << endl;
return 0;
}
| [
"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 <= n; i++) {
cin >> a[i];
}
vector<bool> dp(n + 1);
for (int i = 0; i <= k; i++) {
for (int j = 1; j <= n; j++) {
if (i >= a[j] && !dp[i - a[j]])
dp[i] = true;
}
}
dp[k] ? (cout << "First") : (cout << "Second");
return 0;
}
| #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 <= n; i++) {
cin >> a[i];
}
vector<bool> dp(k + 1);
for (int i = 0; i <= k; i++) {
for (int j = 1; j <= n; j++) {
if (i >= a[j] && !dp[i - a[j]])
dp[i] = true;
}
}
dp[k] ? (cout << "First") : (cout << "Second");
return 0;
}
| [
"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_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("a.in", "r", stdin);
// freopen("a.out", "w", stdout);
int n, k;
cin >> n >> k;
int a[n + 5];
for (int i = 0; i < n; i++)
cin >> a[i];
int fw[k + 5];
memset(fw, 0, sizeof(fw));
for (int i = 0; i < k; i++) {
for (int j = 0; j < n; j++) {
if (i - a[j] >= 0 && fw[i - a[j]] == 0) {
fw[i] = 1;
break;
}
}
}
if (fw[k] == 0)
cout << "Second\n";
else
cout << "First\n";
return 0;
}
| // 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_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("a.in", "r", stdin);
// freopen("a.out", "w", stdout);
int n, k;
cin >> n >> k;
int a[n + 5];
for (int i = 0; i < n; i++)
cin >> a[i];
int fw[k + 5];
memset(fw, 0, sizeof(fw));
for (int i = 0; i <= k + 2; i++) {
for (int j = 0; j < n; j++) {
if (i - a[j] >= 0 && fw[i - a[j]] == 0) {
fw[i] = 1;
break;
}
}
}
if (fw[k] == 0)
cout << "Second\n";
else
cout << "First\n";
return 0;
}
| [
"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++) {
for (int j = 0; j < n; j++) {
if (i >= p[j]) {
win[i] = win[i] | !win[i - p[j]];
}
}
}
cout << (win[k] ? "first" : "second") << endl;
return 0;
}
| #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++) {
for (int j = 0; j < n; j++) {
if (i >= p[j]) {
win[i] = win[i] | !win[i - p[j]];
}
}
}
cout << (win[k] ? "First" : "Second") << endl;
return 0;
}
| [
"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]);
}
vector<bool> dp(k + 5, false);
for (int val = 1; val <= k; val++) {
for (int i = 0; i < n; i++) {
if (val - A[i] >= 0) {
dp[val] = dp[val] | !(dp[val - A[i]]);
}
}
}
if (dp[k])
printf("first\n");
else
printf("second\n");
return 0;
}
| // 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]);
}
vector<bool> dp(k + 5, false);
for (int val = 1; val <= k; val++) {
for (int i = 0; i < n; i++) {
if (val - A[i] >= 0) {
dp[val] = dp[val] | !(dp[val - A[i]]);
}
}
}
if (dp[k])
printf("First\n");
else
printf("Second\n");
return 0;
}
| [
"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 << setprecision(10);
int t;
// cin >> t;
t = 1;
while (t--)
solve();
return 0;
}
int dp[105];
int n, k, a[100005];
bool dfs(int balance) {
if (dp[balance] != -1)
return dp[balance];
int ans = 0;
for (int i = 1; i <= n; ++i)
if (a[i] <= balance)
ans |= !dfs(balance - a[i]);
return dp[balance] = ans;
}
void solve() {
cin >> n >> k;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; ++i)
cin >> a[i];
cout << (dfs(k) ? "First\n" : "Second\n");
} | #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 << setprecision(10);
int t;
// cin >> t;
t = 1;
while (t--)
solve();
return 0;
}
int dp[100005];
int n, k, a[100005];
bool dfs(int balance) {
if (dp[balance] != -1)
return dp[balance];
int ans = 0;
for (int i = 1; i <= n; ++i)
if (a[i] <= balance)
ans |= !dfs(balance - a[i]);
return dp[balance] = ans;
}
void solve() {
cin >> n >> k;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; ++i)
cin >> a[i];
cout << (dfs(k) ? "First\n" : "Second\n");
} | [
"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 j = 0; j < n && k - a[j] >= 0; j++) {
for (int p = 0; p < 2; p++) {
dp[k][p] |= !dp[k - a[j]][!p];
}
}
}
cout << (dp[k][0] ? "First" : "Second");
}
| // 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 j = 0; j < n && i - a[j] >= 0; j++) {
for (int p = 0; p < 2; p++) {
dp[i][p] |= !dp[i - a[j]][!p];
}
}
}
cout << (dp[k][0] ? "First" : "Second");
}
| [
"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, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
int N, K, a[102];
Scd2(N, K);
Rep(i, N) Scd(a[i]);
int dp[100002] = {};
Rep(i, K + 1) {
if (dp[i] == 0) {
Rep(j, N) { dp[i + a[j]] = 1; }
}
}
printf(dp[K] ? "First" : "Second");
printf("\n");
return 0;
}
| #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, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
int N, K, a[102];
Scd2(N, K);
Rep(i, N) Scd(a[i]);
int dp[200002] = {};
Rep(i, K + 1) {
if (dp[i] == 0) {
Rep(j, N) { dp[i + a[j]] = 1; }
}
}
printf(dp[K] ? "First" : "Second");
printf("\n");
return 0;
}
| [
"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_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define debug(x) cout << #x << " = " << x << endl;
#define trace1(x) cout << #x << ": " << x << endl
#define trace2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long int, long long int> pll;
typedef map<int, int> mii;
typedef vector<pair<int, int>> vpii;
#define endl "\n";
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(cont, it) \
for (decltype((cont).begin()) it = (cont).begin(); it != (cont).end(); it++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define F first
#define S second
const ll mod = 1000000007;
const ll inf = (ll)1e15;
ll power(ll a, ll b, ll m = mod) {
if (b == 0)
return 1;
if (b == 1)
return (a % m);
ll x = power(a, b / 2, m);
x = (x * x) % m;
if (b % 2)
x = (x * a) % m;
return x;
}
ll max(ll a, ll b) { return (a > b ? a : b); }
ll min(ll a, ll b) { return (a < b ? a : b); }
const int N = 105, M = 1e5 + 5;
int a[N], k;
int n;
bool dp1[N], memo1[N], dp2[N], memo2[N];
bool func1(int);
bool func2(int rem) {
// cout << "inf";
if (rem == 0)
return false;
if (memo2[rem])
return dp2[rem];
memo2[rem] = true;
bool ret = false;
for (int i = 1; i <= n; i++) {
if (rem - a[i] >= 0)
ret |= (!func1(rem - a[i]));
}
return dp2[rem] = ret;
}
bool func1(int rem) {
// cout << "inf1";
if (rem == 0)
return false;
if (memo1[rem])
return dp1[rem];
memo1[rem] = true;
bool ret = false;
for (int i = 1; i <= n; i++) {
if (rem - a[i] >= 0)
ret |= (!func2(rem - a[i]));
}
return dp1[rem] = ret;
}
void solve() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
bool ans = func1(k);
if (ans) {
cout << "First" << endl;
} else
cout << "Second" << endl;
}
int main() {
IOS;
int t = 1, num = 1; ///// change this t for number of testcase globally
while (t--) {
solve();
}
return 0;
}
| #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_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define debug(x) cout << #x << " = " << x << endl;
#define trace1(x) cout << #x << ": " << x << endl
#define trace2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long int, long long int> pll;
typedef map<int, int> mii;
typedef vector<pair<int, int>> vpii;
#define endl "\n";
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(cont, it) \
for (decltype((cont).begin()) it = (cont).begin(); it != (cont).end(); it++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define F first
#define S second
const ll mod = 1000000007;
const ll inf = (ll)1e15;
ll power(ll a, ll b, ll m = mod) {
if (b == 0)
return 1;
if (b == 1)
return (a % m);
ll x = power(a, b / 2, m);
x = (x * x) % m;
if (b % 2)
x = (x * a) % m;
return x;
}
ll max(ll a, ll b) { return (a > b ? a : b); }
ll min(ll a, ll b) { return (a < b ? a : b); }
const int N = 105, M = 1e5 + 5;
int a[N], k;
int n;
bool dp1[M], memo1[M], dp2[M], memo2[M];
bool func1(int);
bool func2(int rem) {
// cout << "inf";
if (rem == 0)
return false;
if (memo2[rem])
return dp2[rem];
memo2[rem] = true;
bool ret = false;
for (int i = 1; i <= n; i++) {
if (rem - a[i] >= 0)
ret |= (!func1(rem - a[i]));
}
return dp2[rem] = ret;
}
bool func1(int rem) {
// cout << "inf1";
if (rem == 0)
return false;
if (memo1[rem])
return dp1[rem];
memo1[rem] = true;
bool ret = false;
for (int i = 1; i <= n; i++) {
if (rem - a[i] >= 0)
ret |= (!func2(rem - a[i]));
}
return dp1[rem] = ret;
}
void solve() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
bool ans = func1(k);
if (ans) {
cout << "First" << endl;
} else
cout << "Second" << endl;
}
int main() {
IOS;
int t = 1, num = 1; ///// change this t for number of testcase globally
while (t--) {
solve();
}
return 0;
}
| [
"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 (int i = 1; i <= n; i++) {
int num = 0;
for (int j = 0; j <= k; j++) {
add(num, dp[i - 1][j]);
dp[i][j] = num;
if (j - a[i - 1] >= 0)
add(num, -dp[i - 1][j - a[i - 1]]);
}
}
cout << dp[n][k] << endl;
}
| #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 (int i = 1; i <= n; i++) {
int num = 0;
for (int j = 0; j <= k; j++) {
add(num, dp[i - 1][j]);
dp[i][j] = num;
if (j - a[i - 1] >= 0)
add(num, -dp[i - 1][j - a[i - 1]]);
}
}
cout << (dp[n][k] + MOD) % MOD << endl;
}
| [
"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); \
ios_base::sync_with_stdio(false);
#define loop(i, a, b) for (int i = a; i < b; i++)
#define INF 10000000000099ll
#define mod 1000000007
#define prDouble(x) cout << fixed << setprecision(10) << x
ll solve(vector<int> &v, int n, int k) {
ll dp[n + 2][k + 2];
for (int i = 0; i <= k; i++)
dp[1][i] = (i > v[1]) ? 0 : 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= k; j++) {
if (j == 0)
dp[i][j] = dp[i - 1][j];
else
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] -
((j - v[i] - 1 >= 0) ? dp[i - 1][j - v[i] - 1] : 0)) %
mod;
}
}
return dp[n][k] % mod;
}
int main() {
FASTIO;
int n, k;
cin >> n >> k;
vector<int> v(n + 1);
loop(i, 1, n + 1) cin >> v[i];
cout << solve(v, n, k);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define FASTIO \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define loop(i, a, b) for (int i = a; i < b; i++)
#define INF 10000000000099ll
#define mod 1000000007
#define prDouble(x) cout << fixed << setprecision(10) << x
ll solve(vector<int> &v, int n, int k) {
ll dp[n + 2][k + 2];
for (int i = 0; i <= k; i++)
dp[1][i] = (i > v[1]) ? 0 : 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= k; j++) {
if (j == 0)
dp[i][j] = dp[i - 1][j];
else
dp[i][j] = (mod + dp[i][j - 1] + dp[i - 1][j] -
((j - v[i] - 1 >= 0) ? dp[i - 1][j - v[i] - 1] : 0)) %
mod;
}
}
return dp[n][k] % mod;
}
int main() {
FASTIO;
int n, k;
cin >> n >> k;
vector<int> v(n + 1);
loop(i, 1, n + 1) cin >> v[i];
cout << solve(v, n, k);
return 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--)
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, k;
cin >> n >> k;
ll a[n + 1], dp[n + 1][k + 1];
memset(dp, 0, sizeof(dp));
fo(i, 1, n + 1) cin >> a[i], dp[i][0] = 1;
dp[0][0] = 1;
fo(i, 1, n + 1) {
for (ll j = 1; j <= k; j++) {
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod;
if (j > a[i])
dp[i][j] = (dp[i][j] - dp[i - 1][j - a[i] - 1]) % mod;
if (dp[i][j] < 0)
dp[i][j] = 0;
// cout << i << " " << j << " " << dp[i][j] << endl;
}
}
cout << dp[n][k];
}
| #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--)
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, k;
cin >> n >> k;
ll a[n + 1], dp[n + 1][k + 1];
memset(dp, 0, sizeof(dp));
fo(i, 1, n + 1) cin >> a[i], dp[i][0] = 1;
dp[0][0] = 1;
fo(i, 1, n + 1) {
for (ll j = 1; j <= k; j++) {
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod;
if (j > a[i])
dp[i][j] = (dp[i][j] - dp[i - 1][j - a[i] - 1] + mod) % mod;
if (dp[i][j] < 0)
dp[i][j] = 0;
// cout << i << " " << j << " " << dp[i][j] << endl;
}
}
cout << dp[n][k];
}
| [
"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() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
ll n, k;
cin >> n >> k;
ll a[n];
ll maxi = -1;
for (ll i = 0; i < n; i++) {
/* code */
cin >> a[i];
maxi = max(a[i], maxi);
}
vector<vector<ll>> dp(n, vector<ll>(k + 1, 0));
dp[0][0] = 1;
for (ll i = 1; i <= min(a[0], k); i++) {
dp[0][i] = 1;
}
if (n == 1) {
cout << dp[0][k] << '\n';
return 0;
}
for (ll i = 1; i <= k; i++) {
dp[0][i] += dp[0][i - 1];
}
for (ll i = 1; i < n; i++) {
for (ll j = 0; j <= k; j++) {
if (j == 0) {
dp[i][j] = 1;
} else {
ll l = max(j - a[i], (ll)0);
if (l > 0)
dp[i][j] = (dp[i - 1][j] - dp[i - 1][l - 1]) % mod;
else {
dp[i][j] = dp[i - 1][j];
}
}
}
if (i == (n - 1))
break;
for (ll j = 1; j <= k; j++) {
dp[i][j] = (dp[i][j - 1] + dp[i][j]) % mod;
}
}
cout << dp[n - 1][k] << '\n';
} | #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() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
ll n, k;
cin >> n >> k;
ll a[n];
ll maxi = -1;
for (ll i = 0; i < n; i++) {
/* code */
cin >> a[i];
maxi = max(a[i], maxi);
}
vector<vector<ll>> dp(n, vector<ll>(k + 1, 0));
dp[0][0] = 1;
for (ll i = 1; i <= min(a[0], k); i++) {
dp[0][i] = 1;
}
if (n == 1) {
cout << dp[0][k] << '\n';
return 0;
}
for (ll i = 1; i <= k; i++) {
dp[0][i] += dp[0][i - 1];
}
for (ll i = 1; i < n; i++) {
for (ll j = 0; j <= k; j++) {
if (j == 0) {
dp[i][j] = 1;
} else {
ll l = max(j - a[i], (ll)0);
if (l > 0)
dp[i][j] = (dp[i - 1][j] - dp[i - 1][l - 1] + mod) % mod;
else {
dp[i][j] = dp[i - 1][j];
}
}
}
if (i == (n - 1))
break;
for (ll j = 1; j <= k; j++) {
dp[i][j] = (dp[i][j - 1] + dp[i][j]) % mod;
}
}
cout << dp[n - 1][k] << '\n';
} | [
"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 (int i = 0; i < n; i++)
cin >> upto[i];
vector<long long int> dp(candies + 1);
dp[0] = 1;
for (int i = 0; i < n; i++) {
vector<ll> dp1(candies + 1);
for (int cur_candy = candies; cur_candy >= 0; cur_candy--) {
int temp = dp[cur_candy];
int L = cur_candy + 1;
int R = cur_candy + min(upto[i], candies - cur_candy);
if (L <= R && L <= candies) {
add_self(dp1[L], temp);
if (R + 1 <= candies)
set_self(dp1[R], temp);
}
}
ll prefix_sum = 0;
for (int i = 0; i <= candies; i++) {
add_self(prefix_sum, dp1[i]);
add_self(dp[i], prefix_sum);
}
}
cout << dp[candies] % mod;
}
| #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 (int i = 0; i < n; i++)
cin >> upto[i];
vector<long long int> dp(candies + 1);
dp[0] = 1;
for (int i = 0; i < n; i++) {
vector<ll> dp1(candies + 1);
for (int cur_candy = candies; cur_candy >= 0; cur_candy--) {
int temp = dp[cur_candy];
int L = cur_candy + 1;
int R = cur_candy + min(upto[i], candies - cur_candy);
if (L <= R && L <= candies) {
add_self(dp1[L], temp);
if (R + 1 <= candies)
set_self(dp1[R + 1], temp);
}
}
ll prefix_sum = 0;
for (int i = 0; i <= candies; i++) {
add_self(prefix_sum, dp1[i]);
add_self(dp[i], prefix_sum);
}
}
cout << dp[candies];
}
| [
"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; i++) {
for (int j = 0; j <= k; j++) {
if (j == 0)
ans[i][j] = ans[i - 1][j];
else {
ans[i][j] =
(ans[i][j - 1] + ans[i - 1][j] -
((j - 1 - a[i - 1] >= 0) ? ans[i - 1][j - 1 - a[i - 1]] : 0)) %
mdl;
}
}
}
cout << (ans[n][k] % mdl) << endl;
return 0;
}
| #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; i++) {
for (int j = 0; j <= k; j++) {
if (j == 0)
ans[i][j] = ans[i - 1][j];
else {
ans[i][j] =
(mdl + ans[i][j - 1] + ans[i - 1][j] -
((j - 1 - a[i - 1] >= 0) ? ans[i - 1][j - 1 - a[i - 1]] : 0)) %
mdl;
}
}
}
cout << (ans[n][k] % mdl) << endl;
return 0;
}
| [
"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>>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define vs vector<string>
#define vvpll vector<vector<pair<ll, ll>>>
#define pb push_back
#define pob pop_back()
#define MOD (ll)(1e9 + 7)
#define test \
ll t; \
cin >> t; \
while (t--)
using namespace std;
void enter(vll &ar) {
ll n = ar.size();
for (ll i = 0; i < n; i++) {
cin >> ar[i];
}
}
void show(vll &a) {
ll n = a.size();
for (ll i = 0; i < n; i++) {
cout << a[i] << " ";
}
cout << "\n";
}
void SieveOfErat1sthenes(int n, vll &pri) {
vb prime(n + 1, true);
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
pri.pb(p);
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
ll mo(ll a) { return a % MOD; }
bool compare(pll a, pll b) { return a.first > b.first; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
vll a(n);
enter(a);
vvll dp(k + 1, vll(n + 1)), mat(k + 1, vll(n + 1));
vll sum(n + 1, 0);
sort(a.begin(), a.end(), greater<ll>());
for (ll i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + a[i - 1];
}
for (ll i = 0; i <= n; i++)
dp[0][i] = 1;
for (ll i = 0; i <= n; i++)
mat[0][i] = 1;
for (ll i = 0; i <= k; i++)
mat[i][0] = 1;
// for(ll i=1;i<=k;i++) dp[i][0] = i;
for (ll i = 1; i <= k; i++) {
for (ll j = 1; j <= n; j++) {
if (sum[j] >= i) {
dp[i][j] = mo(
mo(mat[i][j - 1]) -
mo(((i - a[j - 1] - 1 >= 0) ? mat[i - a[j - 1] - 1][j - 1] : 0)));
}
mat[i][j] = mo(mo(dp[i][j]) + mo(mat[i - 1][j]));
// for(ll l=i;l>=max(0LL, i-a[j-1]); l--)
// {
// dp[i][j] = mo(mo(dp[i][j]) + mo(dp[l][j-1]));
// }
}
}
// cout<<"sum: ";
// show(sum);
// for(ll i=0;i<=k;i++)
// {
// for(ll j=0;j<=n;j++)
// {
// cout<<dp[i][j]<<" ";
// }
// cout<<"\n";
// }
if (sum[n] < k)
dp[k][n] = 0;
cout << dp[k][n] << "\n";
return 0;
}
| //#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>>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define vs vector<string>
#define vvpll vector<vector<pair<ll, ll>>>
#define pb push_back
#define pob pop_back()
#define MOD (ll)(1e9 + 7)
#define test \
ll t; \
cin >> t; \
while (t--)
using namespace std;
void enter(vll &ar) {
ll n = ar.size();
for (ll i = 0; i < n; i++) {
cin >> ar[i];
}
}
void show(vll &a) {
ll n = a.size();
for (ll i = 0; i < n; i++) {
cout << a[i] << " ";
}
cout << "\n";
}
void SieveOfErat1sthenes(int n, vll &pri) {
vb prime(n + 1, true);
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
pri.pb(p);
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
ll mo(ll a) { return a % MOD; }
bool compare(pll a, pll b) { return a.first > b.first; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
vll a(n);
enter(a);
vvll dp(k + 1, vll(n + 1)), mat(k + 1, vll(n + 1));
vll sum(n + 1, 0);
sort(a.begin(), a.end(), greater<ll>());
for (ll i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + a[i - 1];
}
for (ll i = 0; i <= n; i++)
dp[0][i] = 1;
for (ll i = 0; i <= n; i++)
mat[0][i] = 1;
for (ll i = 0; i <= k; i++)
mat[i][0] = 1;
// for(ll i=1;i<=k;i++) dp[i][0] = i;
for (ll i = 1; i <= k; i++) {
for (ll j = 1; j <= n; j++) {
if (sum[j] >= i) {
dp[i][j] = mo(
mo(mat[i][j - 1]) -
mo(((i - a[j - 1] - 1 >= 0) ? mat[i - a[j - 1] - 1][j - 1] : 0)) +
MOD);
}
mat[i][j] = mo(mo(dp[i][j]) + mo(mat[i - 1][j]));
// for(ll l=i;l>=max(0LL, i-a[j-1]); l--)
// {
// dp[i][j] = mo(mo(dp[i][j]) + mo(dp[l][j-1]));
// }
}
}
// cout<<"sum: ";
// show(sum);
// for(ll i=0;i<=k;i++)
// {
// for(ll j=0;j<=n;j++)
// {
// cout<<dp[i][j]<<" ";
// }
// cout<<"\n";
// }
if (sum[n] < k)
dp[k][n] = 0;
cout << dp[k][n] << "\n";
return 0;
}
| [
"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"
#define pii pair<int, int>
#define pll pair<ll, ll>
typedef long long ll;
#define loop() for (int i = 0; i < (); i++)
const int MOD = 1e9 + 7;
int modpow(int x, int n, int m) {
if (n == 0)
return 1;
ll ans = 1;
while (n > 0) {
if (n % 2 == 1)
ans = (ans * x) % m;
x = (x * x) % m;
n /= 2;
}
return ans;
}
void solve() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
// fill(dp[1].begin(),dp[1].end(),1);
for (int i = 0; i <= n; i++)
dp[i][0] = 1;
for (int i = 1; i <= n; i++) {
int sum[k + 1];
sum[0] = 1;
for (int j = 1; j <= k; j++)
sum[j] = (sum[j - 1] + dp[i - 1][j]) % MOD;
for (int j = 1; j <= k; j++) {
int r = min(a[i - 1], j);
dp[i][j] = ((sum[j] - sum[j - r]) + dp[i - 1][j - r] + MOD) % MOD;
}
}
cout << dp[n][k] << endl;
}
int main() {
fast int t = 1;
// cin>>t;
while (t--)
solve();
}
| #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"
#define pii pair<int, int>
#define pll pair<ll, ll>
typedef long long ll;
#define loop() for (int i = 0; i < (); i++)
const int MOD = 1e9 + 7;
int modpow(int x, int n, int m) {
if (n == 0)
return 1;
ll ans = 1;
while (n > 0) {
if (n % 2 == 1)
ans = (ans * x) % m;
x = (x * x) % m;
n /= 2;
}
return ans;
}
void solve() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
// fill(dp[1].begin(),dp[1].end(),1);
for (int i = 0; i <= n; i++)
dp[i][0] = 1;
for (int i = 1; i <= n; i++) {
int sum[k + 1];
sum[0] = 1;
for (int j = 1; j <= k; j++)
sum[j] = (sum[j - 1] + dp[i - 1][j]) % MOD;
for (int j = 1; j <= k; j++) {
int r = min(a[i - 1], j);
dp[i][j] = ((sum[j] - sum[j - r] + MOD) % MOD + dp[i - 1][j - r]) % MOD;
}
}
cout << dp[n][k] << endl;
}
int main() {
fast int t = 1;
// cin>>t;
while (t--)
solve();
}
| [
"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"
#define pii pair<int, int>
#define pll pair<ll, ll>
typedef long long ll;
#define loop() for (int i = 0; i < (); i++)
const int MOD = 1e9 + 7;
int modpow(int x, int n, int m) {
if (n == 0)
return 1;
ll ans = 1;
while (n > 0) {
if (n % 2 == 1)
ans = (ans * x) % m;
x = (x * x) % m;
n /= 2;
}
return ans;
}
void solve() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
// fill(dp[1].begin(),dp[1].end(),1);
for (int i = 0; i <= n; i++)
dp[i][0] = 1;
for (int i = 1; i <= n; i++) {
int sum[k + 1];
sum[0] = 1;
for (int j = 1; j <= k; j++)
sum[j] = (sum[j - 1] + dp[i - 1][j]) % MOD;
for (int j = 1; j <= k; j++) {
int r = min(a[i - 1], j);
dp[i][j] = ((sum[j] - sum[j - r]) + dp[i - 1][j - r]) % MOD;
}
}
cout << dp[n][k] << endl;
}
int main() {
fast int t = 1;
// cin>>t;
while (t--)
solve();
}
| #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"
#define pii pair<int, int>
#define pll pair<ll, ll>
typedef long long ll;
#define loop() for (int i = 0; i < (); i++)
const int MOD = 1e9 + 7;
int modpow(int x, int n, int m) {
if (n == 0)
return 1;
ll ans = 1;
while (n > 0) {
if (n % 2 == 1)
ans = (ans * x) % m;
x = (x * x) % m;
n /= 2;
}
return ans;
}
void solve() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
// fill(dp[1].begin(),dp[1].end(),1);
for (int i = 0; i <= n; i++)
dp[i][0] = 1;
for (int i = 1; i <= n; i++) {
int sum[k + 1];
sum[0] = 1;
for (int j = 1; j <= k; j++)
sum[j] = (sum[j - 1] + dp[i - 1][j]) % MOD;
for (int j = 1; j <= k; j++) {
int r = min(a[i - 1], j);
dp[i][j] = ((sum[j] - sum[j - r] + MOD) % MOD + dp[i - 1][j - r]) % MOD;
}
}
cout << dp[n][k] << endl;
}
int main() {
fast int t = 1;
// cin>>t;
while (t--)
solve();
}
| [
"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(dp));
for (int i = 0; i < n; i++)
dp[i][0] = 1;
for (int i = 0; i <= k; i++)
dp[0][i] = 1;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (v[i - 1] < j) {
dp[i][j] =
(dp[i][j - 1] + (dp[i - 1][j] - dp[i - 1][j - v[i - 1] - 1])) % mod;
} else
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % mod;
}
}
if (k <= v[n - 1])
cout << dp[n - 1][k] % mod;
else
cout << (dp[n - 1][k] - dp[n - 1][k - v[n - 1] - 1]) % mod;
} | #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(dp));
for (int i = 0; i < n; i++)
dp[i][0] = 1;
for (int i = 0; i <= k; i++)
dp[0][i] = 1;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (v[i - 1] < j) {
dp[i][j] = (dp[i][j - 1] +
(dp[i - 1][j] - dp[i - 1][j - v[i - 1] - 1]) + mod) %
mod;
} else
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % mod;
}
}
if (k <= v[n - 1])
cout << dp[n - 1][k] % mod;
else
cout << (dp[n - 1][k] - dp[n - 1][k - v[n - 1] - 1] + mod) % mod;
} | [
"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};
pref[0] = dp[i - 1][0] % mod;
for (ll j = 1; j <= k; j++)
pref[j] = (pref[j - 1] + dp[i - 1][j]) % mod;
for (ll j = 0; j <= k; j++) {
if (j <= a[i])
dp[i][j] = pref[j] % mod;
else {
dp[i][j] = (pref[j] - pref[j - a[i] - 1]) % mod;
}
}
}
cout << dp[n][k] << endl;
return 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};
pref[0] = dp[i - 1][0] % mod;
for (ll j = 1; j <= k; j++)
pref[j] = (pref[j - 1] + dp[i - 1][j]) % mod;
for (ll j = 0; j <= k; j++) {
if (j <= a[i])
dp[i][j] = pref[j] % mod;
else {
dp[i][j] = (pref[j] - pref[j - a[i] - 1] + mod) % mod;
}
}
}
cout << dp[n][k] << endl;
return 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; i++) {
for (j = 1; j <= n; j++) {
ll x = min(i, a[j]);
x++;
if (x > i)
ans = dp[i][j - 1] % mod;
else {
ans = dp[i][j - 1] - dp[i - x][j - 1] + mod;
ans %= mod;
}
dp[i][j] = dp[i - 1][j] % mod + ans;
dp[i][j] %= mod;
}
}
cout << ans;
return 0;
}
| #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; i++) {
for (j = 1; j <= n; j++) {
ll x = min(i, a[j]);
x++;
if (x > i)
ans = dp[i][j - 1] % mod;
else {
ans = dp[i][j - 1] - dp[i - x][j - 1] + mod;
ans %= mod;
}
dp[i][j] = dp[i - 1][j] % mod + ans;
dp[i][j] %= mod;
}
}
cout << ans;
return 0;
}
| [
"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 = 1; i < n; i++) {
// check 7 dec 16 in diary for solution;
x = min(A[i], K);
dp[i][0] = 1;
for (int k = 1; k <= x; k++) {
dp[i][k] = (dp[i][k - 1] + dp[i - 1][k]) % M;
}
for (int k = x + 1; k <= K; k++) {
dp[i][k] = (dp[i - 1][k] + dp[i][k - 1] - dp[i][k - 1 - x] + M) % M;
}
}
return dp[n - 1][K];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << solve() << "\n";
} | #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 = 1; i < n; i++) {
// check 7 dec 16 in diary for solution;
x = min(A[i], K);
dp[i][0] = 1;
// cout<<x<<"\n";
for (int k = 1; k <= x; k++) {
dp[i][k] = (dp[i][k - 1] + dp[i - 1][k]) % M;
}
for (int k = x + 1; k <= K; k++) {
dp[i][k] = (dp[i - 1][k] + dp[i][k - 1] - dp[i - 1][k - 1 - x] + M) % M;
}
}
return dp[n - 1][K];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << solve() << "\n";
} | [
"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.tie(0)
#define debug(x) cerr << #x << " " << x << endl
#define cina(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define couta(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " ";
#define fauto(ar) \
for (auto x : ar) \
cout << x << " ";
#define mod 1000000007
#define inf 10010010010010010
#define siz 100005
#define f first
#define s second
#define pb push_back
#define endl "\n"
#define ci cin.ignore()
using namespace std;
// ll getans(ll *a,ll n,ll k,ll pos,ll sum)
//{
// if(sum > k)
// return 0;
// if(pos == n)
// {
// return sum == k;
// }
// if(dp[pos][sum] != -1)
// return dp[pos][sum];
//
// ll ans = 0;
// for(ll i = 0;i<=a[pos];i++)
// ans += getans(a,n,k,pos+1,sum+i),
// ans %= mod;
//
// return dp[pos][sum] = ans;
//
//}
int main() {
ll n, k, i, j, p, flag;
cin >> n >> k;
ll a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
ll dp[2][k + 1];
for (i = 0; i <= 1; i++)
for (j = 0; j <= k; j++)
dp[i][j] = 0;
// for(i = 0;i<=k;i++)
// dp[0][i] = 1;
ll sum[k + 1];
flag = 1;
for (i = 1; i <= n; i++) {
sum[0] = 1;
for (j = 1; j <= k; j++)
sum[j] = sum[j - 1] + dp[flag ^ 1][j], sum[j] %= mod;
for (j = 1; j <= k; j++) {
ll left = 0;
if (j - a[i] - 1 >= 0)
left = sum[j - a[i] - 1];
ll right = sum[j];
dp[flag][j] = right - left;
dp[flag][j] %= mod;
dp[flag][j] += mod;
dp[flag][j] %= mod;
}
flag ^= 1;
}
cout << dp[flag ^ 1][k];
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define debug(x) cerr << #x << " " << x << endl
#define cina(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define couta(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " ";
#define fauto(ar) \
for (auto x : ar) \
cout << x << " ";
#define mod 1000000007
#define inf 10010010010010010
#define siz 100005
#define f first
#define s second
#define pb push_back
#define endl "\n"
#define ci cin.ignore()
using namespace std;
int main() {
ll n, k, i, j, p, flag;
cin >> n >> k;
ll a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
ll dp[2][k + 1];
for (i = 0; i <= 1; i++)
for (j = 0; j <= k; j++)
dp[i][j] = 0;
// for(i = 0;i<=k;i++)
// dp[0][i] = 1;
ll sum[k + 1];
flag = 1;
for (i = 1; i <= n; i++) {
sum[0] = 1;
for (j = 1; j <= k; j++)
sum[j] = sum[j - 1] + dp[flag ^ 1][j], sum[j] %= mod;
// dp[flag][0] = 1;
for (j = 0; j <= k; j++) {
ll left = 0;
if (j - a[i] - 1 >= 0)
left = sum[j - a[i] - 1];
ll right = sum[j];
dp[flag][j] = right - left;
dp[flag][j] %= mod;
dp[flag][j] += mod;
dp[flag][j] %= mod;
}
flag ^= 1;
}
cout << dp[flag ^ 1][k];
} | [
"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.tie(0)
#define debug(x) cerr << #x << " " << x << endl
#define cina(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define couta(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " ";
#define fauto(ar) \
for (auto x : ar) \
cout << x << " ";
#define mod 1000000007
#define inf 10010010010010010
#define siz 100005
#define f first
#define s second
#define pb push_back
#define endl "\n"
#define ci cin.ignore()
using namespace std;
int main() {
ll n, k, i, j, p, flag;
cin >> n >> k;
ll a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
ll dp[2][k + 1];
for (i = 0; i <= 1; i++)
for (j = 0; j <= k; j++)
dp[i][j] = 0;
// for(i = 0;i<=k;i++)
// dp[0][i] = 1;
ll sum[k + 1];
flag = 1;
for (i = 1; i <= n; i++) {
sum[0] = 1;
for (j = 1; j <= k; j++)
sum[j] = sum[j - 1] + dp[flag ^ 1][j], sum[j] %= mod;
dp[i][0] = 1;
for (j = 1; j <= k; j++) {
ll left = 0;
if (j - a[i] - 1 >= 0)
left = sum[j - a[i] - 1];
ll right = sum[j];
dp[flag][j] = right - left;
dp[flag][j] %= mod;
dp[flag][j] += mod;
dp[flag][j] %= mod;
}
flag ^= 1;
}
cout << dp[flag ^ 1][k];
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define debug(x) cerr << #x << " " << x << endl
#define cina(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define couta(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " ";
#define fauto(ar) \
for (auto x : ar) \
cout << x << " ";
#define mod 1000000007
#define inf 10010010010010010
#define siz 100005
#define f first
#define s second
#define pb push_back
#define endl "\n"
#define ci cin.ignore()
using namespace std;
int main() {
ll n, k, i, j, p, flag;
cin >> n >> k;
ll a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
ll dp[2][k + 1];
for (i = 0; i <= 1; i++)
for (j = 0; j <= k; j++)
dp[i][j] = 0;
// for(i = 0;i<=k;i++)
// dp[0][i] = 1;
ll sum[k + 1];
flag = 1;
for (i = 1; i <= n; i++) {
sum[0] = 1;
for (j = 1; j <= k; j++)
sum[j] = sum[j - 1] + dp[flag ^ 1][j], sum[j] %= mod;
dp[flag][0] = 1;
for (j = 1; j <= k; j++) {
ll left = 0;
if (j - a[i] - 1 >= 0)
left = sum[j - a[i] - 1];
ll right = sum[j];
dp[flag][j] = right - left;
dp[flag][j] %= mod;
dp[flag][j] += mod;
dp[flag][j] %= mod;
}
flag ^= 1;
}
cout << dp[flag ^ 1][k];
} | [
"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] = 0;
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
vector<int> pre(k + 1);
for (int p = 0; p <= k; p++) {
if (p - a[i] - 1 < 0)
dp[i][p] = prefix[p];
else {
dp[i][p] = (prefix[p] - prefix[p - a[i] - 1] + mod) % mod;
}
// cout<<i<<' '<<p<<' '<<dp[i][p]<<'\n';
if (p > 0)
pre[p] = dp[i][p] + pre[p - 1];
else
pre[p] = 1;
}
prefix = pre;
/*int sums[k+1];
sums[0]=dp[i-1][0];
for(int j=1;j<=k;j++)
{
sums[j]=(sums[j-1]+dp[i-1][j])%mod; ///Calculate the prefix sums for i-1
}
for(int j=0;j<=k;j++)
{
int tr=sums[j]; ///Sum of dp[i-1][0...j]
int unreachable=j-a[i]-1; ///We need to subtract the sum of the first
"unreachable" elements (dp[i-1][0...unreachable]) if(unreachable>=0)
{
tr=(tr-sums[unreachable]+mod)%mod; ///Add mod to make sure that
"tr-sums[unreachable]" is not negative.
}
dp[i][j]=tr;
}*/
}
cout << dp[n][k];
} | #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] = 0;
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
vector<int> pre(k + 1);
for (int p = 0; p <= k; p++) {
if (p - a[i] - 1 < 0)
dp[i][p] = prefix[p];
else {
dp[i][p] = (prefix[p] - prefix[p - a[i] - 1] + mod) % mod;
}
// cout<<i<<' '<<p<<' '<<dp[i][p]<<'\n';
if (p > 0)
pre[p] = (dp[i][p] + pre[p - 1]) % mod;
else
pre[p] = 1;
}
prefix = pre;
/*int sums[k+1];
sums[0]=dp[i-1][0];
for(int j=1;j<=k;j++)
{
sums[j]=(sums[j-1]+dp[i-1][j])%mod; ///Calculate the prefix sums for i-1
}*/
/*vector<int>pre(k+1);
for(int j=0;j<=k;j++)
{
int tr=prefix[j]; ///Sum of dp[i-1][0...j]
int unreachable=j-a[i]-1; ///We need to subtract the sum of the first
"unreachable" elements (dp[i-1][0...unreachable]) if(unreachable>=0)
{
tr=(tr-prefix[unreachable]+mod)%mod; ///Add mod to make sure that
"tr-sums[unreachable]" is not negative.
}
dp[i][j]=tr;
if(j>0)pre[j]=(pre[j-1]+dp[i][j]);
else pre[j]=1;
}
prefix=pre;*/
}
cout << dp[n][k];
} | [
"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 \
ios::sync_with_stdio(0); \
cin.tie(0);
#define de(x, y) cout << #x << " :" << x << y;
#define int long long
#define SZ(xx) ((int)xx.size())
#define lowbit(xx) (xx & (-xx))
#define pb push_back
typedef pair<int, int> pii;
const int maxn = 4e5 + 5;
const int mod = 1e9 + 7;
int arr[maxn];
struct Bit_Tree {
int bit[maxn] = {};
void upd(int x, int val) {
for (int i = x; i < maxn; i += lowbit(i))
bit[i] = (bit[i] + val) % mod;
}
int qry(int l) {
int ret = 0;
for (int i = l; i; i -= lowbit(i))
ret = (ret + bit[i]) % mod;
return ret;
}
} bit;
main() {
IOS int n, k;
cin >> n >> k;
k++;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
bit.upd(1, 1);
bit.upd(min(k, 1 + arr[1]) + 1, -1);
for (int i = 2; i <= n; i++) {
if (arr[i] == 0)
continue;
for (int j = k; j >= 1; j--) {
int val = bit.qry(j);
int r = min(j + arr[i], k) + 1;
// cout << j << " " << r << " " << val << "\n";
bit.upd(j, val);
bit.upd(r, -val);
bit.upd(j, -val);
bit.upd(j + 1, val);
// cout << val << " ";
}
// cout << "\n";
}
// for (int i = 1; i <= k; i++) cout << bit.qry(i) << " \n"[i==k];
cout << bit.qry(k) << "\n";
}
| #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 \
ios::sync_with_stdio(0); \
cin.tie(0);
#define de(x, y) cout << #x << " :" << x << y;
#define int long long
#define SZ(xx) ((int)xx.size())
#define lowbit(xx) (xx & (-xx))
#define pb push_back
typedef pair<int, int> pii;
const int maxn = 4e5 + 5;
const int mod = 1e9 + 7;
int arr[maxn];
struct Bit_Tree {
int bit[maxn] = {};
void upd(int x, int val) {
for (int i = x; i < maxn; i += lowbit(i))
bit[i] = (bit[i] + val) % mod;
}
int qry(int l) {
int ret = 0;
for (int i = l; i; i -= lowbit(i))
ret = (ret + bit[i]) % mod;
return ret;
}
} bit;
main() {
IOS int n, k;
cin >> n >> k;
k++;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
bit.upd(1, 1);
bit.upd(min(k, 1 + arr[1]) + 1, -1);
for (int i = 2; i <= n; i++) {
if (arr[i] == 0)
continue;
for (int j = k; j >= 1; j--) {
int val = bit.qry(j);
int r = min(j + arr[i], k) + 1;
// cout << j << " " << r << " " << val << "\n";
bit.upd(j, val);
bit.upd(r, -val + mod);
bit.upd(j, -val + mod);
bit.upd(j + 1, val);
// cout << val << " ";
}
// cout << "\n";
}
// for (int i = 1; i <= k; i++) cout << bit.qry(i) << " \n"[i==k];
cout << bit.qry(k) << "\n";
}
| [
"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 <unordered_set>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int, int> mii;
typedef set<int> si;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define arep(i, v) for (auto i : v)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STLL(s) strtoll(s.c_str(), NULL, 10)
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define fi first
#define se second
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
template <class T> inline void dump(T &v) {
irep(i, v) { cout << (*i) << ((i == --v.end()) ? '\n' : ' '); }
}
inline string getline() {
string s;
getline(cin, s);
return s;
}
inline void yn(const bool b) { b ? fin("yes") : fin("no"); }
inline void Yn(const bool b) { b ? fin("Yes") : fin("No"); }
inline void YN(const bool b) { b ? fin("YES") : fin("NO"); }
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
constexpr ll LLINF = 1LL << 60;
constexpr ll MOD = 1000000007;
constexpr ld EPS = 1e-11;
/* -------------------- ここまでテンプレ -------------------- */
struct mint {
ll x;
mint(ll _x = 0) : x((_x % MOD + MOD) % MOD) {}
/* 初期化子 */
mint operator+() const { return mint(x); }
mint operator-() const { return mint(-x); }
/* 代入演算子 */
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint &operator/=(const mint a) {
x *= modinv(a).x;
x %= MOD;
return (*this);
}
mint &operator%=(const mint a) {
x %= a.x;
return (*this);
}
mint &operator++() {
++x;
if (x >= MOD)
x -= MOD;
return *this;
}
mint &operator--() {
if (!x)
x += MOD;
--x;
return *this;
}
mint &operator&=(const mint a) {
x &= a.x;
return (*this);
}
mint &operator|=(const mint a) {
x |= a.x;
return (*this);
}
mint &operator^=(const mint a) {
x ^= a.x;
return (*this);
}
mint &operator<<=(const mint a) {
x *= pow(2, a).x;
return (*this);
}
mint &operator>>=(const mint a) {
x /= pow(2, a).x;
return (*this);
}
/* 算術演算子 */
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
mint operator%(const mint a) const {
mint res(*this);
return res %= a;
}
mint operator&(const mint a) const {
mint res(*this);
return res &= a;
}
mint operator|(const mint a) const {
mint res(*this);
return res |= a;
}
mint operator^(const mint a) const {
mint res(*this);
return res ^= a;
}
mint operator<<(const mint a) const {
mint res(*this);
return res <<= a;
}
mint operator>>(const mint a) const {
mint res(*this);
return res >>= a;
}
/* 条件演算子 */
bool operator==(const mint a) const noexcept { return x == a.x; }
bool operator!=(const mint a) const noexcept { return x != a.x; }
bool operator<(const mint a) const noexcept { return x < a.x; }
bool operator>(const mint a) const noexcept { return x > a.x; }
bool operator<=(const mint a) const noexcept { return x <= a.x; }
bool operator>=(const mint a) const noexcept { return x >= a.x; }
/* ストリーム挿入演算子 */
friend istream &operator>>(istream &is, mint &m) {
is >> m.x;
m.x = (m.x % MOD + MOD) % MOD;
return is;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
/* その他の関数 */
mint modinv(mint a) { return pow(a, MOD - 2); }
mint pow(mint x, mint n) {
mint res = 1;
while (n.x > 0) {
if ((n % 2).x)
res *= x;
x *= x;
n.x /= 2;
}
return res;
}
};
int main() {
ll n, k;
cin >> n >> k;
vector<vector<mint>> dp(n, vector<mint>(k + 2, 0));
vll v(n);
rep(i, n) { cin >> v[i]; }
rep(i, min(k + 1, v[0] + 1)) { ++dp[0][i]; }
for (int i = 0; i < n - 1; i++) {
rep(j, k + 1) {
if (dp[i][j].x == 0)
continue;
dp[i + 1][j] += dp[i][j];
// dp[i + 1][j] %= MOD;
ll nj = min(k + 1, j + v[i] + 2);
dp[i + 1][nj] -= dp[i][j];
// dp[i + 1][nj] += MOD;
// dp[i + 1][nj] %= MOD;
}
for (int j = 1; j < k + 1; j++) { // 累積和
dp[i + 1][j] += dp[i + 1][j - 1];
// dp[i + 1][j] %= MOD;
}
}
fin(dp[n - 1][k]);
}
| #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 <unordered_set>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int, int> mii;
typedef set<int> si;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define arep(i, v) for (auto i : v)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STLL(s) strtoll(s.c_str(), NULL, 10)
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define fi first
#define se second
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
template <class T> inline void dump(T &v) {
irep(i, v) { cout << (*i) << ((i == --v.end()) ? '\n' : ' '); }
}
inline string getline() {
string s;
getline(cin, s);
return s;
}
inline void yn(const bool b) { b ? fin("yes") : fin("no"); }
inline void Yn(const bool b) { b ? fin("Yes") : fin("No"); }
inline void YN(const bool b) { b ? fin("YES") : fin("NO"); }
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
constexpr ll LLINF = 1LL << 60;
constexpr ll MOD = 1000000007;
constexpr ld EPS = 1e-11;
/* -------------------- ここまでテンプレ -------------------- */
struct mint {
ll x;
mint(ll _x = 0) : x((_x % MOD + MOD) % MOD) {}
/* 初期化子 */
mint operator+() const { return mint(x); }
mint operator-() const { return mint(-x); }
/* 代入演算子 */
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint &operator/=(const mint a) {
x *= modinv(a).x;
x %= MOD;
return (*this);
}
mint &operator%=(const mint a) {
x %= a.x;
return (*this);
}
mint &operator++() {
++x;
if (x >= MOD)
x -= MOD;
return *this;
}
mint &operator--() {
if (!x)
x += MOD;
--x;
return *this;
}
mint &operator&=(const mint a) {
x &= a.x;
return (*this);
}
mint &operator|=(const mint a) {
x |= a.x;
return (*this);
}
mint &operator^=(const mint a) {
x ^= a.x;
return (*this);
}
mint &operator<<=(const mint a) {
x *= pow(2, a).x;
return (*this);
}
mint &operator>>=(const mint a) {
x /= pow(2, a).x;
return (*this);
}
/* 算術演算子 */
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
mint operator%(const mint a) const {
mint res(*this);
return res %= a;
}
mint operator&(const mint a) const {
mint res(*this);
return res &= a;
}
mint operator|(const mint a) const {
mint res(*this);
return res |= a;
}
mint operator^(const mint a) const {
mint res(*this);
return res ^= a;
}
mint operator<<(const mint a) const {
mint res(*this);
return res <<= a;
}
mint operator>>(const mint a) const {
mint res(*this);
return res >>= a;
}
/* 条件演算子 */
bool operator==(const mint a) const noexcept { return x == a.x; }
bool operator!=(const mint a) const noexcept { return x != a.x; }
bool operator<(const mint a) const noexcept { return x < a.x; }
bool operator>(const mint a) const noexcept { return x > a.x; }
bool operator<=(const mint a) const noexcept { return x <= a.x; }
bool operator>=(const mint a) const noexcept { return x >= a.x; }
/* ストリーム挿入演算子 */
friend istream &operator>>(istream &is, mint &m) {
is >> m.x;
m.x = (m.x % MOD + MOD) % MOD;
return is;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
/* その他の関数 */
mint modinv(mint a) { return pow(a, MOD - 2); }
mint pow(mint x, mint n) {
mint res = 1;
while (n.x > 0) {
if ((n % 2).x)
res *= x;
x *= x;
n.x /= 2;
}
return res;
}
};
int main() {
ll n, k;
cin >> n >> k;
vector<vector<mint>> dp(n, vector<mint>(k + 2, 0));
vll v(n);
rep(i, n) { cin >> v[i]; }
rep(i, min(k + 1, v[0] + 1)) { ++dp[0][i]; }
for (int i = 0; i < n - 1; i++) {
rep(j, k + 1) {
if (dp[i][j].x == 0)
continue;
dp[i + 1][j] += dp[i][j];
ll nj = min(k + 1, j + v[i + 1] + 1);
dp[i + 1][nj] -= dp[i][j];
}
for (int j = 1; j < k + 1; j++) { // 累積和
dp[i + 1][j] += dp[i + 1][j - 1];
}
}
// rep(i, n) dump(dp[i]);
fin(dp[n - 1][k]);
}
| [
"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 <unordered_set>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int, int> mii;
typedef set<int> si;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define arep(i, v) for (auto i : v)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STLL(s) strtoll(s.c_str(), NULL, 10)
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define fi first
#define se second
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
template <class T> inline void dump(T &v) {
irep(i, v) { cout << (*i) << ((i == --v.end()) ? '\n' : ' '); }
}
inline string getline() {
string s;
getline(cin, s);
return s;
}
inline void yn(const bool b) { b ? fin("yes") : fin("no"); }
inline void Yn(const bool b) { b ? fin("Yes") : fin("No"); }
inline void YN(const bool b) { b ? fin("YES") : fin("NO"); }
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
constexpr ll LLINF = 1LL << 60;
constexpr ll MOD = 1000000007;
constexpr ld EPS = 1e-11;
/* -------------------- ここまでテンプレ -------------------- */
struct mint {
ll x;
mint(ll _x = 0) : x((_x % MOD + MOD) % MOD) {}
/* 初期化子 */
mint operator+() const { return mint(x); }
mint operator-() const { return mint(-x); }
/* 代入演算子 */
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint &operator/=(const mint a) {
x *= modinv(a).x;
x %= MOD;
return (*this);
}
mint &operator%=(const mint a) {
x %= a.x;
return (*this);
}
mint &operator++() {
++x;
if (x >= MOD)
x -= MOD;
return *this;
}
mint &operator--() {
if (!x)
x += MOD;
--x;
return *this;
}
mint &operator&=(const mint a) {
x &= a.x;
return (*this);
}
mint &operator|=(const mint a) {
x |= a.x;
return (*this);
}
mint &operator^=(const mint a) {
x ^= a.x;
return (*this);
}
mint &operator<<=(const mint a) {
x *= pow(2, a).x;
return (*this);
}
mint &operator>>=(const mint a) {
x /= pow(2, a).x;
return (*this);
}
/* 算術演算子 */
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
mint operator%(const mint a) const {
mint res(*this);
return res %= a;
}
mint operator&(const mint a) const {
mint res(*this);
return res &= a;
}
mint operator|(const mint a) const {
mint res(*this);
return res |= a;
}
mint operator^(const mint a) const {
mint res(*this);
return res ^= a;
}
mint operator<<(const mint a) const {
mint res(*this);
return res <<= a;
}
mint operator>>(const mint a) const {
mint res(*this);
return res >>= a;
}
/* 条件演算子 */
bool operator==(const mint a) const noexcept { return x == a.x; }
bool operator!=(const mint a) const noexcept { return x != a.x; }
bool operator<(const mint a) const noexcept { return x < a.x; }
bool operator>(const mint a) const noexcept { return x > a.x; }
bool operator<=(const mint a) const noexcept { return x <= a.x; }
bool operator>=(const mint a) const noexcept { return x >= a.x; }
/* ストリーム挿入演算子 */
friend istream &operator>>(istream &is, mint &m) {
is >> m.x;
m.x = (m.x % MOD + MOD) % MOD;
return is;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
/* その他の関数 */
mint modinv(mint a) { return pow(a, MOD - 2); }
mint pow(mint x, mint n) {
mint res = 1;
while (n.x > 0) {
if ((n % 2).x)
res *= x;
x *= x;
n.x /= 2;
}
return res;
}
};
int main() {
ll n, k;
cin >> n >> k;
vector<vector<mint>> dp(n, vector<mint>(k + 2, 0));
vll v(n);
rep(i, n) { cin >> v[i]; }
rep(i, min(k + 1, v[0] + 1)) { ++dp[0][i]; }
for (int i = 0; i < n - 1; i++) {
rep(j, k + 1) {
if (dp[i][j].x == 0)
continue;
dp[i + 1][j] += dp[i][j];
// dp[i + 1][j] %= MOD;
ll nj = min(k + 1, j + v[i] + 2);
dp[i + 1][nj] -= dp[i][j];
// dp[i + 1][nj] += MOD;
// dp[i + 1][nj] %= MOD;
}
for (int j = 1; j < k + 1; j++) { // 累積和
dp[i + 1][j] += dp[i + 1][j - 1];
// dp[i + 1][j] %= MOD;
}
}
fin(dp[n - 1][k]);
}
| #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 <unordered_set>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int, int> mii;
typedef set<int> si;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define arep(i, v) for (auto i : v)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STLL(s) strtoll(s.c_str(), NULL, 10)
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define fi first
#define se second
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
template <class T> inline void dump(T &v) {
irep(i, v) { cout << (*i) << ((i == --v.end()) ? '\n' : ' '); }
}
inline string getline() {
string s;
getline(cin, s);
return s;
}
inline void yn(const bool b) { b ? fin("yes") : fin("no"); }
inline void Yn(const bool b) { b ? fin("Yes") : fin("No"); }
inline void YN(const bool b) { b ? fin("YES") : fin("NO"); }
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
constexpr ll LLINF = 1LL << 60;
constexpr ll MOD = 1000000007;
constexpr ld EPS = 1e-11;
/* -------------------- ここまでテンプレ -------------------- */
struct mint {
ll x;
mint(ll _x = 0) : x((_x % MOD + MOD) % MOD) {}
/* 初期化子 */
mint operator+() const { return mint(x); }
mint operator-() const { return mint(-x); }
/* 代入演算子 */
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint &operator/=(const mint a) {
x *= modinv(a).x;
x %= MOD;
return (*this);
}
mint &operator%=(const mint a) {
x %= a.x;
return (*this);
}
mint &operator++() {
++x;
if (x >= MOD)
x -= MOD;
return *this;
}
mint &operator--() {
if (!x)
x += MOD;
--x;
return *this;
}
mint &operator&=(const mint a) {
x &= a.x;
return (*this);
}
mint &operator|=(const mint a) {
x |= a.x;
return (*this);
}
mint &operator^=(const mint a) {
x ^= a.x;
return (*this);
}
mint &operator<<=(const mint a) {
x *= pow(2, a).x;
return (*this);
}
mint &operator>>=(const mint a) {
x /= pow(2, a).x;
return (*this);
}
/* 算術演算子 */
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
mint operator%(const mint a) const {
mint res(*this);
return res %= a;
}
mint operator&(const mint a) const {
mint res(*this);
return res &= a;
}
mint operator|(const mint a) const {
mint res(*this);
return res |= a;
}
mint operator^(const mint a) const {
mint res(*this);
return res ^= a;
}
mint operator<<(const mint a) const {
mint res(*this);
return res <<= a;
}
mint operator>>(const mint a) const {
mint res(*this);
return res >>= a;
}
/* 条件演算子 */
bool operator==(const mint a) const noexcept { return x == a.x; }
bool operator!=(const mint a) const noexcept { return x != a.x; }
bool operator<(const mint a) const noexcept { return x < a.x; }
bool operator>(const mint a) const noexcept { return x > a.x; }
bool operator<=(const mint a) const noexcept { return x <= a.x; }
bool operator>=(const mint a) const noexcept { return x >= a.x; }
/* ストリーム挿入演算子 */
friend istream &operator>>(istream &is, mint &m) {
is >> m.x;
m.x = (m.x % MOD + MOD) % MOD;
return is;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
/* その他の関数 */
mint modinv(mint a) { return pow(a, MOD - 2); }
mint pow(mint x, mint n) {
mint res = 1;
while (n.x > 0) {
if ((n % 2).x)
res *= x;
x *= x;
n.x /= 2;
}
return res;
}
};
int main() {
ll n, k;
cin >> n >> k;
vector<vector<mint>> dp(n, vector<mint>(k + 2, 0));
vll v(n);
rep(i, n) { cin >> v[i]; }
rep(i, min(k + 1, v[0] + 1)) { ++dp[0][i]; }
for (int i = 0; i < n - 1; i++) {
rep(j, k + 1) {
if (dp[i][j].x == 0)
continue;
dp[i + 1][j] += dp[i][j];
// dp[i + 1][j] %= MOD;
ll nj = min(k + 1, j + v[i + 1] + 1);
dp[i + 1][nj] -= dp[i][j];
// dp[i + 1][nj] += MOD;
// dp[i + 1][nj] %= MOD;
}
for (int j = 1; j < k + 1; j++) { // 累積和
dp[i + 1][j] += dp[i + 1][j - 1];
// dp[i + 1][j] %= MOD;
}
}
// rep(i, n) dump(dp[i]);
fin(dp[n - 1][k]);
}
| [
"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, \
tree_order_statistics_node_update>
#define standardVar ll n, m, i, j, k, num, num1, num2, flag = 0
#define nn << "\n"
#define __ << " " <<
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ittr(x, v) \
for (auto x = v.begin(); x != v.end(); x++) // COMMON FOR LOOP (ITERATOR)
#define itr(x, n) for (x = 0; x < n; x++) // COMMON FOR LOOP (VARIABLE)
#define itrab(x, a, b) \
for (x = a; x < b; x++) // FOR LOOP WITH SPECIFIED START/END
#define itpr(v) \
ittr(x, v) cout << *x << " "; \
cout nn // PRINTS VECTOR,SET,MAP OF INTS
#define itppr(v) \
ittr(x, v) cout << (*x).ff << " " << (*x).ss << " "; \
cout nn // PRINTS VECTOR,SET,MAP OF PAIRS
#define sz(x) (ll)((x).size())
#define dTor(x) ((x)*pi) / 180.0
#define pi 3.14159265359
#define INF 1000000000
#define INFF 1000000000000000000
typedef long long int ll; // TYPEDEFS
typedef long double ld;
typedef vector<ll> vl;
typedef map<ll, ll> ml;
typedef set<ll> sl;
typedef string str;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef map<pl, ll> mpl;
typedef set<pl> spl;
typedef vector<str> vst;
typedef vector<vl> vvl;
const ll M = 1000000007; // COMMON MODULO PRIMES
const ll N = 998244353;
ll power(ll x, ll y, ll p) { // MODULAR EXPONENTIATION
ll res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll inv(ll x, ll m) { // FERMAT INVERSE
return power(x, m - 2, m);
}
ll nCr(ll n, ll r) { // nCr MOD P
if (r == 0)
return 1;
vl fac(n);
return (fac[n] * inv(fac[r], M) % M * inv(fac[n - r], M) % M) % M;
}
struct comp { // COMPARISON ON PAIRS
template <typename T> bool operator()(const T &a, const T &b) {
if (a.ff == b.ff)
return (a.ss < b.ss);
else
return (a.ff < b.ff);
}
};
bool mod(const pair<ll, ll> &a,
const pair<ll, ll> &b) { // COMPARATOR FOR PAIRS (SORTING)
if (a.ff != b.ff)
return (a.ff > b.ff);
else
return (a.ss > b.ss);
}
void sieve() { // SIEVE OF ERATOSTHENES
vector<bool> pr(1000000 + 1, 1);
for (ll i = 2; i * i <= 1000000; i++)
if (pr[i] == 1)
for (ll j = i * i; j <= 1000000; j += i)
pr[j] = 0;
}
bool isValid(ll i, ll j, ll n, ll m) { // CHECKS FOR OVERFLOW
if (i >= 0 && i < n && j >= 0 && j < m) {
return true;
}
return false;
}
// MAIN FUNCTION STARTS HERE
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
standardVar;
cin >> n >> k;
vl v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
}
vl dp(k + 1);
dp[0] = 1;
for (int i = 0; i < n; i++) {
vl fake(k + 1);
for (int j = k; j >= 0; j--) {
ll tmp = dp[j];
ll L = j + 1;
ll R = j + min(k - j, v[i]);
if (L <= R) {
fake[L] = (fake[L] + tmp) % M;
if (R + 1 <= k) {
fake[R + 1] = (fake[R + 1] - tmp) % M;
}
}
}
ll sum = 0;
for (j = 1; j <= k; j++) {
sum = (sum + fake[j]) % M;
dp[j] = (dp[j] + sum) % M;
}
}
cout << dp[k] nn;
return 0;
} | #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, \
tree_order_statistics_node_update>
#define standardVar ll n, m, i, j, k, num, num1, num2, flag = 0
#define nn << "\n"
#define __ << " " <<
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ittr(x, v) \
for (auto x = v.begin(); x != v.end(); x++) // COMMON FOR LOOP (ITERATOR)
#define itr(x, n) for (x = 0; x < n; x++) // COMMON FOR LOOP (VARIABLE)
#define itrab(x, a, b) \
for (x = a; x < b; x++) // FOR LOOP WITH SPECIFIED START/END
#define itpr(v) \
ittr(x, v) cout << *x << " "; \
cout nn // PRINTS VECTOR,SET,MAP OF INTS
#define itppr(v) \
ittr(x, v) cout << (*x).ff << " " << (*x).ss << " "; \
cout nn // PRINTS VECTOR,SET,MAP OF PAIRS
#define sz(x) (ll)((x).size())
#define dTor(x) ((x)*pi) / 180.0
#define pi 3.14159265359
#define INF 1000000000
#define INFF 1000000000000000000
typedef long long int ll; // TYPEDEFS
typedef long double ld;
typedef vector<ll> vl;
typedef map<ll, ll> ml;
typedef set<ll> sl;
typedef string str;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef map<pl, ll> mpl;
typedef set<pl> spl;
typedef vector<str> vst;
typedef vector<vl> vvl;
const ll M = 1000000007; // COMMON MODULO PRIMES
const ll N = 998244353;
ll power(ll x, ll y, ll p) { // MODULAR EXPONENTIATION
ll res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll inv(ll x, ll m) { // FERMAT INVERSE
return power(x, m - 2, m);
}
ll nCr(ll n, ll r) { // nCr MOD P
if (r == 0)
return 1;
vl fac(n);
return (fac[n] * inv(fac[r], M) % M * inv(fac[n - r], M) % M) % M;
}
struct comp { // COMPARISON ON PAIRS
template <typename T> bool operator()(const T &a, const T &b) {
if (a.ff == b.ff)
return (a.ss < b.ss);
else
return (a.ff < b.ff);
}
};
bool mod(const pair<ll, ll> &a,
const pair<ll, ll> &b) { // COMPARATOR FOR PAIRS (SORTING)
if (a.ff != b.ff)
return (a.ff > b.ff);
else
return (a.ss > b.ss);
}
void sieve() { // SIEVE OF ERATOSTHENES
vector<bool> pr(1000000 + 1, 1);
for (ll i = 2; i * i <= 1000000; i++)
if (pr[i] == 1)
for (ll j = i * i; j <= 1000000; j += i)
pr[j] = 0;
}
bool isValid(ll i, ll j, ll n, ll m) { // CHECKS FOR OVERFLOW
if (i >= 0 && i < n && j >= 0 && j < m) {
return true;
}
return false;
}
// MAIN FUNCTION STARTS HERE
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
standardVar;
cin >> n >> k;
vl v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
}
vl dp(k + 1);
dp[0] = 1;
for (int i = 0; i < n; i++) {
vl fake(k + 1);
for (int j = k; j >= 0; j--) {
ll tmp = dp[j];
ll L = j + 1;
ll R = j + min(k - j, v[i]);
if (L <= R) {
fake[L] = (fake[L] + tmp) % M;
if (R + 1 <= k) {
fake[R + 1] = (fake[R + 1] - tmp + M) % M;
}
}
}
ll sum = 0;
for (j = 1; j <= k; j++) {
sum = (sum + fake[j]) % M;
dp[j] = (dp[j] + sum) % M;
}
}
cout << dp[k] nn;
return 0;
} | [
"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, \
tree_order_statistics_node_update>
#define standardVar ll n, m, i, j, k, num, num1, num2, flag = 0
#define nn << "\n"
#define __ << " " <<
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ittr(x, v) \
for (auto x = v.begin(); x != v.end(); x++) // COMMON FOR LOOP (ITERATOR)
#define itr(x, n) for (x = 0; x < n; x++) // COMMON FOR LOOP (VARIABLE)
#define itrab(x, a, b) \
for (x = a; x < b; x++) // FOR LOOP WITH SPECIFIED START/END
#define itpr(v) \
ittr(x, v) cout << *x << " "; \
cout nn // PRINTS VECTOR,SET,MAP OF INTS
#define itppr(v) \
ittr(x, v) cout << (*x).ff << " " << (*x).ss << " "; \
cout nn // PRINTS VECTOR,SET,MAP OF PAIRS
#define sz(x) (ll)((x).size())
#define dTor(x) ((x)*pi) / 180.0
#define pi 3.14159265359
#define INF 1000000000
#define INFF 1000000000000000000
typedef long long int ll; // TYPEDEFS
typedef long double ld;
typedef vector<ll> vl;
typedef map<ll, ll> ml;
typedef set<ll> sl;
typedef string str;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef map<pl, ll> mpl;
typedef set<pl> spl;
typedef vector<str> vst;
typedef vector<vl> vvl;
const ll M = 1000000007; // COMMON MODULO PRIMES
const ll N = 998244353;
ll power(ll x, ll y, ll p) { // MODULAR EXPONENTIATION
ll res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll inv(ll x, ll m) { // FERMAT INVERSE
return power(x, m - 2, m);
}
ll nCr(ll n, ll r) { // nCr MOD P
if (r == 0)
return 1;
vl fac(n);
return (fac[n] * inv(fac[r], M) % M * inv(fac[n - r], M) % M) % M;
}
struct comp { // COMPARISON ON PAIRS
template <typename T> bool operator()(const T &a, const T &b) {
if (a.ff == b.ff)
return (a.ss < b.ss);
else
return (a.ff < b.ff);
}
};
bool mod(const pair<ll, ll> &a,
const pair<ll, ll> &b) { // COMPARATOR FOR PAIRS (SORTING)
if (a.ff != b.ff)
return (a.ff > b.ff);
else
return (a.ss > b.ss);
}
void sieve() { // SIEVE OF ERATOSTHENES
vector<bool> pr(1000000 + 1, 1);
for (ll i = 2; i * i <= 1000000; i++)
if (pr[i] == 1)
for (ll j = i * i; j <= 1000000; j += i)
pr[j] = 0;
}
bool isValid(ll i, ll j, ll n, ll m) { // CHECKS FOR OVERFLOW
if (i >= 0 && i < n && j >= 0 && j < m) {
return true;
}
return false;
}
// MAIN FUNCTION STARTS HERE
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
standardVar;
cin >> n >> k;
vl v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
}
vl dp(k + 1);
dp[0] = 1;
for (int i = 0; i < n; i++) {
vl fake(k + 1);
for (int j = k; j >= 0; j--) {
ll tmp = dp[j];
ll L = j + 1;
ll R = j + min(k - j, v[i]);
if (L <= R) {
fake[L] = (fake[L] + tmp) % M;
if (R + 1 <= k) {
fake[R + 1] = (fake[R + 1] - tmp) % M;
}
}
}
ll sum = 0;
for (j = 0; j <= k; j++) {
sum = (sum + fake[j]) % M;
dp[j] = (dp[j] + sum) % M;
}
}
cout << dp[k] nn;
return 0;
} | #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, \
tree_order_statistics_node_update>
#define standardVar ll n, m, i, j, k, num, num1, num2, flag = 0
#define nn << "\n"
#define __ << " " <<
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ittr(x, v) \
for (auto x = v.begin(); x != v.end(); x++) // COMMON FOR LOOP (ITERATOR)
#define itr(x, n) for (x = 0; x < n; x++) // COMMON FOR LOOP (VARIABLE)
#define itrab(x, a, b) \
for (x = a; x < b; x++) // FOR LOOP WITH SPECIFIED START/END
#define itpr(v) \
ittr(x, v) cout << *x << " "; \
cout nn // PRINTS VECTOR,SET,MAP OF INTS
#define itppr(v) \
ittr(x, v) cout << (*x).ff << " " << (*x).ss << " "; \
cout nn // PRINTS VECTOR,SET,MAP OF PAIRS
#define sz(x) (ll)((x).size())
#define dTor(x) ((x)*pi) / 180.0
#define pi 3.14159265359
#define INF 1000000000
#define INFF 1000000000000000000
typedef long long int ll; // TYPEDEFS
typedef long double ld;
typedef vector<ll> vl;
typedef map<ll, ll> ml;
typedef set<ll> sl;
typedef string str;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef map<pl, ll> mpl;
typedef set<pl> spl;
typedef vector<str> vst;
typedef vector<vl> vvl;
const ll M = 1000000007; // COMMON MODULO PRIMES
const ll N = 998244353;
ll power(ll x, ll y, ll p) { // MODULAR EXPONENTIATION
ll res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll inv(ll x, ll m) { // FERMAT INVERSE
return power(x, m - 2, m);
}
ll nCr(ll n, ll r) { // nCr MOD P
if (r == 0)
return 1;
vl fac(n);
return (fac[n] * inv(fac[r], M) % M * inv(fac[n - r], M) % M) % M;
}
struct comp { // COMPARISON ON PAIRS
template <typename T> bool operator()(const T &a, const T &b) {
if (a.ff == b.ff)
return (a.ss < b.ss);
else
return (a.ff < b.ff);
}
};
bool mod(const pair<ll, ll> &a,
const pair<ll, ll> &b) { // COMPARATOR FOR PAIRS (SORTING)
if (a.ff != b.ff)
return (a.ff > b.ff);
else
return (a.ss > b.ss);
}
void sieve() { // SIEVE OF ERATOSTHENES
vector<bool> pr(1000000 + 1, 1);
for (ll i = 2; i * i <= 1000000; i++)
if (pr[i] == 1)
for (ll j = i * i; j <= 1000000; j += i)
pr[j] = 0;
}
bool isValid(ll i, ll j, ll n, ll m) { // CHECKS FOR OVERFLOW
if (i >= 0 && i < n && j >= 0 && j < m) {
return true;
}
return false;
}
// MAIN FUNCTION STARTS HERE
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
standardVar;
cin >> n >> k;
vl v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
}
vl dp(k + 1);
dp[0] = 1;
for (int i = 0; i < n; i++) {
vl fake(k + 1);
for (int j = k; j >= 0; j--) {
ll tmp = dp[j];
ll L = j + 1;
ll R = j + min(k - j, v[i]);
if (L <= R) {
fake[L] = (fake[L] + tmp) % M;
if (R + 1 <= k) {
fake[R + 1] = (fake[R + 1] - tmp + M) % M;
}
}
}
ll sum = 0;
for (j = 1; j <= k; j++) {
sum = (sum + fake[j]) % M;
dp[j] = (dp[j] + sum) % M;
}
}
cout << dp[k] nn;
return 0;
} | [
"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; i++) {
cin >> arr[i];
}
int dp[k + 1];
int ndp[k + 1];
memset(dp, 0, sizeof(dp));
dp[0] = 1;
for (int i = 0; i < n; i++) {
ndp[0] = dp[0];
for (int i = 1; i <= k; i++) {
ndp[i] = dp[i] - dp[i - 1];
}
for (int j = 0; j < k; j++) {
int ll = j + 1;
int rr = min(k, j + arr[i]);
ndp[ll] += dp[j];
if (rr + 1 <= k)
ndp[rr + 1] -= dp[j];
}
dp[0] = ndp[0];
for (int i = 1; i <= k; i++) {
dp[i] = (dp[i - 1] + ndp[i]) % MOD;
}
}
cout << dp[k];
return 0;
} | #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; i++) {
cin >> arr[i];
}
int dp[k + 1];
int ndp[k + 1];
memset(dp, 0, sizeof(dp));
dp[0] = 1;
for (int i = 0; i < n; i++) {
ndp[0] = dp[0];
for (int i = 1; i <= k; i++) {
ndp[i] = dp[i] - dp[i - 1];
}
for (int j = 0; j < k; j++) {
int ll = j + 1;
int rr = min(k, j + arr[i]);
ndp[ll] += dp[j];
if (rr + 1 <= k)
ndp[rr + 1] -= dp[j];
}
dp[0] = ndp[0];
for (int i = 1; i <= k; i++) {
dp[i] = (dp[i - 1] + ndp[i] + MOD) % MOD;
}
}
cout << dp[k];
return 0;
} | [
"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 long
int bs_upper_bound(int a[], int n, int x) {
int l = 0;
int h = n; // Not n - 1
while (l < h) {
int mid = l + (h - l) / 2;
if (x >= a[mid]) {
l = mid + 1;
} else {
h = mid;
}
}
return l;
}
int bs_lower_bound(int a[], int n, int x) {
int l = 0;
int h = n; // Not n - 1
while (l < h) {
int mid = l + (h - l) / 2;
if (x <= a[mid]) {
h = mid;
} else {
l = mid + 1;
}
}
return l;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
ll n, k;
vector<ll> a;
ll mod = 1e9 + 7;
int main() {
IOS;
cin >> n >> k;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.push_back(x);
}
ll dp[k + 2];
for (int i = 0; i <= k; i++)
dp[i] = 0;
dp[0] = 1;
ll t[k + 2];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= k + 1; j++)
t[j] = 0;
for (int j = k; j >= 0; j--) {
int l = j + 1;
int r = min(j + a[i], k);
if (l <= r) {
t[l] = (t[l] + dp[j]) % mod;
t[r + 1] = (t[r + 1] - dp[j]) % mod;
}
}
ll p = 0;
for (int j = 0; j <= k; j++) {
p = (p + t[j]) % mod;
dp[j] = (dp[j] + p) % mod;
}
}
cout << dp[k];
}
| #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
int bs_upper_bound(int a[], int n, int x) {
int l = 0;
int h = n; // Not n - 1
while (l < h) {
int mid = l + (h - l) / 2;
if (x >= a[mid]) {
l = mid + 1;
} else {
h = mid;
}
}
return l;
}
int bs_lower_bound(int a[], int n, int x) {
int l = 0;
int h = n; // Not n - 1
while (l < h) {
int mid = l + (h - l) / 2;
if (x <= a[mid]) {
h = mid;
} else {
l = mid + 1;
}
}
return l;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
ll n, k;
vector<ll> a;
ll mod = 1e9 + 7;
int main() {
IOS;
cin >> n >> k;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.push_back(x);
}
ll dp[k + 2];
for (int i = 0; i <= k; i++)
dp[i] = 0;
dp[0] = 1;
ll t[k + 2];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= k + 1; j++)
t[j] = 0;
for (int j = k; j >= 0; j--) {
int l = j + 1;
int r = min(j + a[i], k);
if (l <= r) {
t[l] = (t[l] + dp[j]) % mod;
t[r + 1] = (t[r + 1] - dp[j] + mod) % mod;
}
}
ll p = 0;
for (int j = 0; j <= k; j++) {
p = (p + t[j]) % mod;
dp[j] = (dp[j] + p) % mod;
}
}
cout << dp[k];
}
| [
"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_pair
#define pi pair<int, int>
#define all(a) a.begin(), a.end()
#define sz(a) a.size()
#define sl(a) a.length()
#define rev(a) sort(all(a), greater<int>())
#define ff first
#define ss second
#define minel(a) *min_element(all(a))
#define maxel(a) *max_element(all(a))
#define Mod 1000000007
#define deb(x) cout << x << endl;
#define o(x) \
for (auto a : x) \
cout << a << " "; \
cout << endl;
#define o2(x, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) \
cout << x[i][j] << " "; \
cout << endl; \
}
#define i(x, n) \
for (int i = 0; i < n; i++) \
cin >> x[i];
#define i2(x, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) \
cin >> x[i][j]; \
}
int inf = 1e18;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vi a(n + 1);
for (int i = 1; i < n + 1; i++)
cin >> a[i];
int dp[n + 1][k + 1];
for (int j = 0; j < k + 1; j++)
dp[0][j] = 0;
for (int i = 0; i < n + 1; i++)
dp[i][0] = 1;
vi pref(k + 1, 1);
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < k + 1; j++) {
int x = max(j - a[i], (long long)0);
if (x == 0) {
dp[i][j] = pref[j];
} else {
(dp[i][j] = pref[j] - pref[x - 1] + Mod) % Mod;
}
}
pref.clear();
pref.resize(k + 1, 0);
pref[0] = dp[i][0];
for (int j = 1; j < k + 1; j++) {
pref[j] = (pref[j - 1] + dp[i][j]) % Mod;
}
}
// o2(dp,n+1,k+1);
deb(dp[n][k]);
}
| #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_pair
#define pi pair<int, int>
#define all(a) a.begin(), a.end()
#define sz(a) a.size()
#define sl(a) a.length()
#define rev(a) sort(all(a), greater<int>())
#define ff first
#define ss second
#define minel(a) *min_element(all(a))
#define maxel(a) *max_element(all(a))
#define Mod 1000000007
#define deb(x) cout << x << endl;
#define o(x) \
for (auto a : x) \
cout << a << " "; \
cout << endl;
#define o2(x, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) \
cout << x[i][j] << " "; \
cout << endl; \
}
#define i(x, n) \
for (int i = 0; i < n; i++) \
cin >> x[i];
#define i2(x, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) \
cin >> x[i][j]; \
}
int inf = 1e18;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vi a(n + 1);
for (int i = 1; i < n + 1; i++)
cin >> a[i];
int dp[n + 1][k + 1];
for (int j = 0; j < k + 1; j++)
dp[0][j] = 0;
for (int i = 0; i < n + 1; i++)
dp[i][0] = 1;
vi pref(k + 1, 1);
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < k + 1; j++) {
int x = max(j - a[i], (long long)0);
if (x == 0) {
dp[i][j] = pref[j];
} else {
dp[i][j] = (pref[j] - pref[x - 1] + Mod) % Mod;
}
}
pref.clear();
pref.resize(k + 1, 0);
pref[0] = dp[i][0];
for (int j = 1; j < k + 1; j++) {
pref[j] = (pref[j - 1] + dp[i][j]) % Mod;
}
}
// o2(dp,n+1,k+1);
deb(dp[n][k]);
}
| [] | 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, 0, sizeof(dp));
dp[0][0] = 1;
for (ll i = 1; i <= N; ++i) {
ll pre[K + 1];
// cout<<"For i: "<<i<<endl;
for (ll k = 0; k <= K; ++k) {
pre[k] = (((k > 0) ? pre[k - 1] : 0) + dp[i - 1][k]) % MOD;
// cout<<k<<" "<<pre[k]<<endl;
}
for (ll k = 0; k <= K; ++k)
dp[i][k] =
(pre[k] - ((k > arr[i - 1]) ? pre[k - arr[i - 1] - 1] : 0)) % MOD;
}
// cout<<dp[1][1]<<endl;
cout << dp[N][K] << endl;
} | // 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, 0, sizeof(dp));
dp[0][0] = 1;
for (ll i = 1; i <= N; ++i) {
ll pre[K + 1];
// cout<<"For i: "<<i<<endl;
for (ll k = 0; k <= K; ++k) {
pre[k] = (((k > 0) ? pre[k - 1] : 0) + dp[i - 1][k]) % MOD;
// cout<<k<<" "<<pre[k]<<endl;
}
for (ll k = 0; k <= K; ++k)
dp[i][k] =
(pre[k] - ((k > arr[i - 1]) ? pre[k - arr[i - 1] - 1] : 0) + MOD) %
MOD;
}
// cout<<dp[1][1]<<endl;
cout << dp[N][K] << endl;
} | [
"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; j <= k; j++) {
dp[0][j] = 0;
}
for (ll i = 2; i <= n; i++) {
for (ll j = 0; j <= k; j++) {
if (j == 0) {
dp[i][j] = dp[i - 1][j];
} else if (j - 1 - capacity[i] >= 0) {
dp[i][j] =
(dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - 1 - capacity[i]]) %
MOD;
} else {
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % MOD;
}
}
}
return dp[n][k];
}
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
vector<ll> capacity(n + 1);
for (ll i = 1; i <= n; i++) {
ll d;
cin >> d;
capacity[i] = d;
}
cout << num_of_ways(capacity, n, k);
return 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; j <= k; j++) {
dp[0][j] = 0;
}
for (ll i = 2; i <= n; i++) {
for (ll j = 0; j <= k; j++) {
if (j == 0) {
dp[i][j] = dp[i - 1][j];
} else if (j - 1 - capacity[i] >= 0) {
// MOD plus isiliye kiya kyunki agar result negative aaya to MOD kaise
// hoga
dp[i][j] = (MOD + dp[i][j - 1] + dp[i - 1][j] -
dp[i - 1][j - 1 - capacity[i]]) %
MOD;
} else {
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % MOD;
}
}
}
return dp[n][k];
}
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
vector<ll> capacity(n + 1);
for (ll i = 1; i <= n; i++) {
ll d;
cin >> d;
capacity[i] = d;
}
cout << num_of_ways(capacity, n, k);
return 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]) %= MOD;
(pre[a + min(w, k - a) + 1] -= dp[a]) %= MOD;
}
for (int j = 0; j <= k; j++) {
if (j)
(pre[j] += pre[j - 1]) %= MOD;
(dp[j] += pre[j]) %= MOD;
}
}
printf("%lld\n", dp[k]);
} | #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]) %= MOD;
(pre[a + min(w, k - a) + 1] -= dp[a] - MOD) %= MOD;
}
for (int j = 0; j <= k; j++) {
if (j)
(pre[j] += pre[j - 1]) %= MOD;
(dp[j] += pre[j]) %= MOD;
}
}
printf("%lld\n", dp[k]);
} | [
"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_back
#define mp make_pair
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
const ll MAX = 100009, MOD = 1000000007, BASE = 311, inf = 1e9;
int du[] = {1, -1, 0, 0}, dv[] = {0, 0, -1, 1};
using namespace std;
ll n, k, a[109], f[109][MAX];
int main() {
// freopen("SUBXOR.inp", "r", stdin);
// freopen("SUBXOR.out", "w", stdout);
cin >> n >> k;
FORUP(i, 1, n) cin >> a[i];
f[0][0] = 1;
FORUP(i, 1, n) {
vector<ll> sum(k + 9, 0);
sum[0] = f[i - 1][0];
FORUP(j, 1, k) sum[j] = (sum[j - 1] + f[i - 1][j]) % MOD;
FORUP(j, 0, k) {
ll pos = j - a[i] - 1;
if (pos > 0)
f[i][j] = (sum[j] - sum[pos]) % MOD;
else
f[i][j] = sum[j] % MOD;
}
}
cout << f[n][k] << endl;
return 0;
}
| #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_back
#define mp make_pair
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
const ll MAX = 100009, MOD = 1000000007, BASE = 311, inf = 1e9;
int du[] = {1, -1, 0, 0}, dv[] = {0, 0, -1, 1};
using namespace std;
ll n, k, a[109], f[109][MAX];
int main() {
// freopen("SUBXOR.inp", "r", stdin);
// freopen("SUBXOR.out", "w", stdout);
cin >> n >> k;
FORUP(i, 1, n) cin >> a[i];
f[0][0] = 1;
FORUP(i, 1, n) {
vector<ll> sum(k + 9, 0);
sum[0] = f[i - 1][0];
FORUP(j, 1, k) sum[j] = (sum[j - 1] + f[i - 1][j]) % MOD;
FORUP(j, 0, k) {
ll pos = j - a[i] - 1;
if (pos >= 0)
f[i][j] = (sum[j] - sum[pos] + MOD * MOD) % MOD;
else
f[i][j] = sum[j] % MOD;
}
}
cout << f[n][k] << endl;
return 0;
}
| [
"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_back
#define mp make_pair
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
const ll MAX = 100009, MOD = 1000000007, BASE = 311, inf = 1e9;
int du[] = {1, -1, 0, 0}, dv[] = {0, 0, -1, 1};
using namespace std;
ll n, k, a[109], f[109][MAX];
int main() {
// freopen("SUBXOR.inp", "r", stdin);
// freopen("SUBXOR.out", "w", stdout);
cin >> n >> k;
FORUP(i, 1, n) cin >> a[i];
f[0][0] = 1;
FORUP(i, 1, n) {
vector<ll> sum(k + 9, 0);
sum[0] = f[i - 1][0];
FORUP(j, 1, k) sum[j] = (sum[j - 1] + f[i - 1][j]) % MOD;
FORUP(j, 0, k) {
ll pos = j - a[i] - 1;
if (pos >= 0)
f[i][j] = (sum[j] - sum[pos]) % MOD;
else
f[i][j] = sum[j] % MOD;
}
}
cout << f[n][k] << endl;
return 0;
}
| #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_back
#define mp make_pair
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
const ll MAX = 100009, MOD = 1000000007, BASE = 311, inf = 1e9;
int du[] = {1, -1, 0, 0}, dv[] = {0, 0, -1, 1};
using namespace std;
ll n, k, a[109], f[109][MAX];
int main() {
// freopen("SUBXOR.inp", "r", stdin);
// freopen("SUBXOR.out", "w", stdout);
cin >> n >> k;
FORUP(i, 1, n) cin >> a[i];
f[0][0] = 1;
FORUP(i, 1, n) {
vector<ll> sum(k + 9, 0);
sum[0] = f[i - 1][0];
FORUP(j, 1, k) sum[j] = (sum[j - 1] + f[i - 1][j]) % MOD;
FORUP(j, 0, k) {
ll pos = j - a[i] - 1;
if (pos >= 0)
f[i][j] = (sum[j] - sum[pos] + MOD * MOD) % MOD;
else
f[i][j] = sum[j] % MOD;
}
}
cout << f[n][k] << endl;
return 0;
}
| [
"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); \
cout.tie(0);
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define mod(n) (n) % 1000000007
#define sp << " "
#define precision(n) cout << fixed << setprecision(n);
#define startTime \
time_t start, end; \
time(&start);
#define endTime \
time(&end); \
double tt = double(end - start); \
cout << "Time taken : " << fixed << tt << setprecision(5); \
cout << " sec" << endl;
using namespace std;
int main() {
IOS;
ll n, k;
cin >> n >> k;
vll a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n][k + 1];
ll cum[n][k + 1];
memset(dp, 0, sizeof dp);
memset(cum, 0, sizeof cum);
for (int i = 0; i < n; i++) {
for (int j = 0; j < k + 1; j++) {
if (i == 0) {
dp[i][j] = (a[i] >= j) ? 1 : 0;
} else {
if (j - (a[i] + 1) < 0)
dp[i][j] = mod(cum[i - 1][j]);
else
dp[i][j] = mod(mod(cum[i - 1][j]) - mod(cum[i - 1][j - (a[i] + 1)]));
}
if (j > 0)
cum[i][j] = mod(mod(dp[i][j]) + mod(cum[i][j - 1]));
else
cum[i][j] = mod(dp[i][j]);
}
}
cout << dp[n - 1][k] << endl;
} | #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); \
cout.tie(0);
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define mod(n) (n) % 1000000007
#define sp << " "
#define precision(n) cout << fixed << setprecision(n);
#define startTime \
time_t start, end; \
time(&start);
#define endTime \
time(&end); \
double tt = double(end - start); \
cout << "Time taken : " << fixed << tt << setprecision(5); \
cout << " sec" << endl;
using namespace std;
int main() {
IOS;
ll n, k;
cin >> n >> k;
vll a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n][k + 1];
ll cum[n][k + 1];
memset(dp, 0, sizeof dp);
memset(cum, 0, sizeof cum);
for (int i = 0; i < n; i++) {
for (int j = 0; j < k + 1; j++) {
if (i == 0) {
dp[i][j] = (a[i] >= j) ? 1 : 0;
} else {
if (j - (a[i] + 1) < 0)
dp[i][j] = mod(cum[i - 1][j]);
else
dp[i][j] = mod(1000000007 + mod(cum[i - 1][j]) -
mod(cum[i - 1][j - (a[i] + 1)]));
}
if (j > 0)
cum[i][j] = mod(mod(dp[i][j]) + mod(cum[i][j - 1]));
else
cum[i][j] = mod(dp[i][j]);
}
}
cout << dp[n - 1][k] << endl;
} | [
"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 (int i = 0; i <= min(k, v[0]); i++)
dp[i] = 1;
for (int i = 1; i < n; i++) {
vector<ll> pre = dp;
for (int j = 1; j <= k; j++) {
pre[j] += pre[j - 1];
pre[j] %= mod;
}
for (int j = 1; j <= k; j++) {
int lo = max(0, j - v[i]), hi = j;
ll tmp = 0;
if (lo > 0)
tmp = pre[lo - 1];
// cout<<pre[hi]<<endl;
dp[j] = (pre[hi] - tmp) % mod;
// cout<<dp[j]<<endl;
}
}
cout << dp[k] << endl;
return 0;
} | #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 (int i = 0; i <= min(k, v[0]); i++)
dp[i] = 1;
for (int i = 1; i < n; i++) {
vector<ll> pre = dp;
for (int j = 1; j <= k; j++) {
pre[j] += pre[j - 1];
pre[j] %= mod;
}
for (int j = 1; j <= k; j++) {
int lo = max(0, j - v[i]), hi = j;
ll tmp = 0;
if (lo > 0)
tmp = pre[lo - 1];
// cout<<pre[hi]<<endl;
dp[j] = (pre[hi] - tmp + mod) % mod;
// cout<<dp[j]<<endl;
}
}
cout << dp[k] << endl;
return 0;
} | [
"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() {
// ******* START HERE ******
int n, k;
cin >> n >> k;
a.clear();
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.pb(x);
}
dp[0][0] = 1;
for (int i = 1; i <= k; i++)
dp[0][i] = 0;
for (int i = 1; i <= n; i++) {
vector<ll> sum(k + 1);
sum[0] = dp[i - 1][0];
for (int j = 1; j <= k; j++)
sum[j] = (sum[j - 1] + dp[i - 1][j]) % mod;
for (int j = 0; j <= k; j++) {
if (j <= a[i - 1])
dp[i][j] = sum[j];
else {
dp[i][j] = (sum[j] - sum[j - a[i - 1]] - 1) % mod;
}
}
sum.clear();
}
cout << dp[n][k] << endl;
// ***** END HERE *****
return 0;
} | #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() {
// ******* START HERE ******
int n, k;
cin >> n >> k;
a.clear();
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.pb(x);
}
dp[0][0] = 1;
for (int i = 1; i <= k; i++)
dp[0][i] = 0;
for (int i = 1; i <= n; i++) {
vector<ll> sum(k + 1);
sum[0] = dp[i - 1][0];
for (int j = 1; j <= k; j++)
sum[j] = (sum[j - 1] + dp[i - 1][j]) % mod;
for (int j = 0; j <= k; j++) {
if (j <= a[i - 1])
dp[i][j] = sum[j];
else {
dp[i][j] = (sum[j] - sum[j - a[i - 1] - 1] + mod) % mod;
}
}
sum.clear();
}
cout << dp[n][k] << endl;
// ***** END HERE *****
return 0;
} | [
"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() {
// ******* START HERE ******
int n, k;
cin >> n >> k;
a.clear();
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.pb(x);
}
dp[0][0] = 1;
for (int i = 1; i <= k; i++)
dp[0][i] = 0;
for (int i = 1; i <= n; i++) {
vector<ll> sum(k + 1);
sum[0] = dp[i - 1][0];
for (int j = 1; j <= k; j++)
sum[j] = (sum[j - 1] + dp[i - 1][j]) % mod;
for (int j = 0; j <= k; j++) {
if (j <= a[i - 1])
dp[i][j] = sum[j];
else {
dp[i][j] = (sum[j] - sum[j - a[i - 1] - 1]) % mod;
}
}
sum.clear();
}
cout << dp[n][k] << endl;
// ***** END HERE *****
return 0;
} | #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() {
// ******* START HERE ******
int n, k;
cin >> n >> k;
a.clear();
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.pb(x);
}
dp[0][0] = 1;
for (int i = 1; i <= k; i++)
dp[0][i] = 0;
for (int i = 1; i <= n; i++) {
vector<ll> sum(k + 1);
sum[0] = dp[i - 1][0];
for (int j = 1; j <= k; j++)
sum[j] = (sum[j - 1] + dp[i - 1][j]) % mod;
for (int j = 0; j <= k; j++) {
if (j <= a[i - 1])
dp[i][j] = sum[j];
else {
dp[i][j] = (sum[j] - sum[j - a[i - 1] - 1] + mod) % mod;
}
}
sum.clear();
}
cout << dp[n][k] << endl;
// ***** END HERE *****
return 0;
} | [
"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] = DP[i - 1][j];
else
DP[i][j] = (DP[i][j - 1] + DP[i - 1][j] -
((j - 1 - arr[i]) >= 0 ? DP[i - 1][j - 1 - arr[i]] : 0)) %
1000000007;
}
}
return DP[n - 1][k];
}
int main() {
int n, k;
cin >> n >> k;
long long int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << maxcandypossible(arr, n, k) << endl;
return 0;
} |
#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] = DP[i - 1][j];
else
DP[i][j] = (1000000007 + DP[i][j - 1] + DP[i - 1][j] -
((j - 1 - arr[i]) >= 0 ? DP[i - 1][j - 1 - arr[i]] : 0)) %
1000000007;
}
}
return DP[n - 1][k];
}
int main() {
int n, k;
cin >> n >> k;
long long int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << maxcandypossible(arr, n, k) << endl;
return 0;
} | [
"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 i = 1; i <= n; i++)
for (int j = 1; j <= k; j++)
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] -
((j > a[i]) ? dp[i - 1][j - a[i] - 1] : 0)) %
mod;
/*for(int i=0;i<=n;i++)
{
for(int j=0;j<=k;j++) cout<<dp[i][j]<<" ";
cout<<"\n";
}*/
cout << dp[n][k] - ((k > 0) ? dp[n][k - 1] : 0);
} | #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 i = 1; i <= n; i++)
for (int j = 1; j <= k; j++)
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] -
((j > a[i]) ? dp[i - 1][j - a[i] - 1] : 0)) %
mod;
cout << (dp[n][k] - ((k > 0) ? dp[n][k - 1] : 0) + mod) % mod;
} | [
"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 i = 1; i <= n; i++)
for (int j = 1; j <= k; j++)
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] -
((j > a[i]) ? dp[i - 1][j - a[i] - 1] : 0)) %
mod;
/*for(int i=0;i<=n;i++)
{
for(int j=0;j<=k;j++) cout<<dp[i][j]<<" ";
cout<<"\n";
}*/
cout << dp[n][k] - ((k > 0) ? dp[n][k - 1] : 0);
} | #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 i = 1; i <= n; i++)
for (int j = 1; j <= k; j++)
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] -
((j > a[i]) ? dp[i - 1][j - a[i] - 1] : 0)) %
mod;
/*for(int i=0;i<=n;i++)
{
for(int j=0;j<=k;j++) cout<<dp[i][j]<<" ";
cout<<"\n";
}*/
cout << (dp[n][k] - ((k > 0) ? dp[n][k - 1] : 0) + mod) % mod;
} | [
"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 = 1; i <= k; i++) {
dp[0][i] = 0;
}
for (int i = 1; i <= n; i++) {
vector<int> sum(k + 1);
sum[0] = dp[i - 1][0];
for (int j = 1; j <= k; j++)
sum[j] = (sum[j - 1] + dp[i - 1][j]) % mod;
for (int j = 0; j <= k; j++) {
if (j <= a[i])
dp[i][j] = sum[j];
else {
int remove = j - a[j] - 1;
dp[i][j] = (sum[j] - sum[remove] + mod) % mod;
}
}
sum.clear();
}
cout << dp[n][k];
} | #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 = 1; i <= k; i++) {
dp[0][i] = 0;
}
for (int i = 1; i <= n; i++) {
vector<int> sum(k + 1);
sum[0] = dp[i - 1][0];
for (int j = 1; j <= k; j++)
sum[j] = (sum[j - 1] + dp[i - 1][j]) % mod;
for (int j = 0; j <= k; j++) {
if (j <= a[i])
dp[i][j] = sum[j];
else {
int remove = j - a[i] - 1;
dp[i][j] = (sum[j] - sum[remove] + mod) % mod;
}
}
sum.clear();
}
cout << dp[n][k];
} | [
"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<int> psum(k + 1);
psum[0] = dp[0];
for (int j = 1; j <= k; ++j) {
psum[j] = dp[j];
psum[j] += psum[j - 1];
psum[j] %= mod;
}
for (int j = 0; j <= k; ++j) {
int sum = psum[j];
if (j - v[i] - 1 >= 0)
sum -= psum[j - v[i] - 1];
dp[j] = sum % mod;
}
}
int ans = dp[k];
cout << ans << '\n';
return 0;
}
| #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<int> psum(k + 1);
psum[0] = dp[0];
for (int j = 1; j <= k; ++j) {
psum[j] = dp[j];
psum[j] += psum[j - 1];
psum[j] %= mod;
}
for (int j = 0; j <= k; ++j) {
int sum = psum[j];
if (j - v[i] - 1 >= 0)
sum -= psum[j - v[i] - 1];
dp[j] = sum % mod;
}
}
int ans = dp[k];
cout << (ans + mod) % mod << '\n';
return 0;
}
| [
"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] = dp[i - 1][j];
else
dp[i][j] = (mod + dp[i][j - 1] + dp[i - 1][j] -
((j - arr[i] - 1) >= 0 ? dp[i - 1][j - arr[i] - 1] : 0)) %
mod;
}
}
return dp[n][k];
}
int main() {
ll n, k;
cin >> n >> k;
ll arr[n + 1];
for (ll i = 1; i <= n; i++)
cin >> arr[i];
cout << solve(arr, n, k);
}
| #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] = dp[i - 1][j];
else
dp[i][j] = (mod + dp[i][j - 1] + dp[i - 1][j] -
((j - arr[i] - 1) >= 0 ? dp[i - 1][j - arr[i] - 1] : 0)) %
mod;
}
}
return dp[n][k];
}
int main() {
ll n, k;
cin >> n >> k;
ll arr[n + 1];
for (ll i = 1; i <= n; i++)
cin >> arr[i];
cout << solve(arr, n, k);
}
| [
"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;
if (i == N - 1) {
if (j <= a[i]) {
dp[i][j] = 1;
}
continue;
}
if (j == 0) {
dp[i][j] = 1;
continue;
}
if (j <= a[i]) {
dp[i][j] = (dp[i][j - 1] + dp[i + 1][j]) % MOD;
continue;
}
dp[i][j] = (dp[i][j - 1] - dp[i + 1][j - a[i] - 1] + dp[i + 1][j]) % MOD;
}
}
// for(int i=N-1;i>=0;i--){
// for(int j=0;j<=K;j++){
// cerr << "i=" << i << "j=" << j << "val=" << dp[i][j] << endl;
// }
// }
cout << dp[0][K] % MOD << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
std::vector<long long> a(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &a[i]);
}
solve(N, K, std::move(a));
return 0;
}
| #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;
if (i == N - 1) {
if (j <= a[i]) {
dp[i][j] = 1;
}
continue;
}
if (j == 0) {
dp[i][j] = 1;
continue;
}
if (j <= a[i]) {
dp[i][j] = (dp[i][j - 1] + dp[i + 1][j]) % MOD;
continue;
}
dp[i][j] =
(dp[i][j - 1] - dp[i + 1][j - a[i] - 1] + dp[i + 1][j] + MOD) % MOD;
}
}
// for(int i=N-1;i>=0;i--){
// for(int j=0;j<=K;j++){
// cerr << "i=" << i << "j=" << j << "val=" << dp[i][j] << endl;
// }
// }
cout << dp[0][K] % MOD << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
std::vector<long long> a(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &a[i]);
}
solve(N, K, std::move(a));
return 0;
}
| [
"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;
cin >> a;
vector<int> seg(k + 2, 0);
for (int used = k; used >= 0; used--) {
int L = used + 1;
int R = min(k, used + a);
if (L > R) {
continue;
}
seg[L] += dp[used];
seg[L] %= mod;
seg[R + 1] -= dp[used];
seg[R + 1] %= mod;
}
for (int i = 1; i <= k; i++) {
seg[i] += seg[i - 1];
seg[i] %= mod;
dp[i] += seg[i];
dp[i] %= mod;
}
}
cout << dp[k] << endl;
} | #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;
cin >> a;
vector<int> seg(k + 2, 0);
for (int used = k; used >= 0; used--) {
int L = used + 1; //+1 since adding nothing doesn't yield a new way
int R = min(k, used + a);
if (L > R) {
continue;
}
seg[L] += dp[used];
seg[L] %= mod;
seg[R + 1] -= dp[used];
seg[R + 1] %= mod;
}
for (int i = 1; i <= k; i++) {
seg[i] += seg[i - 1];
seg[i] %= mod;
dp[i] += seg[i];
dp[i] %= mod;
}
}
cout << (dp[k] + mod) % mod << endl;
} | [
"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);
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
int pos = max(0ll, j - arr[i]);
if (pos > 0) {
dp[j] = (presum[j] - presum[pos - 1]) % M;
}
if (pos == 0) {
dp[j] = (presum[j]) % M;
}
// cout<<dp[j]<<" ";
} // cout<<"\n";
presum[0] = dp[0];
for (int j = 1; j <= k; j++) {
presum[j] = (presum[j - 1] + dp[j]) % M;
}
}
cout << dp[k] << "\n";
}
| #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);
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
int pos = max(0ll, j - arr[i]);
if (pos > 0) {
dp[j] = (presum[j] - presum[pos - 1] + M) % M;
}
if (pos == 0) {
dp[j] = (presum[j]) % M;
}
// cout<<dp[j]<<" ";
} // cout<<"\n";
presum[0] = dp[0];
for (int j = 1; j <= k; j++) {
presum[j] = (presum[j - 1] + dp[j]) % M;
}
}
cout << dp[k] << "\n";
}
| [
"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);
int N, K;
std::cin >> N >> K;
vector<vector<int>> dp = vector<vector<int>>(N + 1, vector<int>(K + 1, 0));
vector<vector<int>> prefix = dp;
prefix[0] = vector<int>(K + 1, 1);
for (int i = 1; i <= N; ++i) {
int kid;
cin >> kid;
for (int sum = 0; sum <= K; ++sum) {
int R = min(kid, sum);
dp[i][sum] = sub(prefix[i - 1][sum],
(sum - R > 0 ? prefix[i - 1][sum - R - 1] : 0));
prefix[i][sum] = (dp[i][sum], (sum > 0 ? prefix[i][sum - 1] : 0)) % MOD;
}
}
std::cout << dp[N][K];
return 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);
int N, K;
std::cin >> N >> K;
vector<vector<int>> dp = vector<vector<int>>(N + 1, vector<int>(K + 1, 0));
vector<vector<int>> prefix = dp;
prefix[0] = vector<int>(K + 1, 1);
for (int i = 1; i <= N; ++i) {
int kid;
cin >> kid;
for (int sum = 0; sum <= K; ++sum) {
int R = min(kid, sum);
dp[i][sum] = sub(prefix[i - 1][sum],
(sum - R > 0 ? prefix[i - 1][sum - R - 1] : 0));
prefix[i][sum] = (dp[i][sum] + (sum > 0 ? prefix[i][sum - 1] : 0)) % MOD;
}
}
std::cout << dp[N][K];
return 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++)
cin >> a[i];
ll dp[n][k + 1];
for (i = 0; i <= k; i++) {
if (i <= a[0])
dp[0][i] = 1;
else
dp[0][i] = 0;
}
ll j;
for (i = 1; i < n; i++) {
for (j = 0; j <= k; j++) {
if (j == 0) {
dp[i][j] = 1;
} else if (j <= a[i]) {
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % x;
} else {
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - a[i] - 1]) % x;
}
}
}
cout << dp[n - 1][k] << endl;
return 0;
}
| #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++)
cin >> a[i];
ll dp[n][k + 1];
for (i = 0; i <= k; i++) {
if (i <= a[0])
dp[0][i] = 1;
else
dp[0][i] = 0;
}
ll j;
for (i = 1; i < n; i++) {
for (j = 0; j <= k; j++) {
if (j == 0) {
dp[i][j] = 1;
} else if (j <= a[i]) {
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % x;
} else {
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - a[i] - 1]) % x;
}
}
}
cout << (dp[n - 1][k] + x) % x << endl;
return 0;
} | [
"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 (n % 2 == 0)
f = 0;
else {
ll i;
for (i = 3; (i * i <= n) && (f == 1); i += 2) {
if (n % i == 0)
f = 0;
}
}
return f;
}
ll nCr(ll n, ll r) {
ll i, res = 1;
if (r > n - r)
r = n - r;
for (i = 0; i < r; ++i) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll btod(string n) {
ll lg = n.length();
ll i, val = 0, bs = 1;
for (i = lg - 1; i >= 0; i--) {
if (n[i] == '1') {
val += bs;
}
bs *= 2;
}
return val;
}
ll ston(string s) {
ll val = 0, bs = 1;
ll sl = s.length();
sl--;
while (sl >= 0) {
val += ((s[sl] - 48) * bs);
bs *= 10;
sl--;
}
return val;
}
ll nCrModpDP(ll n, ll r, ll p) {
ll i, j, C[r + 1];
memset(C, 0, sizeof(C));
C[0] = 1;
for (i = 1; i <= n; i++) {
for (j = min(i, r); j > 0; j--) {
C[j] = (C[j] + C[j - 1]) % p;
}
}
return C[r];
}
ll nCrModpLucas(ll n, ll r, ll p) {
if (r == 0)
return 1;
ll ni = n % p, ri = r % p;
return (nCrModpLucas(n / p, r / p, p) * nCrModpDP(ni, ri, p)) % p;
}
//(x^y)%p
ll pwr(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p) { return pwr(n, p - 2, p); }
ll nCrModPFermat(ll n, ll r, ll p, ll fac[]) {
if (r == 0)
return 1;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
/*ll fac[n+1];
fac[0] = 1;
ll i;
for (i=1 ; i<=n; i++)
fac[i] = fac[i-1]*i%M;*/
/*ll nPr(ll n,ll r,ll m,ll fac[])
{
ll q=fac[n];
r=(fac[r])%m;
return (q*pow(r,m-2))%m;
}*/
// ll power(int x, unsigned int y)
// {
// int temp;
// if( y == 0)
// return 1;
// temp = power(x, y/2);
// if (y%2 == 0)
// return temp*temp;
// else
// return x*temp*temp;
// }
// Zeller's Congruence
int calcDate(int date, int month, int year) {
if (month == 1) {
month = 13;
year--;
}
if (month == 2) {
month = 14;
year--;
}
int q = date, m = month, k = year % 100, j = year / 100;
int day = q + (13 * (m + 1)) / 5 + k + (k / 4) + (j / 4) + 5 * j;
day = day % 7;
return day;
}
vector<vector<ll>> matmul(vector<vector<ll>> a, vector<vector<ll>> b) {
ll k = a.size();
vector<vector<ll>> c(k, vector<ll>(k));
ll i, j, l;
for (i = 0; i < k; i++) {
for (j = 0; j < k; j++) {
for (l = 0; l < k; l++) {
c[i][j] = (c[i][j] + a[i][l] * b[l][j]) % M; //%Mo only if req.
}
}
}
return c;
}
vector<vector<ll>> matexp(vector<vector<ll>> a, ll p) {
if (p == 1)
return a;
if (p & 1)
return matmul(a, matexp(a, p - 1));
vector<vector<ll>> x = matexp(a, p / 2);
return matmul(x, x);
}
// linear recurrence
// find Fn
ll linrec(ll n, ll k, vector<ll> a, vector<ll> b) {
if (n == 0)
return 0;
if (n <= k)
return a[n - 1];
ll i, j;
vector<ll> F1(k + 1);
for (i = 1; i <= k; i++)
F1[i] = a[i - 1];
vector<vector<ll>> T(k + 1, vector<ll>(k + 1));
for (i = 1; i <= k; i++) {
for (j = 1; j <= k; j++) {
if (i < k) {
if (j == i + 1)
T[i][j] = 1;
else
T[i][j] = 0;
continue;
}
T[i][j] = b[k - j];
}
}
T = matexp(T, n - 1);
ll res = 0;
for (i = 1; i <= k; i++) {
res += (T[1][i] * F1[i]) % M;
}
return res % M;
}
/*primefactors[a]=primefactors[a/primediviser[a]]+1*/
/*
ll N=5000000+200;
ll p[N]={},d[N],i,j;
for(i=2;i<N;i++)
{
if(p[i]!=0)continue;
for(j=i;j<N;j+=i)
{
if(p[j]==0)p[j]=i;
}
}
d[1] = 0;
for(i=2;i<N;i++)d[i]=1+d[i/p[i]];
for(i=2;i<N;i++)d[i]+=d[i-1];
*/
void add(ll &a, ll b) {
a = a + b;
if (a > M)
a -= M;
}
void sub(ll &a, ll b) {
a = a - b;
if (a < 0)
a += M;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*ll t,w;
cin>>t;
w=0;
ll ans=0;
while(w<t)
{*/
// cout<<"Case #"<<w+1<<": ";
ll n, k, i, j, l;
cin >> n >> k;
ll a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[k + 1] = {}, trm;
dp[0] = 1;
for (i = 0; i < n; i++) {
ll cm[k + 1] = {};
for (j = k; j >= 0; j--) {
trm = dp[j];
ll ed = min(a[i], k - j) + j + 1;
if (j + 1 <= ed - 1) {
// cm[j+1]=(cm[j+1]+trm)%M;
add(cm[j + 1], trm);
if (ed <= k) {
// cm[ed]=(cm[ed]-trm)%M;
sub(cm[ed], trm);
}
}
/*for(l=1;l<=min(a[i],k-j);l++)
{
dp[j+l]+=dp[j];
}*/
}
trm = 0;
for (j = 0; j <= k; j++) {
/*trm=(trm+cm[j])%M;
dp[j]=(dp[j]+trm)%M;*/
add(trm, cm[j]);
add(dp[j], trm);
}
}
/*for(i=0;i<k+1;i++)cout<<dp[i]<<" ";
cout<<"\n";*/
cout << dp[k] << "\n";
/*w++;
}*/
return 0;
}
| #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 (n % 2 == 0)
f = 0;
else {
ll i;
for (i = 3; (i * i <= n) && (f == 1); i += 2) {
if (n % i == 0)
f = 0;
}
}
return f;
}
ll nCr(ll n, ll r) {
ll i, res = 1;
if (r > n - r)
r = n - r;
for (i = 0; i < r; ++i) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll btod(string n) {
ll lg = n.length();
ll i, val = 0, bs = 1;
for (i = lg - 1; i >= 0; i--) {
if (n[i] == '1') {
val += bs;
}
bs *= 2;
}
return val;
}
ll ston(string s) {
ll val = 0, bs = 1;
ll sl = s.length();
sl--;
while (sl >= 0) {
val += ((s[sl] - 48) * bs);
bs *= 10;
sl--;
}
return val;
}
ll nCrModpDP(ll n, ll r, ll p) {
ll i, j, C[r + 1];
memset(C, 0, sizeof(C));
C[0] = 1;
for (i = 1; i <= n; i++) {
for (j = min(i, r); j > 0; j--) {
C[j] = (C[j] + C[j - 1]) % p;
}
}
return C[r];
}
ll nCrModpLucas(ll n, ll r, ll p) {
if (r == 0)
return 1;
ll ni = n % p, ri = r % p;
return (nCrModpLucas(n / p, r / p, p) * nCrModpDP(ni, ri, p)) % p;
}
//(x^y)%p
ll pwr(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p) { return pwr(n, p - 2, p); }
ll nCrModPFermat(ll n, ll r, ll p, ll fac[]) {
if (r == 0)
return 1;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
/*ll fac[n+1];
fac[0] = 1;
ll i;
for (i=1 ; i<=n; i++)
fac[i] = fac[i-1]*i%M;*/
/*ll nPr(ll n,ll r,ll m,ll fac[])
{
ll q=fac[n];
r=(fac[r])%m;
return (q*pow(r,m-2))%m;
}*/
// ll power(int x, unsigned int y)
// {
// int temp;
// if( y == 0)
// return 1;
// temp = power(x, y/2);
// if (y%2 == 0)
// return temp*temp;
// else
// return x*temp*temp;
// }
// Zeller's Congruence
int calcDate(int date, int month, int year) {
if (month == 1) {
month = 13;
year--;
}
if (month == 2) {
month = 14;
year--;
}
int q = date, m = month, k = year % 100, j = year / 100;
int day = q + (13 * (m + 1)) / 5 + k + (k / 4) + (j / 4) + 5 * j;
day = day % 7;
return day;
}
vector<vector<ll>> matmul(vector<vector<ll>> a, vector<vector<ll>> b) {
ll k = a.size();
vector<vector<ll>> c(k, vector<ll>(k));
ll i, j, l;
for (i = 0; i < k; i++) {
for (j = 0; j < k; j++) {
for (l = 0; l < k; l++) {
c[i][j] = (c[i][j] + a[i][l] * b[l][j]) % M; //%Mo only if req.
}
}
}
return c;
}
vector<vector<ll>> matexp(vector<vector<ll>> a, ll p) {
if (p == 1)
return a;
if (p & 1)
return matmul(a, matexp(a, p - 1));
vector<vector<ll>> x = matexp(a, p / 2);
return matmul(x, x);
}
// linear recurrence
// find Fn
ll linrec(ll n, ll k, vector<ll> a, vector<ll> b) {
if (n == 0)
return 0;
if (n <= k)
return a[n - 1];
ll i, j;
vector<ll> F1(k + 1);
for (i = 1; i <= k; i++)
F1[i] = a[i - 1];
vector<vector<ll>> T(k + 1, vector<ll>(k + 1));
for (i = 1; i <= k; i++) {
for (j = 1; j <= k; j++) {
if (i < k) {
if (j == i + 1)
T[i][j] = 1;
else
T[i][j] = 0;
continue;
}
T[i][j] = b[k - j];
}
}
T = matexp(T, n - 1);
ll res = 0;
for (i = 1; i <= k; i++) {
res += (T[1][i] * F1[i]) % M;
}
return res % M;
}
/*primefactors[a]=primefactors[a/primediviser[a]]+1*/
/*
ll N=5000000+200;
ll p[N]={},d[N],i,j;
for(i=2;i<N;i++)
{
if(p[i]!=0)continue;
for(j=i;j<N;j+=i)
{
if(p[j]==0)p[j]=i;
}
}
d[1] = 0;
for(i=2;i<N;i++)d[i]=1+d[i/p[i]];
for(i=2;i<N;i++)d[i]+=d[i-1];
*/
void add(ll &a, ll b) {
a = a + b;
if (a >= M)
a -= M;
}
void sub(ll &a, ll b) {
a = a - b;
if (a < 0)
a += M;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*ll t,w;
cin>>t;
w=0;
ll ans=0;
while(w<t)
{*/
// cout<<"Case #"<<w+1<<": ";
ll n, k, i, j, l;
cin >> n >> k;
ll a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[k + 1] = {}, trm;
dp[0] = 1;
for (i = 0; i < n; i++) {
ll cm[k + 1] = {};
for (j = k; j >= 0; j--) {
trm = dp[j];
ll ed = min(a[i], k - j) + j + 1;
if (j + 1 <= ed - 1) {
// cm[j+1]=(cm[j+1]+trm)%M;
add(cm[j + 1], trm);
if (ed <= k) {
// cm[ed]=(cm[ed]-trm)%M;
sub(cm[ed], trm);
}
}
/*for(l=1;l<=min(a[i],k-j);l++)
{
dp[j+l]+=dp[j];
}*/
}
trm = 0;
for (j = 0; j <= k; j++) {
/*trm=(trm+cm[j])%M;
dp[j]=(dp[j]+trm)%M;*/
add(trm, cm[j]);
add(dp[j], trm);
}
}
/*for(i=0;i<k+1;i++)cout<<dp[i]<<" ";
cout<<"\n";*/
cout << dp[k] << "\n";
/*w++;
}*/
return 0;
}
| [
"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 all(vec) vec.begin(), vec.end()
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
vector<ll> fac;
void c_fac(int x = pow(10, 6) + 10) {
fac.resize(x, true);
rep(i, x) fac[i] = i ? (fac[i - 1] * i) % MOD : 1;
}
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
int d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return (x + m) % m;
}
ll nck(ll n, ll k) { return fac[n] * inv(fac[k] * fac[n - k] % MOD) % MOD; }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, K;
cin >> N >> K;
ll a[N];
rep(i, N) cin >> a[i];
ll dp[N + 1][K + 1] = {};
dp[0][0] = 1;
rep(i, N) rep(j, K + 1) {
if (j == 0)
dp[i + 1][j] = dp[i][j];
else if (j <= a[i])
dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j]) % MOD;
else
dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j] - dp[i][j - a[i] - 1]) % MOD;
}
// rep(i,N+1) debug(dp[i],dp[i]+(K+1));
ll result = dp[N][K];
cout << result << endl;
return 0;
} | #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 all(vec) vec.begin(), vec.end()
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
vector<ll> fac;
void c_fac(int x = pow(10, 6) + 10) {
fac.resize(x, true);
rep(i, x) fac[i] = i ? (fac[i - 1] * i) % MOD : 1;
}
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
int d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return (x + m) % m;
}
ll nck(ll n, ll k) { return fac[n] * inv(fac[k] * fac[n - k] % MOD) % MOD; }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, K;
cin >> N >> K;
ll a[N];
rep(i, N) cin >> a[i];
ll dp[N + 1][K + 1] = {};
dp[0][0] = 1;
rep(i, N) rep(j, K + 1) {
if (j == 0)
dp[i + 1][j] = dp[i][j];
else if (j <= a[i])
dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j]) % MOD;
else
dp[i + 1][j] =
((dp[i + 1][j - 1] + dp[i][j] - dp[i][j - a[i] - 1]) % MOD + MOD) %
MOD;
}
// rep(i,N+1) debug(dp[i],dp[i]+(K+1));
ll result = dp[N][K];
cout << result << endl;
return 0;
} | [
"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);
for (int j = 0; j <= k; ++j) {
pre[j + 1] = (pre[j] + dp1[j]) % MOD;
}
for (int j = k; ~j; --j) {
dp2[j] = (pre[j + 1] - pre[max(0, j - arr[i])]) % MOD;
}
swap(dp1, dp2);
}
cout << dp1[k];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
arr = vector<int>(n);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
solve();
return 0;
} | #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);
for (int j = 0; j <= k; ++j) {
pre[j + 1] = (pre[j] + dp1[j]) % MOD;
}
for (int j = k; ~j; --j) {
dp2[j] = (pre[j + 1] - pre[max(0, j - arr[i])]) % MOD;
}
swap(dp1, dp2);
}
cout << (dp1[k] + MOD) % MOD;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
arr = vector<int>(n);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
solve();
return 0;
} | [
"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>> dp(n + 1, vector<ll>(k + 2, 0));
rep(i, n + 1) dp[i][1] = 1;
rep(i, n) {
int m = a[i];
rep(j, k + 1) {
dp[i][j + 1] += dp[i][j];
dp[i][j + 1] %= MOD;
}
for (int j = 1; j < k + 1; j++) {
dp[i + 1][j + 1] = dp[i][j + 1] - dp[i][max(j - m, 0)];
dp[i + 1][j + 1] %= MOD;
}
}
cout << dp[n][k + 1] << endl;
} | #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>> dp(n + 1, vector<ll>(k + 2, 0));
rep(i, n + 1) dp[i][1] = 1;
rep(i, n) {
int m = a[i];
rep(j, k + 1) {
dp[i][j + 1] += dp[i][j];
dp[i][j + 1] %= MOD;
}
for (int j = 1; j < k + 1; j++) {
dp[i + 1][j + 1] = dp[i][j + 1] - dp[i][max(j - m, 0)] + MOD;
dp[i + 1][j + 1] %= MOD;
}
}
cout << dp[n][k + 1] << endl;
} | [
"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>> dp(n + 1, vector<int>(k + 2, 0));
rep(i, n) dp[i][1] = 1;
rep(i, n) {
int m = a[i];
rep(j, k + 1) {
dp[i][j + 1] += dp[i][j];
dp[i][j + 1] %= MOD;
}
for (int j = 1; j < k + 1; j++) {
dp[i + 1][j + 1] = dp[i][j + 1] - dp[i][max(j - m, 0)];
dp[i + 1][j + 1] %= MOD;
}
}
cout << dp[n][k + 1] << endl;
} | #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>> dp(n + 1, vector<ll>(k + 2, 0));
rep(i, n + 1) dp[i][1] = 1;
rep(i, n) {
int m = a[i];
rep(j, k + 1) {
dp[i][j + 1] += dp[i][j];
dp[i][j + 1] %= MOD;
}
for (int j = 1; j < k + 1; j++) {
dp[i + 1][j + 1] = dp[i][j + 1] - dp[i][max(j - m, 0)] + MOD;
dp[i + 1][j + 1] %= MOD;
}
}
cout << dp[n][k + 1] << endl;
} | [
"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 int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vi a(n);
rep(i, 0, n) { cin >> a[i]; }
vector<vll> dp(n, vll(k + 1, 0));
rep(j, 0, k + 1) { dp[0][j] = j <= a[0] ? 1 : 0; }
rep(i, 1, n) {
ll sum = 0;
rep(j, 0, k + 1) {
if (j <= a[i]) {
sum = (sum + dp[i - 1][j]) % MOD;
} else {
sum = (sum + dp[i - 1][j] - dp[i - 1][j - a[i]] + MOD) % MOD;
}
dp[i][j] = sum;
}
}
cout << dp[n - 1][k] << endl;
return 0;
} | #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 int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vi a(n);
rep(i, 0, n) { cin >> a[i]; }
vector<vll> dp(n, vll(k + 1, 0));
rep(j, 0, k + 1) { dp[0][j] = j <= a[0] ? 1 : 0; }
rep(i, 1, n) {
ll sum = 0;
rep(j, 0, k + 1) {
if (j <= a[i]) {
sum = (sum + dp[i - 1][j]) % MOD;
} else {
sum = (sum + dp[i - 1][j] - dp[i - 1][j - a[i] - 1] + MOD) % MOD;
}
dp[i][j] = sum;
}
}
cout << dp[n - 1][k] << endl;
return 0;
} | [
"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 vector<vd> vvd;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pair<int, int>> vpii;
const int MOD = 1e9 + 7;
// prefixes in dp
int main() {
ll n, k;
cin >> n >> k;
vi a(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
vvll state(k + 1, vll(n + 1, 0));
state[0][0] = 1;
for (int i = 0; i <= k; i++)
for (int j = 0; j <= n; j++) {
if (i == j && j == 0)
continue;
// state[i][j] += (i-l < 0 || j - 1 < 0? 0 :state[i - l][j-1] % MOD);
state[i][j] =
((j - 1 < 0 ? 0
: (state[i][j - 1] -
(i - a[j] - 1 < 0 ? 0 : state[i - a[j] - 1][j - 1]))) +
(i - 1 < 0 ? 0 : state[i - 1][j])) %
MOD;
}
cout << (state[k][n] - (k - 1 < 0 ? 0 : state[k - 1][n])) % MOD << endl;
} | // 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 vector<vd> vvd;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pair<int, int>> vpii;
const int MOD = 1e9 + 7;
// prefixes in dp
int main() {
ll n, k;
cin >> n >> k;
vi a(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
vvll state(k + 1, vll(n + 1, 0));
state[0][0] = 1;
for (int i = 0; i <= k; i++)
for (int j = 0; j <= n; j++) {
if (i == j && j == 0)
continue;
// state[i][j] += (i-l < 0 || j - 1 < 0? 0 :state[i - l][j-1] % MOD);
state[i][j] =
((j - 1 < 0 ? 0
: (state[i][j - 1] -
(i - a[j] - 1 < 0 ? 0 : state[i - a[j] - 1][j - 1]))) +
(i - 1 < 0 ? 0 : state[i - 1][j])) %
MOD;
}
cout << (state[k][n] - (k - 1 < 0 ? 0 : state[k - 1][n]) + MOD) % MOD << endl;
} | [
"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 vector<vd> vvd;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pair<int, int>> vpii;
const int MOD = 1e9 + 7;
// prefixes in dp
int main() {
ll n, k;
cin >> n >> k;
vi a(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
vvll state(k + 1, vll(n + 1, 0));
state[0][0] = 1;
for (int i = 0; i <= k; i++)
for (int j = 0; j <= n; j++) {
if (i == j && j == 0)
continue;
// state[i][j] += (i-l < 0 || j - 1 < 0? 0 :state[i - l][j-1] % MOD);
state[i][j] =
((j - 1 < 0 ? 0
: (state[i][j - 1] -
(i - a[j] - 1 < 0 ? 0 : state[i - a[j] - 1][j - 1]))) +
(i - 1 < 0 ? 0 : state[i - 1][j])) %
MOD;
}
cout << state[k][n] - (k - 1 < 0 ? 0 : state[k - 1][n]) << endl;
} | // 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 vector<vd> vvd;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pair<int, int>> vpii;
const int MOD = 1e9 + 7;
// prefixes in dp
int main() {
ll n, k;
cin >> n >> k;
vi a(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
vvll state(k + 1, vll(n + 1, 0));
state[0][0] = 1;
for (int i = 0; i <= k; i++)
for (int j = 0; j <= n; j++) {
if (i == j && j == 0)
continue;
// state[i][j] += (i-l < 0 || j - 1 < 0? 0 :state[i - l][j-1] % MOD);
state[i][j] =
((j - 1 < 0 ? 0
: (state[i][j - 1] -
(i - a[j] - 1 < 0 ? 0 : state[i - a[j] - 1][j - 1]))) +
(i - 1 < 0 ? 0 : state[i - 1][j])) %
MOD;
}
cout << (state[k][n] - (k - 1 < 0 ? 0 : state[k - 1][n]) + MOD) % MOD << endl;
} | [
"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 <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
template <class T> inline T chmax(T &a, const T b) {
return a = (a < b) ? b : a;
}
template <class T> inline T chmin(T &a, const T b) {
return a = (a > b) ? b : a;
}
constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;
#define all(a) (a).begin(), (a).end()
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, 0));
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
vector<ll> dpsum(k + 2, 0);
for (int j = 0; j <= k; j++) {
dpsum[j + 1] = dpsum[j] + dp[i][j];
dpsum[j + 1] %= MOD;
}
for (int cur = 0; cur <= k; cur++) {
dp[i + 1][cur] += dpsum[cur + 1] - dpsum[max(0, cur - a[i])];
dp[i + 1][cur] %= MOD;
}
}
cout << dp[n][k] << endl;
return 0;
} | #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 <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
template <class T> inline T chmax(T &a, const T b) {
return a = (a < b) ? b : a;
}
template <class T> inline T chmin(T &a, const T b) {
return a = (a > b) ? b : a;
}
constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;
#define all(a) (a).begin(), (a).end()
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, 0));
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
vector<ll> dpsum(k + 2, 0);
for (int j = 0; j <= k; j++) {
dpsum[j + 1] = dpsum[j] + dp[i][j];
dpsum[j + 1] %= MOD;
}
for (int cur = 0; cur <= k; cur++) {
dp[i + 1][cur] += dpsum[cur + 1] - dpsum[max(0, cur - a[i])] + MOD;
dp[i + 1][cur] %= MOD;
}
}
cout << dp[n][k] << endl;
return 0;
} | [
"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 long int i = 0; i < n; i++)
cin >> arr[i];
for (long long int i = 0; i <= k; i++)
dp[0][i] = 0;
dp[0][0] = 1;
for (long long int i = 1; i <= n; i++) {
long long int a = 0;
long long int iter = 0;
for (long long int j = 0; j <= k; j++) {
a += dp[i - 1][j];
a %= mod;
iter++;
if (iter > arr[i - 1] + 1) {
a = (a - dp[i - 1][j - arr[i - 1] - 1]) % mod;
iter--;
}
dp[i][j] = a % mod;
}
}
cout << dp[n][k] << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
pre();
long long int num = 1;
// cin>>num;
for (long long int i = 0; i < num; i++) {
solve();
}
}
| #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 long int i = 0; i < n; i++)
cin >> arr[i];
for (long long int i = 0; i <= k; i++)
dp[0][i] = 0;
dp[0][0] = 1;
for (long long int i = 1; i <= n; i++) {
long long int a = 0;
long long int iter = 0;
for (long long int j = 0; j <= k; j++) {
a += dp[i - 1][j];
a %= mod;
iter++;
if (iter > arr[i - 1] + 1) {
a = (mod + a - dp[i - 1][j - arr[i - 1] - 1]) % mod;
iter--;
}
dp[i][j] = a % mod;
}
}
cout << dp[n][k] << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
pre();
long long int num = 1;
// cin>>num;
for (long long int i = 0; i < num; i++) {
solve();
}
}
| [
"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<pair<ll, ll>> ii; // Vector of pairs
#define ff first // For pairs
#define ss second // For pairs
#define sz(a) int((a).size()) // Function to determine size of any container
#define pb push_back // Pushback to vector
#define mp make_pair // Makes pairs to be stored as pair
#define all(c) (c).begin(), (c).end() // Mainly used by me in sorting
// ordered_set adds two new functions to set - (set).find_by_order([kth element
// based on zero indexing]) and order_of_key() order_of_key returns number of
// elements less that parameter. If element exists, that order is its index
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define MAXK (ll)((1e5 * 3) + 5)
#define MAXN (ll)(1e2 + 10)
#define MOD (ll)(1e9 + 7)
#define mod(a) (((a % MOD) + MOD) % MOD)
ll dp[MAXN][MAXK];
ll n;
vi arr;
int main(void) {
memset(dp, 0, sizeof(dp));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll k;
cin >> n >> k;
arr.resize(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = k; i >= 0; i--)
if (k - i <= arr[0])
dp[0][i] = mod(dp[0][i + 1] + 1);
else
dp[0][i] = dp[0][i + 1];
for (int i = 1; i < n; i++)
for (int j = k; j >= 0; j--)
dp[i][j] =
mod(dp[i][j + 1] + mod(dp[i - 1][j] - dp[i - 1][j + arr[i] + 1]));
cout << dp[n - 1][0] - dp[n - 1][1] << "\n";
} | #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<pair<ll, ll>> ii; // Vector of pairs
#define ff first // For pairs
#define ss second // For pairs
#define sz(a) int((a).size()) // Function to determine size of any container
#define pb push_back // Pushback to vector
#define mp make_pair // Makes pairs to be stored as pair
#define all(c) (c).begin(), (c).end() // Mainly used by me in sorting
// ordered_set adds two new functions to set - (set).find_by_order([kth element
// based on zero indexing]) and order_of_key() order_of_key returns number of
// elements less that parameter. If element exists, that order is its index
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define MAXK (ll)((1e5 * 3) + 5)
#define MAXN (ll)(1e2 + 10)
#define MOD (ll)(1e9 + 7)
#define mod(a) (((a % MOD) + MOD) % MOD)
ll dp[MAXN][MAXK];
ll n;
vi arr;
int main(void) {
memset(dp, 0, sizeof(dp));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll k;
cin >> n >> k;
arr.resize(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = k; i >= 0; i--)
if (k - i <= arr[0])
dp[0][i] = mod(dp[0][i + 1] + 1);
else
dp[0][i] = dp[0][i + 1];
for (int i = 1; i < n; i++)
for (int j = k; j >= 0; j--)
dp[i][j] =
mod(dp[i][j + 1] + mod(dp[i - 1][j] - dp[i - 1][j + arr[i] + 1]));
cout << mod(dp[n - 1][0] - dp[n - 1][1]) << "\n";
} | [
"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[0] = 1;
rep(i, n) {
vector<int> cum(k + 1, 0);
rep(j, k + 1)(cum[j + 1] = cum[j] + dp[j]) %= mod;
rep(j, k + 1)(dp[j] = (cum[j + 1] - cum[max(0, j - a[i])]) + mod) %= mod;
}
cout << dp[k] << endl;
return 0;
} | #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[0] = 1;
rep(i, n) {
vector<int> cum(k + 2, 0);
rep(j, k + 1)(cum[j + 1] = cum[j] + dp[j]) %= mod;
rep(j, k + 1)(dp[j] = (cum[j + 1] - cum[max(0, j - a[i])]) + mod) %= mod;
}
cout << dp[k] << endl;
return 0;
} | [
"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 -= result / n;
return result;
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p) { return power(n, p - 2, p); }
int main() {
ll n, k, i, j;
cin >> n >> k;
ll arr[n];
for (i = 0; i < n; i++)
cin >> arr[i];
ll dp[n][k + 1];
dp[0][0] = 1;
for (j = 1; j <= k; j++) {
if (j <= arr[0])
dp[0][j] = 1 + dp[0][j - 1];
else
dp[0][j] = dp[0][j - 1];
dp[0][j] %= p;
}
for (i = 1; i < n; i++) {
for (j = 0; j <= k; j++) {
if (j == 0)
dp[i][j] = 1;
else {
if (j <= arr[i])
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
else
dp[i][j] =
dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - arr[i] - 1] + p;
}
dp[i][j] %= p;
}
}
if (k >= 1)
cout << dp[n - 1][k] - dp[n - 1][k - 1];
else
cout << dp[n - 1][0];
return 0;
}
| #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 -= result / n;
return result;
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p) { return power(n, p - 2, p); }
int main() {
ll n, k, i, j;
cin >> n >> k;
ll arr[n];
for (i = 0; i < n; i++)
cin >> arr[i];
ll dp[n][k + 1];
dp[0][0] = 1;
for (j = 1; j <= k; j++) {
if (j <= arr[0])
dp[0][j] = 1 + dp[0][j - 1];
else
dp[0][j] = dp[0][j - 1];
dp[0][j] %= p;
}
for (i = 1; i < n; i++) {
for (j = 0; j <= k; j++) {
if (j == 0)
dp[i][j] = 1;
else {
if (j <= arr[i])
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
else
dp[i][j] =
dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - arr[i] - 1] + p;
}
dp[i][j] %= p;
}
}
if (k >= 1)
cout << (dp[n - 1][k] - dp[n - 1][k - 1] + p) % p;
else
cout << dp[n - 1][0];
return 0;
}
| [
"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 <= n; i++) {
dp[i][0] = 1LL;
for (int k = 1; k <= K; k++) {
dp[i][k] = (pref[i - 1][k] - pref[i - 1][max(0, k - tab[i] - 1)]) % mod;
if (k <= tab[i])
dp[i][k] = (dp[i][k] + 1) % mod; // zero cukierkw
}
pref[i][0] = 1LL;
for (int k = 1; k <= K; k++) {
pref[i][k] = (pref[i][k - 1] + dp[i][k]) % mod;
}
}
printf("%lld\n", dp[n][K] % mod);
return 0;
}
| #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 <= n; i++) {
dp[i][0] = 1LL;
for (int k = 1; k <= K; k++) {
dp[i][k] =
(pref[i - 1][k] - pref[i - 1][max(0, k - tab[i] - 1)] + mod) % mod;
if (k <= tab[i])
dp[i][k] = (dp[i][k] + 1LL) % mod; // zero cukierkw
}
pref[i][0] = 1LL;
for (int k = 1; k <= K; k++) {
pref[i][k] = (pref[i][k - 1] + dp[i][k]) % mod;
}
}
printf("%lld\n", dp[n][K] % mod);
return 0;
}
| [
"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++)
template <class T> inline int chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline int chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1 << 30;
const ll LINF = 1LL << 58;
const int mod = 1000000007;
ll dp[110][101010];
int main() {
int n, k;
cin >> n >> k;
int A[110];
for (int i = 0; i < n; i++)
cin >> A[i];
int a = 0;
vector<ll> S(k + 1, 0LL);
dp[0][0] = 1LL;
for (int i = 0; i < n; i++) {
a += A[i];
for (int j = 0; j <= min(k, a); j++) {
S[j + 1] = (S[j] + dp[i][j]) % mod;
}
for (int j = 0; j <= min(k, a); j++) {
dp[i + 1][j] = S[j + 1] - S[max(0, j - A[i])];
dp[i + 1][j] %= mod;
if (dp[i + 1][j] < 0)
dp[i + 1][j] += mod;
}
}
cout << dp[n][k] << endl;
}
| #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++)
template <class T> inline int chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline int chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1 << 30;
const ll LINF = 1LL << 58;
const int mod = 1000000007;
ll dp[110][101010];
int main() {
int n, k;
cin >> n >> k;
int A[110];
for (int i = 0; i < n; i++)
cin >> A[i];
int a = 0;
vector<ll> S(k + 2, 0LL);
dp[0][0] = 1LL;
for (int i = 0; i < n; i++) {
a += A[i];
for (int j = 0; j <= min(k, a); j++) {
S[j + 1] = (S[j] + dp[i][j]) % mod;
}
for (int j = 0; j <= min(k, a); j++) {
dp[i + 1][j] = S[j + 1] - S[max(0, j - A[i])];
dp[i + 1][j] %= mod;
if (dp[i + 1][j] < 0)
dp[i + 1][j] += mod;
}
}
cout << dp[n][k] << endl;
}
| [
"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++)
template <class T> inline int chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline int chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 58;
constexpr int mod = 1000000007;
ll dp[110][101010];
int main() {
int n, k;
cin >> n >> k;
int A[110];
for (int i = 0; i < n; i++)
cin >> A[i];
int a = 0;
vector<ll> S(k + 1, 0);
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
a += A[i];
for (int j = 0; j <= min(k, a); j++) {
S[j + 1] = (S[j] + dp[i][j]) % mod;
}
for (int j = 0; j <= min(k, a); j++) {
dp[i + 1][j] = S[j + 1] - S[max(0, j - A[i])];
dp[i + 1][j] %= mod;
if (dp[i + 1][j] < 0)
dp[i + 1][j] += mod;
}
}
cout << dp[n][k] << endl;
}
| #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++)
template <class T> inline int chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline int chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1 << 30;
const ll LINF = 1LL << 58;
const int mod = 1000000007;
ll dp[110][101010];
int main() {
int n, k;
cin >> n >> k;
int A[110];
for (int i = 0; i < n; i++)
cin >> A[i];
int a = 0;
vector<ll> S(k + 2, 0LL);
dp[0][0] = 1LL;
for (int i = 0; i < n; i++) {
a += A[i];
for (int j = 0; j <= min(k, a); j++) {
S[j + 1] = (S[j] + dp[i][j]) % mod;
}
for (int j = 0; j <= min(k, a); j++) {
dp[i + 1][j] = S[j + 1] - S[max(0, j - A[i])];
dp[i + 1][j] %= mod;
if (dp[i + 1][j] < 0)
dp[i + 1][j] += mod;
}
}
cout << dp[n][k] << endl;
}
| [
"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 % (int)1e7 == 0)
cout << amt << endl;
ll r = 0;
dp[x][k] = r;
++amt2;
if (amt2 % 1000 == 0)
cout << "2: " << amt << endl;
return r;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll ok;
cin >> n >> ok;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i <= v[n - 1]; ++i)
dp[n - 1][i] = 1;
for (int x = n - 2; x >= 0; --x) {
vector<int> sum;
ll s = 0;
for (int i = 0; i <= ok; ++i) {
s = (s + dp[x + 1][i]) % M;
sum.push_back(s);
}
for (ll k = 0; k <= ok; ++k) {
if (k - v[x] > 0)
dp[x][k] = sum[k] - sum[k - v[x] - 1];
else
dp[x][k] = sum[k];
}
}
cout << dp[0][ok] << '\n';
}
| #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 % (int)1e7 == 0)
cout << amt << endl;
ll r = 0;
dp[x][k] = r;
++amt2;
if (amt2 % 1000 == 0)
cout << "2: " << amt << endl;
return r;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll ok;
cin >> n >> ok;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i <= v[n - 1]; ++i)
dp[n - 1][i] = 1;
for (int x = n - 2; x >= 0; --x) {
vector<int> sum;
ll s = 0;
for (int i = 0; i <= ok; ++i) {
s = (s + dp[x + 1][i]) % M;
sum.push_back(s);
}
for (ll k = 0; k <= ok; ++k) {
if (k - v[x] > 0)
dp[x][k] = (sum[k] - sum[k - v[x] - 1] + M) % M;
else
dp[x][k] = sum[k];
}
}
cout << dp[0][ok] << '\n';
}
| [
"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++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, k;
cin >> n >> k;
vl a(n);
rep(i, n) { cin >> a[i]; }
vvl dp(n + 1,
vl(k + 1)); // dp[i+1][j] :
// i人目の子供(iは0-index)まででj個の飴を分け合う方法の数
dp[0][0] = 1;
rep(i, n) {
exrep(j, 0, k) {
/* exrep(x, 0, min(j, a[i])) { // i人目の子供にx個の飴をあげるとする
dp[i+1][j] += dp[i][j-x];
}
↑ このままではTLEなので漸化式の階差を取って高速化する
dp[i+1][j] = sum_{0 <= x <= a[i]} dp[i][j-x] で
dp[i+1][j-1] = sum_{0 <= x <= a[i]} dp[i][j-x-1] なので
dp[i+1][j] - dp[i+1][j-1] = dp[i][j] - dp[i][j - a[i] - 1]
となる(最初と最後の項だけ残る) よって、 dp[i+1][j] = dp[i][j] +
dp[i+1][j-1] - dp[i][j - a[i] - 1] と更新すればよい */
if (j == 0) {
dp[i + 1][j] = dp[i][j];
} else if (j <= a[i]) {
dp[i + 1][j] = dp[i][j] + dp[i + 1][j - 1];
} else {
dp[i + 1][j] = dp[i][j] + dp[i + 1][j - 1] - dp[i][j - a[i] - 1];
}
dp[i + 1][j] %= mod;
}
}
out(dp[n][k]);
re0;
} | #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++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, k;
cin >> n >> k;
vl a(n);
rep(i, n) { cin >> a[i]; }
vvl dp(n + 1,
vl(k + 1)); // dp[i+1][j] :
// i人目の子供(iは0-index)まででj個の飴を分け合う方法の数
dp[0][0] = 1;
rep(i, n) {
exrep(j, 0, k) {
/* exrep(x, 0, min(j, a[i])) { // i人目の子供にx個の飴をあげるとする
dp[i+1][j] += dp[i][j-x];
}
↑ このままではTLEなので漸化式の階差を取って高速化する
dp[i+1][j] = sum_{0 <= x <= a[i]} dp[i][j-x] で
dp[i+1][j-1] = sum_{0 <= x <= a[i]} dp[i][j-x-1] なので
dp[i+1][j] - dp[i+1][j-1] = dp[i][j] - dp[i][j - a[i] - 1]
となる(最初と最後の項だけ残る) よって、 dp[i+1][j] = dp[i][j] +
dp[i+1][j-1] - dp[i][j - a[i] - 1] と更新すればよい */
if (j == 0) {
dp[i + 1][j] = dp[i][j];
} else if (j <= a[i]) {
dp[i + 1][j] = dp[i][j] + dp[i + 1][j - 1];
} else {
dp[i + 1][j] = dp[i][j] + dp[i + 1][j - 1] - dp[i][j - a[i] - 1] + mod;
}
dp[i + 1][j] %= mod;
}
}
out(dp[n][k]);
re0;
} | [
"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())
#define FI first
#define SE second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define REP1(i, n) for (int i = 1; i < ((int)n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PB push_back
#define EB emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define ZERO(a) memset(a, 0, sizeof(a))
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
ll dp[101][100010];
ll n, k;
ll a[101];
ll rec(ll i, ll num) {
if (dp[i][num] != -1)
return dp[i][num];
if (i == n - 1) {
if (num > a[i])
return dp[i][num] = 0;
else
return dp[i][num] = 1;
}
ll res = 0;
REP(j, a[i] + 1)
res = (res + rec(i + 1, num - j)) % MOD;
return dp[i][num] = res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
REP(i, n) cin >> a[i];
REP(i, n + 1) REP(j, k + 1) dp[i][j] = 0;
for (ll i = n - 1; i >= 0; i--) {
vll cum(k + 3);
if (i != n - 1) {
REP(num, k + 1)
cum[num + 1] = (cum[num] + dp[i + 1][num]) % MOD;
}
for (ll num = 0; num <= k; num++) {
if (i == n - 1) {
if (num > a[i])
dp[i][num] = 0;
else
dp[i][num] = 1;
} else {
dp[i][num] = (cum[num + 1] - cum[max(0LL, num - a[i])]) % MOD;
// cout<<i<<":"<<num<<":"<<dp[i][num]<<endl;
}
}
}
ll ans = dp[0][k];
cout << ans << endl;
}
| #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())
#define FI first
#define SE second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define REP1(i, n) for (int i = 1; i < ((int)n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PB push_back
#define EB emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define ZERO(a) memset(a, 0, sizeof(a))
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
ll dp[101][100010];
ll n, k;
ll a[101];
ll rec(ll i, ll num) {
if (dp[i][num] != -1)
return dp[i][num];
if (i == n - 1) {
if (num > a[i])
return dp[i][num] = 0;
else
return dp[i][num] = 1;
}
ll res = 0;
REP(j, a[i] + 1)
res = (res + rec(i + 1, num - j)) % MOD;
return dp[i][num] = res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
REP(i, n) cin >> a[i];
REP(i, n + 1) REP(j, k + 1) dp[i][j] = 0;
for (ll i = n - 1; i >= 0; i--) {
vll cum(k + 3);
if (i != n - 1) {
REP(num, k + 1)
cum[num + 1] = (cum[num] + dp[i + 1][num]) % MOD;
}
for (ll num = 0; num <= k; num++) {
if (i == n - 1) {
if (num > a[i])
dp[i][num] = 0;
else
dp[i][num] = 1;
} else {
dp[i][num] = (MOD + cum[num + 1] - cum[max(0LL, num - a[i])]) % MOD;
// cout<<i<<":"<<num<<":"<<dp[i][num]<<endl;
}
}
}
ll ans = dp[0][k];
cout << ans << endl;
}
| [
"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
#define F first
#define S second
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpi vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<int, int>
#define mpi map<pii, int>
#define spi set<pii>
#define endl "\n"
#define sz(x) ((int)x.size())
#define all(p) p.begin(), p.end()
#define double long double
#define que_max priority_queue<int>
#define que_min priority_queue<int, vi, greater<int>>
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define print(a) \
for (auto x : a) \
cout << x << " "; \
cout << endl
#define print1(a) \
for (auto x : a) \
cout << x.F << " " << x.S << endl
#define print2(a, x, y) \
for (int i = x; i < y; i++) \
cout << a[i] << " "; \
cout << endl
inline int power(int a, int b) {
int x = 1;
while (b) {
if (b & 1)
x *= a;
a *= a;
b >>= 1;
}
return x;
}
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_order_statistics_node_update>
Set;
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
const int N = 200005;
int a[N], n, m, k;
int cache[101][N];
int mod = 1e9 + 7;
int dp(int pos, int val) {
if (val > k)
return 0;
if (pos == n)
return val == k;
int &ans = cache[pos][val];
if (ans != -1)
return ans;
ans = dp(pos, val + 1) + dp(pos + 1, val) - dp(pos + 1, val + a[pos] + 1);
ans %= mod;
return ans;
}
void solve() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(cache, -1, sizeof cache);
cout << dp(0, 0);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << setprecision(9) << fixed;
clock_t z = clock();
solve();
cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);
return 0;
} | /*
"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
#define F first
#define S second
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpi vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<int, int>
#define mpi map<pii, int>
#define spi set<pii>
#define endl "\n"
#define sz(x) ((int)x.size())
#define all(p) p.begin(), p.end()
#define double long double
#define que_max priority_queue<int>
#define que_min priority_queue<int, vi, greater<int>>
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define print(a) \
for (auto x : a) \
cout << x << " "; \
cout << endl
#define print1(a) \
for (auto x : a) \
cout << x.F << " " << x.S << endl
#define print2(a, x, y) \
for (int i = x; i < y; i++) \
cout << a[i] << " "; \
cout << endl
inline int power(int a, int b) {
int x = 1;
while (b) {
if (b & 1)
x *= a;
a *= a;
b >>= 1;
}
return x;
}
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_order_statistics_node_update>
Set;
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
const int N = 200005;
int a[N], n, m, k;
int cache[101][N];
int mod = 1e9 + 7;
int dp(int pos, int val) {
if (val > k)
return 0;
if (pos == n)
return val == k;
int &ans = cache[pos][val];
if (ans != -1)
return ans;
ans = dp(pos, val + 1) + dp(pos + 1, val) - dp(pos + 1, val + a[pos] + 1) +
2 * mod;
ans %= mod;
return ans;
}
void solve() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(cache, -1, sizeof cache);
cout << dp(0, 0);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << setprecision(9) << fixed;
clock_t z = clock();
solve();
cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);
return 0;
} | [
"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] =
{}; // i番目(1-index)までの人に合計j個渡す組み合わせの数のMOD
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
ll rui[k + 2] = {}; // 一つ前の累積をとる
for (int j = 0; j <= k + 1; j++)
rui[j + 1] = (rui[j] + dp[i - 1][j]) % MOD;
for (int j = 0; j <= k; j++)
dp[i][j] = (rui[j + 1] - rui[max(0ll, j - v[i])]) % MOD;
}
cout << dp[n][k] % MOD << endl;
}
| #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] =
{}; // i番目(1-index)までの人に合計j個渡す組み合わせの数のMOD
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
ll rui[k + 2] = {}; // 一つ前の累積をとる
for (int j = 0; j <= k + 1; j++)
rui[j + 1] = (rui[j] + dp[i - 1][j]) % MOD;
for (int j = 0; j <= k; j++)
dp[i][j] = (rui[j + 1] - rui[max(0ll, j - v[i])] + MOD) % MOD;
}
cout << dp[n][k] % MOD << endl;
}
| [
"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<ll>(k + 1, 0));
for (int i = 0; i <= k; ++i) {
if (i <= a[0]) {
dp[0][i] = 1;
if (i > 0)
rv[0][i] = rv[0][i - 1] + 1;
else
rv[0][i] = 1;
} else
rv[0][i] = rv[0][a[0]];
}
for (int i = 0; i < n; ++i) {
dp[i][0] = 1;
rv[i][0] = 1;
}
for (int i = 1; i < n; ++i) {
ll up, lw, f = 0;
for (int j = 1; j <= k; ++j) {
up = rv[i - 1][j];
if (j > a[i])
lw = rv[i - 1][j - a[i] - 1];
else
lw = 0;
dp[i][j] = (up - lw) % m;
rv[i][j] = (rv[i][j - 1] + dp[i][j]) % m;
}
}
cout << dp[n - 1][k] % m << "\n";
}
| #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<ll>(k + 1, 0));
for (int i = 0; i <= k; ++i) {
if (i <= a[0]) {
dp[0][i] = 1;
if (i > 0)
rv[0][i] = rv[0][i - 1] + 1;
else
rv[0][i] = 1;
} else
rv[0][i] = rv[0][a[0]];
}
for (int i = 0; i < n; ++i) {
dp[i][0] = 1;
rv[i][0] = 1;
}
for (int i = 1; i < n; ++i) {
ll up, lw, f = 0;
for (int j = 1; j <= k; ++j) {
up = rv[i - 1][j];
if (j > a[i])
lw = rv[i - 1][j - a[i] - 1];
else
lw = 0;
dp[i][j] = (up - lw) % m;
rv[i][j] = (rv[i][j - 1] + dp[i][j]);
}
}
cout << dp[n - 1][k] % m << "\n";
}
| [
"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")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define sz(x) (int)x.size()
#define aint(v) v.begin(), v.end()
#define in(x) cin >> x;
#define ind(x) \
ll(x); \
cin >> x;
#define ins(x) \
string(x); \
cin >> x;
#define rep(ai, j, k) for (ll ai = j; ai <= k; ai++)
#define sep(ai, j, k) for (ll ai = j; ai >= k; ai--)
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define inputarr(x, y) \
for (ll ai = 1; ai <= y; ai++) { \
cin >> x[ai]; \
}
#define inpprefixarr(arr, y) \
cin >> arr[0]; \
for (ll ai = 1; ai < y; ai++) { \
ll temp; \
cin >> temp; \
arr[ai] = temp + arr[ai - 1]; \
}
#define indarr(y) \
ll(y); \
cin >> y; \
ll arr[y + 1]; \
inputarr(arr, y);
#define watch(x) cout << (#x) << " is " << (x) << endl
#define watcharrsz(x) \
cout << (#x) << " starts:\n"; \
for (ll ai = 0; ai < sz(x); ai++) { \
cout << x[ai] << " "; \
} \
cout << "\n" << (#x) << "ends\n";
#define watcharr(x, n) \
cout << (#x) << " starts:\n"; \
for (ll ai = 0; ai < n; ai++) { \
cout << x[ai] << " "; \
} \
cout << "\n" << (#x) << "ends\n";
#define watchg(x, n, y) \
cout << (#x) << " starts:\n"; \
for (ll ai = 0; ai <= n; ai++) { \
cout << (ai) << ":"; \
for (ll aj = 0; aj < x[ai].size(); aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n" << (#x) << "ends\n";
#define watch2darr(x, m, n, y) \
cout << (#x) << " starts:\n"; \
for (ll ai = 0; ai <= m; ai++) { \
cout << "i=" << (ai) << " "; \
for (ll aj = 0; aj <= n; aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n" << (#x) << "ends\n";
#define print(x, y) cout << (x) << y;
#define printarrsz(x, y) \
for (ll ai = 0; ai < sz(x); ai++) { \
cout << x[ai] << y; \
} \
cout << "\n";
#define printarr(x, n, y) \
for (ll ai = 0; ai < n; ai++) { \
cout << x[ai] << y; \
} \
cout << "\n";
#define print2darr(x, m, n, y) \
for (ll ai = 0; ai < m; ai++) { \
for (ll aj = 0; aj < n; aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n";
#define mod(x) = (x % m + m) % m;
const ll m = (ll)1e9 + 7;
const ll N = 3e6 + 5;
const ll INF = 1ll << 63;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef set<int> si;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<pii> vpii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef set<ll> sl;
typedef map<ll, ll> mll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<pll, vpll, greater<pll>> pqg;
/***************************Code Begins Here *****************************/
void solve() {
// Never use x,y here, try to use i,j in loops only
ind(n) ind(k);
ll a[n + 1];
inputarr(a, n);
ll dp[n + 1][k + 1];
memset(dp, 0, sizeof(dp));
rep(i, 1, n) { dp[i][0] = 1; }
rep(i, 1, k) {
if (i - a[1] - 1 < 0)
dp[1][i] = (dp[1][i - 1] + 1) % m;
else
dp[1][i] = dp[1][i - 1];
}
rep(i, 2, n) {
rep(j, 1, k) {
if (j - a[i] - 1 < 0)
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % m;
else
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - a[i] - 1]) % m;
}
}
// watch2darr(dp,n,k," ");
if (k > 0) {
print(dp[n][k] - dp[n][k - 1], endl);
} else
print(dp[n][k], endl);
}
signed main() {
ios ll t = 1;
// cin>>t;
// #ifndef ONLINE_JUDGE
// time_t time_t1, time_t2;
// time_t1 = clock();
// #endif
while (t--)
solve();
// #ifndef ONLINE_JUDGE
// time_t2 = clock();
// cout << "time taken :" << time_t2 - time_t1 << endl;
// #endif
return 0;
} | #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")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define sz(x) (int)x.size()
#define aint(v) v.begin(), v.end()
#define in(x) cin >> x;
#define ind(x) \
ll(x); \
cin >> x;
#define ins(x) \
string(x); \
cin >> x;
#define rep(ai, j, k) for (ll ai = j; ai <= k; ai++)
#define sep(ai, j, k) for (ll ai = j; ai >= k; ai--)
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define inputarr(x, y) \
for (ll ai = 1; ai <= y; ai++) { \
cin >> x[ai]; \
}
#define inpprefixarr(arr, y) \
cin >> arr[0]; \
for (ll ai = 1; ai < y; ai++) { \
ll temp; \
cin >> temp; \
arr[ai] = temp + arr[ai - 1]; \
}
#define indarr(y) \
ll(y); \
cin >> y; \
ll arr[y + 1]; \
inputarr(arr, y);
#define watch(x) cout << (#x) << " is " << (x) << endl
#define watcharrsz(x) \
cout << (#x) << " starts:\n"; \
for (ll ai = 0; ai < sz(x); ai++) { \
cout << x[ai] << " "; \
} \
cout << "\n" << (#x) << "ends\n";
#define watcharr(x, n) \
cout << (#x) << " starts:\n"; \
for (ll ai = 0; ai < n; ai++) { \
cout << x[ai] << " "; \
} \
cout << "\n" << (#x) << "ends\n";
#define watchg(x, n, y) \
cout << (#x) << " starts:\n"; \
for (ll ai = 0; ai <= n; ai++) { \
cout << (ai) << ":"; \
for (ll aj = 0; aj < x[ai].size(); aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n" << (#x) << "ends\n";
#define watch2darr(x, m, n, y) \
cout << (#x) << " starts:\n"; \
for (ll ai = 0; ai <= m; ai++) { \
cout << "i=" << (ai) << " "; \
for (ll aj = 0; aj <= n; aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n" << (#x) << "ends\n";
#define print(x, y) cout << (x) << y;
#define printarrsz(x, y) \
for (ll ai = 0; ai < sz(x); ai++) { \
cout << x[ai] << y; \
} \
cout << "\n";
#define printarr(x, n, y) \
for (ll ai = 0; ai < n; ai++) { \
cout << x[ai] << y; \
} \
cout << "\n";
#define print2darr(x, m, n, y) \
for (ll ai = 0; ai < m; ai++) { \
for (ll aj = 0; aj < n; aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n";
#define mod(x) = (x % m + m) % m;
const ll m = (ll)1e9 + 7;
const ll N = 3e6 + 5;
const ll INF = 1ll << 63;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef set<int> si;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<pii> vpii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef set<ll> sl;
typedef map<ll, ll> mll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<pll, vpll, greater<pll>> pqg;
/***************************Code Begins Here *****************************/
void solve() {
// Never use x,y here, try to use i,j in loops only
ind(n) ind(k);
ll a[n + 1];
inputarr(a, n);
ll dp[n + 1][k + 1];
memset(dp, 0, sizeof(dp));
rep(i, 1, n) { dp[i][0] = 1; }
rep(i, 1, k) {
if (i - a[1] - 1 < 0)
dp[1][i] = (dp[1][i - 1] + 1) % m;
else
dp[1][i] = dp[1][i - 1];
}
rep(i, 2, n) {
rep(j, 1, k) {
if (j - a[i] - 1 < 0)
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % m;
else
dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - a[i] - 1]) % m;
}
}
// watch2darr(dp,n,k," ");
if (k > 0) {
print((dp[n][k] - dp[n][k - 1] + m) % m, endl);
} else
print(dp[n][k], endl);
}
signed main() {
ios ll t = 1;
// cin>>t;
// #ifndef ONLINE_JUDGE
// time_t time_t1, time_t2;
// time_t1 = clock();
// #endif
while (t--)
solve();
// #ifndef ONLINE_JUDGE
// time_t2 = clock();
// cout << "time taken :" << time_t2 - time_t1 << endl;
// #endif
return 0;
} | [
"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 mul(int a, int b) { return 1LL * a * b % mod; }
int const N = 1e5 + 10;
/********************i**********************************/
void show(vector<int> a) {
for (auto b : a)
cout << b << " ";
cout << endl;
}
void solve() {
int n, k;
cin >> n >> k;
vector<int> dp(k + 5, 0);
dp[0] = 1;
for (int x = 0; x < n; x++) {
vector<int> sum(k + 5, 0);
sum[0] = dp[0];
for (int y = 1; y <= k + 2; y++)
sum[y] = add(sum[y - 1], dp[y]);
// show(sum);
int a1;
cin >> a1;
for (int y = 1; y <= k; y++) {
int a = 0;
if (y > a1)
a = sub(sum[y], sum[y - a1 - 1]);
else
a = sum[y];
dp[y] = a;
}
// show(dp);
}
if (k == 0) {
cout << 1 << "\n";
return;
}
cout << dp[k];
}
/******************************************************/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
t = 1;
// cin >> t;
while (t--) {
solve();
}
} | #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 mul(int a, int b) { return 1LL * a * b % mod; }
int const N = 1e5 + 10;
/********************i**********************************/
void show(vector<int> a) {
for (auto b : a)
cout << b << " ";
cout << endl;
}
void solve() {
int n, k;
cin >> n >> k;
vector<int> dp(k + 5, 0);
dp[0] = 1;
for (int x = 0; x < n; x++) {
vector<int> sum(k + 5, 0);
sum[0] = dp[0];
for (int y = 1; y <= k + 2; y++)
sum[y] = add(sum[y - 1], dp[y]);
// show(sum);
int a1;
cin >> a1;
for (int y = 1; y <= k; y++) {
int a = 0;
if (y > a1)
a = sub(sum[y], sum[y - a1 - 1]);
else
a = sum[y];
dp[y] = a;
}
// show(dp);
}
if (k == 0) {
cout << 1 << "\n";
return;
}
cout << dp[k];
}
/******************************************************/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
t = 1;
// cin >> t;
while (t--) {
solve();
}
} | [
"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 mul(int a, int b) { return 1LL * a * b % mod; }
int const N = 1e5 + 10;
/********************i**********************************/
void show(vector<int> a) {
for (auto b : a)
cout << b << " ";
cout << endl;
}
void solve() {
int n, k;
cin >> n >> k;
vector<int> dp(k + 5, 0);
dp[0] = 1;
for (int x = 0; x < n; x++) {
vector<int> sum(k + 5, 0);
sum[0] = dp[0];
for (int y = 1; y <= k + 2; y++)
sum[y] = add(sum[y - 1], dp[y]);
// show(sum);
int a1;
cin >> a1;
for (int y = 1; y <= k; y++) {
int a = 0;
if (y > a1)
a = sub(sum[y], sum[y - a1 - 1]);
else
a = sum[y];
dp[y] = a;
}
// show(dp);
}
cout << dp[k];
}
/******************************************************/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
t = 1;
// cin >> t;
while (t--) {
solve();
}
} | #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 mul(int a, int b) { return 1LL * a * b % mod; }
int const N = 1e5 + 10;
/********************i**********************************/
void show(vector<int> a) {
for (auto b : a)
cout << b << " ";
cout << endl;
}
void solve() {
int n, k;
cin >> n >> k;
vector<int> dp(k + 5, 0);
dp[0] = 1;
for (int x = 0; x < n; x++) {
vector<int> sum(k + 5, 0);
sum[0] = dp[0];
for (int y = 1; y <= k + 2; y++)
sum[y] = add(sum[y - 1], dp[y]);
// show(sum);
int a1;
cin >> a1;
for (int y = 1; y <= k; y++) {
int a = 0;
if (y > a1)
a = sub(sum[y], sum[y - a1 - 1]);
else
a = sum[y];
dp[y] = a;
}
// show(dp);
}
if (k == 0) {
cout << 1 << "\n";
return;
}
cout << dp[k];
}
/******************************************************/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
t = 1;
// cin >> t;
while (t--) {
solve();
}
} | [
"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
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int max(int a, int b) {
if (a > b)
return a;
return b;
}
int min(int a, int b) {
if (a < b)
return a;
return b;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int mod = 1e9 + 7;
int32_t main() {
// int n, k;
// cin>>n>>k;
// int a[n+1];
// for(int i=1;i<=n;i++){
// cin>>a[i];
// }
// //no of ways with k stones and upto ith person
// int dp[n+1][k+1];
// for(int i=0;i<=n;i++){
// dp[i][0] =1;
// }
// for(int i=1;i<=n;i++){
// for(int st = 1; st<=k; st++){
// int ans = 0;
// for(int v = 0; v<= a[i] && st - v >=0; v++){
// ans += dp[i-1][st - v];
// if(ans > mod)
// ans -= mod;
// }
// dp[i][st] = ans;
// }
// }
// cout<<dp[n][k]<<endl;
int n, k;
cin >> n >> k;
int a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[k + 1];
// 0 stones and 0 children initially so 1 way is nothin
dp[0] = 1;
// for more than 1 stones but no children there is no way
for (int i = 1; i <= k; i++)
dp[i] = 0;
// ex if we have 4 stone and the cap on the last person is 3
// dp[4] will appear in the foll terms dp[5] -- when last person eats 1
// dp[6] when last person eats 2
// dp[7] when last person eats 3
for (int c = 1; c <= n; c++) { // for each subsequent child
int lim = a[c]; // the last child can be awarded 1...lim candies
int temp[k + 2] = {0};
for (int st = 0; st <= k;
st++) { // we are seeing which stone influnces which answer
int lo = st + 1;
int hi = min(k, st + lim);
temp[lo] += (dp[st]);
if (temp[lo] > mod)
temp[lo] -= mod;
temp[hi + 1] -= (dp[st]);
temp[hi + 1] += mod;
if (temp[hi + 1] > mod)
temp[hi + 1] -= mod;
}
// prefix sum
int sum = 0;
for (int i = 0; i <= k; i++) {
sum += temp[i];
if (sum > mod)
sum -= mod;
dp[i] += sum;
if (dp[i] > mod)
dp[i] -= mod;
}
}
cout << dp[k] << endl;
}
| #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
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int max(int a, int b) {
if (a > b)
return a;
return b;
}
int min(int a, int b) {
if (a < b)
return a;
return b;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int mod = 1e9 + 7;
int32_t main() {
// int n, k;
// cin>>n>>k;
// int a[n+1];
// for(int i=1;i<=n;i++){
// cin>>a[i];
// }
// //no of ways with k stones and upto ith person
// int dp[n+1][k+1];
// for(int i=0;i<=n;i++){
// dp[i][0] =1;
// }
// for(int i=1;i<=n;i++){
// for(int st = 1; st<=k; st++){
// int ans = 0;
// for(int v = 0; v<= a[i] && st - v >=0; v++){
// ans += dp[i-1][st - v];
// if(ans > mod)
// ans -= mod;
// }
// dp[i][st] = ans;
// }
// }
// cout<<dp[n][k]<<endl;
int n, k;
cin >> n >> k;
int a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[k + 1];
// 0 stones and 0 children initially so 1 way is nothin
dp[0] = 1;
// for more than 1 stones but no children there is no way
for (int i = 1; i <= k; i++)
dp[i] = 0;
// ex if we have 4 stone and the cap on the last person is 3
// dp[4] will appear in the foll terms dp[5] -- when last person eats 1
// dp[6] when last person eats 2
// dp[7] when last person eats 3
for (int c = 1; c <= n; c++) { // for each subsequent child
int lim = a[c]; // the last child can be awarded 1...lim candies
int temp[k + 2] = {0};
for (int st = 0; st <= k;
st++) { // we are seeing which stone influnces which answer
int lo = st + 1;
int hi = min(k, st + lim);
temp[lo] += (dp[st]);
if (temp[lo] >= mod)
temp[lo] -= mod;
temp[hi + 1] -= (dp[st]);
temp[hi + 1] += mod;
if (temp[hi + 1] >= mod)
temp[hi + 1] -= mod;
}
// prefix sum
int sum = 0;
for (int i = 0; i <= k; i++) {
sum += temp[i];
if (sum >= mod)
sum -= mod;
dp[i] += sum;
if (dp[i] >= mod)
dp[i] -= mod;
}
}
cout << dp[k] << endl;
}
| [
"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++) {
vector<int> ps(k + 1, 0);
int cur = 0;
for (int u = 0; u <= k; u++) {
cur = (cur % mod + dp[i - 1][u] % mod);
ps[u] = cur % mod;
}
for (int j = 0; j <= k; j++) {
int idx = j - arr[i - 1] - 1;
if (idx < 0) {
dp[i][j] = ps[j] % mod;
} else {
dp[i][j] = (ps[j] - ps[idx]) % mod;
}
}
}
int res = dp[n][k];
cout << res << endl;
return 0;
} | #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++) {
vector<int> ps(k + 1, 0);
int cur = 0;
for (int u = 0; u <= k; u++) {
cur = (cur % mod + dp[i - 1][u] % mod);
ps[u] = cur % mod;
}
for (int j = 0; j <= k; j++) {
int idx = j - arr[i - 1] - 1;
if (idx < 0) {
dp[i][j] = ps[j] % mod;
} else {
dp[i][j] = (ps[j] - ps[idx] + mod) % mod;
}
}
}
int res = dp[n][k];
cout << res << endl;
return 0;
} | [
"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 <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define forn(i, a, b) for (int i = (a); i < ll(b); ++i)
#define fo(i, a) forn(i, 0, ll(a))
#define rforn(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define ro(i, a) rforn(i, 0, a)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rsz resize
#define ins insert
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define s second
ll mod = 1000000007;
inline int fast_expo(int base, int power, int modulo = mod) {
base %= modulo;
if (base < 0)
base += modulo;
ll x = base, cnt = power, ans = 1;
while (cnt) {
if (cnt & 1)
ans = (ans * x) % modulo;
x = (x * x) % modulo;
cnt >>= 1;
}
return ans;
}
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
const int INF = (int)1e9;
//=========================CODE STARTS HERE=============================//
int main() {
fast_cin();
ll n;
cin >> n;
vl arr(n);
ll k;
cin >> k;
fo(i, n) cin >> arr[i];
ll dp[n][k + 1];
dp[0][0] = 1;
ll pre[n][k + 1];
pre[0][0] = 1;
forn(i, 1, k + 1) {
if (i < arr[0] + 1) {
dp[0][i] = 1;
} else {
dp[0][i] = 0;
}
pre[0][i] = (pre[0][i - 1] + dp[0][i]) % mod;
}
fo(i, n) { dp[i][0] = 1; }
forn(i, 1, n) {
pre[i][0] = 1;
forn(j, 1, k + 1) {
if (j - arr[i] < 1) {
dp[i][j] = pre[i - 1][j] % mod;
} else {
dp[i][j] = (pre[i - 1][j] - pre[i - 1][j - arr[i] - 1]) % mod;
}
pre[i][j] = (pre[i][j - 1] + dp[i][j]) % mod;
}
}
cout << dp[n - 1][k] % mod << endl;
return 0;
}
| /*
* 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 <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define forn(i, a, b) for (int i = (a); i < ll(b); ++i)
#define fo(i, a) forn(i, 0, ll(a))
#define rforn(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define ro(i, a) rforn(i, 0, a)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rsz resize
#define ins insert
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define s second
ll mod = 1000000007;
inline int fast_expo(int base, int power, int modulo = mod) {
base %= modulo;
if (base < 0)
base += modulo;
ll x = base, cnt = power, ans = 1;
while (cnt) {
if (cnt & 1)
ans = (ans * x) % modulo;
x = (x * x) % modulo;
cnt >>= 1;
}
return ans;
}
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
const int INF = (int)1e9;
//=========================CODE STARTS HERE=============================//
int main() {
fast_cin();
ll n;
cin >> n;
vl arr(n);
ll k;
cin >> k;
fo(i, n) cin >> arr[i];
ll dp[n][k + 1];
dp[0][0] = 1;
ll pre[n][k + 1];
pre[0][0] = 1;
forn(i, 1, k + 1) {
if (i < arr[0] + 1) {
dp[0][i] = 1;
} else {
dp[0][i] = 0;
}
pre[0][i] = (pre[0][i - 1] + dp[0][i]);
}
fo(i, n) { dp[i][0] = 1; }
forn(i, 1, n) {
pre[i][0] = 1;
forn(j, 1, k + 1) {
if (j - arr[i] < 1) {
dp[i][j] = pre[i - 1][j] % mod;
} else {
dp[i][j] = (pre[i - 1][j] - pre[i - 1][j - arr[i] - 1]) % mod;
}
pre[i][j] = (pre[i][j - 1] + dp[i][j]);
}
}
cout << dp[n - 1][k] % mod << endl;
return 0;
}
| [
"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[i - 1];
for (int i = 1; i <= n; i++) {
int l = niz[i] + 1;
vector<ll> curr(k + 2, 0);
curr[0] = 1;
for (int j = 1; j <= k; j++) {
curr[j] = curr[j - 1];
curr[j] += dp[j];
if (j >= l)
curr[j] -= dp[j - l];
curr[j] %= mod;
if (curr[j] < 0)
curr[j] += mod;
}
dp = curr;
}
if (k == 0)
cout << 1 << endl;
else
cout << dp[k] - dp[k - 1] << endl;
}
| #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[i - 1];
for (int i = 1; i <= n; i++) {
int l = niz[i] + 1;
vector<ll> curr(k + 2, 0);
curr[0] = 1;
for (int j = 1; j <= k; j++) {
curr[j] = curr[j - 1];
curr[j] += dp[j];
if (j >= l)
curr[j] -= dp[j - l];
curr[j] %= mod;
if (curr[j] < 0)
curr[j] += mod;
}
dp = curr;
}
if (k == 0)
cout << 1 << endl;
else
cout << (dp[k] - dp[k - 1] + mod) % mod << endl;
}
| [
"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++)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MOD = 1e9 + 7;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1));
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
vector<ll> sum(k + 2);
rep(j, k + 1) sum[j + 1] = (sum[j] + dp[i - 1][j]) % MOD;
rep(j, k + 1) dp[i][j] = (sum[j + 1] - sum[max(0, j - a[i - 1])]) % MOD;
}
cout << dp[n][k] << endl;
return 0;
} | #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++)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MOD = 1e9 + 7;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1));
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
vector<ll> sum(k + 2);
rep(j, k + 1) sum[j + 1] = (sum[j] + dp[i - 1][j]) % MOD;
rep(j, k + 1) dp[i][j] =
(sum[j + 1] - sum[max(0, j - a[i - 1])] + MOD) % MOD;
}
cout << dp[n][k] << endl;
return 0;
} | [
"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;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(s.size()) - 1)
cout << endl;
else
cout << " ";
}
}
template <typename T> class BIT {
int sz;
public:
std::vector<T> node;
BIT(int sz) : sz(sz + 1), node(std::vector<T>(sz + 1, 0)) {}
void add(int idx, T val) {
++idx;
assert(0 < idx && idx < sz);
while (idx < sz) {
node[idx] += val;
node[idx] %= MOD;
idx += idx & -idx;
}
}
T sum(int idx) {
++idx;
assert(0 < idx && idx < sz);
T res = 0;
while (idx > 0) {
res += node[idx];
res %= MOD;
idx -= idx & -idx;
}
return res;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n, K;
cin >> n >> K;
vi a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
BIT<ll> bit(K + 1);
bit.add(K, 1);
// cout << sz << endl;
for (int i = 0; i < n; ++i) {
// printv(bit.node);
for (int j = 0; j < K; ++j) {
int l = j, r = j + a[i];
l = max(0, l);
r = min(K, r);
ll tmp = bit.sum(r) - bit.sum(l);
// cout << l << ":" << r << ":" << tmp << endl;
bit.add(j, tmp % MOD);
}
}
// printv(bit.node);
cout << bit.sum(0) << endl;
}
| #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;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(s.size()) - 1)
cout << endl;
else
cout << " ";
}
}
template <typename T> class BIT {
int sz;
public:
std::vector<T> node;
BIT(int sz) : sz(sz + 1), node(std::vector<T>(sz + 1, 0)) {}
void add(int idx, T val) {
++idx;
assert(0 < idx && idx < sz);
while (idx < sz) {
node[idx] += val;
node[idx] %= MOD;
idx += idx & -idx;
}
}
T sum(int idx) {
++idx;
assert(0 < idx && idx < sz);
T res = 0;
while (idx > 0) {
res += node[idx];
res %= MOD;
idx -= idx & -idx;
}
return res;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n, K;
cin >> n >> K;
vi a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
BIT<ll> bit(K + 1);
bit.add(K, 1);
// cout << sz << endl;
for (int i = 0; i < n; ++i) {
// printv(bit.node);
for (int j = 0; j < K; ++j) {
int l = j, r = j + a[i];
l = max(0, l);
r = min(K, r);
ll tmp = bit.sum(r) + MOD - bit.sum(l);
// cout << l << ":" << r << ":" << tmp << endl;
bit.add(j, tmp % MOD);
}
}
// printv(bit.node);
cout << bit.sum(0) << endl;
}
| [
"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] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
dp[i][j] =
(dp[i - 1][j] -
(j - a[i - 1] - 1 >= 0 ? dp[i - 1][j - a[i - 1] - 1] : 0) + mod) %
mod;
dp[i][j] = (j ? dp[i][j - 1] + dp[i][j] : dp[i][j]) % mod;
}
}
cout << dp[n][k] - (k ? dp[n][k - 1] : 0);
}
int main() {
cout << fixed << setprecision(20);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
| #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] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
dp[i][j] =
(dp[i - 1][j] -
(j - a[i - 1] - 1 >= 0 ? dp[i - 1][j - a[i - 1] - 1] : 0) + mod) %
mod;
dp[i][j] = (j ? dp[i][j - 1] + dp[i][j] : dp[i][j]) % mod;
}
}
cout << (dp[n][k] - (k ? dp[n][k - 1] : 0) + mod) % mod;
}
int main() {
cout << fixed << setprecision(20);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
| [
"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 bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e15;
const int INF = 1e9;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<vector<mint>> dp(n + 1, vector<mint>(k + 1, 0));
rep(i, n + 1) dp[i][0] = 1;
rep(i, n) rep(j, k + 1) {
dp[i + 1][j] = dp[i][j] + dp[i + 1][j - 1];
if (j - 1 >= a[i])
dp[i + 1][j] -= dp[i][j - 1 - a[i]];
}
cout << dp[n][k].x << endl;
} | #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 bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e15;
const int INF = 1e9;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<vector<mint>> dp(n + 1, vector<mint>(k + 1, 0));
rep(i, n + 1) dp[i][0] = 1;
rep(i, n) FOR(j, 1, k + 1) {
dp[i + 1][j] = dp[i][j] + dp[i + 1][j - 1];
if (j - 1 >= a[i])
dp[i + 1][j] -= dp[i][j - 1 - a[i]];
}
cout << dp[n][k].x << endl;
} | [
"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, vector<long long>(K + 1, -1));
vector<long long> a(N + 1);
for (long long i = 0; i < N; i++) {
cin >> a[i + 1];
}
for (long long i = 0; i < K + 1; i++) {
if (a[1] >= i)
dp[1][i] = i + 1;
else
dp[1][i] = a[1] + 1;
}
for (long long i = 2; i < N + 1; i++) {
dp[i][0] = 1;
for (long long j = 1; j < K + 1; j++) {
if (j > a[i])
dp[i][j] = dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - a[i] - 1];
else
dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
dp[i][j] %= 1000000007;
}
}
if (dp[N][K] < 0) {
dp[N][K] += (long long)10 * 1000000007;
dp[N][K] %= 1000000007;
}
long long res = dp[N][K] - dp[N][K - 1];
if (res < 0) {
res += (long long)10 * 1000000007;
res %= 1000000007;
}
if (K > 0) {
cout << res;
return 0;
}
cout << dp[N][K];
cout << endl;
}
| #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, vector<long long>(K + 1, -1));
vector<long long> a(N + 1);
for (long long i = 0; i < N; i++) {
cin >> a[i + 1];
}
for (long long i = 0; i < K + 1; i++) {
if (a[1] >= i)
dp[1][i] = i + 1;
else
dp[1][i] = a[1] + 1;
}
for (long long i = 2; i < N + 1; i++) {
dp[i][0] = 1;
for (long long j = 1; j < K + 1; j++) {
if (j > a[i])
dp[i][j] = dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - a[i] - 1];
else
dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
dp[i][j] %= 1000000007;
}
}
if (dp[N][K] < 0) {
dp[N][K] += (long long)10 * 1000000007;
}
dp[N][K] %= 1000000007;
long long res = dp[N][K] - dp[N][K - 1];
if (res < 0) {
res += (long long)10 * 1000000007;
}
res %= 1000000007;
if (K > 0) {
cout << res;
return 0;
}
cout << dp[N][K];
cout << endl;
}
| [] | 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 namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
#define PI 3.141592653589793
int main() {
int N, K;
cin >> N >> K;
int dp[N + 1][K + 1] = {};
int a[N];
rep(i, N) { cin >> a[i]; }
dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
int cum[K + 1] = {0};
rep(j, K + 1) { cum[j + 1] = (cum[j] + dp[i - 1][j]) % mod; }
rep(j, K + 1) {
dp[i][j] += (cum[j + 1] - cum[max(0, j - a[i - 1])]);
dp[i][j] %= mod;
}
}
cout << dp[N][K] << endl;
} | #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 namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
#define PI 3.141592653589793
int main() {
int N, K;
cin >> N >> K;
int dp[N + 1][K + 1] = {};
int a[N];
rep(i, N) { cin >> a[i]; }
dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
int cum[K + 1] = {0};
rep(j, K + 1) { cum[j + 1] = (cum[j] + dp[i - 1][j]) % mod; }
rep(j, K + 1) {
dp[i][j] += (cum[j + 1] - cum[max(0, j - a[i - 1])] + mod) % mod;
dp[i][j] %= mod;
}
}
cout << dp[N][K] << endl;
} | [
"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(N);
REP(i, N) cin >> a[i];
vector<vector<int>> dp(N + 1, vector<int>(K + 1, 0));
vector<vector<int>> dp_sum(N + 1, vector<int>(K + 1, 0));
dp[0][0] = 1;
REP(j, K + 1) dp_sum[0][j] = 1;
REP(i, N + 1) dp_sum[i][0] = 1;
REP(i, N) REP(j, K + 1) {
if (a[i] >= j) {
dp[i + 1][j] = dp_sum[i][j];
if (j)
dp_sum[i + 1][j] = (dp_sum[i + 1][j - 1] + dp[i + 1][j]) % MOD;
} else {
dp[i + 1][j] = dp_sum[i][j] - dp_sum[i][j - a[i] - 1];
dp_sum[i + 1][j] = (dp_sum[i + 1][j - 1] + dp[i + 1][j]) % MOD;
}
}
cout << dp[N][K] << endl;
return 0;
} | #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(N);
REP(i, N) cin >> a[i];
vector<vector<int>> dp(N + 1, vector<int>(K + 1, 0));
vector<vector<int>> dp_sum(N + 1, vector<int>(K + 1, 0));
dp[0][0] = 1;
REP(j, K + 1) dp_sum[0][j] = 1;
REP(i, N + 1) dp_sum[i][0] = 1;
REP(i, N) REP(j, K + 1) {
if (a[i] >= j) {
dp[i + 1][j] = dp_sum[i][j];
if (j)
dp_sum[i + 1][j] = (dp_sum[i + 1][j - 1] + dp[i + 1][j]) % MOD;
} else {
dp[i + 1][j] = (MOD + dp_sum[i][j] - dp_sum[i][j - a[i] - 1]) % MOD;
dp_sum[i + 1][j] = (dp_sum[i + 1][j - 1] + dp[i + 1][j]) % MOD;
}
}
cout << dp[N][K] << endl;
return 0;
} | [
"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;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll divceil(ll A, ll B) { return (A + (B - 1)) / B; }
ll myctoi(char C) { return C - '0'; }
char myitoc(ll N) { return '0' + N; }
#define FINALANS(A) \
{ \
cout << (A) << '\n'; \
exit(0); \
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<vector<ll>> dp(N + 10, vector<ll>(K + 10, 0));
dp.at(0).at(0) = 1, dp.at(0).at(1) = -1;
for (ll i = 0; i <= N; i++) {
for (ll j = 0; j <= K; j++) {
if (i != N) {
dp.at(i + 1).at(j) += dp.at(i).at(j);
dp.at(i + 1).at(j) %= MOD;
if (j + A.at(i) + 1 <= K) {
dp.at(i + 1).at(j + A.at(i) + 1) -= dp.at(i).at(j);
dp.at(i + 1).at(j + A.at(i) + 1) %= MOD;
}
}
if (j != K) {
dp.at(i).at(j + 1) += dp.at(i).at(j);
dp.at(i).at(j + 1) %= MOD;
}
}
}
/*
for (ll i = 0; i < N + 1; i++)
{
for (ll j = 0; j < K + 1; j++)
{
cerr << dp.at(i).at(j) << " ";
}
cerr << endl;
}
*/
ll ans = dp.at(N).at(K);
cout << ans << endl;
} | #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;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll divceil(ll A, ll B) { return (A + (B - 1)) / B; }
ll myctoi(char C) { return C - '0'; }
char myitoc(ll N) { return '0' + N; }
#define FINALANS(A) \
{ \
cout << (A) << '\n'; \
exit(0); \
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<vector<ll>> dp(N + 10, vector<ll>(K + 10, 0));
dp.at(0).at(0) = 1, dp.at(0).at(1) = -1;
for (ll i = 0; i <= N; i++) {
for (ll j = 0; j <= K; j++) {
if (i != N) {
dp.at(i + 1).at(j) += dp.at(i).at(j);
dp.at(i + 1).at(j) %= MOD;
if (j + A.at(i) + 1 <= K) {
dp.at(i + 1).at(j + A.at(i) + 1) += MOD - dp.at(i).at(j);
dp.at(i + 1).at(j + A.at(i) + 1) %= MOD;
}
}
if (j != K) {
dp.at(i).at(j + 1) += dp.at(i).at(j);
dp.at(i).at(j + 1) %= MOD;
}
}
}
/*
for (ll i = 0; i < N + 1; i++)
{
for (ll j = 0; j < K + 1; j++)
{
cerr << dp.at(i).at(j) << " ";
}
cerr << endl;
}
*/
ll ans = dp.at(N).at(K);
cout << ans << endl;
} | [
"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 <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eps (1e-9)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef tuple<int, int, int> tiii;
const long long mod = 1000000007;
template <typename T> void max_self(T &a, T b) { a = max(a, b); }
template <typename T> void add_self(T &a, T b) {
a += b;
if (a > mod)
a -= mod;
}
template <typename T> void sub_self(T &a, T b) {
a -= b;
if (a < 0)
a += mod;
}
// dp[i][j] - number of ways to distribute i candies to j kids
int main() {
#ifdef LOCAL_MACHINE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << setprecision(18) << fixed;
int n, k;
cin >> n >> k;
vll dp(k + 1, 0);
dp[0] = 1;
for (int child = 0; child < n; child++) {
int up_to;
cin >> up_to;
vll fake(k + 1);
for (int used = k; used >= 0; used--) {
ll tmp = dp[used];
ll left = used + 1LL;
ll right = min((ll)up_to, k - (ll)used) + used;
if (left <= right) {
add_self(fake[left], tmp);
if (right < sz(fake) - 1)
sub_self(fake[right + 1], tmp);
}
}
ll cur_sum = 0;
for (int i = 0; i < sz(fake); i++) {
add_self(cur_sum, fake[i]);
add_self(dp[i], cur_sum);
}
}
cout << dp[k];
return 0;
} | #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 <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eps (1e-9)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef tuple<int, int, int> tiii;
const long long mod = 1000000007;
template <typename T> void max_self(T &a, T b) { a = max(a, b); }
template <typename T> void add_self(T &a, T b) {
a += b;
if (a >= mod)
a -= mod;
}
template <typename T> void sub_self(T &a, T b) {
a -= b;
if (a < 0)
a += mod;
}
// dp[i][j] - number of ways to distribute i candies to j kids
int main() {
#ifdef LOCAL_MACHINE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << setprecision(18) << fixed;
int n, k;
cin >> n >> k;
vll dp(k + 1, 0);
dp[0] = 1;
for (int child = 0; child < n; child++) {
int up_to;
cin >> up_to;
vll fake(k + 1);
for (int used = k; used >= 0; used--) {
ll tmp = dp[used];
ll left = used + 1LL;
ll right = min((ll)up_to, k - (ll)used) + used;
if (left <= right) {
add_self(fake[left], tmp);
if (right < sz(fake) - 1)
sub_self(fake[right + 1], tmp);
}
}
ll cur_sum = 0;
for (int i = 0; i < sz(fake); i++) {
add_self(cur_sum, fake[i]);
add_self(dp[i], cur_sum);
}
}
cout << dp[k];
return 0;
} | [
"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>
#include <utility>
#include <vector>
#define whlie while
#define mp make_pair
#define pb emplace_back
#define fi first
#define se second
#define inf 1001001001
#define infLL ((1LL << 61))
#define MOD 1000000007
#define FOR(i, a, b) for (int(i) = ((int)a); (i) < ((int)b); (i)++) // [a,b)
#define rep(i, N) FOR((i), 0, ((int)N)) // [0,N)
#define FORR(i, a, b) for (int(i) = ((int)b) - 1; (i) >= ((int)a); (i)--)
#define repr(i, N) FORR((i), 0, ((int)N))
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define vrep(v, it) for (auto it = v.begin(); it != v.end(); it++)
#define vrepr(v, it) for (auto it = v.rbegin(); it != v.rend(); it++)
#define inx(t, ...) \
t __VA_ARGS__; \
in(__VA_ARGS__)
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define inpii(...) \
pii __VA_ARGS__; \
in(__VA_ARGS__)
#define invi(v, ...) \
vi v; \
in(v, ##__VA_ARGS__)
#define invl(v, ...) \
vl v; \
in(v, ##__VA_ARGS__)
#define mem(ar, val) memset((ar), (val), sizeof(ar))
#define mem0(ar) memset((ar), 0, sizeof(ar))
#define mem1(ar) memset((ar), -1, sizeof(ar))
#ifdef LOCAL
#define dbg(...) fprintf(stderr, __VA_ARGS__)
#define trc(...) \
do { \
cout << #__VA_ARGS__ << " = "; \
dbg_out(__VA_ARGS__); \
} while (0)
#define stopif(val) assert(!(val))
#define vdbg(v, ...) \
do { \
cout << #v << " = "; \
vector_debug(v, ##__VA_ARGS__); \
} while (0)
#else
#define dbg(...) 1
#define trc(...) 1
#define stopif(...) 1
#define vdbg(...) 1
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vector<int>> vvi;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(15);
}
} iosetup;
int gcd(int a, int b) {
if (a > b)
swap(a, b);
return a == 0 ? b : gcd(b % a, a);
}
ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
return a == 0 ? b : gcd(b % a, a);
}
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
inline ll pow(int a, int b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(ll a, ll b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(int a, ll b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(ll a, int b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
template <typename T, typename U> inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U> inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename C> inline void _cin(C &c) { cin >> c; }
template <typename T, typename U> inline void _cin(pair<T, U> &p) {
cin >> p.fi;
cin >> p.se;
}
template <typename C> inline void _cout(const C &c) { cout << c; }
template <typename T, typename U> inline void _cout(const pair<T, U> &p) {
cout << p.fi << ' ' << p.se;
}
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
_cin(t);
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, U... u) {
_cout(t);
if (sizeof...(u))
cout << ' ';
out(u...);
}
template <typename C> inline void in(vector<C> &v, int N = -1) {
if (sz(v) != 0) {
int M = (N == -1) ? sz(v) : N;
rep(i, M) _cin(v[i]);
} else {
C c;
rep(i, N) v.pb((_cin(c), c));
}
}
template <typename C> inline void in(C v[], int N) { rep(i, N) _cin(v[i]); }
template <typename C> inline void out(const vector<C> &v, int N = -1) {
int M = (N == -1) ? sz(v) : N;
rep(i, M) {
cout << ((i) ? " " : "");
_cout(v[i]);
}
cout << "\n";
}
template <typename C> inline void out(C v[], int N) {
rep(i, N) {
cout << ((i) ? " " : "");
_cout(v[i]);
}
cout << "\n";
}
template <typename C> inline void vector_debug(const vector<C> &v, int N = -1) {
cout << "{";
int M = (N == -1) ? sz(v) : N;
rep(i, M) {
cout << ((i) ? ", " : "");
_cout(v[i]);
}
cout << "}" << endl;
}
template <typename C> inline void vector_debug(C v[], int N) {
cout << "{";
rep(i, N) {
cout << ((i) ? ", " : "");
_cout(*(v + i));
}
cout << "}" << endl;
}
void dbg_out() { cout << endl; }
template <typename T, class... U> void dbg_out(const T &t, U... u) {
_cout(t);
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C, class... U> void dbg_out(const vector<C> &v, U... u) {
vector_debug(v);
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C, class... U>
void dbg_out(const vector<vector<C>> &v, U... u) {
cout << "{ ";
rep(i, sz(v)) {
if (i)
cout << ", ";
vector_debug(v[i]);
}
cout << " }";
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C> inline C vmax(const vector<C> &v) {
C n = v[0];
rep(i, sz(v)) amax(n, v[i]);
return n;
}
template <typename C> inline C vmax(C v[], int N) {
C n = v[0];
rep(i, N) amax(n, v[i]);
return n;
}
template <typename C> inline C vmin(const vector<C> &v) {
C n = v[0];
rep(i, sz(v)) amin(n, v[i]);
return n;
}
template <typename C> inline C vmin(C v[], int N) {
C n = v[0];
rep(i, N) amin(n, v[i]);
return n;
}
template <typename C> inline C vsum(const vector<C> &v) {
C n = 0;
rep(i, sz(v)) n += v[i];
return n;
}
template <typename C> inline C vsum(C v[], int N) {
C n = 0;
rep(i, N) n += v[i];
return n;
}
////////////
/// main ///
////////////
template <typename T> struct BinaryIndexedTree {
vector<T> data;
BinaryIndexedTree(int sz) { data.assign(++sz, 0); }
T sum(int k) {
T ret = 0;
for (++k; k > 0; k -= k & -k)
ret += data[k];
return (ret);
}
void add(int k, T x) {
for (++k; k < data.size(); k += k & -k)
data[k] += x;
}
};
int main() {
ini(N, K);
vi a(N);
in(a, N);
if (K == 0) {
out(1);
exit(0);
}
BinaryIndexedTree<ll> bit(K + 10);
bit.add(0, 1);
rep(i, N) {
repr(j, K + 1) {
if (j == 0)
continue;
ll add = bit.sum(j - 1);
add -= j - a[i] > 0 ? bit.sum(j - a[i] - 1) : 0;
add %= MOD;
// trc(i,j,add);
bit.add(j, add);
}
}
out(bit.sum(K) - bit.sum(K - 1));
}
| #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>
#include <utility>
#include <vector>
#define whlie while
#define mp make_pair
#define pb emplace_back
#define fi first
#define se second
#define inf 1001001001
#define infLL ((1LL << 61))
#define MOD 1000000007
#define FOR(i, a, b) for (int(i) = ((int)a); (i) < ((int)b); (i)++) // [a,b)
#define rep(i, N) FOR((i), 0, ((int)N)) // [0,N)
#define FORR(i, a, b) for (int(i) = ((int)b) - 1; (i) >= ((int)a); (i)--)
#define repr(i, N) FORR((i), 0, ((int)N))
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define vrep(v, it) for (auto it = v.begin(); it != v.end(); it++)
#define vrepr(v, it) for (auto it = v.rbegin(); it != v.rend(); it++)
#define inx(t, ...) \
t __VA_ARGS__; \
in(__VA_ARGS__)
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define inpii(...) \
pii __VA_ARGS__; \
in(__VA_ARGS__)
#define invi(v, ...) \
vi v; \
in(v, ##__VA_ARGS__)
#define invl(v, ...) \
vl v; \
in(v, ##__VA_ARGS__)
#define mem(ar, val) memset((ar), (val), sizeof(ar))
#define mem0(ar) memset((ar), 0, sizeof(ar))
#define mem1(ar) memset((ar), -1, sizeof(ar))
#ifdef LOCAL
#define dbg(...) fprintf(stderr, __VA_ARGS__)
#define trc(...) \
do { \
cout << #__VA_ARGS__ << " = "; \
dbg_out(__VA_ARGS__); \
} while (0)
#define stopif(val) assert(!(val))
#define vdbg(v, ...) \
do { \
cout << #v << " = "; \
vector_debug(v, ##__VA_ARGS__); \
} while (0)
#else
#define dbg(...) 1
#define trc(...) 1
#define stopif(...) 1
#define vdbg(...) 1
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vector<int>> vvi;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(15);
}
} iosetup;
int gcd(int a, int b) {
if (a > b)
swap(a, b);
return a == 0 ? b : gcd(b % a, a);
}
ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
return a == 0 ? b : gcd(b % a, a);
}
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
inline ll pow(int a, int b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(ll a, ll b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(int a, ll b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(ll a, int b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
template <typename T, typename U> inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U> inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename C> inline void _cin(C &c) { cin >> c; }
template <typename T, typename U> inline void _cin(pair<T, U> &p) {
cin >> p.fi;
cin >> p.se;
}
template <typename C> inline void _cout(const C &c) { cout << c; }
template <typename T, typename U> inline void _cout(const pair<T, U> &p) {
cout << p.fi << ' ' << p.se;
}
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
_cin(t);
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, U... u) {
_cout(t);
if (sizeof...(u))
cout << ' ';
out(u...);
}
template <typename C> inline void in(vector<C> &v, int N = -1) {
if (sz(v) != 0) {
int M = (N == -1) ? sz(v) : N;
rep(i, M) _cin(v[i]);
} else {
C c;
rep(i, N) v.pb((_cin(c), c));
}
}
template <typename C> inline void in(C v[], int N) { rep(i, N) _cin(v[i]); }
template <typename C> inline void out(const vector<C> &v, int N = -1) {
int M = (N == -1) ? sz(v) : N;
rep(i, M) {
cout << ((i) ? " " : "");
_cout(v[i]);
}
cout << "\n";
}
template <typename C> inline void out(C v[], int N) {
rep(i, N) {
cout << ((i) ? " " : "");
_cout(v[i]);
}
cout << "\n";
}
template <typename C> inline void vector_debug(const vector<C> &v, int N = -1) {
cout << "{";
int M = (N == -1) ? sz(v) : N;
rep(i, M) {
cout << ((i) ? ", " : "");
_cout(v[i]);
}
cout << "}" << endl;
}
template <typename C> inline void vector_debug(C v[], int N) {
cout << "{";
rep(i, N) {
cout << ((i) ? ", " : "");
_cout(*(v + i));
}
cout << "}" << endl;
}
void dbg_out() { cout << endl; }
template <typename T, class... U> void dbg_out(const T &t, U... u) {
_cout(t);
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C, class... U> void dbg_out(const vector<C> &v, U... u) {
vector_debug(v);
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C, class... U>
void dbg_out(const vector<vector<C>> &v, U... u) {
cout << "{ ";
rep(i, sz(v)) {
if (i)
cout << ", ";
vector_debug(v[i]);
}
cout << " }";
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C> inline C vmax(const vector<C> &v) {
C n = v[0];
rep(i, sz(v)) amax(n, v[i]);
return n;
}
template <typename C> inline C vmax(C v[], int N) {
C n = v[0];
rep(i, N) amax(n, v[i]);
return n;
}
template <typename C> inline C vmin(const vector<C> &v) {
C n = v[0];
rep(i, sz(v)) amin(n, v[i]);
return n;
}
template <typename C> inline C vmin(C v[], int N) {
C n = v[0];
rep(i, N) amin(n, v[i]);
return n;
}
template <typename C> inline C vsum(const vector<C> &v) {
C n = 0;
rep(i, sz(v)) n += v[i];
return n;
}
template <typename C> inline C vsum(C v[], int N) {
C n = 0;
rep(i, N) n += v[i];
return n;
}
////////////
/// main ///
////////////
template <typename T> struct BinaryIndexedTree {
vector<T> data;
BinaryIndexedTree(int sz) { data.assign(++sz, 0); }
T sum(int k) {
T ret = 0;
for (++k; k > 0; k -= k & -k)
ret += data[k];
return (ret);
}
void add(int k, T x) {
for (++k; k < data.size(); k += k & -k)
data[k] += x;
}
};
int main() {
ini(N, K);
vi a(N);
in(a, N);
if (K == 0) {
out(1);
exit(0);
}
BinaryIndexedTree<ll> bit(K + 10);
bit.add(0, 1);
rep(i, N) {
repr(j, K + 1) {
if (j == 0)
continue;
ll add = bit.sum(j - 1);
add -= j - a[i] > 0 ? bit.sum(j - a[i] - 1) : 0;
add %= MOD;
// trc(i,j,add);
bit.add(j, add);
}
}
out((bit.sum(K) - bit.sum(K - 1)) % MOD);
}
| [
"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 amongst i children.
// dp[i][j] += dp[i-1][j-k] for every k ith child can eat.
ll dp[n + 1][k + 1];
ll prefix_sum[k + 2] = {0};
fill(*dp, *dp + (n + 1) * (k + 1), 0);
for (int i = 0; i <= n; ++i)
dp[i][0] = 1;
for (int child = 1; child <= n; ++child) {
for (ll i = 1; i <= k + 1; ++i)
prefix_sum[i] = (prefix_sum[i - 1] + dp[child - 1][i - 1]) % MOD;
for (ll c_dist = 1; c_dist <= k; ++c_dist)
dp[child][c_dist] = prefix_sum[c_dist + 1] -
prefix_sum[c_dist - min(arr[child - 1], c_dist)];
}
cout << dp[n][k];
return 0;
}
| #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 amongst i children.
// dp[i][j] += dp[i-1][j-k] for every k ith child can eat.
ll dp[n + 1][k + 1];
ll prefix_sum[k + 2] = {0};
fill(*dp, *dp + (n + 1) * (k + 1), 0);
for (int i = 0; i <= n; ++i)
dp[i][0] = 1;
for (int child = 1; child <= n; ++child) {
for (ll i = 1; i <= k + 1; ++i)
prefix_sum[i] = (prefix_sum[i - 1] + dp[child - 1][i - 1]) % MOD;
for (ll c_dist = 1; c_dist <= k; ++c_dist)
dp[child][c_dist] =
(prefix_sum[c_dist + 1] -
prefix_sum[c_dist - min(arr[child - 1], c_dist)] + MOD) %
MOD;
}
cout << dp[n][k];
return 0;
}
| [
"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] = (bd[i][j + 1] - bd[i - 1][j + a + 1] + bd[i - 1][j]) % M;
// cout << bd[i][j] << ' ';
}
// cout << "\n";
}
cout << bd[n][0] << "\n";
} | #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] = (bd[i][j + 1] - bd[i - 1][j + a + 1] + bd[i - 1][j] + M) % M;
}
}
cout << bd[n][0] << "\n";
} | [
"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.