You have to convert base 2 number into base 6 constraint : length of array <1000
You have to find sum of product of cool subset : cool subset is having number of odd element even total size of subset is k constraint size of array <1000;
- you have to find number of numbers of exact digit n whose digit sum is compact number. compact number is the number which is made by the given x, y for ex if x and y are 2 and 3 respectively then 22, 33, 23, 32 are compact numbers. x<=9 y<=9 n<=1000