using System;

using System.Linq;

​

public class Program

{

    public static void Main()

    {

        Console.WriteLine("Hello World");

        int firstCluster = 5; // first clusters

        int n = 7; // max number of clusters,

        int m = 3; // req. # of clusters 

        int[] arr = new int[m];

        arr[0] = firstCluster; // Preset first cluster to result

        bool found = getClusterPermuation(arr, n, m, 1);

        // if found, the arr is our cluster list to link FAT entries

    }

​

    static bool getClusterPermuation(int[] arr, int n, int m, int index)

    {

        bool found = false;

        if (index == m)

        {

            // DEBUG output to see output combo

            for (int i = 0; i < m; i++)

                Console.Write("{0} ", arr[i]);

            Console.WriteLine();

            // Load cluster buffer according to arr and verify SHA

            bool SHAMatch = false;

            return SHAMatch;

        }

        // add `&& !found` to loop exit condition will return with arr contain the sequence

        for (int i = 3; i <= n; i++) // always starts cluster 3 as 0-2 are not used

        {

            if (arr.Contains(i))

                continue;

            arr[index] = i;

            found = getClusterPermuation(arr, n, m, index + 1);

        }

        return found;

    }

/*

​

    static bool getClusterPermuation(int[] arr, int n, int m, int index, int start, int firstCluster)

    {

        bool found = false;

        if (index == m)

        {

            Console.Write("{0} ", firstCluster);

            for (int i = 0; i < m; i++)

                Console.Write("{0} ", arr[i]);

            Console.WriteLine();

            // Load clusters and match SHA, if match return true, otherwise false

            return true; // found

        }

​

        // add `&& !found` to loop exit condition will return with arr contain the sequence

        for (int i = 3; i <= n; i++) // always starts cluster 3 as 0-2 are not used

        {

            if (i == firstCluster || arr.Contains(i))

                continue;

            arr[index] = i;

            found = getClusterPermuation(arr, n, m, index + 1, i + 1, firstCluster);

        }

        return found; // not found

    }

    */

}