16.11 | C# Online Compiler

16.11 by Master)=

using System;
using System.Collections.Generic;

public class DoublyLinkedList<T>
{
	private class ListNode
	{
		public T Element
		{ get; set; }

		public ListNode NextNode
		{ get; set; }

		public ListNode PreviousNode
		{ get; set; }

		public ListNode(T element)
		{
			this.Element = element;
			NextNode = null;
			PreviousNode = null;
		}
		
		public ListNode(T element, ListNode prevNode)
		{
			this.Element = element;
			prevNode.NextNode = this;
			this.PreviousNode = prevNode;
		}
	}
	private ListNode head;
	private ListNode tail;
	private int count;
		
	public DoublyLinkedList()
	{
		this.head = null;
		this.tail = null;
		this.count = 0;
	}
		
	public void Add(T item)
	{
		if (this.head == null)
		{
			this.head = new ListNode(item);
			this.tail = this.head;
		}
		else
		{
			ListNode newNode = new ListNode(item, this.tail);
			//this.tail.NextNode = newNode;
			this.tail = newNode;
		}
		this.count++;
	}
	
	public T RemoveAt(int index)
	{
		if (index >= count || index < 0)
		{
			throw new ArgumentOutOfRangeException("Invalid index: " + index);
		}
		int currentIndex = 0;
		ListNode currentNode = this.head;
		ListNode prevNode = null;
		
		while (currentIndex < index)
		{
			prevNode = currentNode;
			
			currentNode = currentNode.NextNode;
			currentIndex++;
		}
		RemoveListNode(currentNode, prevNode);
		return currentNode.Element;
	}
	private void RemoveListNode(ListNode node, ListNode prevNode)
	{
		count--;
		if (count == 0)
		{
			this.head = null;
			this.tail = null;
		}
		else if (prevNode == null)
		{
			this.head = node.NextNode;
		}
		else if (node.NextNode == null)
		{
			this.tail = node.PreviousNode;
		}
		else
		{
			prevNode.NextNode = node.NextNode;
		}
	//	if (object.ReferenceEquals(this.tail, node))
	//	{ this.tail = prevNode; }
	}
	
	public int Remove(T item)
	{
		int currentIndex = 0;
		ListNode currentNode = this.head;
		ListNode prevNode = null;
		while (currentNode !=null)
		{
			if (object.Equals(currentNode.Element, item))
			{
				break;
			}
			prevNode = currentNode;
			currentNode = currentNode.NextNode;
			currentIndex++;
		}
		if (currentNode != null)
		{	
			RemoveListNode(currentNode, prevNode);
			return currentIndex;
		}
		else
		{
			return -1;
		}
	}
	public int IndexOf(T item)
	{
		int index = 0;
		ListNode currentNode = this.head;
		while (currentNode != null)
		{
			if (object.Equals(currentNode.Element, item))
			{
				return index;
			}
			currentNode = currentNode.NextNode;
			index++;
		}
		return -1;
	}
	
	public bool Contains(T item)
	{
		int index = IndexOf(item);
		bool found = (index != -1);
		return found;
	}
	
	public T this[int index]
	{
		get
		{
			if (index >= count || index < 0)
			{
				throw new ArgumentOutOfRangeException("Invalid index: " + index);
			}
			ListNode currentNode = this.head;
			for (int i = 0; i < index; i++)
			{
				currentNode = currentNode.NextNode;
			}
			return currentNode.Element;
		}
		set
		{
			if (index >= count || index < 0)
			{
				throw new ArgumentOutOfRangeException("Invalid index: " + index);
			}
			ListNode currentNode = this.head;
			for (int i = 0; i < index; i++)
			{
				currentNode = currentNode.NextNode;
			}
			currentNode.Element = value;
		}
	}
	public int Count
		{
			get {return this.count;}
		}
}

public class DoublyLinkedListTest
{
	public static void Main()
	{
		DoublyLinkedList<string> shoppingList = new DoublyLinkedList<string>();
		shoppingList.Add("Milk");
		shoppingList.Remove("Milk"); // Empty list
		shoppingList.Add("Honey");
		shoppingList.Add("Olives");
		shoppingList.Add("Water");
		shoppingList[2] = "A lot of " + shoppingList[2];
		shoppingList.Add("Fruits");
		shoppingList.RemoveAt(0); // Removes "Honey" (first)
		shoppingList.RemoveAt(2); // Removes "Fruits" (last)
		shoppingList.Add(null);
		shoppingList.Add("Beer");
		shoppingList.Remove(null);
		Console.WriteLine("We need to buy:");
		for (int i = 0; i < shoppingList.Count; i++)
		{
			Console.WriteLine(" - " + shoppingList[i]);
		}
		Console.WriteLine("Position of 'Beer' = {0}",
		shoppingList.IndexOf("Beer"));
		Console.WriteLine("Position of 'Water' = {0}",
		shoppingList.IndexOf("Water"));
		Console.WriteLine("Do we have to buy Bread? " +
		shoppingList.Contains("Bread"));
	}
}

/*Implement the data structure dynamic doubly linked list
(DoublyLinkedList<T>) – list, the elements of which have pointers both
to the next and the previous elements. Implement the operations for
adding, removing and searching for an element, as well as inserting an
element at a given index, retrieving an element by a given index and a
method, which returns an array with the elements of the list.*/

​x
 
using System;
using System.Collections.Generic;
​
public class DoublyLinkedList<T>
{
    private class ListNode
    {
        public T Element
        { get; set; }
​
        public ListNode NextNode
        { get; set; }
​
        public ListNode PreviousNode
        { get; set; }
​
        public ListNode(T element)
        {
            this.Element = element;
            NextNode = null;
            PreviousNode = null;
        }
        
        public ListNode(T element, ListNode prevNode)
        {
            this.Element = element;
            prevNode.NextNode = this;
            this.PreviousNode = prevNode;
        }
    }
    private ListNode head;
    private ListNode tail;
    private int count;
        
    public DoublyLinkedList()
    {
        this.head = null;
        this.tail = null;
        this.count = 0;
    }
        
    public void Add(T item)
    {
        if (this.head == null)
        {
            this.head = new ListNode(item);
            this.tail = this.head;
        }
        else
        {
            ListNode newNode = new ListNode(item, this.tail);
            //this.tail.NextNode = newNode;
            this.tail = newNode;
        }
        this.count++;
    }
    
    public T RemoveAt(int index)
    {
        if (index >= count || index < 0)
        {
            throw new ArgumentOutOfRangeException("Invalid index: " + index);
        }
        int currentIndex = 0;
        ListNode currentNode = this.head;
        ListNode prevNode = null;
        
        while (currentIndex < index)
        {
            prevNode = currentNode;
            
            currentNode = currentNode.NextNode;
            currentIndex++;
        }
        RemoveListNode(currentNode, prevNode);
        return currentNode.Element;
    }
    private void RemoveListNode(ListNode node, ListNode prevNode)
    {
        count--;
        if (count == 0)
        {
            this.head = null;
            this.tail = null;
        }
        else if (prevNode == null)
        {
            this.head = node.NextNode;
        }
        else if (node.NextNode == null)
        {
            this.tail = node.PreviousNode;
        }
        else
        {
            prevNode.NextNode = node.NextNode;
        }
    //  if (object.ReferenceEquals(this.tail, node))
    //  { this.tail = prevNode; }
    }
    
    public int Remove(T item)
    {
        int currentIndex = 0;
        ListNode currentNode = this.head;
        ListNode prevNode = null;
        while (currentNode !=null)
        {
            if (object.Equals(currentNode.Element, item))
            {
                break;
            }
            prevNode = currentNode;
            currentNode = currentNode.NextNode;
            currentIndex++;
        }
        if (currentNode != null)
        {   
            RemoveListNode(currentNode, prevNode);
            return currentIndex;
        }
        else
        {
            return -1;
        }
    }
    public int IndexOf(T item)
    {
        int index = 0;
        ListNode currentNode = this.head;
        while (currentNode != null)
        {
            if (object.Equals(currentNode.Element, item))
            {
                return index;
            }
            currentNode = currentNode.NextNode;
            index++;
        }
        return -1;
    }
    
    public bool Contains(T item)
    {
        int index = IndexOf(item);
        bool found = (index != -1);
        return found;
    }
    
    public T this[int index]
    {
        get
        {
            if (index >= count || index < 0)
            {
                throw new ArgumentOutOfRangeException("Invalid index: " + index);
            }
            ListNode currentNode = this.head;
            for (int i = 0; i < index; i++)
            {
                currentNode = currentNode.NextNode;
            }
            return currentNode.Element;
        }
        set
        {
            if (index >= count || index < 0)
            {
                throw new ArgumentOutOfRangeException("Invalid index: " + index);
            }
            ListNode currentNode = this.head;
            for (int i = 0; i < index; i++)
            {
                currentNode = currentNode.NextNode;
            }
            currentNode.Element = value;
        }
    }
    public int Count
        {
            get {return this.count;}
        }
}
​
public class DoublyLinkedListTest
{
    public static void Main()
    {
        DoublyLinkedList<string> shoppingList = new DoublyLinkedList<string>();
        shoppingList.Add("Milk");
        shoppingList.Remove("Milk"); // Empty list
        shoppingList.Add("Honey");
        shoppingList.Add("Olives");
        shoppingList.Add("Water");
        shoppingList[2] = "A lot of " + shoppingList[2];
        shoppingList.Add("Fruits");
        shoppingList.RemoveAt(0); // Removes "Honey" (first)
        shoppingList.RemoveAt(2); // Removes "Fruits" (last)
        shoppingList.Add(null);
        shoppingList.Add("Beer");
        shoppingList.Remove(null);
        Console.WriteLine("We need to buy:");
        for (int i = 0; i < shoppingList.Count; i++)
        {
            Console.WriteLine(" - " + shoppingList[i]);
        }
        Console.WriteLine("Position of 'Beer' = {0}",
        shoppingList.IndexOf("Beer"));
        Console.WriteLine("Position of 'Water' = {0}",
        shoppingList.IndexOf("Water"));
        Console.WriteLine("Do we have to buy Bread? " +
        shoppingList.Contains("Bread"));
    }
}
​
/*Implement the data structure dynamic doubly linked list
(DoublyLinkedList<T>) – list, the elements of which have pointers both
to the next and the previous elements. Implement the operations for
adding, removing and searching for an element, as well as inserting an
element at a given index, retrieving an element by a given index and a
method, which returns an array with the elements of the list.*/

---------------------------------
Cipher: r Crib: l E: g
Cipher: y Crib: i E: q
Cipher: i Crib: n E: v
Cipher: b Crib: c E: z
Cipher: p Crib: o E: b
Cipher: c Crib: l E: r
Cipher: a Crib: n E: n
Key: gqvzbrn
---------------------------------
Cipher: y Crib: l E: n
Cipher: i Crib: i E: a
Cipher: b Crib: n E: o
Cipher: p Crib: c E: n
Cipher: c Crib: o E: o
Cipher: a Crib: l E: p
Cipher: r Crib: n E: e
Key: naonope
---------------------------------
Cipher: i Crib: l E: x
Cipher: b Crib: i E: t
Cipher: p Crib: n E: c
Cipher: c Crib: c E: a
Cipher: a Crib: o E: m
Cipher: r Crib: l E: g
Cipher: r Crib: n E: e
Key: xtcamge
---------------------------------
Cipher: b Crib: l E: q
Cipher: p Crib: i E: h
Cipher: c Crib: n E: p
Cipher: a Crib: c E: y
Cipher: r Crib: o E: d
Cipher: r Crib: l E: g
Cipher: r Crib: n E: e
Key: qhpydge
---------------------------------
Cipher: p Crib: l E: e
Cipher: c Crib: i E: u
Cipher: a Crib: n E: n
Cipher: r Crib: c E: p
Cipher: r Crib: o E: d
Cipher: r Crib: l E: g
Cipher: w Crib: n E: j
Key: eunpdgj
---------------------------------
Cipher: c Crib: l E: r
Cipher: a Crib: i E: s
Cipher: r Crib: n E: e
Cipher: r Crib: c E: p
Cipher: r Crib: o E: d
Cipher: w Crib: l E: l
Cipher: e Crib: n E: r
Key: rsepdlr
---------------------------------
Cipher: a Crib: l E: p
Cipher: r Crib: i E: j
Cipher: r Crib: n E: e
Cipher: r Crib: c E: p
Cipher: w Crib: o E: i
Cipher: e Crib: l E: t
Cipher: r Crib: n E: e
Key: pjepite
---------------------------------
Cipher: r Crib: l E: g
Cipher: r Crib: i E: j
Cipher: r Crib: n E: e
Cipher: w Crib: c E: u
Cipher: e Crib: o E: q
Cipher: r Crib: l E: g
Cipher: y Crib: n E: l
Key: gjeuqgl
---------------------------------
Cipher: r Crib: l E: g
Cipher: r Crib: i E: j
Cipher: w Crib: n E: j
Cipher: e Crib: c E: c
Cipher: r Crib: o E: d
Cipher: y Crib: l E: n
Cipher: b Crib: n E: o
Key: gjjcdno
---------------------------------
Cipher: r Crib: l E: g
Cipher: w Crib: i E: o
Cipher: e Crib: n E: r
Cipher: r Crib: c E: p
Cipher: y Crib: o E: k
Cipher: b Crib: l E: q
Cipher: r Crib: n E: e
Key: gorpkqe
---------------------------------
Cipher: w Crib: l E: l
Cipher: e Crib: i E: w
Cipher: r Crib: n E: e
Cipher: y Crib: c E: w
Cipher: b Crib: o E: n
Cipher: r Crib: l E: g
Cipher: m Crib: n E: z
Key: lwewngz
---------------------------------
Cipher: e Crib: l E: t
Cipher: r Crib: i E: j
Cipher: y Crib: n E: l
Cipher: b Crib: c E: z
Cipher: r Crib: o E: d
Cipher: m Crib: l E: b
Cipher: p Crib: n E: c
Key: tjlzdbc
---------------------------------
Cipher: r Crib: l E: g
Cipher: y Crib: i E: q
Cipher: b Crib: n E: o
Cipher: r Crib: c E: p
Cipher: m Crib: o E: y
Cipher: p Crib: l E: e
Cipher: e Crib: n E: r
Key: gqopyer
---------------------------------
Cipher: y Crib: l E: n
Cipher: b Crib: i E: t
Cipher: r Crib: n E: e
Cipher: m Crib: c E: k
Cipher: p Crib: o E: b
Cipher: e Crib: l E: t
Cipher: e Crib: n E: r
Key: ntekbtr
---------------------------------
Cipher: b Crib: l E: q
Cipher: r Crib: i E: j
Cipher: m Crib: n E: z
Cipher: p Crib: c E: n
Cipher: e Crib: o E: q
Cipher: e Crib: l E: t
Cipher: r Crib: n E: e
Key: qjznqte
---------------------------------
Cipher: r Crib: l E: g
Cipher: m Crib: i E: e
Cipher: p Crib: n E: c
Cipher: e Crib: c E: c
Cipher: e Crib: o E: q
Cipher: r Crib: l E: g
Cipher: x Crib: n E: k
Key: geccqgk
---------------------------------
Cipher: m Crib: l E: b
Cipher: p Crib: i E: h
Cipher: e Crib: n E: r
Cipher: e Crib: c E: c
Cipher: r Crib: o E: d
Cipher: x Crib: l E: m
Cipher: x Crib: n E: k
Key: bhrcdmk
---------------------------------
Cipher: p Crib: l E: e
Cipher: e Crib: i E: w
Cipher: e Crib: n E: r
Cipher: r Crib: c E: p
Cipher: x Crib: o E: j
Cipher: x Crib: l E: m
Cipher: i Crib: n E: v
Key: ewrpjmv
---------------------------------
Cipher: e Crib: l E: t
Cipher: e Crib: i E: w
Cipher: r Crib: n E: e
Cipher: x Crib: c E: v
Cipher: x Crib: o E: j
Cipher: i Crib: l E: x
Cipher: o Crib: n E: b
Key: twevjxb
---------------------------------
Cipher: e Crib: l E: t
Cipher: r Crib: i E: j
Cipher: x Crib: n E: k
Cipher: x Crib: c E: v
Cipher: i Crib: o E: u
Cipher: o Crib: l E: d
Cipher: m Crib: n E: z
Key: tjkvudz
---------------------------------
Cipher: r Crib: l E: g
Cipher: x Crib: i E: p
Cipher: x Crib: n E: k
Cipher: i Crib: c E: g
Cipher: o Crib: o E: a
Cipher: m Crib: l E: b
Cipher: w Crib: n E: j
Key: gpkgabj
---------------------------------
Cipher: x Crib: l E: m
Cipher: x Crib: i E: p
Cipher: i Crib: n E: v
Cipher: o Crib: c E: m
Cipher: m Crib: o E: y
Cipher: w Crib: l E: l
Cipher: t Crib: n E: g
Key: mpvmylg
---------------------------------
Cipher: x Crib: l E: m
Cipher: i Crib: i E: a
Cipher: o Crib: n E: b
Cipher: m Crib: c E: k
Cipher: w Crib: o E: i
Cipher: t Crib: l E: i
Cipher: n Crib: n E: a
Key: mabkiia
---------------------------------
Cipher: i Crib: l E: x
Cipher: o Crib: i E: g
Cipher: m Crib: n E: z
Cipher: w Crib: c E: u
Cipher: t Crib: o E: f
Cipher: n Crib: l E: c
Cipher: f Crib: n E: s
Key: xgzufcs
---------------------------------
Cipher: o Crib: l E: d
Cipher: m Crib: i E: e
Cipher: w Crib: n E: j
Cipher: t Crib: c E: r
Cipher: n Crib: o E: z
Cipher: f Crib: l E: u
Cipher: z Crib: n E: m
Key: dejrzum
---------------------------------
Cipher: m Crib: l E: b
Cipher: w Crib: i E: o
Cipher: t Crib: n E: g
Cipher: n Crib: c E: l
Cipher: f Crib: o E: r
Cipher: z Crib: l E: o
Cipher: r Crib: n E: e
Key: boglroe
---------------------------------
Cipher: w Crib: l E: l
Cipher: t Crib: i E: l
Cipher: n Crib: n E: a
Cipher: f Crib: c E: d
Cipher: z Crib: o E: l
Cipher: r Crib: l E: g
Cipher: r Crib: n E: e
Key: lladlge
---------------------------------
Cipher: t Crib: l E: i
Cipher: n Crib: i E: f
Cipher: f Crib: n E: s
Cipher: z Crib: c E: x
Cipher: r Crib: o E: d
Cipher: r Crib: l E: g
Cipher: y Crib: n E: l
Key: ifsxdgl
---------------------------------
Cipher: n Crib: l E: c
Cipher: f Crib: i E: x
Cipher: z Crib: n E: m
Cipher: r Crib: c E: p
Cipher: r Crib: o E: d
Cipher: y Crib: l E: n
Cipher: b Crib: n E: o
Key: cxmpdno
---------------------------------
Cipher: f Crib: l E: u
Cipher: z Crib: i E: r
Cipher: r Crib: n E: e
Cipher: r Crib: c E: p
Cipher: y Crib: o E: k
Cipher: b Crib: l E: q
Cipher: m Crib: n E: z
Key: urepkqz
---------------------------------
Cipher: z Crib: l E: o
Cipher: r Crib: i E: j
Cipher: r Crib: n E: e
Cipher: y Crib: c E: w
Cipher: b Crib: o E: n
Cipher: m Crib: l E: b
Cipher: z Crib: n E: m
Key: ojewnbm
---------------------------------
Cipher: r Crib: l E: g
Cipher: r Crib: i E: j
Cipher: y Crib: n E: l
Cipher: b Crib: c E: z
Cipher: m Crib: o E: y
Cipher: z Crib: l E: o
Cipher: c Crib: n E: p
Key: gjlzyop
---------------------------------
Cipher: r Crib: l E: g
Cipher: y Crib: i E: q
Cipher: b Crib: n E: o
Cipher: m Crib: c E: k
Cipher: z Crib: o E: l
Cipher: c Crib: l E: r
Cipher: h Crib: n E: u
Key: gqoklru
---------------------------------
Cipher: y Crib: l E: n
Cipher: b Crib: i E: t
Cipher: m Crib: n E: z
Cipher: z Crib: c E: x
Cipher: c Crib: o E: o
Cipher: h Crib: l E: w
Cipher: n Crib: n E: a
Key: ntzxowa
---------------------------------
Cipher: b Crib: l E: q
Cipher: m Crib: i E: e
Cipher: z Crib: n E: m
Cipher: c Crib: c E: a
Cipher: h Crib: o E: t
Cipher: n Crib: l E: c
Cipher: d Crib: n E: q
Key: qematcq
---------------------------------
Cipher: m Crib: l E: b
Cipher: z Crib: i E: r
Cipher: c Crib: n E: p
Cipher: h Crib: c E: f
Cipher: n Crib: o E: z
Cipher: d Crib: l E: s
Cipher: p Crib: n E: c
Key: brpfzsc
---------------------------------
Cipher: z Crib: l E: o
Cipher: c Crib: i E: u
Cipher: h Crib: n E: u
Cipher: n Crib: c E: l
Cipher: d Crib: o E: p
Cipher: p Crib: l E: e
Cipher: x Crib: n E: k
Key: ouulpek
---------------------------------
Cipher: c Crib: l E: r
Cipher: h Crib: i E: z
Cipher: n Crib: n E: a
Cipher: d Crib: c E: b
Cipher: p Crib: o E: b
Cipher: x Crib: l E: m
Cipher: h Crib: n E: u
Key: rzabbmu
---------------------------------
Cipher: h Crib: l E: w
Cipher: n Crib: i E: f
Cipher: d Crib: n E: q
Cipher: p Crib: c E: n
Cipher: x Crib: o E: j
Cipher: h Crib: l E: w
Cipher: d Crib: n E: q
Key: wfqnjwq
---------------------------------
Cipher: n Crib: l E: c
Cipher: d Crib: i E: v
Cipher: p Crib: n E: c
Cipher: x Crib: c E: v
Cipher: h Crib: o E: t
Cipher: d Crib: l E: s
Cipher: z Crib: n E: m
Key: cvcvtsm
---------------------------------
Cipher: d Crib: l E: s
Cipher: p Crib: i E: h
Cipher: x Crib: n E: k
Cipher: h Crib: c E: f
Cipher: d Crib: o E: p
Cipher: z Crib: l E: o
Cipher: t Crib: n E: g
Key: shkfpog
---------------------------------
Cipher: p Crib: l E: e
Cipher: x Crib: i E: p
Cipher: h Crib: n E: u
Cipher: d Crib: c E: b
Cipher: z Crib: o E: l
Cipher: t Crib: l E: i
Cipher: p Crib: n E: c
Key: epublic
---------------------------------
Cipher: x Crib: l E: m
Cipher: h Crib: i E: z
Cipher: d Crib: n E: q
Cipher: z Crib: c E: x
Cipher: t Crib: o E: f
Cipher: p Crib: l E: e
Cipher: d Crib: n E: q
Key: mzqxfeq
---------------------------------
Cipher: h Crib: l E: w
Cipher: d Crib: i E: v
Cipher: z Crib: n E: m
Cipher: t Crib: c E: r
Cipher: p Crib: o E: b
Cipher: d Crib: l E: s
Cipher: v Crib: n E: i
Key: wvmrbsi
---------------------------------
Cipher: d Crib: l E: s
Cipher: z Crib: i E: r
Cipher: t Crib: n E: g
Cipher: p Crib: c E: n
Cipher: d Crib: o E: p
Cipher: v Crib: l E: k
Cipher: v Crib: n E: i
Key: srgnpki
---------------------------------
Cipher: z Crib: l E: o
Cipher: t Crib: i E: l
Cipher: p Crib: n E: c
Cipher: d Crib: c E: b
Cipher: v Crib: o E: h
Cipher: v Crib: l E: k
Cipher: h Crib: n E: u
Key: olcbhku
---------------------------------
Cipher: t Crib: l E: i
Cipher: p Crib: i E: h
Cipher: d Crib: n E: q
Cipher: v Crib: c E: t
Cipher: v Crib: o E: h
Cipher: h Crib: l E: w
Cipher: w Crib: n E: j
Key: ihqthwj
---------------------------------
Cipher: p Crib: l E: e
Cipher: d Crib: i E: v
Cipher: v Crib: n E: i
Cipher: v Crib: c E: t
Cipher: h Crib: o E: t
Cipher: w Crib: l E: l
Cipher: u Crib: n E: h
Key: evittlh
---------------------------------
Cipher: d Crib: l E: s
Cipher: v Crib: i E: n
Cipher: v Crib: n E: i
Cipher: h Crib: c E: f
Cipher: w Crib: o E: i
Cipher: u Crib: l E: j
Cipher: t Crib: n E: g
Key: snifijg
---------------------------------
Cipher: v Crib: l E: k
Cipher: v Crib: i E: n
Cipher: h Crib: n E: u
Cipher: w Crib: c E: u
Cipher: u Crib: o E: g
Cipher: t Crib: l E: i
Cipher: l Crib: n E: y
Key: knuugiy
---------------------------------
Cipher: v Crib: l E: k
Cipher: h Crib: i E: z
Cipher: w Crib: n E: j
Cipher: u Crib: c E: s
Cipher: t Crib: o E: f
Cipher: l Crib: l E: a
Cipher: t Crib: n E: g
Key: kzjsfag
---------------------------------
Cipher: h Crib: l E: w
Cipher: w Crib: i E: o
Cipher: u Crib: n E: h
Cipher: t Crib: c E: r
Cipher: l Crib: o E: x
Cipher: t Crib: l E: i
Cipher: t Crib: n E: g
Key: wohrxig
---------------------------------
Cipher: w Crib: l E: l
Cipher: u Crib: i E: m
Cipher: t Crib: n E: g
Cipher: l Crib: c E: j
Cipher: t Crib: o E: f
Cipher: t Crib: l E: i
Cipher: e Crib: n E: r
Key: lmgjfir
---------------------------------
Cipher: u Crib: l E: j
Cipher: t Crib: i E: l
Cipher: l Crib: n E: y
Cipher: t Crib: c E: r
Cipher: t Crib: o E: f
Cipher: e Crib: l E: t
Cipher: n Crib: n E: a
Key: jlyrfta
---------------------------------
Cipher: t Crib: l E: i
Cipher: l Crib: i E: d
Cipher: t Crib: n E: g
Cipher: t Crib: c E: r
Cipher: e Crib: o E: q
Cipher: n Crib: l E: c
Cipher: u Crib: n E: h
Key: idgrqch
---------------------------------
Cipher: l Crib: l E: a
Cipher: t Crib: i E: l
Cipher: t Crib: n E: g
Cipher: e Crib: c E: c
Cipher: n Crib: o E: z
Cipher: u Crib: l E: j
Cipher: c Crib: n E: p
Key: algczjp
---------------------------------
Cipher: t Crib: l E: i
Cipher: t Crib: i E: l
Cipher: e Crib: n E: r
Cipher: n Crib: c E: l
Cipher: u Crib: o E: g
Cipher: c Crib: l E: r
Cipher: g Crib: n E: t
Key: ilrlgrt
---------------------------------
Cipher: t Crib: l E: i
Cipher: e Crib: i E: w
Cipher: n Crib: n E: a
Cipher: u Crib: c E: s
Cipher: c Crib: o E: o
Cipher: g Crib: l E: v
Cipher: y Crib: n E: l
Key: iwasovl
---------------------------------
Cipher: e Crib: l E: t
Cipher: n Crib: i E: f
Cipher: u Crib: n E: h
Cipher: c Crib: c E: a
Cipher: g Crib: o E: s
Cipher: y Crib: l E: n
Run-time exception (line 26): Index was outside the bounds of the array.

Stack Trace:

[System.IndexOutOfRangeException: Index was outside the bounds of the array.]
at System.String.get_Chars(Int32 index)
at Program.Main() :line 26

Last Run:	9:38:21 pm
Compile:	0.299s
Execute:	0.006s
Memory:	338.43kb
CPU:	0.062s

View IL Code