Auto comment: topic has been updated by wadhwasahil (previous revision, new revision, compare).

Look at the editorial it is quiet good. You may want to look at problem : http://www.spoj.com/problems/ASSIGN/

I couldn't submit my solution in Codechef because when I click on "Submit", it sends me back to the problem statement like nothing happened.

Well... anyway, what I did was, first make a list of all people that can wear each shirt, then iterate on shirts and try to assign them to unassigned people. So let's have DP[i][m] which means ways to reach a state where I processed the first i shirts and the people in mask m have been assigned a shirt already. The answer will be DP[100][2^N - 1].