Count_Subsequences_having_product_less_than_k.txt

int dp[k+1][n+1];
memset(dp,-1,sizeof(dp));
for(int i=0;i<=k;i++)
{
  for(int j=1;j<=n;j++)
 {
   dp[i][j]=dp[i-1][j-1];
 }
  if(arr[j-1]<=i)
  {
   dp[i][j]=dp[i/arr[j-1][j-1]+1;
  }
  }
 return dp[k][n];
}