Редици.02.Сума образувана от поредни елементи

using System;
class LongestEqualSubsequence
{
    static int[] array = { 1, 23, 3, 4, 6, 5, 5, 6, 8, 6, 3, 7, 8, 45 };
    static void Main()
    {
        int sum = 24;

        int newSum = 0, index = 0;
        bool isFound = false;

        for (int i = 0; i < array.Length; i++)
        {
            newSum = array[i];
            for (int j = i + 1; j < array.Length; j++)
            {
                newSum += array[j];
                if (newSum == sum)
                {
                    isFound = true;
                    index = i;
                    PrintNumbers(index,sum);
                    break;
                }
            }
            newSum = 0;
        }
        if (!isFound)
        {
            Console.WriteLine("Nqma takova jivotno");
        }
     }

    static void PrintNumbers(int index, int sum)
    {
        int result = 0;
        while(result < sum)
        {
            Console.Write(array[index] + " ");
            result += array[index];
            index++;
        }
        Console.Write(" = " + sum);
        Console.WriteLine();
    }
}