dynamic_programming.bitmask
===========================

.. py:module:: dynamic_programming.bitmask

.. autoapi-nested-parse::

   This is a Python implementation for questions involving task assignments between people.
   Here Bitmasking and DP are used for solving this.

   Question :-
   We have N tasks and M people. Each person in M can do only certain of these tasks. Also
   a person can do only one task and a task is performed only by one person.
   Find the total no of ways in which the tasks can be distributed.



Attributes
----------

.. autoapisummary::

   dynamic_programming.bitmask.total_tasks


Classes
-------

.. autoapisummary::

   dynamic_programming.bitmask.AssignmentUsingBitmask


Module Contents
---------------

.. py:class:: AssignmentUsingBitmask(task_performed, total)

   .. py:method:: count_no_of_ways(task_performed)


   .. py:method:: count_ways_until(mask, task_no)


   .. py:attribute:: dp


   .. py:attribute:: final_mask


   .. py:attribute:: task


   .. py:attribute:: total_tasks


.. py:data:: total_tasks
   :value: 5