Problem:
Combination of Number Sequences
0 から 9 までの整数を使った
n
個の数の並び
k
1
,
k
2
, ...,
k
n
を考えます。正の整数
n
と
s
を読み込んで、
k
1
+ 2 × k
2
+ 3 × k
3
+
...
+ n × k
n
= s
となっているような
n
個の数の並びが何通りあるかを出力するプログラムを作成してください。ただし、1 つの「
n
個の数の並び」には同じ数が 2 回以上現われないものとします。
Input
入力は複数のデータセットからなります。各データセットとして、
n
(1 ≤
n
≤ 10) と
s
(0 ≤
s
≤ 10,000)が空白区切りで１行に与えられます。
データセットの数は 100 を超えません。
Output
データセットごとに、
n
個の整数の和が
s
になる組み合わせの個数を１行に出力します。
Sample Input
3 10
3 1
Output for the Sample Input
8
0

Submitted solutions:

code_snippet: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>

using namespace std;

int** table;

void recursive(int sum,bool checkTable[10],int count){
	if(count == 10)return;

	bool new_table[10-count][10];

	for(int i = 0; i < 10-count;i++){
		for(int k = 0; k < 10; k++)new_table[i][k] = checkTable[k];
	}

	int index = 0;
	for(int i = 0; i <= 9; i++){
		if(checkTable[i] == false){
			new_table[index][i] = true;
			table[count+1][sum+(count+1)*i]++;
			recursive(sum+(count+1)*i,new_table[index],count+1);
			index++;
		}
	}
}

int main(){

	table = new int*[11];
	for(int i = 1; i <= 10; i++){
		table[i] = new int[10001];
		for(int k = 0; k <= 10000; k++)table[i][k] = 0;
	}

	bool checkTable[10];
	for(int i = 0; i < 10; i++)checkTable[i] = false;

	recursive(0,checkTable,0);

	int n,s;

	while(scanf("%d %d",&n,&s) != EOF){
		printf("%d\n",table[n][s]);
	}

	return 0;
}
accuracy: 1
time_ms: 110
memory_kb: 3108
final_rank: 7

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

int main(void){
  int n, s;
  while(cin >> n >> s){
    int ans=0;
    for(int i=0; i<(1<<10); i++){
      bitset<10> now(i);
      if(now.count()!=n) continue;
      vector<int> use(n);
      int cnt=0;
      for(int j=0; j<10; j++){
        if(now.test(j)){
          use[cnt]=j; cnt++;
        }
      }
      do{
        int kari=0;
        for(int k=0; k<n; k++) kari+=use[k]*(k+1);
        if(kari==s) ans++;
      }while(next_permutation(use.begin(), use.end()));
    }
    cout << ans << endl;
  }
  return 0;
}
accuracy: 1
time_ms: 590
memory_kb: 3304
final_rank: 15

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
// 正なら+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 = 10;
    int K, S;
    while (cin >> K >> S) {
        vector<int> P(N);
        for (int i = 0; i < N; i++) P[i] = i;

        int ans = 0;
        do {
            int sum = 0;
            for (int i = 0; i < K; i++) {
                sum += P[i] * (i + 1);
            }
            if (sum == S) ans++;
            reverse(P.begin() + K, P.end());
        } while (next_permutation(P.begin(), P.end()));
        cout << ans << endl;
    }
}
accuracy: 1
time_ms: 950
memory_kb: 3188
final_rank: 18

code_snippet: #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int m = 10;
    vector<vector<int>> dp(1<<m,vector<int>(10001));
    dp[0][0] = 1;
    for (int i = 0; i < (1<<m); ++i) {
        for (int j = 0; j < dp[0].size(); ++j) {
            if (!dp[i][j]) continue;
            for (int k = 0; k < m; ++k) {
                if ((1<<k)&i) continue;
                dp[i+(1<<k)][j + (__builtin_popcount(i) + 1) * k] += dp[i][j];
            }
        }
    }
    int n,s;
    while (cin >> n >> s) {
        int res = 0;
        for (int i = 0; i < (1<<m); ++i) {
            if (__builtin_popcount(i) == n) res += dp[i][s];
        }
        cout << res << endl;
    }
}
accuracy: 1
time_ms: 10
memory_kb: 43088
final_rank: 13

code_snippet: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define rep(i,n) for(i=0; i<n; i++)

int main() {
	int n, s, ans, i, c;
	vector<int> a(10, 0);
	while (cin >> n) {
		cin >> s;
		rep(i, 10) {
			a[i] = max(0, i + (n - 9));
		}
		ans = 0;
		do {
			c = 0;
			rep(i, 10) {
				c += i * a[i];
			}
			ans += (c == s);
		} while (next_permutation(a.begin(), a.end()));
		cout << ans << endl;
	}
}
accuracy: 1
time_ms: 560
memory_kb: 3132
final_rank: 14

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; }

vvll memo;

void dfs(ll sum,ll depth,vll& history){
	if(depth==10){
		return;
	}

	for(ll i=0;i<10;i++){
		if(history[i]) continue;
		history[i]=1;
		memo[depth][sum+(depth+1)*i]++;
		dfs(sum+(depth+1)*i,depth+1,history);
		history[i]=0;
	}
	return;
}

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

	memo.resize(10,vll(331,0));
	vll H(10,0);
	dfs(0,0,H);

	ll N,S;
	while(cin>>N>>S){
		if(S>330){
			out(0);
		}
		else out(memo[N-1][S]);
	}
	return 0;
}
accuracy: 1
time_ms: 90
memory_kb: 3296
final_rank: 4

code_snippet: #include<bits/stdc++.h>
using namespace std;
int n, s, memo[12][(1<<12)][312];
int dp(int k, int bit, int sum){
    if(k == n+1){
        if(sum == s) return 1;
        else return 0;
    }
    if(memo[k][bit][sum] != -1) return memo[k][bit][sum];
    int res = 0;
    for(int i=0;i<10;i++){
        if((bit&(1<<i)) != 0) continue;
        res += dp(k+1, (bit|(1<<i)), sum+k*i);
    }
    return memo[k][bit][sum] = res;
}
int main(){
    while(cin >> n >> s){
        memset(memo, -1, sizeof(memo));
        cout << dp(1, 0, 0) << endl;
    }
    return(0);
}
accuracy: 1
time_ms: 320
memory_kb: 62996
final_rank: 19

code_snippet: #include <iostream>
#include <sstream>
#include <string>
#include <map>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cmath>

using namespace std;
int n, s;
int memo[1 << 11][10001];

int dfs(int d, int sum, int used, int used_num) {
    if(sum > s) {
        return 0;
    }

    if(d >= 10 || used_num >= n) {
        return used_num == n && sum == s;
    }

    if(memo[used][sum] != -1){
        return memo[used][sum];
    }

    int res = 0;
    for(int i = 0; i < 10; i++) {
        if(used & (1 << i)) {
            continue;
        }
        res += dfs(d + 1, sum + (d + 1)*i, used^(1 << i), used_num + 1);
    }

    return memo[used][sum] = res;
}

int main() {

    while(cin >> n >> s) {
        for(int i = 0; i < 1 << 11; i++){
            for(int j = 0; j < 10001; j++){
                memo[i][j] = -1;
            }
        }
        cout << dfs(0, 0, 0, 0) << endl;
    }

    return 0;
}
accuracy: 1
time_ms: 840
memory_kb: 83076
final_rank: 20

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

int main(){
    int n, s;
    vector<vector<int>> dp(11, vector<int>(10001));
    function<void(int,int,int)> dfs = [&](int i, int S, int sumv){
        dp[i - 1][sumv]++;
        if(i == 11)return;
        for(int j = 0; j < 10; j++){
            if(S >> j & 1)dfs(i + 1, S ^ (1 << j), sumv + j * i);
        }
    };
    dfs(1, (1 << 10) - 1, 0);
    while(cin >> n >> s){
        cout << dp[n][s] << '\n';
    }
}
accuracy: 1
time_ms: 90
memory_kb: 3336
final_rank: 5

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

int main(){
  for(;;){
    int N=-1,S;
    cin >> N >> S;
    if(N == -1) break;
    if(500 <= S) cout << 0 << endl;
    else{
      vector<vector<int>> dp(1024,vector<int>(S+1,0));
      dp[0][0] = 1;
      for(int i=0;i<1024;i++){
        int cnt = 0;
        vector<bool> used(10,false);
        for(int j=0;j<10;j++){
          if(i & (1<<j)){
            cnt++;
            used[j] = true;
          }
        }
        for(int j=0;j<10;j++){
          if(!(i & (1<<j))){
            int ni = i+(1<<j);
            for(int k=0;k<=S;k++){
              int nk = k+(cnt+1)*j;
              if(nk <= S) dp[ni][nk] += dp[i][k];
            }
          }
        }
      }
      int ans = 0;
      for(int i=0;i<1024;i++){
        int cnt = 0;
        for(int j=0;j<10;j++){
          if(i & (1<<j)){
            cnt++;
          }
        }
        if(cnt == N) ans += dp[i][S];
      }
      cout << ans << endl;
    }
  }
}
accuracy: 1
time_ms: 30
memory_kb: 4540
final_rank: 1

code_snippet: #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<sstream>
#include<regex>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<list>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<iomanip>
#include<random>
using namespace std;
#define int long long
#define uint unsigned long long
const int mod=1e9+7;
const int inf=mod*mod;
const double eps=1e-10;
int ary[11][10001];
signed main(){
	int tmp[10];
	iota(tmp,tmp+10,0);
	do{
		int sum=0;
		for(int i=0;i<10;i++){
			sum+=(i+1)*tmp[i];
			ary[i+1][sum]++;
		}
	}while(next_permutation(tmp,tmp+10));
	for(int i=1;i<10;i++)
		for(int j=1;j<=10-i;j++)
			for(int k=0;k<=10000;k++)
				ary[i][k]/=j;
	int n,s;
	while(cin>>n>>s)
		cout<<ary[n][s]<<endl;
}
accuracy: 1
time_ms: 40
memory_kb: 4148
final_rank: 2

code_snippet: #include <bits/stdc++.h>
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
const double PI = acos(-1.0);

int n, s, ans;
vector<vector<int>> vec(10, vector<int>(10000, 0));
vector<bool> used(10,0);
bool num[10] = { 0 };

void combinations(int c, int sum) {
	/*for (int i = 0; i < 10; i++) cout << num[i];
	cout << endl;*/
	if (c == 11) return;
	for (int i = 0; i < 10; i++) {
		if (used[i]) continue;
		used[i] = 1;
		++vec[c][sum + i * (c + 1)];
		combinations(c + 1, sum + i * (c + 1));
		used[i] = 0;
	}
}

int main() {
	int sum = 0;
	combinations(0, 0);

	while (cin >> n >> s) {
		cout << vec[n-1][s] << endl;
	}
	return 0;
}
accuracy: 1
time_ms: 130
memory_kb: 3196
final_rank: 11

code_snippet: #include <bits/stdc++.h>
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
const double PI = acos(-1.0);

int n, s, ans;
vector<vector<int>> vec(10, vector<int>(10000, 0));
vector<bool> used(10,0);
bool num[10] = { 0 };

void combinations(int c, int sum) {
	/*for (int i = 0; i < 10; i++) cout << num[i];
	cout << endl;*/
	if (c == 11) return;
	for (int i = 0; i < 10; i++) {
		if (num[i]) continue;
		num[i] = 1;
		++vec[c][sum + i * (c + 1)];
		combinations(c + 1, sum + i * (c + 1));
		num[i] = 0;
	}
}

int main() {
	int sum = 0;
	combinations(0, 0);

	while (cin >> n >> s) {
		cout << vec[n-1][s] << endl;
	}
	return 0;
}
accuracy: 1
time_ms: 120
memory_kb: 3240
final_rank: 9

code_snippet: #include <bits/stdc++.h>
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
const double PI = acos(-1.0);

int n, s, ans;
vector<vector<int>> vec(10, vector<int>(10000, 0));
vector<bool> used(10,0);
bool num[10] = { 0 };

void combinations(int c, int sum) {
	if (c == 11) return;
	for (int i = 0; i < 10; i++) {
		if (num[i]) continue;
		num[i] = 1;
		++vec[c][sum + i * (c + 1)];
		combinations(c + 1, sum + i * (c + 1));
		num[i] = 0;
	}
}

int main() {
	used.assign(10, 0);
	int sum = 0;
	combinations(0, 0);

	while (cin >> n >> s) {
		cout << vec[n-1][s] << endl;
	}
	return 0;
}
accuracy: 1
time_ms: 120
memory_kb: 3248
final_rank: 10

code_snippet: #include <iostream>
using namespace std;

int n, s, res[10][330] = { 0 };
bool num[10] = { 0 };
void combinations(int c, int sum) {
	if (c == 11) return ;
	for (int i = 0; i < 10; i++) {
		if (num[i]) continue;
		num[i] = 1;
		++res[c + 1][sum + i * (c + 1)];
		combinations(c + 1, sum + i * (c + 1));
		num[i] = 0;
	}
}

int main() {
	combinations(0, 0);
	while (cin >> n) {
		cin >> s;
		if (s > 330) {
			n = 0;
			s = 0;
		}
		cout << res[n][s] << endl;
	}
	return 0;
}
accuracy: 1
time_ms: 100
memory_kb: 3092
final_rank: 6

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;
}

vector<int> permutations(vector<int> v, int size = -1) {
    int idx = 0, idx_pre, n = (int)v.size(), ret_size = 1, x = 0;
    if (size == -1) size = n;
    for (int i = n; i > n - size; i--) ret_size *= i;
    vector<int> perm(ret_size, 0);
    vector<int> step(size, 0), idx_pre_v(size--, 0);
    bool down = true;
    int q;
    while (x >= 0) {
        if (x == size) {
            idx -= x;
            for (int i = x; i < n; i++) perm[idx + i] += v[i] * (x + 1);
            idx += n, down = false, x--;
        } else {
            if (down) {
                swap(v[x], v[step[x]]);
                idx_pre_v[x++] = idx;
                idx_pre_v[x] = idx, step[x] = x;
            } else {
                q = v[x] * (x + 1);
                for (int j = idx_pre_v[x]; j < idx; j++) perm[j] += q;
                swap(v[x], v[step[x]++]);
                if (step[x] == n) {
                    x--;
                } else {
                    down = true;
                }
            }
        }
    }
    return perm;
}

int main() {
    PRE_COMMAND
    int n, s;
    vector<vector<int>> p(11);
    vector<int> v = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
    for (int i = 1; i < 11; i++) { p[i] = permutations(v, i); }
    while (cin >> n >> s) {
        int ans2 = 0;
        for (int a : p[n]) {
            if (a == s) ans2++;
        }
        cout << ans2 << endl;
    }
}
accuracy: 1
time_ms: 150
memory_kb: 41388
final_rank: 16

code_snippet: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

template <class BI>
bool next_partial_permutation(BI first, BI middle, BI last){
    reverse(middle, last);
    return next_permutation(first, last);
}


int main(){
    int n,s;
    while(cin >> n >> s){
        vector<int> a(10);
        for(int i=0; i<10; i++){
            a[i] = i;
        }
        int ans = 0;
        do{
            int sub = 0;
            for(int i=0; i<n; i++){
                sub += (i+1)*a[i];
            }
            if(sub == s) ans++;
        }while(next_partial_permutation(a.begin(), a.begin()+n, a.end()));
        cout << ans << endl;
    }
    return 0;
}
accuracy: 1
time_ms: 790
memory_kb: 3076
final_rank: 17

code_snippet: #include <bits/stdc++.h>
using namespace std;
#define modulo K
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 10000000000000

int main(){
	
	vector<vector<int>> X(10,vector<int>(100001,0));
	vector<int> t = {0,1,2,3,4,5,6,7,8,9};
	
	do{
		int S=0;
		for(int i=0;i<10;i++){
			S += (i+1) * t[i];
			X[i][S]++;
		}
	}
	while(next_permutation(t.begin(),t.end()));
	
	int x = 1;
	for(int i=9;i>=0;i--){
		for(int j=0;j<X[i].size();j++)X[i][j]/=x;
		x *= 10-i;
	}
	
	int n,s;
	while(cin>>n>>s){
		cout<<X[n-1][s]<<endl;
	}
	
	return 0;
}
accuracy: 1
time_ms: 40
memory_kb: 6824
final_rank: 3

code_snippet: #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
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};

vector<vector<int>> ans(20, vector<int>(1000));
bool used[20];

void solve(int level, int sum){
    if(10 < level) return ;

    for(int i=0; i<=9; i++){
        if(used[i]) continue;
        used[i] = true;
        ans[level+1][sum+(level+1)*i]++;
        solve(level + 1, sum + (level + 1) * i);
        used[i] = false;
    }

    return ;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    solve(0, 0);
    
    int n, s;
    while(cin>>n>>s){
        if(330 < s) s = 0, n = 0;
        cout << ans[n][s] << endl;
    }

    return 0;
}
accuracy: 1
time_ms: 220
memory_kb: 3232
final_rank: 12

code_snippet: #include<bits/stdc++.h>
#define int long long
#define for0(i, n) for(int i = 0; i < (n); i++)
using namespace std;
int n, s;
int sum = 0;
bool b[20];
int f(int k) {
	if (sum + 9 * k * (k + 1) / 2 < s)return 0;
	int r = 0;
	if (k == 0) return s == sum;
	for0(i, 10) {
		if (sum + i * k > s)break;
		if (b[i])continue;
		b[i] = 1; sum += k * i;
		r += f(k - 1);
		b[i] = 0; sum -= k * i;
	}
	return r;
}
signed main() {
	while (cin >> n >> s) printf("%d\n", f(n));
}
accuracy: 1
time_ms: 110
memory_kb: 3212
final_rank: 8