Problem:
整数の和 II
0 から 100 の数字から異なる
n
個の数を取り出して合計が
s
となる組み合わせの数を出力するプログラムを作成してください。
n
個の数はおのおの 0 から 100 までとし、１つの組み合わせに同じ数字は使えません。たとえば、
n
が 3 で
s
が6 のとき、3 個の数字の合計が 6 になる組み合わせは、
1 + 2 + 3 = 6
0 + 1 + 5 = 6
0 + 2 + 4 = 6
の 3 通りとなります。
Input
複数のデータセットが与えられます。各データセットに
n
( 1 ≤
n
≤ 9 ) と
s
( 0 ≤
s
≤ 1000 ) が１つのスペースで区切られて１行に与えられます。
n
と
s
が共に 0 のとき入力の最後とします。
データセットの数は 50 を超えません。
Output
各データセットに対して、
n
個の整数の和が
s
になる組み合わせの数を１行に出力して下さい。
組み合わせの数が 10
10
を超える入力は与えられません。
Sample Input
3 6
3 1
0 0
Output for the Sample Input
3
0

Submitted solutions:

code_snippet: #pragma region Macros

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")

#include <bits/extc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using namespace __gnu_pbds;

// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;
// using Bdouble = mp::number<mp::cpp_dec_float<256>>;
// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32
// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }

#define pb emplace_back
#define int ll
#define endl '\n'
// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> 

#define sqrt __builtin_sqrtl
#define cbrt __builtin_cbrtl
#define hypot __builtin_hypotl

#define next asdnext
#define prev asdprev

using ll = long long;
using ld = long double;
const ld PI = acosl(-1);
const int INF = 1 << 30;
const ll INFL = 1LL << 61;
// const int MOD = 998244353;
const int MOD = 1000000007;

const ld EPS = 1e-10;
const bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }

const vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗
const vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};

struct Edge {
    int from, to, cost;
    Edge() : from(-1), to(-1), cost(-1) {}
    Edge(int to, int cost) : to(to), cost(cost) {}
    Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}
    bool operator ==(const Edge& e) {
        return this->from == e.from && this->to == e.to && this->cost == e.cost;
    }
    bool operator !=(const Edge& e) {
        return this->from != e.from or this->to != e.to or this->cost != e.cost;
    }
};

chrono::system_clock::time_point start;
__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    start = chrono::system_clock::now();
}

random_device seed_gen;
mt19937_64 rng(seed_gen());
uniform_int_distribution<int> dist_x(0, 1e9);
struct RNG {
    unsigned Int(unsigned l, unsigned r) {
        return dist_x(rng) % (r - l + 1) + l;
    }
    ld Double() {
        return ld(dist_x(rng)) / 1e9;
    }
} rnd;

using i64 = ll;
// using i64 = uint64_t;
// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)
i64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }
i64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可
i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }

i64 popcount(i64 x) { return __builtin_popcountll(x); }
i64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }
i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }
i64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }
bool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }

i64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)
i64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)
// i64 next_bit(i64 x, i64 k) { return 0; }
// i64 prev_bit(i64 x, i64 k) { return 0; }
// i64 kth_bit(i64 x, i64 k) { return 0; }
i64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask
i64 LSB(i64 x) { return (x & -x); } // mask

i64 countl_zero(i64 x) { return __builtin_clzll(x); }
i64 countl_one(i64 x) {
    i64 ret = 0, k = 63 - __builtin_clzll(x);
    while (k != -1 && (x & (1LL << k))) { k--; ret++; }
    return ret;
}
i64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意
i64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }

i64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }
i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ
i64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }
i64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }

i64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意
    i64 w = bit_width(x); k %= w;
    return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);
}
// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}
i64 rotr(i64 x, i64 k) {
    i64 w = bit_width(x); k %= w;
    return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);
}
// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}
i64 bit_reverse(i64 x) { // 有効bit内で左右反転
    i64 r = 0, w = bit_width(x);
    for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);
    return r;
}
// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }

bool is_palindrome(i64 x) { return x == bit_reverse(x); }
bool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }
i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意
i64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット

i64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }
i64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }
i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }
i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数
i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数

i64 next_combination(i64 x) {
    i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));
}


__int128_t POW(__int128_t x, int n) {
    __int128_t ret = 1;
    assert(n >= 0);
    if (x == 1 or n == 0) ret = 1;
    else if (x == -1 && n % 2 == 0) ret = 1; 
    else if (x == -1) ret = -1; 
    else if (n % 2 == 0) {
        assert(x < INFL);
        ret = POW(x * x, n / 2);
    } else {
        assert(x < INFL);
        ret = x * POW(x, n - 1);
    }
    return ret;
}
int per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq
    assert(y != 0);
    if (x >= 0 && y > 0) return x / y;
    if (x >= 0 && y < 0) return x / y - (x % y < 0);
    if (x < 0 && y < 0) return x / y + (x % y < 0);
    return x / y - (x % y < 0); //  (x < 0 && y > 0) 
}
int mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr
    assert(y != 0);
    if (x >= 0) return x % y;
    __int128_t ret = x % y; // (x < 0)
    ret += (__int128_t)abs(y) * INFL;
    ret %= abs(y);
    return ret;
}
int floor(int x, int y) { // (ld)x / y 以下の最大の整数
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return x >= 0 ? x / y : (x + 1) / y - 1;
}
int ceil(int x, int y) { // (ld)x / y 以上の最小の整数
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return x > 0 ? (x - 1) / y + 1 : x / y;
}
int round(int x, int y) {
    assert(y != 0);
    return (x * 2 + y) / (y * 2);
}
int round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入
    assert(y != 0); // TODO
    return INF;
}
int round2(int x, int y) { // 五捨五超入 // 未verify
    assert(y != 0);
    if (y < 0) y = -y, x = -x;
    int z = z / y;
    if ((z * 2 + 1) * y <= y * 2) z++;
    return z;
}
// int round(ld x, int k) { // xを10^kの位に関して四捨五入
// }
// int floor(ld x, int k) { // xを10^kの位に関してflooring
// }
// int ceil(ld x, int k) { // xを10^kの位に関してceiling
// }
// int kth(int x, int y, int k) { // x / yの10^kの位の桁
// }
int floor(ld x, ld y) { // 誤差対策TODO
    assert(!equals(y, 0));
    return floor(x / y);
    // floor(x) = ceil(x - 1) という話も
}
int ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい
    assert(!equals(y, 0));
    return ceil(x / y);
    // ceil(x) = floor(x + 1)
}
int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q
    // 未verify. 誤差対策TODO. EPS外してもいいかも。
    assert(!equals(y, 0));
    if (x >= 0 && y > 0) return floor(x / y)+EPS;
    if (x >= 0 && y < 0) return -floor(x / fabs(y));
    if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);
    return floor(x / y) - (x - floor(x/y)*y < -EPS); //  (x < 0 && y > 0) 
}
ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r
    // 未verify. 誤差対策TODO. -0.0が返りうる。
    assert(!equals(y, 0));
    if (x >= 0) return x - fabs(y)*fabs(per(x, y));
    return x - fabs(y)*floor(x, fabs(y));
}
int seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO
int modf(ld x) {
	if (x < 0) return ceill(x);
	else return floorl(x);
}
// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?
int seisuu(int x, int y) {
    assert(y != 0);
    return x / y;
}
int seisuu(ld x, ld y) { // 誤差対策TODO
    assert(!equals(y, 0));
    return (int)(x / y);
}

template <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {
    if (a.first > b.first or a.first == b.first && a.second > b.second) return a;
    return b;
}
template <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {
    if (a.first < b.first or a.first == b.first && a.second < b.second) return a;
    return b;
}

template <class T> bool chmax(T &a, const T& b) {
    if (a < b) { a = b; return true; } return false;
}
template <class T> bool chmin(T &a, const T& b) {
    if (a > b) { a = b; return true; } return false;
}
template <class T> T mid(T a, T b, T c) { // 誤差対策TODO
    return a + b + c - max({a, b, c}) - min({a, b, c});
}
template <class T> void Sort(T &a, T &b, bool rev = false) { 
    if (rev == false) {  // TODO テンプレート引数
        if (a > b) swap(a, b);
    } else {
        if (b > a) swap(b, a);
    }
}
template <class T> void sort(T &a, T &b, T &c, bool rev = false) {
    if (rev == false) { 
        if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);
    } else {
        if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);
    }
}
template <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {
    if (rev == false) { 
        if (a > b) swap(a, b); if (a > c) swap(a, c);  if (a > d) swap(a, d);
        if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);
    } else {
        if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);
        if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);
    }
}

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

class Compress {
public:
    int sz = 0;
    // gp_hash_table<int, int, custom_hash> Z, UZ;
    unordered_map<int, int> Z;    // 元の値 -> 圧縮した値
    unordered_map<int, int> UZ;   // 圧縮した値 -> 元の値

    Compress(const vector<int> &V, int base = 0) {
        this->sz = base;
        set<int> s(V.begin(), V.end());

        for (int x : s) {
            this->Z[x] = this->sz;
            this->UZ[this->sz] = x;
            this->sz++;
        }
    }
    
    Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {
        this->sz = base;
        vector<int> V3 = V2;
        V3.insert(V3.end(), V1.begin(), V1.end());
        set<int> s(V3.begin(), V3.end());

        for (int x : s) {
            this->Z[x] = this->sz;
            this->UZ[this->sz] = x;
            this->sz++;
        }
    }

    Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {
        this->sz = base;
        vector<int> V4 = V1;
        V4.insert(V4.end(), V2.begin(), V2.end());
        V4.insert(V4.end(), V3.begin(), V3.end());
        set<int> s(V4.begin(), V4.end());

        for (int x : s) {
            this->Z[x] = this->sz;
            this->UZ[this->sz] = x;
            this->sz++;
        }
    }

    Compress(const vector<int> &V1, const vector<int> &V2,
            const vector<int> &V3, const vector<int> &V4, int base = 0) {
        this->sz = base;
        vector<int> V5 = V1;
        V5.insert(V5.end(), V2.begin(), V2.end());
        V5.insert(V5.end(), V3.begin(), V3.end());
        V5.insert(V5.end(), V4.begin(), V4.end());
        set<int> s(V5.begin(), V5.end());

        for (int x : s) {
            this->Z[x] = this->sz;
            this->UZ[this->sz] = x;
            this->sz++;
        }
    }

    vector<int> zip(const vector<int> &V) {
        vector<int> ret = V;
        for (int i = 0; i < (int)V.size(); i++) {
            ret[i] = Z[ret[i]];
        }
        return ret;
    }

    vector<int> unzip(const vector<int> &V) {
        vector<int> ret = V;
        for (int i = 0; i < (int)V.size(); i++) {
            ret[i] = UZ[ret[i]];
        }
        return ret;
    }

    int size() { return sz; }

    int encode(int x) { return Z[x]; }
    int decode(int x) {
        if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき
        return UZ[x];
    }
};

class UnionFind {
public:
	UnionFind() = default;
    UnionFind(int N) : par(N), sz(N, 1) {
        iota(par.begin(), par.end(), 0);
    }
	int root(int x) {
		if (par[x] == x) return x;
		return (par[x] = root(par[x]));
	}
	bool unite(int x, int y) {
		int rx = root(x);
		int ry = root(y);
        if (rx == ry) return false;
		if (sz[rx] < sz[ry]) swap(rx, ry);
		sz[rx] += sz[ry];
		par[ry] = rx;
        return true;
	}
	bool issame(int x, int y) { return (root(x) == root(y)); }
	int size(int x) { return sz[root(x)]; }
    vector<vector<int>> groups(int N) {
        vector<vector<int>> G(N);
        for (int x = 0; x < N; x++) {
            G[root(x)].push_back(x);
        }
		G.erase( remove_if(G.begin(), G.end(),
            [&](const vector<int>& V) { return V.empty(); }), G.end());
        return G;
    }
private:
	vector<int> par, sz;
};

template<typename T>
struct BIT {
    int N;             // 要素数
    vector<T> bit[2];  // データの格納先
    BIT(int N_, int x = 0) {
        N = N_ + 1;
        bit[0].assign(N, 0); bit[1].assign(N, 0);
        if (x != 0) {
            for (int i = 0; i < N; i++) add(i, x);
        }
    }
    BIT(const vector<int> &A) {
        N = A.size() + 1;
        bit[0].assign(N, 0); bit[1].assign(N, 0);
        for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);
    }
    void add_sub(int p, int i, T x) {
        while (i < N) { bit[p][i] += x; i += (i & -i); }
    }
    void add(int l, int r, T x) {
        add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);
        add_sub(1, l + 1, x); add_sub(1, r + 1, -x);
    }
    void add(int i, T x) { add(i, i + 1, x); }
    T sum_sub(int p, int i) {
        T ret = 0;
        while (i > 0) { ret += bit[p][i]; i -= (i & -i); }
        return ret;
    }
    T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }
    T sum(int l, int r) { return sum(r) - sum(l); }
    T get(int i) { return sum(i, i + 1); }
    void set(int i, T x) { T s = get(i); add(i, -s + x); }
};

template<int mod> class Modint {
public:
    int val = 0;
    Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }
    Modint(const Modint &r) { val = r.val; }

    Modint operator -() { return Modint(-val); } // 単項
    Modint operator +(const Modint &r) { return Modint(*this) += r; }
    Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }
    Modint operator -(const Modint &r) { return Modint(*this) -= r; }
    Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }
    Modint operator *(const Modint &r) { return Modint(*this) *= r; }
    Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }
    Modint operator /(const Modint &r) { return Modint(*this) /= r; }
    Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }
    
    Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置
    Modint operator ++(signed) { ++*this; return *this; } // 後置
    Modint& operator --() { val--; if (val < 0) val += mod; return *this; }
    Modint operator --(signed) { --*this; return *this; }
    Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }
    Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }
    Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }
    Modint &operator -=(const int &q) { Modint r(q);  if (val < r.val) val += mod; val -= r.val; return *this; }
    Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }
    Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }
    Modint &operator /=(const Modint &r) {
        int a = r.val, b = mod, u = 1, v = 0;
        while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}
        val = val * u % mod; if (val < 0) val += mod;
        return *this;
    }
    Modint &operator /=(const int &q) {
        Modint r(q); int a = r.val, b = mod, u = 1, v = 0;
        while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}
        val = val * u % mod; if (val < 0) val += mod;
        return *this;
    }
    bool operator ==(const Modint& r) { return this -> val == r.val; }
    bool operator <(const Modint& r) { return this -> val < r.val; }
    bool operator >(const Modint& r) { return this -> val > r.val; }
    bool operator !=(const Modint& r) { return this -> val != r.val; }
};

using mint = Modint<MOD>;

istream &operator >>(istream &is, mint& x) {
    int t; is >> t; x = t; return (is);
}
ostream &operator <<(ostream &os, const mint& x) {
    return os << x.val;
}
mint modpow(const mint &x, int n) {
    if (n < 0) return (mint)1 / modpow(x, -n); // 未verify
    assert(n >= 0);
    if (n == 0) return 1;
    mint t = modpow(x, n / 2);
    t = t * t;
    if (n & 1) t = t * x;
    return t;
}

int modpow(__int128_t x, int n, int mod) {
    assert(n >= 0 && mod > 0); // TODO: n <= -1
    __int128_t ret = 1;
    while (n > 0) {
        if (n % 2 == 1) ret = ret * x % mod;
        x = x * x % mod;
        n /= 2;
    }
    return ret;
}
int modinv(__int128_t x, int mod) {
    assert(mod > 0);
    // assert(x > 0);
    if (x == 1 or x == 0) return 1;
    return mod - modinv(mod % x, mod) * (mod / x) % mod;
}

istream &operator >>(istream &is, __int128_t& x) {
    string S; is >> S;
    __int128_t ret = 0;
    int f = 1;
    if (S[0] == '-') f = -1; 
    for (int i = 0; i < S.length(); i++)
        if ('0' <= S[i] && S[i] <= '9')
            ret = ret * 10 + S[i] - '0';
    x = ret * f;
    return (is);
}
ostream &operator <<(ostream &os, __int128_t x) {
    ostream::sentry s(os);
    if (s) {
        __uint128_t tmp = x < 0 ? -x : x;
        char buffer[128]; char *d = end(buffer);
        do {
            --d; *d = "0123456789"[tmp % 10]; tmp /= 10;
        } while (tmp != 0);
        if (x < 0) { --d; *d = '-'; }
        int len = end(buffer) - d;
        if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);
    }
    return os;
}

__int128_t stoll(string &S) {
    __int128_t ret = 0; int f = 1;
    if (S[0] == '-') f = -1; 
    for (int i = 0; i < S.length(); i++)
        if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';
    return ret * f;
}
__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }
__int128_t lcm(__int128_t a, __int128_t b) {
    return a / gcd(a, b) * b;
    // lcmが__int128_tに収まる必要あり
}

string to_string(ld x, int k) { // xの小数第k位までをstring化する
    assert(k >= 0);
    stringstream ss;
    ss << setprecision(k + 2) << x;
    string s = ss.str();
    if (s.find('.') == string::npos) s += '.';
    int pos = s.find('.');
    for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';
    s.pop_back();
    if (s.back() == '.') s.pop_back();
    return s;

    // stringstream ss; // 第k+1位を四捨五入して第k位まで返す
    // ss << setprecision(k + 1) << x;
    // string s = ss.str();
    // if (s.find('.') == string::npos) s += '.';
    // int pos = s.find('.');
    // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';
    // if (s.back() == '.') s.pop_back();
    // return s;
}
string to_string(__int128_t x) {
    string ret = "";
    if (x < 0) { ret += "-"; x *= -1; }
    while (x) { ret += (char)('0' + x % 10); x /= 10; }
    reverse(ret.begin(), ret.end());
    return ret;
}
string to_string(char c) { string s = ""; s += c; return s; }

template<class T> size_t HashCombine(const size_t seed,const T &v) {
    return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));
}
template<class T,class S> struct hash<pair<T,S>>{
    size_t operator()(const pair<T,S> &keyval) const noexcept {
        return HashCombine(hash<T>()(keyval.first), keyval.second);
    }
};
template<class T> struct hash<vector<T>>{
    size_t operator()(const vector<T> &keyval) const noexcept {
        size_t s=0;
        for (auto&& v: keyval) s=HashCombine(s,v);
        return s;
    }
};
template<int N> struct HashTupleCore{
    template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{
        size_t s=HashTupleCore<N-1>()(keyval);
        return HashCombine(s,get<N-1>(keyval));
    }
};
template <> struct HashTupleCore<0>{
    template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }
};
template<class... Args> struct hash<tuple<Args...>>{
    size_t operator()(const tuple<Args...> &keyval) const noexcept {
        return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);
    }
};

vector<mint> _fac, _finv, _inv;
void COMinit(int N) {
    _fac.resize(N + 1); _finv.resize(N + 1);  _inv.resize(N + 1);
    _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;
    for (int i = 2; i <= N; i++) {
        _fac[i] = _fac[i-1] * mint(i);
        _inv[i] = -_inv[MOD % i] * mint(MOD / i);
        _finv[i] = _finv[i - 1] * _inv[i];
    }
}

mint FAC(int N) {
    if (N < 0) return 0; return _fac[N];
}
mint COM(int N, int K) {
    if (N < K) return 0; if (N < 0 or K < 0) return 0;
    return _fac[N] * _finv[K] * _finv[N - K];
}
mint PERM(int N, int K) {
    if (N < K) return 0; if (N < 0 or K < 0) return 0;
    return _fac[N] *  _finv[N - K];
}
mint NHK(int N, int K) { // initのサイズに注意
    if (N == 0 && K == 0)  return 1;
    return COM(N + K - 1, K);
}

#pragma endregion

vector<string> split_str(string S, char c) {
    vector<string> ret;
    stringstream ss;
    for (int i = 0; i < S.size(); i++) {
        if (S[i] == c) {
            ret.pb(ss.str());
            ss.str("");
            ss.clear();
        } else {
            ss << S[i];
        }
    }
    ret.pb(ss.str());
    return ret;
}

signed main() {
    int N, M;
    vector<int> P(101);
    for (int i = 0; i <= 100; i++) P[i] = i;
    while (cin >> N >> M, N) {
        vector<vector<vector<int>>> dp(102, vector<vector<int>>(N + 1, vector<int>(M + 1)));
        dp[0][0][0] = 1;
        for (int i = 0; i <= 100; i++) {
            for (int j = 0; j <= N; j++) {
                for (int k = 0; k <= M; k++) {
                    dp[i + 1][j][k] += dp[i][j][k];
                    if (j + 1 <= N && k + P[i] <= M) dp[i + 1][j + 1][k + P[i]] += dp[i][j][k];
                }
            }
        }

        int fac = 1;
        cout << dp[101][N][M] << endl;
    }
}
accuracy: 1
time_ms: 20
memory_kb: 10624
final_rank: 7

code_snippet: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[101][10][1001];
int main() {
    while (1) {
        ll n, s;
        cin >> n >> s;
        if (!n) break;
        memset(dp, 0, sizeof(dp));
        dp[0][0][0] = 1;
        dp[0][1][0] = 1;
        for (int i = 1; i <= 100; i++) {
            for (int j = 0; j <= n; j++) {
                for (int k = 0; k <= s; k++) {
                    dp[i][j][k] = dp[i - 1][j][k];
                    if (j && k >= i) dp[i][j][k] += dp[i - 1][j - 1][k - i];
                }
            }
        }
        cout << dp[100][n][s] << endl;
    }
}
accuracy: 1
time_ms: 10
memory_kb: 11264
final_rank: 3

code_snippet: #include "bits/stdc++.h"

#define REP(i,num) for(ll i=0;i<(num);++i)
#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=ll>
T in(){ T x; cin >> x; return (x); }
template<typename T=ll,typename C=vector<T>>
C vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }
template<typename T=ll,size_t N>
array<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}

void vout(){ cout << endl; }
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }
void out(){ cout << endl; }
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }

template<typename T>
bool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }
template<typename T>
bool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);

	while(true){
		auto N=in(),S=in();
		if(!N && !S) break;

		vvll C(1001,vll(10,0));
		vector<set<ll>> H(10);
		H[0].insert(0);
		C[0][0]=1;
		REP(i,101){
			for(ll j=min(i+1ll,8ll);j>=0;j--){
				set<ll> I;
				for(auto& x:H[j]){
					ll K=x+i;
					if(K>=0 && K<=S){
						C[K][j+1] += C[x][j];
						I.insert(K);
					}
				}
				H[j+1].insert(I.begin(),I.end());
			}
		}
		out(C[S][N]);
	}
	return 0;
}
accuracy: 1
time_ms: 380
memory_kb: 3740
final_rank: 12

code_snippet: #include <stdio.h>
#include <string.h>
#include <stdlib.h>



long long  g_dp[101][11][1001];
#define self_min(x,y) (x) > (y) ? (y):(x)

long long  slove(int idx, int num, int sum)
{
	if (sum == 0 && num == 0)
		return 1;
	else if (sum < 0)
		return 0;
	else if (num < 0)
		return 0;

	if (idx > 100)
		return 0;

	if (g_dp[idx][num][sum] != -1)
		return g_dp[idx][num][sum];

	long long  cnt = 0;
	long long v1 = slove(idx + 1, num - 1, sum - idx);
	long long v2 = slove(idx + 1, num, sum);
	cnt = v1 + v2;
	g_dp[idx][num][sum] = cnt;
	return cnt;
}

int main()
{
	int s, n;
	while (1)
	{
		scanf("%d%d", &n, &s);
		if (n == 0 && s == 0)
			break;
		memset(g_dp, -1, sizeof(g_dp));
		long long  cnt = slove(0, n, s);
		printf("%lld\n", cnt);
	}
}
accuracy: 1
time_ms: 30
memory_kb: 11348
final_rank: 9

code_snippet: #include <stdio.h>
#include <string.h>
#include <stdlib.h>



int g_dp[101][11][1001];
#define self_min(x,y) (x) > (y) ? (y):(x)

int  slove(int idx, int num, int sum)
{
	if (sum == 0 && num == 0)
		return 1;
	else if (sum < 0)
		return 0;
	else if (num < 0)
		return 0;

	if (idx > 100)
		return 0;

	if (g_dp[idx][num][sum] != -1)
		return g_dp[idx][num][sum];

	int cnt = 0;
	int v1 = slove(idx + 1, num - 1, sum - idx);
	int v2 = slove(idx + 1, num, sum);
	cnt = v1 + v2;
	g_dp[idx][num][sum] = cnt;
	return cnt;
}

int main()
{
	int s, n;
	while (1)
	{
		scanf("%d%d", &n, &s);
		if (n == 0 && s == 0)
			break;
		memset(g_dp, -1, sizeof(g_dp));
		int cnt = slove(0, n, s);
		printf("%d\n", cnt);
	}
}
accuracy: 0.5
time_ms: 20
memory_kb: 7052
final_rank: 16

code_snippet: #include <stdio.h>
#include <string.h>
#include <stdlib.h>



int g_dp[101][11][1001];
#define self_min(x,y) (x) > (y) ? (y):(x)

int  slove(int idx, int num, int sum)
{
	if (sum == 0 && num == 0)
		return 1;
	else if (sum == 0 || num == 0)
		return 0;

	if (idx > 100)
		return 0;

	if (g_dp[idx][num][sum] != -1)
		return g_dp[idx][num][sum];

	int cnt = 0;
	int v1 = slove(idx + 1, num - 1, sum - idx);
	int v2 = slove(idx + 1, num, sum);
	cnt = v1 + v2;
	g_dp[idx][num][sum] = cnt;
	return cnt;
}

int main()
{
	int s, n;
	while (1)
	{
		scanf("%d%d", &n, &s);
		if (n == 0 && s == 0)
			break;
		memset(g_dp, -1, sizeof(g_dp));
		int cnt = slove(0, n, s);
		printf("%d\n", cnt);
	}
}
accuracy: 0.25
time_ms: 10
memory_kb: 7008
final_rank: 19

code_snippet: #include <bits/stdc++.h>
using namespace std;

long long dp[102][11][1001];

int main() {
    while(true) {
        int n,s;
        cin >> n >> s;
        if(n == 0 && s == 0) {
            return 0;
        }
        memset(dp,0,sizeof(dp));
        dp[0][0][0] = 1;
        for(int i = 0; i <= 100; i++) {
            for(int j = 0; j <= n; j++) {
                for(int k = 0; k <= s; k++) {
                    dp[i+1][j][k] += dp[i][j][k];
                    if(k+i <= s) {
                        dp[i+1][j+1][k+i] += dp[i][j][k];
                    }
                }
            }
        }
        cout << dp[101][n][s] << endl;
    }
}
accuracy: 1
time_ms: 10
memory_kb: 12052
final_rank: 6

code_snippet: #include<bits/stdc++.h>
using namespace std;

int main(){
  for(;;){
    int n,s;
    cin >> n >> s;
    if(n == 0 && s == 0) break;
    vector<vector<vector<long long int> > > dp(n,vector<vector<long long int> >(s+1,vector<long long int>(101,0)));
    for(int i=0;i<=min(s,100);i++) dp[0][i][i] = 1;
    for(int i=1;i<n;i++) for(int j=0;j<=s;j++) for(int k=0;k<=100;k++) for(int l=k+1;l<=100;l++) if(j-l >= 0) dp[i][j][l] += dp[i-1][j-l][k];
    long long int ans = 0;
    for(int i=0;i<=100;i++) ans += dp[n-1][s][i];
    cout << ans << endl;
  }
}
accuracy: 1
time_ms: 380
memory_kb: 10228
final_rank: 13

code_snippet: #include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<list>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<iomanip>
#include<regex>
#include<sstream>
#include<random>
using namespace std;
#define int long long
#define uint unsigned long long
const int mod=1e9+7;
const int inf=mod*mod;
int dp[10][1001][101];
signed main(){
	for(int i=0;i<=100;i++)
		for(int j=i;j<=100;j++)
			dp[1][i][j]+=1;
	for(int i=2;i<=9;i++)
		for(int j=0;j<=1000;j++)
			for(int k=i-1;k<=100;k++)
				for(int l=i-1;l<=min(j,k);l++)
					dp[i][j][k]+=dp[i-1][j-l][l-1];
	int n,s;
	while(cin>>n>>s,n)
		cout<<dp[n][s][100]<<endl;
}
accuracy: 1
time_ms: 10
memory_kb: 9840
final_rank: 1

code_snippet: #include<bits/stdc++.h>

using namespace std;
using ll = long long;
void solve();
const int M = 101;


int main()
{
	while(true)solve();
}

void solve()
{
	int n, s; cin >> n >> s;
	if(!n && !s) exit(0);
	vector<int> A(M);
	iota(A.begin(), A.end(), 0);

	vector dp(M + 1, vector(n + 1, vector(s + 1, 0LL)));
	dp[0][0][0] = 1;

	for(int i = 0; i < M; i++) { //考慮する数
		for(int j = 0; j <= n; j++) { //すでに選んだ数
			for(int k = 0; k <= s; k++) { //総和

				dp[i + 1][j][k] += dp[i][j][k];

				if(A[i] + k <= s && j != n) {
					dp[i + 1][j + 1][k + A[i]] += dp[i][j][k];
				}
			}
		}
	}

	cout << dp[M][n][s] << endl;
	

}
accuracy: 1
time_ms: 30
memory_kb: 10592
final_rank: 8

code_snippet: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define ALL(x) (x).begin(), (x).end()  // sortなどの引数を省略したい
#ifdef _DEBUG
#define PRE_COMMAND             \
    std::cin.rdbuf(in.rdbuf()); \
    std::cout << fixed << setprecision(15);
#else
#define PRE_COMMAND cout << fixed << setprecision(15);
#endif
const double EPS = 1e-10, PI = acos(-1.0);
template <class T> auto MAX(T& seq) {
    return *max_element(seq.begin(), seq.end());
}
template <class T> auto MIN(T& seq) {
    return *min_element(seq.begin(), seq.end());
}
template <class T> auto SUM(T& seq) {
    T temp{0};
    auto& temp2 = temp[0];
    return accumulate(seq.begin(), seq.end(), temp2);
}
template <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }
template <class T, class S> void SORT(T& seq, S& sort_order) {
    sort(seq.begin(), seq.end(), sort_order);
}
template <class T> void SORTR(vector<T>& seq) {
    sort(seq.begin(), seq.end(), greater<T>());
}
template <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {
    long long n = n_0 % mod_0, k = k_0, mod = mod_0, now = 1;
    while (k) {
        if (k & 1) now = (now * n) % mod;
        n = (n * n) % mod;
        k >>= 1;
    }
    return now;
}
template <typename T> istream& operator>>(istream& is, vector<T>& vec) {
    for (T& x : vec) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    if (!v.size()) return os;
    typename vector<T>::const_iterator ii = v.begin();
    os << *ii++;
    for (; ii != v.end(); ++ii) os << " " << *ii;
    return os;
}

int main() {
    PRE_COMMAND
    // 何個目か、合計値、どこまで見たか
    vector<vector<vector<ll>>> dp(9,
                                  vector<vector<ll>>(1001, vector<ll>(101, 0)));
    for (int j = 0; j < 101; j++) { dp[0][j][j] = 1; }
    for (int i = 0; i < 8; i++) {
        int lim = (i + 2) * 100;
        for (int j = 0; j <= lim; j++) {
            for (int k = 0; k < 101; k++) {
                ll pre = dp[i][j][k];
                if (pre <= 10000000000) {
                    for (int x = k + 1; x < 101; x++) {
                        dp[i + 1][j + x][x] += pre;
                    }
                }
            }
        }
    }
    while (true) {
        int x, y;
        cin >> x >> y;
        if (x == 0) break;
        cout << SUM(dp[x - 1][y]) << endl;
    }
}
accuracy: 1
time_ms: 10
memory_kb: 11064
final_rank: 2

code_snippet: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i< (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int inf = (1<<30);
ll tebl[10][1001][101]={};
ll dp[10][1001]={};
int main(){
	int n,s;
	rep(i,101){
		dp[0][i]=1;
		tebl[0][i][i]=1;
	}
	//cout<<dp[0][0]<<endl;
	for(int i=1; i<=9; i++){
		for(int j=0; j<=1000; j++){
			for(int k=0; k<=100 && j-k>k; k++){
				ll a=0;
				for(int l=0; l<=k; l++){//0~kを含む式を数える
					a+=tebl[i-1][j-k][l];
				}
				tebl[i][j][k]=dp[i-1][j-k]-a;//ｋを含む式の数
				dp[i][j]+=tebl[i][j][k];
			}
			/*if(dp[0][0]==0){
				cout<<i<<" "<<j<<endl;
				return 0;
			}
			*/
		}
	}
	/*for(int j=0; j<=6; j++){
		for(int i=0; i<=3; i++){
			cout<<dp[i][j]<<" ";
		}
		cout<<endl;
	}
	cout<<dp[0][0]<<endl;
	for(int i=0; i<=3; i++){
		for(int j=0; j<=6; j++){
			cout<<i<<" "<<j<<endl;
			for(int k=0; k<=3 && j-k>k; k++){
				cout<<k<<"が　"<<tebl[i][j][k]<<" ";
			}
			cout<<endl;
		}
	}
	
	
	for(int i=1; i<n; i++){
		for(int j=0; j<=s; j++){
			
			for(int k=0; k<t; k++,t--){
				dp[i][j]+=dp[i-1][k]*dp[i-1][t];
			}
		}
	}
	*/
	
	while(true){
		cin>>n>>s;
		if(n==0 && s==0) break;
		cout<<dp[n-1][s]<<endl;
	}
}
accuracy: 1
time_ms: 20
memory_kb: 10348
final_rank: 5

code_snippet: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i< (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int inf = (1<<30);
int tebl[10][1001][101]={};
int dp[10][1001]={};
int main(){
	int n,s;
	rep(i,101){
		dp[0][i]=1;
		tebl[0][i][i]=1;
	}
	//cout<<dp[0][0]<<endl;
	for(int i=1; i<=9; i++){
		for(int j=0; j<=1000; j++){
			for(int k=0; k<=100 && j-k>k; k++){
				int a=0;
				for(int l=0; l<=k; l++){//0~kを含む式を数える
					a+=tebl[i-1][j-k][l];
				}
				tebl[i][j][k]=dp[i-1][j-k]-a;//ｋを含む式の数
				dp[i][j]+=tebl[i][j][k];
			}
			/*if(dp[0][0]==0){
				cout<<i<<" "<<j<<endl;
				return 0;
			}
			*/
		}
	}
	/*for(int j=0; j<=6; j++){
		for(int i=0; i<=3; i++){
			cout<<dp[i][j]<<" ";
		}
		cout<<endl;
	}
	cout<<dp[0][0]<<endl;
	for(int i=0; i<=3; i++){
		for(int j=0; j<=6; j++){
			cout<<i<<" "<<j<<endl;
			for(int k=0; k<=3 && j-k>k; k++){
				cout<<k<<"が　"<<tebl[i][j][k]<<" ";
			}
			cout<<endl;
		}
	}
	
	
	for(int i=1; i<n; i++){
		for(int j=0; j<=s; j++){
			
			for(int k=0; k<t; k++,t--){
				dp[i][j]+=dp[i-1][k]*dp[i-1][t];
			}
		}
	}
	*/
	
	while(true){
		cin>>n>>s;
		if(n==0 && s==0) break;
		cout<<dp[n-1][s]<<endl;
	}
}
accuracy: 0.5
time_ms: 20
memory_kb: 6724
final_rank: 15

code_snippet: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define each(i, a) for(auto &i : a)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }

int main() {
    init();

    for (int n, s; cin >> n >> s && n;) {
        auto dp = vec<ll>(102, n + 1, s + 1);
        dp[0][0][0] = 1;
        eFOR(i, 0, 100)eFOR(j, 0, n)eFOR(k, 0, s) {
            dp[i + 1][j][k] += dp[i][j][k];
            if (j < n && k + i <= s)
                dp[i + 1][j + 1][k + i] += dp[i][j][k];
        }
        print(dp[101][n][s]);
    }

    return 0;
}
accuracy: 1
time_ms: 20
memory_kb: 10184
final_rank: 4

code_snippet: #include <iostream>

#define MAX_SUM 900

int main()
{
	unsigned long long*** DP = new unsigned long long**[9];
	for (int i=0; i<9; i++) {
		DP[i] = new unsigned long long*[901];
		for (int j=0; j<MAX_SUM+1; j++) DP[i][j] = new unsigned long long[901];
	}
	
	for (int j=0; j<MAX_SUM+1; j++) {
		for (int k=0; k<MAX_SUM+1; k++) DP[0][j][k] = (j<=k && k<=100) ? 1 : 0;
	}
	
	for (int i=1; i<9; i++) {
		for (int j=0; j<MAX_SUM+1; j++) {
			for (int k=0; k<MAX_SUM+1; k++) {
				unsigned long long sum = 0;
				for (int m=j; m<MAX_SUM+1 && m<=(k-1)/2; m++) sum += DP[i-1][m+1][k-m];
				DP[i][j][k] = sum;
			}
		}
	}
	
	int n, s;
	while (std::cin >> n >> s) {
		//std::cout << n << " " << s << std::endl;
		if (n == 0 && s == 0) break;
		if (s>MAX_SUM) std::cout << 0 << std::endl;
		else std::cout << DP[n-1][0][s] << std::endl;
	}
	
	for (int i=0; i<9; i++) {
		for (int j=0; j<MAX_SUM+1; j++) delete[] DP[i][j];
		delete[] DP[i];
		
	}
	
	return 0;
}
accuracy: 1
time_ms: 220
memory_kb: 59932
final_rank: 14

code_snippet: #include <iostream>
#include <stdlib.h>
using namespace std;

int main(void){
  //long table[11][101][1001];
  long **table[11];
  for(int i=0;i<=10;i++){
    table[i]=(long **)malloc(101*(sizeof(long *)));
    for(int j=0;j<=100;j++){
      table[i][j]=(long *)malloc(1001*sizeof(long));
    }
  }
  for(int i=0;i<=10;i++){
    for(int j=0;j<=100;j++){
      for(int s=0;s<=1000;s++){
        table[i][j][s]=0;
      }
    }
  }

  for(int j=0;j<=100;j++){
    table[1][j][j]=1;
  }

  for(int i=2;i<=10;i++){
    for(int j=0;j<=100;j++){
      for(int s=0;s<=1000;s++){
        if(s>=j){
        for(int k=0;k<j;k++){
            table[i][j][s]+=table[i-1][k][s-j];
          }
        }
      }
    }
  }

  int n,s;
  while(true){
    cin>>n>>s;
    if(n==0 and s==0){break;}
    long retval=0;
    for(int j=0;j<=100;j++){
      retval+=table[n][j][s];
    }
    cout<<retval<<endl;
  }
  return 0;
}
accuracy: 1
time_ms: 30
memory_kb: 11796
final_rank: 10

code_snippet: #include <iostream>
#include <stdlib.h>
using namespace std;

int main(void){
  //long table[11][101][1001];
  long **table[11];
  for(int i=0;i<=10;i++){
    table[i]=(long**)malloc(101*(sizeof(long*)));
    for(int j=0;j<=100;j++){
      table[i][j]=(long*)malloc(1001*sizeof(long));
    }
  }
  for(int i=0;i<=10;i++){
    for(int j=0;j<=100;j++){
      for(int s=0;s<=1000;s++){
        table[i][j][s]=0;
      }
    }
  }

  for(int j=0;j<=100;j++){
    table[1][j][j]=1;
  }

  for(int i=2;i<=10;i++){
    for(int j=0;j<=100;j++){
      for(int s=0;s<=1000;s++){
        if(s>=j){
        for(int k=0;k<j;k++){
            table[i][j][s]+=table[i-1][k][s-j];
          }
        }
      }
    }
  }

  int n,s;
  while(true){
    cin>>n>>s;
    if(n==0 and s==0){break;}
    int retval=0;
    for(int j=0;j<=100;j++){
      retval+=table[n][j][s];
    }
    cout<<retval<<endl;
  }
  return 0;
}
accuracy: 0.5
time_ms: 30
memory_kb: 11784
final_rank: 17

code_snippet: #include<iostream>
#include<algorithm>
using namespace std;
int n,s;
long long memo[20][1010][110];
long long dp(int num,int sum,int cnt){
    if(num == n){
        if(sum == s) return 1;
        return 0;
    }
    if(memo[num][sum][cnt] != -1) return memo[num][sum][cnt];
    long long ret = 0;
    for(int i=cnt;i<=100;i++){
        if(sum+i > s) continue;
        ret += dp(num+1,sum+i,i+1);
    }
    return memo[num][sum][cnt] = ret;
}
int main(){
    
    while(cin >> n >> s,n!=0||s!=0){
        fill_n(**memo,20*1010*110,-1);
        cout << dp(0,0,0) << endl;
    }
    
    return(0);
}
accuracy: 1
time_ms: 250
memory_kb: 20456
final_rank: 11

code_snippet: #include<iostream>
#include<algorithm>
using namespace std;
int n,s;
int memo[20][1010][110];
int dp(int num,int sum,int cnt){
    if(num == n){
        if(sum == s) return 1;
        return 0;
    }
    if(memo[num][sum][cnt] != -1) return memo[num][sum][cnt];
    int ret = 0;
    for(int i=cnt;i<=100;i++){
        if(sum+i > s) continue;
        ret += dp(num+1,sum+i,i+1);
    }
    return memo[num][sum][cnt] = ret;
}
int main(){
    
    while(cin >> n >> s,n!=0||s!=0){
        fill_n(**memo,20*1010*110,-1);
        cout << dp(0,0,0) << endl;
    }
    
    return(0);
}
accuracy: 0.5
time_ms: 110
memory_kb: 11776
final_rank: 18

code_snippet: #include<iostream>
#include<algorithm>
using namespace std;
int n,s;
int memo[20][1010][110];
int dp(int num,int sum,int cnt){
    if(num == n && sum == s) return 1;
    if(memo[num][sum][cnt] != -1) return memo[num][sum][cnt];
    int ret = 0;
    for(int i=cnt;i<=100;i++){
        if(sum+i > s) continue;
        ret += dp(num+1,sum+i,i+1);
    }
    return memo[num][sum][cnt] = ret;
}
int main(){
    
    while(cin >> n >> s,n!=0&&s!=0){
        for(int i=0;i<=n;i++){
            for(int j=0;j<=s;j++){
                for(int k=0;k<=100;k++){
                    memo[i][j][k] = -1;
                }
            }
        }
        cout << dp(0,0,0) << endl;
    }
    
    return(0);
}
accuracy: 0.25
time_ms: 60
memory_kb: 4164
final_rank: 20