Counting duplicates in Coin change problem

I recently participated in a programming contest in which there was a problem similar to the coin change problem with difference that it required to keep track of the duplicate ways of inclusion too.

For example, in the original coin change problem {1,1,2} , {1,2,1} and {2,1,1} are considered same and counted as 1.

Need some hints for this.

Thank You.

//