CHEFCODE - Editorial

#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;cin>>n>>k;int a[n],ans=0;
for(int i=0;i<n;i++)cin>>a[i];
int up=1<<n;
for(int i=0;i<=up-1;i++)
{
int pro=1;
for(int j=0;j<=n-1;j++)
{
if(i&(1<<j))pro*=a[j];
}
if(pro<=k)ans++;
}cout<<ans<<endl;
}

Giving wrong answer ?