CareerCup

so many bug on that one.
try to test those.
AAAACCCCBB, ACBACBACBA, ABCCC

// C#, O(NumOfDice * NumOfDice * Total)
<code><pre class="language-java">
public static string GetMutation(int[] arr, int total)
{
var sum = 0;
var str = "";
foreach (var n in arr)
{
str = str + ", " + n;
sum += n;
}
if (total == sum)
{
return str;
}
return "";
}
public static List<string> GetMutations(int NumOfFace, int NumOfDice, int Sum)
{
var permuation = new List<string>();
//no permuation
if (Sum < NumOfDice || Sum > NumOfFace*NumOfDice)
{
return permuation;
}

var getMin = Sum > NumOfFace? NumOfFace: (Sum-NumOfDice+1) ;
// var dir = new Dictionary<int, int>();
var list = new int[NumOfDice];

for (int j = 0; NumOfDice > j; j++)
{
list[j] = 1;
}
var aaa = GetMutation(list, Sum);
if (!string.IsNullOrEmpty(aaa) )
{
permuation.Add(aaa);
return permuation;
}

bool isoverFlow = false;
while (!isoverFlow)
{
aaa = GetMutation(list, Sum);
if (!string.IsNullOrEmpty(aaa))
{
permuation.Add(aaa);
}
for (int j = 0; j < NumOfDice; j++)
{

if (list[j] == getMin )
{
if (j + 1 == NumOfDice)
{
isoverFlow = true;
break;
}
list[j] = 1;
}
else
{
list[j]++;
for (int k = 0; k < j; k++)
{
list[k] = list[j];
}
break;
}

}

}
return permuation;
}
</code> </pre>