martinerk0

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace learnHack
{
    class infix
    {

martinerk0

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace learnHack
{
    class knapsack
    {

martinerk0

static void  lis2(int [] A){
        /* Initialize LIS values for all indexes */
            int n = A.Length;
            int max = int.MinValue;
            int[] L = new int[n]; ;
            for (int i = 0; i < n; i++)
            {
                L[i] = 1;
            }
           /* Compute optimized LIS values in bottom up manner */

martinerk0

fasdf

martinerk0

#!/bin/bash
# Martin Cerven 2015
# Turing Machine simulator


inputName="input.txt"  # path to file with rules

# parameters: current state , current symbol on the tape
# execute next step based on current configuation