C# Online Compiler | .NET Fiddle

<no name> by Anonymous

using System;
using System.Collections.Generic;

public class Program
{
	public static void Main()
	{
		string tryAgain;
		string pause;
		string input;
		string partition = "Occupied";
		;
		float memorySize;
		float os_Size;
		float jobInput;
		List<float> jobs = new List<float>();
		List<string> fails = new List<string>();
		int allocate = 0;
		int deallocate = 1;
		int number;
		do
		{
			Console.Clear();
			int counter = 0;
			int counter2 = 0;
			Console.WriteLine("M3: ML- ACT6 Single-User Contiguous Scheme");
			Console.WriteLine("Bravo, Jhade Lambert L.\n");
			Console.Write("Input the size of memory(k): ");
			input = Console.ReadLine();
			if (float.TryParse(input, out memorySize))
			{
				Console.Write("Input the size of the Operating System(k): ");
				input = Console.ReadLine();
				if (float.TryParse(input, out os_Size))
				{
					memorySize -= os_Size;
					for (int i = 0; i < 6; i++)
					{
						do
						{
							Console.Clear();
							Console.WriteLine("M3: ML- ACT6 Single-User Contiguous Scheme");
							Console.WriteLine("Bravo, Jhade Lambert L.\n");
							Console.WriteLine("Memory Size: " + memorySize + "k");
							Console.WriteLine("OS Size: " + os_Size + "k");
							tryAgain = "placeholder";
							Console.Write("\nInput Job " + (i + 1) + "/" + 6 + " number: ");
							input = Console.ReadLine();
							if (float.TryParse(input, out jobInput))
							{
								if (jobInput <= memorySize)
								{
									jobs.Add(jobInput);
									continue;
								}
								else
								{
									Console.WriteLine("\nWarning. Input for J" + (i + 1) + " is greater than the memory size.");
									Console.WriteLine("Would you like to re-input a new value to the job?:");
									jobs.Add(jobInput);
								}
							}
							else
							{
								Console.WriteLine("Invalid Input. Input only accepts positive numbers.");
							}

							Console.Write("\n");
							Console.Write("\nPress [Y/y] and enter to re-input or press enter only to continue anyway: ");
							tryAgain = Console.ReadLine();
							if (float.TryParse(input, out jobInput))
							{
								continue;
							}
							else
							{
								break;
							}
						}
						while ((tryAgain == "Y") || (tryAgain == "y"));
					}

					for (int i = 0; i < 6; i++)
					{
						Console.Clear();
						Console.WriteLine("M3: ML- ACT6 Single-User Contiguous Scheme");
						Console.WriteLine("Bravo, Jhade Lambert L.\n");
						Console.WriteLine("OS(" + os_Size + "k), J" + (i + 1) + "(" + jobs[i] + "k), Unused(" + memorySize + "k)\n");
						Console.WriteLine("Job Lists:");
						foreach (float j in jobs)
						{
							counter2++;
							Console.Write("Job " + counter2 + "(" + j + "k)");
							Console.Write(" ");
						}

						Console.WriteLine("\n");
						if (jobs[i] <= memorySize)
						{
							Console.WriteLine("Memory for J" + (i + 1) + " was successfully allocated.");
							Console.WriteLine("Press [0] and enter to allocate or press [1] to deallocate");
							Console.Write("\n[0]Allocate/[1]Deallocate: ");
							input = Console.ReadLine();
							if (Int32.TryParse(input, out number))
							{
								if (number == allocate)
								{
									if (partition == "Occupied")
									{
										Console.WriteLine("Allocation cannot be executed. Partition is currently occupied");
										Console.WriteLine("Input again please.");
										i--;
									}
									else
									{
										partition = "Occupied";
										counter++;
									}
								}
								else if (number == deallocate)
								{
									Console.WriteLine("Job " + (i + 1) + " has been deallocated");
									Console.WriteLine("Partition is now available for allocation.");
									partition = "empty";
									i--;
								}
								else
								{
									Console.WriteLine("Invalid input. 0 and 1 only. ");
								}
							}
							else
							{
								Console.WriteLine("Invalid input. 0 and 1 only. ");
								Console.WriteLine("\nInput again? [Y/y]: ");
								input = Console.ReadLine();
							}
						}
						else
						{
							Console.WriteLine("Memory for J" + (i + 1) + " cannot be allocated due to insufficient storage of the memory.");
							fails.Add("Job" + (i + 1) + "(" + jobs[i] + "k)");
							counter--;
						}

						Console.Write("\n\nPress enter to continue... ");
						pause = Console.ReadLine();
					}

					Console.Clear();
					Console.WriteLine("M3: ML- ACT6 Single-User Contiguous Scheme");
					Console.WriteLine("Bravo, Jhade Lambert L.\n");
					Console.WriteLine("\nConlusion");
					if (counter == 6)
					{
						Console.WriteLine("All jobs are allocated succesfully.");
					}
					else
					{
						Console.WriteLine("\nNot all jobs were succesfully allocated.");
						Console.WriteLine("The following list of job/s that failed the allocation are displayed below:");
						foreach (string i in fails)
						{
							Console.Write("- " + i);
							Console.WriteLine(" ");
						}
					}
				}
				else
				{
					Console.WriteLine("Invalid Input. Input only accepts positive numbers and must be below to the memory size.");
				}
			}
			else
			{
				Console.WriteLine("Invalid Input. Input only accepts positive numbers.");
			}

			Console.Write("\n");
			Console.Write("\nProgram will end. Try Again? [Y/y]: ");
			tryAgain = Console.ReadLine();
		}
		while ((tryAgain == "Y") || (tryAgain == "y"));
		Console.WriteLine("End of the program. Press enter key to exit..");
	}
}

​x
 
using System;
using System.Collections.Generic;
​
public class Program
{
    public static void Main()
    {
        string tryAgain;
        string pause;
        string input;
        string partition = "Occupied";
        ;
        float memorySize;
        float os_Size;
        float jobInput;
        List<float> jobs = new List<float>();
        List<string> fails = new List<string>();
        int allocate = 0;
        int deallocate = 1;
        int number;
        do
        {
            Console.Clear();
            int counter = 0;
            int counter2 = 0;
            Console.WriteLine("M3: ML- ACT6 Single-User Contiguous Scheme");
            Console.WriteLine("Bravo, Jhade Lambert L.\n");
            Console.Write("Input the size of memory(k): ");
            input = Console.ReadLine();
            if (float.TryParse(input, out memorySize))
            {
                Console.Write("Input the size of the Operating System(k): ");
                input = Console.ReadLine();
                if (float.TryParse(input, out os_Size))
                {
                    memorySize -= os_Size;
                    for (int i = 0; i < 6; i++)
                    {
                        do
                        {
                            Console.Clear();
                            Console.WriteLine("M3: ML- ACT6 Single-User Contiguous Scheme");
                            Console.WriteLine("Bravo, Jhade Lambert L.\n");
                            Console.WriteLine("Memory Size: " + memorySize + "k");
                            Console.WriteLine("OS Size: " + os_Size + "k");
                            tryAgain = "placeholder";
                            Console.Write("\nInput Job " + (i + 1) + "/" + 6 + " number: ");
                            input = Console.ReadLine();
                            if (float.TryParse(input, out jobInput))
                            {
                                if (jobInput <= memorySize)
                                {
                                    jobs.Add(jobInput);
                                    continue;
                                }
                                else
                                {
                                    Console.WriteLine("\nWarning. Input for J" + (i + 1) + " is greater than the memory size.");
                                    Console.WriteLine("Would you like to re-input a new value to the job?:");
                                    jobs.Add(jobInput);
                                }
                            }
                            else
                            {
                                Console.WriteLine("Invalid Input. Input only accepts positive numbers.");
                            }
​
                            Console.Write("\n");
                            Console.Write("\nPress [Y/y] and enter to re-input or press enter only to continue anyway: ");
                            tryAgain = Console.ReadLine();
                            if (float.TryParse(input, out jobInput))
                            {
                                continue;
                            }
                            else
                            {
                                break;
                            }
                        }
                        while ((tryAgain == "Y") || (tryAgain == "y"));
                    }
​
                    for (int i = 0; i < 6; i++)
                    {
                        Console.Clear();
                        Console.WriteLine("M3: ML- ACT6 Single-User Contiguous Scheme");
                        Console.WriteLine("Bravo, Jhade Lambert L.\n");
                        Console.WriteLine("OS(" + os_Size + "k), J" + (i + 1) + "(" + jobs[i] + "k), Unused(" + memorySize + "k)\n");
                        Console.WriteLine("Job Lists:");
                        foreach (float j in jobs)
                        {
                            counter2++;
                            Console.Write("Job " + counter2 + "(" + j + "k)");
                            Console.Write(" ");
                        }
​
                        Console.WriteLine("\n");
                        if (jobs[i] <= memorySize)
                        {
                            Console.WriteLine("Memory for J" + (i + 1) + " was successfully allocated.");
                            Console.WriteLine("Press [0] and enter to allocate or press [1] to deallocate");
                            Console.Write("\n[0]Allocate/[1]Deallocate: ");
                            input = Console.ReadLine();
                            if (Int32.TryParse(input, out number))
                            {
                                if (number == allocate)
                                {
                                    if (partition == "Occupied")
                                    {
                                        Console.WriteLine("Allocation cannot be executed. Partition is currently occupied");
                                        Console.WriteLine("Input again please.");
                                        i--;
                                    }
                                    else
                                    {
                                        partition = "Occupied";
                                        counter++;
                                    }
                                }
                                else if (number == deallocate)
                                {
                                    Console.WriteLine("Job " + (i + 1) + " has been deallocated");
                                    Console.WriteLine("Partition is now available for allocation.");
                                    partition = "empty";
                                    i--;
                                }
                                else
                                {
                                    Console.WriteLine("Invalid input. 0 and 1 only. ");
                                }
                            }
                            else
                            {
                                Console.WriteLine("Invalid input. 0 and 1 only. ");
                                Console.WriteLine("\nInput again? [Y/y]: ");
                                input = Console.ReadLine();
                            }
                        }
                        else
                        {
                            Console.WriteLine("Memory for J" + (i + 1) + " cannot be allocated due to insufficient storage of the memory.");
                            fails.Add("Job" + (i + 1) + "(" + jobs[i] + "k)");
                            counter--;
                        }
​
                        Console.Write("\n\nPress enter to continue... ");
                        pause = Console.ReadLine();
                    }
​
                    Console.Clear();
                    Console.WriteLine("M3: ML- ACT6 Single-User Contiguous Scheme");
                    Console.WriteLine("Bravo, Jhade Lambert L.\n");
                    Console.WriteLine("\nConlusion");
                    if (counter == 6)
                    {
                        Console.WriteLine("All jobs are allocated succesfully.");
                    }
                    else
                    {
                        Console.WriteLine("\nNot all jobs were succesfully allocated.");
                        Console.WriteLine("The following list of job/s that failed the allocation are displayed below:");
                        foreach (string i in fails)
                        {
                            Console.Write("- " + i);
                            Console.WriteLine(" ");
                        }
                    }
                }
                else
                {
                    Console.WriteLine("Invalid Input. Input only accepts positive numbers and must be below to the memory size.");
                }
            }
            else
            {
                Console.WriteLine("Invalid Input. Input only accepts positive numbers.");
            }
​
            Console.Write("\n");
            Console.Write("\nProgram will end. Try Again? [Y/y]: ");
            tryAgain = Console.ReadLine();
        }
        while ((tryAgain == "Y") || (tryAgain == "y"));
        Console.WriteLine("End of the program. Press enter key to exit..");
    }
}

View IL Code