Submission #71809065

---

Source Code Expand

#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
using namespace std::chrono;
using ll = long long;
using ull = unsigned long long;
#define COUT(num,len) cout << fixed << setprecision(len) << num;
#define ALL(x) (x).begin(), (x).end()
#define coutY cout << "Yes" << endl;
#define coutN cout << "No" << endl;
#define arrIn(arr, start, N) for (int i = (start); i < (N); ++i) cin >> arr[i];
#define arrOut(arr, start, N) for  (int i = (start); i < (N); ++i) { cout << arr[i] <<" "; } cout << endl;
#define arrCopy(arr1,arr2, start, N) for (int i = (start); i < (N); ++i) arr2[i]= arr1[i];
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }
void YN(bool tf) { cout << (tf ? "YES\n" : "NO\n"); }
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string abc="abcdefghijklmnopqrstuvwxyz";

//cout << fixed << setprecision(20) <<

ll gcd(ll a, ll b){ //最大公約数
  if(a%b == 0){
    return b;
  }else{
    return gcd(b, a%b);
  }
}

ll lcm(ll a, ll b){ //最小公倍数
  return a*b / gcd(a, b);
}

auto start = high_resolution_clock::now();

bool CheckTime(auto limit,auto eps){
  auto end = high_resolution_clock::now();
  return  duration_cast<milliseconds>(end - start).count()<limit-eps;
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  ll N,X;
  cin >> N >> X;
  vector<ll> L(N);
  ll stop=1;
  vector<vector<double>> a(N);
  for(ll i=0;i<N;i++){
    cin >> L[i];
    stop*=L[i];
    for(ll j=0;j<L[i];j++){
      ll input;
      cin >> input;
      a[i].push_back(input);
    }
  }
  ll count=0;
  
  ll k=0;
  double big=1000000000000000000;
  while(k<stop){
    double check=1;
    ll k2=k;
    for(ll i=N-1;i>-1;i--){
      check*=a[i][k2%L[i]];
      if(check>big||check<=0){
        break;
      }
      k2/=L[i];
    }
    if(check==X){
      count++;
    }

    k++;
  }
  cout << count << endl;

  return 0;
}

Submission Info

Judge Result