Ex220gdCourseWork | C# Online Compiler

Ex220gdCourseWork by Alleina

using System;

namespace Ex220CourseWork
{
    class Ex220CourseWork
    {
        static void TwoTwenty()
        {
            Console.WriteLine("Г)");
            int capitalPi = 1;
            for (int i = 1; i <= 15; i++)
            {
                capitalPi *= i;
            }

            int n;
            do
            {
                Console.Write("Please enter the value of 'i': ");
                n = Int32.Parse(Console.ReadLine());
                if (n == -1)
                {
                    Console.WriteLine("The input cannot be '-1'");
                }
            } while (n == -1);
            float gornaChast = (float)(capitalPi * (1 / (Math.Pow(n, 3) + 1)));

            float dolnaChast = (float)(capitalPi * (1 / n + 1));

            Console.WriteLine($"The answer is {gornaChast / dolnaChast}");

            #region D)

            Console.WriteLine("Д)");
            int firstCapitalPi = 1;
            int secondCapitalPi = 1;

            for (int i = 1; i <= 15; i++)
            {
                firstCapitalPi *= i;
            }
            for (int i = 1; i <= 20; i++)
            {
                secondCapitalPi *= i;
            }
            int m;
            do
            {
                Console.Write("Please enter the value of 'i': ");
                m = Int32.Parse(Console.ReadLine());
                if (m == -1)
                {
                    Console.WriteLine("The input cannot be '-1'");
                }
            } while (m == -1);
            float delimo = (float)(firstCapitalPi * (1 / (Math.Pow(n, 3) + 1)));
            float delitel = (float)(secondCapitalPi * (1 / n + 1));

            Console.WriteLine($"The answer is {delimo / delitel}");

            #endregion
        }
    }
}

​x
 
using System;
​
namespace Ex220CourseWork
{
    class Ex220CourseWork
    {
        static void TwoTwenty()
        {
            Console.WriteLine("Г)");
            int capitalPi = 1;
            for (int i = 1; i <= 15; i++)
            {
                capitalPi *= i;
            }
​
            int n;
            do
            {
                Console.Write("Please enter the value of 'i': ");
                n = Int32.Parse(Console.ReadLine());
                if (n == -1)
                {
                    Console.WriteLine("The input cannot be '-1'");
                }
            } while (n == -1);
            float gornaChast = (float)(capitalPi * (1 / (Math.Pow(n, 3) + 1)));
​
            float dolnaChast = (float)(capitalPi * (1 / n + 1));
​
            Console.WriteLine($"The answer is {gornaChast / dolnaChast}");
​
            #region D)
​
            Console.WriteLine("Д)");
            int firstCapitalPi = 1;
            int secondCapitalPi = 1;
​
            for (int i = 1; i <= 15; i++)
            {
                firstCapitalPi *= i;
            }
            for (int i = 1; i <= 20; i++)
            {
                secondCapitalPi *= i;
            }
            int m;
            do
            {
                Console.Write("Please enter the value of 'i': ");
                m = Int32.Parse(Console.ReadLine());
                if (m == -1)
                {
                    Console.WriteLine("The input cannot be '-1'");
                }
            } while (m == -1);
            float delimo = (float)(firstCapitalPi * (1 / (Math.Pow(n, 3) + 1)));
            float delitel = (float)(secondCapitalPi * (1 / n + 1));
​
            Console.WriteLine($"The answer is {delimo / delitel}");
​
            #endregion
        }
    }
}

The linked list values:
the fox jumps over the dog

sentence.Contains("jumps") = True
Test 1: Add 'today' to beginning of the list:
today the fox jumps over the dog

Test 2: Move first node to be last node:
the fox jumps over the dog today

Test 3: Change the last node to 'yesterday':
the fox jumps over the dog yesterday

Test 4: Move last node to be first node:
yesterday the fox jumps over the dog

Test 5: Indicate last occurence of 'the':
the fox jumps over (the) dog

Test 6: Add 'lazy' and 'old' after 'the':
the fox jumps over (the) lazy old dog

Test 7: Indicate the 'fox' node:
the (fox) jumps over the lazy old dog

Test 8: Add 'quick' and 'brown' before 'fox':
the quick brown (fox) jumps over the lazy old dog

Test 9: Indicate the 'dog' node:
the quick brown fox jumps over the lazy old (dog)

Test 10: Throw exception by adding node (fox) already in the list:
Exception message: The LinkedList node already belongs to a LinkedList.

Test 11: Move a referenced node (fox) before the current node (dog):
the quick brown jumps over the lazy old fox (dog)

Test 12: Remove current node (dog) and attempt to indicate it:
Node 'dog' is not in the list.

Test 13: Add node removed in test 11 after a referenced node (brown):
the quick brown (dog) jumps over the lazy old fox

Test 14: Remove node that has the value 'old':
the quick brown dog jumps over the lazy fox

Test 15: Remove last node, cast to ICollection, and add 'rhinoceros':
the quick brown dog jumps over the lazy rhinoceros

Test 16: Copy the list to an array:
the
quick
brown
dog
jumps
over
the
lazy
rhinoceros

Test 17: Clear linked list. Contains 'jumps' = False

Cached Result
Last Run:	6:13:44 pm
Compile:	0.12s
Execute:	0.018s
Memory:	72kb
CPU:	0.016s

View IL Code