C# Online Compiler | .NET Fiddle

<no name> by Anonymous

using System;

public class Program
{
	public static void Main()
	{		
            int[] mas = { 1, 2, 3, 4, 5, 4, 3, 5 };
            int a = mas[0];
            for (int i = 0; i < mas.Length; i++)
            {
                if (mas[i] > a)
                {
                    a = mas[i];
                }
            }
            Console.WriteLine("Найбільший елемент масиву: " + a);
	}
}

​x
 
using System;
​
public class Program
{
    public static void Main()
    {       
            int[] mas = { 1, 2, 3, 4, 5, 4, 3, 5 };
            int a = mas[0];
            for (int i = 0; i < mas.Length; i++)
            {
                if (mas[i] > a)
                {
                    a = mas[i];
                }
            }
            Console.WriteLine("Найбільший елемент масиву: " + a);
    }
}

A ([A-Za-z ])*?charge of (\d.)*\s*at (\d.)*\s*for (\d.)*\s*already exists.\s+Replace with a ([A-Za-z ])*?charge of (\d.)*\s*per ([A-Za-z ])*?at recomputed quantity\?
A Minimum Charge charge of 1. at 879.00 for 495.00 already exists.
Replace with a Distance charge of 6.99 per at recomputed quantity?
    Match: True
A Minimum Charge charge of 1. at 742.00 for 156.00 already exists.
Replace with a Distance charge of 1.38 per at recomputed quantity?
    Match: True
A Haul Flat Rate charge of 1. at 0.01 for 0.01 already exists.
Replace with a Haul Flat Rate charge of 487.00 per at recomputed quantity?
    Match: True
A Linehaul Flat Rate charge of 1. at 0.01 for 0.01 already exists.
Replace with a Linehaul Flat Rate charge of 1100.00 per at recomputed quantity?
    Match: False

Last Run:	10:06:53 am
Compile:	0.299s
Execute:	0s
Memory:	36kb
CPU:	0.125s

View IL Code