using System;

class Node<T>

    {

        //attributes

        private T value;

        private Node<T> next;

        // Ctors

        public Node(T value, Node<T> next)

        {

            this.value = value;

            this.next = next;

        }

​

        public Node(T value)

        {

            this.value = value;

            this.next = null;

        }

        //Get , Set

        public T GetValue()

        {  return this.value; }

        public void SetValue(T value)

        { this.value = value; }

        public Node<T> GetNext()

        { return this.next; }

        public void SetNext(Node<T> next)

        { this.next = next; }

        //other

        public bool HasNext()

        { return (this.next != null); }

        public override string ToString()

        {

            return this.value + ",";

        }

​

    }

public class Stack<T>

    {

        // ייצוג המחסנית באמצעות חוליות

        private Node<T> first;

​

​

        public Stack()

        {

            this.first = null;

        }

​

        public bool IsEmpty()

        {

            return this.first == null;

        }

​

        public void Push(T x)

        {

            Node<T> temp = new Node<T>(x, this.first);

            this.first = temp;

        }

        public T Pop()

        {

            T x = this.first.GetValue();

            this.first = this.first.GetNext();

​

            return x;

        }

​

        public T Top()

        {

            return this.first.GetValue();          

        }

​

​

        public override string ToString()

        {

            string str = "";

​

            Node<T> temp = this.first;

​

            while (temp != null)

            {

                str += temp.GetValue();

                if (temp.GetNext() != null)

                {

                    str += ",";

                }

​

                temp = temp.GetNext();

            }

​

            return str;

        }

​

    }

public class HelloWorld

{

    public static bool IsExistarr(int[] arr, int num)

        {

            for (int i = 0; i < arr.Length; i++)

                if (arr[i] == num)

                    return true;

            return false;

        }

​

        public static bool AreExist(Stack<int> st, int[]arr)

        {

            if (st.IsEmpty())

                return false;

            Stack<int> ezer = new Stack<int>();

            bool check=false;

            int lastnum = 0;

            int beforelastnum = 0;

            while (!st.IsEmpty())

            {

                if (st.Top()!=0&&IsExistarr(arr, st.Top()) && IsExistarr(arr, lastnum) && IsExistarr(arr, beforelastnum))

                    check = true;

                beforelastnum = lastnum;

                lastnum = st.Top();

                ezer.Push(st.Pop());

            }

            while (!ezer.IsEmpty())

                st.Push(ezer.Pop());

            return check;

​

        }

        public static Stack<int> Idk(int[] ignored,int sum)

        {

            Stack<int> st = new Stack<int>();

            for (int i=1; i<=9;i++)

            {

                if (!IsExistarr(ignored, i))

                for (int j = 1; j <= 9; j++)

                {

                   if (!IsExistarr(ignored, j))

                        for (int k = 1; k <= 9; k++)

                        {

                             if (!IsExistarr(ignored, k)&&i!=j &&j!=k&&k!=i)

                            {

                                int[] arr = new int[3] { i, j, k };

                                if (i + j + k == sum && !AreExist(st, arr))

                                {

                                st.Push(i);

                                st.Push(j);

                                st.Push(k);

                                st.Push(0);

                                Console.WriteLine(i + "+" + j + "+" + k + "=" + sum);

                                }

​

                            }

                        }

​

                }

​

            }

            return st;

        }

    public static Stack<int> CloneStack (Stack<int> st)

    {

        Stack<int> ezer= new Stack<int> ();

        Stack<int> ezer2= new Stack<int> ();

        while (!st.IsEmpty())

        {

            ezer.Push(st.Pop());

        }

        while (!ezer.IsEmpty())

        {

            ezer2.Push(ezer.Top());

            st.Push(ezer.Pop());

        }

        return ezer2;

    }

    public static void InsertStack(Stack<int> st, int num)

    {

        Stack<int> ezer= new Stack<int> ();

        while (!st.IsEmpty())

        {

        }

    }

    public static Stack<int> Idkfour (int[]ignored, int sum)

    {

        Stack<int>st= new Stack<int>();

        Stack<int>ezer= new Stack<int>();

        for (int i=1; i<=9; i++)

        {

            int tempsum= sum-i;

            ezer=Idk(ignored, tempsum);

            While(!ezer.IsEmpty())

            {

                if(st.Top()!=0)

                st.Push(ezer.Pop());

                else

                {

                    st.Push(i);

                    st.Push(ezer.Pop());

                }

            }

        }

    }

        public static void Main(string[] args)

        {

            int[] ignored = new int[1] { 0};

            int sum = 14;

            Idk(ignored, sum);

        }

    }

​

​