Submission #28185892

---

Source Code Expand

#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
// using P = pair<ll,ll>;

const ll INF = (ll)1e18;
// const int INF = (int)1e9+7;
// const int MOD = (int)1e9+7;
// const ll MOD = (int)1e9+7;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

template<typename T>
void print(vector<T> v) {
    int n = v.size();
    rep(i,n) {
        if (i == 0) cout << v[i];
        else cout << ' ' << v[i];
    }
    cout << endl;
}

ll N, X;
vector<vector<ll>> a;
int ans = 0;

void dfs(int depth, ll prod) {
    if (depth == N) {
        if (prod == X) ans++;
        return;
    }

    for (ll x : a[depth]) {
        // X < x*prod
        if (X / prod < x) continue;
        dfs(depth+1, prod*x);
    }
}

void solve() {
    cin >> N >> X;
    a.resize(N);
    rep(i,N) {
        int L;
        cin >> L;
        a[i].resize(L);
        rep(j,L) cin >> a[i][j];
    }

    dfs(0, 1);
    cout << ans << endl;
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result