Submission #69334627

---

Source Code Expand

  //#include "atcoder/modint"
  #pragma GCC optimize("Ofast")
  #include "atcoder/all"
  #include <bits/stdc++.h>
  #include  <string>
  using namespace std;
  using namespace atcoder;
  #define int long long
    template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
  template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
  //const int MOD =1e9+7;
  //constexpr int MOD =10;
  constexpr int MOD =998244353;
  const long long M1=167772161,M2=469762049,M3=1224736769;
  //const int MOD =31607;
  using mint = static_modint<MOD>;
  //using mint = double;
  //using mint = modint;
  ostream& operator << (ostream& ost, const mint& m){ost << m.val();return ost;}
  istream& operator >> (istream& ost,  mint& m){int a;ost >> a;m=a;return ost;}
  double time_limit = 100.0,start_temp=0.01,end_temp=0.0;
  std::mt19937 rng(std::random_device{}()); 
int ans=0,dp[1ll<<20]={},lcx[1ll<<20];
  signed main(){
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);
    int n,m,y,s=1;
    cin>>n>>m>>y;
    int a[n];
    for(int i=0;i<n;i++)cin>>a[i];
    map<int,int>mp;
    for(int i=m;i<=n;i++){
      mp[i]=s;
      s=-s*(i+1)/(i+1-m);
    }
   
    
    dp[0]=y,lcx[0]=1;
    
    for(unsigned long long i=1;i<(1ll<<n);i++){
      for(int j=n-1;j>=0;j--)if(i&(1ll<<j)){
        if(lcx[i^(1ll<<j)]==-1|| lcx[i^(1ll<<j)]/gcd(lcx[i^(1ll<<j)],a[j])>y/a[j])lcx[i]=-1,dp[i]=0;
        else lcx[i]=lcx[i^(1ll<<j)]/gcd(lcx[i^(1ll<<j)],a[j])*a[j],dp[i]=y/lcx[i];
      
        if(popcount(i)>=m)ans+=mp[popcount(i)]*dp[i];
        break;
      }

    }
    cout<<ans<<endl;



  
 
   

  }

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:41:33: warning: comparison of integer expressions of different signedness: ‘long long unsigned int’ and ‘long long int’ [-Wsign-compare]
   41 |     for(unsigned long long i=1;i<(1ll<<n);i++){
      |                                ~^~~~~~~~~

Judge Result