C# Online Compiler | .NET Fiddle

<no name> by Anonymous

using System;
					
public class Program
{
	public static void Main()
	{
		int[] a = new int[10];
            Random r = new Random();
            for (int i = 0; i < a.Length; i++)
            {
                a[i] = r.Next(1, 101);
            }
            int c = Qe9(a);
            Console.WriteLine(c);
	}
	 static int Qe9(int[] a)
        {
            int c=0;
            for (int i = 1; i < a.Length-1; i++)
            {
                if (a[i] % 2 == 0 && a[i - 1] % 2 == 1 && a[i + 1] % 2 == 1)
                    c++;

            }
            return c;
        }
        static int[] Merge(int[] a, int[] b)
        {
            a = FreQuency(a);
            b = FreQuency(b);
            int[] c = new int[a.Length + b.Length];
            int j = 0;
            for (int i = 0; i < a.Length; i++)
            {
                c[i] = a[i];
                j++;

            }
            int counter = 0;
            for (int i = j; i < c.Length; i++)
            {
                c[i] = b[counter];
                counter++;
            }
            c = MeonRani(c);
            return FreQuency(c);
        }
        static int[] Merge(int[] a, int[] b)
        {
            a = FreQuency(a);
            b = FreQuency(b);
            int[] c = new int[a.Length + b.Length];
            int j=0;
            for (int i = 0; i < c.Length; i++)
            {
                if (i < a.Length)
                    c[i] = a[i];
                else
                {
                    c[i] = b[j];
                    j++;
                }
            }
            c= MeonRani(c);
            return FreQuency(c);

        }
        static bool MainArray(int[] a)
        {
            if (ISEvenSort(a) && ISOddSort(a) && ISAfterAndBefor(a)) return true;
            return false;
        }
        static bool ISEvenSort(int[] a)
        {
            for (int i = 0; i < a.Length-2; i=i+2)
            {
                if (a[i] < a[i + 2]) return false;
            }
            return true;
        }
        static bool ISOddSort(int[] a)
        {
            for (int i = 1; i < a.Length - 2; i = i + 2)
            {
                if (a[i] > a[i + 2]) return false;
            }
            return true;
        }
        static bool ISAfterAndBefor(int[] a)
        {
            if (a[0]<a[1]) return false;
            for (int i = 2; i < a.Length-1; i=i+2)
            {
                if (a[i]<a[i-1] && a[i]<a[i+1]) return false;
            }
            if (a.Length%2==1 && (a[a.Length-1]<a[a.Length-2])) return false;
            return true;

        }
        static int[] CopyOfRange(int[] a, int from, int to)
        {
            if (from > to || from >= a.Length || to >= a.Length || to < 0 || from < 0)
                return null;
            int n = to - from + 1;
            int[] b = new int[n];
            int c = 0;
            for (int i = from; i <= to; i++)
            {
                b[c] = a[i];
                c++;
            }
            return b;
        }
        static int[] GetRightSubArray(int[] a, int value)
        {
             int c = ArrayCountForQu51(a, value);
             int n = a.Length - c - 1;
             int[] b = new int[n];
             int x = 0;
             for (int i = c+1; i < a.Length; i++)
             {
                 b[x] = a[i];
                 x++;
             }
             return b;
        }
        static int[] GetLeftSubArray(int[] a, int value)
        {
            int n = ArrayCountForQu51(a, value);
            int[] b = new int[n];
            for (int i = 0; i < b.Length; i++)
            {
                b[i] = a[i];
            }
            return b;
        }
        static int ArrayCountForQu52(int[] a, int value)
        {
            int c = 0;
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] == value)
                    c = i;
            }
            return c;
        }
        static int ArrayCountForQu51(int[] a, int value)
        {
            int c=0;
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] != value)
                    c++;
                else return c;
            }
            return c;
        }

        static bool TrueForAll1(int[] a, char Op, int Num)
        {
            if (Op=='>')
                for (int i = 0; i < a.Length; i++)
                {
                    if (a[i] <= Num) return false;
                }
            else if (Op=='=')
                for (int i = 0; i < a.Length; i++)
                {
                    if (a[i] != Num) return false;
                }
            else for (int i = 0; i < a.Length; i++)
                {
                    if (a[i] >= Num) return false;
                }
            return true;
        }
        static int Where(int[] a)
        {
            int sum1, sum2;
            for (int i = 1; i < a.Length; i++)
            {
                sum1 = Sum(a, 0, i - 1);
                sum2 = Sum(a, i, a.Length - 1);
                if (sum1 == sum2) return i;
            }
            return -1;
        }
        static int Sum(int[] a, int L, int R)
        {
            int sum = 0;
            for (int i = L; i <=R ; i++)
            {
                sum += a[i];
            }
            return sum;
        }
        static void PrintNumbers(int[] a)
        {
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] % 3 == 0) Console.Write("{0} ",a[i]);   
            }
            Console.Write('*');
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] % 5 == 0) Console.Write("{0} ", a[i]);
            }
        }
        static int Sum2(int[] a)
        {
            int sum = 0;
            for (int i = 0; i < a.Length-1; i=i+2)
            {
                Console.WriteLine(a[i] + a[i + 1]);
                sum += a[i]+a[i+1];
            }
            return sum;
        }
        static int[] SumArray(int[] a, int from, int to,int val)
        {
            if (from > to || from >= a.Length || to >= a.Length || to < 0 || from < 0)
                return a;
            for (int i = from; i <= to; i++)
            {
                a[i] = val;
            }
            return a;
        }
        static int MaxlengthBalndrom(int[] a)
        {
            int max =-1;
            int length = 0;
            for (int i = 0; i < a.Length; i++)
            {
                if (Digitnumber(a[i]) > length && IsBalndrom(a[i]))
                {
                    length = Digitnumber(a[i]);
                    max = a[i];
                }
            }
            int c=0;
            for (int i = 0; i < a.Length; i++)
            {
                if (Digitnumber(a[i]) == length && IsBalndrom(a[i]))
                {
                    if (c < 2)
                    {
                        length = Digitnumber(a[i]);
                        max = a[i];
                        c++;
                    }
                }
            }
            
            return max;
        }
        static bool IsBalndrom(int n)
        {
            int a = Mklob(n);
            if (n == a) return true;
            return false;
        }
        static int[] NadenArrray2(int[] a)
        {
            int c = 0;
            int n = LenghtArrayNaden(a);
            int[] b = new int[n];
            for (int i = 1; i < a.Length; i = i + 2)
            {
                for (int j = 1; j <= a[i]; j++)
                {
                    b[c] = a[i - 1];
                    c++;
                }
            }
            return b;
        }
        static int[] NadenArrray1(int[] a)
        {
            int counter = 0;
            int j = 0;
            int n = LenghtArrayNaden(a);
            int[] b = new int[n];
            for (int i = 0; i < a.Length; i++)
            {
                if (i % 2 == 1)
                {
                    for (j = counter; j < a[i] + counter; j++)
                    {
                        b[j] = a[i-1];
                    }
                    counter = j;
                }
            }
            return b;
        }
        static int LenghtArrayNaden(int[] a)
        {
            int sum=0;
            for (int i = 0; i < a.Length; i++)
            {
                if (i % 2 == 1) sum += a[i];
            }
            return sum;
        }
        static int[] FreQuency(int[] a)
        {
            int[] b=new int[a.Length];
            int j=0;
            bool ok = true;
            for (int i = 0; i < a.Length; i++)
            {
                if (!Found(b, a[i]))
                {
                    b[j] = a[i];
                    j++;
                }
                if (a[i] == 0 && ok==true)
                {
                    ok = false;
                    b[j] = a[i];
                    j++;
                }
                    
            }
            int[] c = new int[j];
            for (int i = 0; i < c.Length; i++)
            {
                c[i] = b[i];
            }
            return c;
        }
        static bool Found(int[] a, int x)
        {
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] == x) return true;
            }
            return false;
        }
        static string MaxName(int[] a, string[] b)
        {
            int max = a[0];
            int index = 0;
            for (int i = 1; i < a.Length; i++)
            {
                if (a[i] > max)
                {
                    max = a[i];
                    index = i;
                }
            }
            return b[index];
        }
        static double[] AvgStudentsArrray(int[] a)
        {
            double[] b = new double[LenghtOfStudentsArray(a)];
            int j = 0;  
            for (int i = 0; i < b.Length; i++)
            {
                int sum = 0;
                int x = a[j];
                for (int z = 1; z <= x; z++)
                {
                    j++;
                    sum += a[j];
                }
                j++;
                b[i] = sum / x;
              
            }
            return b;
        }

        static int LenghtOfStudentsArray(int[] a)
        {
            int c = 0;
            for (int i = 0; i < a.Length; i++)
            {
                c++;
                i += a[i];
            }
            return c;
        }
        static char[] ResultChar2(char[] a)
        {
            int c = LenghtOfCharArray(a);
            char[] b = new char[c];
            int index = 0;
            int i = 0;
            int j = a.Length - 1;
            while (index<a.Length)
            {
                int code = (int)a[index];
                if (code <= 90 && code >= 65)
                {
                    b[i] = a[index];
                    i++;
                }
                if (code <= 122 && code >= 97)
                {
                    b[j] = a[index];
                    j--;
                }
                index++;
            }
            return b;
        }
        static char[] ResultChar1(char[] a)
        {
            int c=LenghtOfCharArray(a);
            char[] b=new char[c];
            int j=0;
            for (int i = 0; i < a.Length; i++)
            {
                 int code = (int)a[i];
                 if (code <= 90 && code >= 65)
                 {
                     b[j] = a[i];
                     j++;
                 }
            }
            for (int i = 0; i < a.Length; i++)
            {
                int code = (int)a[i];
                if (code <= 122 && code >= 97)
                {
                    b[j] = a[i];
                    j++;
                }
            }
            return b;
        }
        static int LenghtOfCharArray(char[] a)
        {
            int c=0;
            for (int i = 0; i < a.Length; i++)
            {
                int code = (int)a[i];
                if ((code <= 122 && code >= 97) || (code <= 90 && code >= 65))
                    c++;
            }
            return c;
        }

        static int LengthOfB1(int[] a)
        {
            int b = 1;
            int x = 1;
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] != x)
                {
                    x = a[i];
                    b++;
                }
            }
            return b;
        }
        static int LengthOfB2(int[] a)
        {
            int c = 1;
            for (int i = 0; i < a.Length-1; i++)
            {
                if (a[i] != a[i + 1])
                    c++;
            }
            return c;
        }

        static int[] NewB(int[] a)
        {
            int n = LengthOfB2(a);
            int[] b = new int[n];
            int c = 1;
            int e=0,h=0;
            
            return b;
        }

        

        static int[] MeonMohammedDahod(int[] a)
        {
            int[] b= new int[a.Length];
            for (int i = 0; i < b.Length; i++)
            {
                b[i] = MinArrayMeon(a);
            }
            return b;
        }
        static int MinArrayMeon(int[] a)
        {
            int min = a[0];
            int index = 0;
            for (int i = 1; i < a.Length; i++)
            {
                if (a[i]<min)
                {
                    min = a[i];
                    index = i;
                }
            }
            a[index] = int.MaxValue;
            return min;
        }

        static bool AeataAesm(int[] a,int b)
        {
            for (int i = 0; i < a.Length; i++)
            {
                if (b == a[i]) return false;
            }
            return true;
        }

        static bool IsNotSimilar(int[] a, int[] b)
        {
            if (a.Length != b.Length) return false;
            for (int i = 0; i < a.Length; i++)
            {
                if (!AeataAesm(b, a[i])) return true;
            }
            return false;
        }

        static int[] MeonAdel(int[] a)
        {
            for (int i= 0; i < a.Length; i++)
            {
                for (int j = 0; j < a.Length-1; j++)
                {
                    if (a[j] > a[j + 1])
                    {
                        int x = a[j];
                        a[j] = a[j + 1];
                        a[j + 1] = x;
                    }
                }
            }
            return a;
        }
        static int[] MeonRani(int[] a)
        {
            int[] b=new int[a.Length];
            for (int i = 0; i < a.Length; i++)
            {
                int c = 0;
                for (int j = 0; j < a.Length; j++)
                {
                    if (a[i] > a[j])
                        c++;
                }
                b[c] = a[i];
            }
            return b;
        }

        static int Check2(int[] a, int n)
        {
            for (int i = 0; i < a.Length; i++)
            {
                int sum = a[i];
                for (int j = i + 1; j < a.Length; j++)
                {
                    sum += a[j];
                    if (sum == n) return i;
                }
            }
            return -1;
        }
        static bool Check1(int[] a, int n)
        {
            for (int i = 0; i < a.Length; i++)
            {
                 int sum=a[i];
                for (int j = i+1; j < a.Length; j++)
                {
                    sum += a[j];
                    if (sum == n) return true;
                }
            }
            return false;
        }
        static bool EqulasNumber3(int[] a, int index)
        {
            int sumLeft = 0;
            int sumRight = 0;
            for (int i = 0; i < a.Length; i++)
            {
                if (i < index) sumLeft += a[i];
                else sumRight += a[i];
            }
            return sumLeft == sumRight-a[index];

        }
        static bool EqulasNumber2(int[] a, int index)
        {
            int sumLeft = 0;
            int sumRight = 0;
            for (int i = 0; i < a.Length; i++)
            {
                if (i < index) sumLeft += a[i];
                if (i > index) sumRight += a[i];
            }
            return sumLeft == sumRight;

        }
        static bool EqulasNumber1(int[] a, int index)
        {
            int sumLeft = 0;
            for (int i = 0; i < index; i++)
                sumLeft += a[i];

            int sumRight = 0;
            for (int i = index+1; i < a.Length; i++)
                sumRight += a[i];

            return sumLeft == sumRight;

        }
        static int MaxIndexIntArray(int[] a)
        {
            int max = a[0];
            int index = 0;
            for (int i = 1; i < a.Length; i++)
            {
                if (a[i] > max)
                {
                    max = a[i];
                    index = i;
                }
            }
            return index;
        }
        static int MaxIntArray(int[] a)
        {
            int max=a[0];
            for (int i = 1; i < a.Length; i++)
            {
                if (a[i] > max)
                    max = a[i];
            }
            return max;
        }
      
        static int[] BuildaArray()
        {
            Random r = new Random();
            int[] a = new int[10];
            for (int i = 0; i < a.Length; i++)
            {
                a[i] = r.Next(10, 100);
            }
            return a;
        }

        static int SortDigits(int n)
        {
            int sum = 0;
            int c=0;
            while (n > 0)
            {
                int min = MinDigit(n);
                n = deleteDigit(n, min);
                sum = sum + min * (int)Math.Pow(10, c);
                c++;
            }
            return sum;
        }
        static int MinDigit(int n)
        {
            int min = 10;
            while (n > 0)
            {
                int a = n % 10;
                if (a < min) min = a;
                n = n / 10;
            }
            return min;
        }
        static int deleteDigit(int n, int a)
        {
            int c=0;
            int sum = 0;
            bool ok = false;
            while (n > 0)
            {
                int x = n % 10;
                if (a != x)
                {
                    sum = sum + x * (int)Math.Pow(10, c);
                    c++;
                }
                else
                {
                    if (ok == true)
                    {
                        sum = sum + x * (int)Math.Pow(10, c);
                        c++;
                    }
                    ok = true;
                }
                n = n / 10;
            }
            return sum;
        }

        static double sum2max(double a, double b)
        {
            if (a > b) return b / 2 + a;
            return a / 2 + b;
        }
        static double sum2max(double a,double b,double c)
        {
            return 0;
        }


        static int Grades(int a, int b, int c)
        {
            int count = 0;
            if (a > 90) count++;
            if (b > 90) count++;
            if (c > 90) count++;
            return count;
        }

        static int GiftCard(int money, int year)
        {
            if (year > 3 && year < 8 && money > 1200) return year * 50;
            else if (year >= 8 && money > 1200) return year * 100;
            else return 0;
        }
        static bool Age1(int a)
        {
            if (a >= 15 && a <= 18) return true;
            return false;
        }
        static bool Age2(int a)
        {
           return (a >= 15 && a <= 18) ;
        }


        static int Lvl1(int a, int b, int c, int d)
        {
            int x = 2 * (c - a);
            if (b == 2) x--;
            if (d == 2) x++;
            return x;
        }
        static int Lvl2(int a, int b, int c, int d)
        {
            int e, f;
            e = a * 2 + b;
            f = c * 2 + d;
            return f - e;
        }
        static int Lvl3(int a, int b, int c, int d)
        {
            int x = (c - a - 1) * 2;
            if (b == 1) x=x+2;
            if (b == 2) x = x + 1;
            if (d == 2) x = x + 1;
            return x;
        }

        static char Gender1(string a, string b)
        {
            if (a == "female" && b == "male") return 'v';
            if (a == "female" && b == "female") return 'f';
            return 'm';
        }
        static char Gender2(string a, string b)
        {
            if (a.Equals("female") && b.Equals("male")) return 'v';
            if (a.Equals("female") && b.Equals("female")) return 'f';
            return 'm';
        }

        static bool Price(int c)
        {
            int sum = 0;
            for (int i = 1; i <=c ; i++)
            {
                int price = int.Parse(Console.ReadLine());
                sum += price;
            }
            if (sum > 150) return true;
            return false;
        }
        static char checkHadel(int a, int b, int c)
        {
            int sum = 0;
            sum = a + b + c;
            if (sum % 2 == 0) return 'y';
            return 'n';
        }
        static bool Check123(int m, int y)
        {
            return (m <= 6 && m >= 1 && y == 2009);    
        }
        static void Spaces(int n)
        {
            for (int i = 1; i <=n ; i++)
            {
                Console.Write(" ");
            }
        }
        static void Traingle(char ch)
        {
            int n = (int)ch - 96;
            for (int i = 97; i <=(int)ch ; i++)
            {
                Spaces(n);
                Print1((char)i);
                print2((char)i);
                Console.WriteLine();
                n--;
            }
        }
        static void Print1(char ch)
        {
            for (int i = 97; i <=(int)ch ; i++)
            {
                Console.Write((char)i);
            }
        }
        static void print2(char ch)
        {
            for (int i = (int)ch-1; i >=97 ; i--)
            {
                Console.Write((char)i);
            }
        }
        static bool IsChar(char ch)
        {
            int x = (int)ch;
            if (x < 97 || x > 122)
                return false;
            return true;
        }

        
        static int GetMinCommon(int n1, int n2)
        {
            while (n1 > 0)
            {
                int d = RemoveMin(ref n1);
                bool ok = Exists(n2, d);
                if (ok == true) return d;
            }
            return -1;
        }
        static bool Exists(int n, int d)
        {
            while (n > 0)
            {
                int a = n % 10;
                if (a == d) return true;
                n = n / 10;
            }
            return false;
        }
        static int RemoveMin(ref int n)
        {
            int sum=0,i=0;
            int a = TheLitterDigit(n);
            while(n>0)
            {
                int b = n % 10;
                if (a != b)
                {
                    sum = sum + b * (int)Math.Pow(10, i);
                    i++;
                }
                n = n / 10;
            }
            n = sum;
            return a;
        }
        static int TheLitterDigit(int n)
        {
            int min = 10;
            while (n > 0)
            {
                int a = n % 10;
                if (a < min) min = a;
                n = n / 10;
            }
            return min;
        }
        static int Winner(int n)
        {
            int a = B(n);
            if (n==a) return 1000;
            return 0;
        }
        static int B(int n)
        {
            int sum = 0;
            int c = 0;
            while (n > 0)
            {
                int a = n % 10;
                if (a % 2 == 1 && a < 9) a = a + 1;
                sum = sum + a * (int)Math.Pow(10, c);
                c++;
                n = n / 10;
            }
            return sum;
        }
        static int Minus(int n1, int n2)
        {
            if (n1 > n2) return n1 - n2;
            return n2 - n1;

        }
        static int Mklob(int n)
        {
            int sum = 0;
            int c = Digitnumber(n);
            for (int i = c-1; i >= 0; i--)
            {
                sum += n % 10 * (int)Math.Pow(10, i);
                n = n / 10;
            }
            return sum;
        }
        static int Digitnumber(int n)
        {
            int c = 0;
            while (n > 0)
            {
                c++;
                n = n / 10;
            }
            return c;
        }
        static int GetRightHalf(int Num, int L)
        {
            int a = (int)Math.Pow(10, L / 2);
            return Num % a;
        }
        static int GetLeftHalf(int Num, int L)
        {
            int a = (int)Math.Pow(10, L / 2);
            return Num / a;
        }


        static int RemoveDigits(int num, int v)
        {
            int n, i = 0, sum = 0;
            while (num > 0)
            {
                n = num % 10;
                if (n > v && n % 2 == 1)
                    num = num / 10;
                else
                {
                    sum += n * (int)Math.Pow(10, i);
                    i++;
                    num = num / 10;
                }
            }
            return sum;
        }
        static bool CheckDema(int n1, int n2)
        {
            int i = 0;
            while (n1 > 0)
            {
                i++;
                if (i % 2 != 0)
                {
                    if (n1 % 10 != n2 % 10) return false;
                }
                n1 = n1 / 10;
                n2=n2 / 10;
            }
            return true;
        }
        static bool CheckAli(int n1, int n2)
        {
            int a = 0, b = 0;
            while (n1 > 0)
            {
                if (n1 % 10 == n2 % 10)
                    a++;
                b++;
                n1 = n1 / 100;
                n2 = n2 / 100;
            }
            if (a == b) return true;
            return false;
        }
        static int LastIndexOf(int n, int digit)
        {
            int c = 0, index = -1;
            while (n > 0)
            {
                c++;
                int a = n % 10;
                if (digit == a)
                    index = c;
                n = n / 10;
            }
            return index;
        }
        static bool IsPerfect(int n)
        {
            int sum = 0;
            for (int i = 1; i < n; i++)
            {
                if (n % i == 0) sum += i;
            }
            if (sum == n) return true;
            return false;
        }
         static int GetNthItem(int N)
         {
            return (int)Math.Pow(N, 2);
         }
        static bool FirstAndLast(int n)// ادعاء دخول : تتلقى عددا صحيحا
        {                               //تعيد صحيح اذا كان اول منزلة تساوي اخر منزلة
            int a = n % 10;
            while (n > 10)
                n = n / 10;
            if (a == n) return true;
            return false;
        }

        static bool Check(int n1, int n2)
        {
            if (!IsLengthEven(n1)) return false;
            if (!IsLengthEven(n2)) return false;
            if (!Equals(n1, n2)) return false;
            int a, b;
            while (n1 > 0)
            {
                a = n1 % 100;
                b = n2 % 100;
                if (a + 1 != b) return false;
                n1 = n1 / 100;
                n2 = n2 / 100;
            }
            return true;

        }
        static bool Equals(int n1, int n2)
        {
            int c1 = 0, c2 = 0;
            while (n1 > 0)
            {
                n1 = n1 / 10;
                c1++;
            }
            while (n2 > 0)
            {
                n2 = n2 / 10;
                c2++;
            }
            if (c1 == c2) return true;
            return false;
        }
        static bool IsLengthEven(int n)
        {
            int c = 0;
            while (n > 0)
            {
                n = n / 10;
                c++;
            }
            if (c % 2 == 0) return true;
            return false;
        }

        static bool IsPrime(int n)
        {
            for (int i = 2; i < n; i++)
            {
                if (n % i == 0) return false;   
            }
            return true;
        }

        static bool IsLowerOfTow(int n)
        {
            int c=0;
            while (n > 0)
            {
                int a = n % 10;
                if (a % 2 == 1) c++;
                n = n / 10;
            }
            if (c > 2) return false;
            return true;
        }
        static bool tsa3de(int n)
        {
            while (n > 10)
            {
              int a = n % 10;
              int b = n / 10 % 10;
              if (a > b) return false;
              n = n / 10;
            }
            return true;
        }


        static int Replace(int N, int Digit1, int Digit2)
        {
            int i=0;
            int sum=0;
            while (N > 0)
            {
                int a = N % 10;
                if (a == Digit1)
                    sum = sum + Digit2 * (int)Math.Pow(10, i);
                else sum = sum + a *(int)Math.Pow(10, i);
                i++;
                N = N / 10;
            }
            return sum;
        }
        static int Blood(int L, int H)
        {
            if (L < 80 && H < 120) return 0;
            if (L < 89 && L > 80 && H > 120 && H < 139) return 1;
            if (L < 99 && L >= 90 && H >= 140 && H < 159) return 2;
            return 3;
            
        }
        static bool StartsWith(int n1, int n2)
        {
            if (n2 > n1) return false;
            bool ok=true;
            int c = 0;
            int b = n2;
            while (b > 0)
            {
                b = b / 10;
                c++;
            }
            double a = Math.Pow(10, c);
            if (n1 % a == n2) return true;
            else return false;

        }

         



        public static bool IsLetter(char ch)
        {
            return IsSmallLetter(ch) || IsCapitalLetter(ch);
        }

        public static bool IsSmallLetter(char ch)
        {
            int a = (int)ch;
            if (a >= 97 && a <= 122) return true;
            return false;
        }
        public static bool IsCapitalLetter(char ch)
        {
            return ((int)ch >= 65 && (int)ch <= 90);
        }

        public static bool IsSmallLetter2(char ch)
        {
            int a = (int)ch;
            return (a >= 97 && a <= 122);
        }

        static double Hadel(double a, double b, double c)
        {
            return Math.Max(a, Math.Max(b, c));
           
        }


        static void AliAbu(int x)
        {
            x = x + 10;
            Console.WriteLine(x);
        }

        static int Gazale(int x)
        {
            x = x + 10;
            return x;
        }

        static int Narden(int a, int b)
        {
            int sum = a + b;
            return sum;
        }

        static void Number()
        {
            for (int i = 1; i <= 100; i++)
            {
                Console.WriteLine(i);
            }
        }

}

​x
 
using System;
                    
public class Program
{
    public static void Main()
    {
        int[] a = new int[10];
            Random r = new Random();
            for (int i = 0; i < a.Length; i++)
            {
                a[i] = r.Next(1, 101);
            }
            int c = Qe9(a);
            Console.WriteLine(c);
    }
     static int Qe9(int[] a)
        {
            int c=0;
            for (int i = 1; i < a.Length-1; i++)
            {
                if (a[i] % 2 == 0 && a[i - 1] % 2 == 1 && a[i + 1] % 2 == 1)
                    c++;
​
            }
            return c;
        }
        static int[] Merge(int[] a, int[] b)
        {
            a = FreQuency(a);
            b = FreQuency(b);
            int[] c = new int[a.Length + b.Length];
            int j = 0;
            for (int i = 0; i < a.Length; i++)
            {
                c[i] = a[i];
                j++;
​
            }
            int counter = 0;
            for (int i = j; i < c.Length; i++)
            {
                c[i] = b[counter];
                counter++;
            }
            c = MeonRani(c);
            return FreQuency(c);
        }
        static int[] Merge(int[] a, int[] b)
        {
            a = FreQuency(a);
            b = FreQuency(b);
            int[] c = new int[a.Length + b.Length];
            int j=0;
            for (int i = 0; i < c.Length; i++)
            {
                if (i < a.Length)
                    c[i] = a[i];
                else
                {
                    c[i] = b[j];
                    j++;
                }
            }
            c= MeonRani(c);
            return FreQuency(c);
​
        }
        static bool MainArray(int[] a)
        {
            if (ISEvenSort(a) && ISOddSort(a) && ISAfterAndBefor(a)) return true;
            return false;
        }
        static bool ISEvenSort(int[] a)
        {
            for (int i = 0; i < a.Length-2; i=i+2)
            {
                if (a[i] < a[i + 2]) return false;
            }
            return true;
        }
        static bool ISOddSort(int[] a)
        {
            for (int i = 1; i < a.Length - 2; i = i + 2)
            {
                if (a[i] > a[i + 2]) return false;
            }
            return true;
        }
        static bool ISAfterAndBefor(int[] a)
        {
            if (a[0]<a[1]) return false;
            for (int i = 2; i < a.Length-1; i=i+2)
            {
                if (a[i]<a[i-1] && a[i]<a[i+1]) return false;
            }
            if (a.Length%2==1 && (a[a.Length-1]<a[a.Length-2])) return false;
            return true;
​
        }
        static int[] CopyOfRange(int[] a, int from, int to)
        {
            if (from > to || from >= a.Length || to >= a.Length || to < 0 || from < 0)
                return null;
            int n = to - from + 1;
            int[] b = new int[n];
            int c = 0;
            for (int i = from; i <= to; i++)
            {
                b[c] = a[i];
                c++;
            }
            return b;
        }
        static int[] GetRightSubArray(int[] a, int value)
        {
             int c = ArrayCountForQu51(a, value);
             int n = a.Length - c - 1;
             int[] b = new int[n];
             int x = 0;
             for (int i = c+1; i < a.Length; i++)
             {
                 b[x] = a[i];
                 x++;
             }
             return b;
        }
        static int[] GetLeftSubArray(int[] a, int value)
        {
            int n = ArrayCountForQu51(a, value);
            int[] b = new int[n];
            for (int i = 0; i < b.Length; i++)
            {
                b[i] = a[i];
            }
            return b;
        }
        static int ArrayCountForQu52(int[] a, int value)
        {
            int c = 0;
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] == value)
                    c = i;
            }
            return c;
        }
        static int ArrayCountForQu51(int[] a, int value)
        {
            int c=0;
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] != value)
                    c++;
                else return c;
            }
            return c;
        }
​
        static bool TrueForAll1(int[] a, char Op, int Num)
        {
            if (Op=='>')
                for (int i = 0; i < a.Length; i++)
                {
                    if (a[i] <= Num) return false;
                }
            else if (Op=='=')
                for (int i = 0; i < a.Length; i++)
                {
                    if (a[i] != Num) return false;
                }
            else for (int i = 0; i < a.Length; i++)
                {
                    if (a[i] >= Num) return false;
                }
            return true;
        }
        static int Where(int[] a)
        {
            int sum1, sum2;
            for (int i = 1; i < a.Length; i++)
            {
                sum1 = Sum(a, 0, i - 1);
                sum2 = Sum(a, i, a.Length - 1);
                if (sum1 == sum2) return i;
            }
            return -1;
        }
        static int Sum(int[] a, int L, int R)
        {
            int sum = 0;
            for (int i = L; i <=R ; i++)
            {
                sum += a[i];
            }
            return sum;
        }
        static void PrintNumbers(int[] a)
        {
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] % 3 == 0) Console.Write("{0} ",a[i]);   
            }
            Console.Write('*');
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] % 5 == 0) Console.Write("{0} ", a[i]);
            }
        }
        static int Sum2(int[] a)
        {
            int sum = 0;
            for (int i = 0; i < a.Length-1; i=i+2)
            {
                Console.WriteLine(a[i] + a[i + 1]);
                sum += a[i]+a[i+1];
            }
            return sum;
        }
        static int[] SumArray(int[] a, int from, int to,int val)
        {
            if (from > to || from >= a.Length || to >= a.Length || to < 0 || from < 0)
                return a;
            for (int i = from; i <= to; i++)
            {
                a[i] = val;
            }
            return a;
        }
        static int MaxlengthBalndrom(int[] a)
        {
            int max =-1;
            int length = 0;
            for (int i = 0; i < a.Length; i++)
            {
                if (Digitnumber(a[i]) > length && IsBalndrom(a[i]))
                {
                    length = Digitnumber(a[i]);
                    max = a[i];
                }
            }
            int c=0;
            for (int i = 0; i < a.Length; i++)
            {
                if (Digitnumber(a[i]) == length && IsBalndrom(a[i]))
                {
                    if (c < 2)
                    {
                        length = Digitnumber(a[i]);
                        max = a[i];
                        c++;
                    }
                }
            }
            
            return max;
        }
        static bool IsBalndrom(int n)
        {
            int a = Mklob(n);
            if (n == a) return true;
            return false;
        }
        static int[] NadenArrray2(int[] a)
        {
            int c = 0;
            int n = LenghtArrayNaden(a);
            int[] b = new int[n];
            for (int i = 1; i < a.Length; i = i + 2)
            {
                for (int j = 1; j <= a[i]; j++)
                {
                    b[c] = a[i - 1];
                    c++;
                }
            }
            return b;
        }
        static int[] NadenArrray1(int[] a)
        {
            int counter = 0;
            int j = 0;
            int n = LenghtArrayNaden(a);
            int[] b = new int[n];
            for (int i = 0; i < a.Length; i++)
            {
                if (i % 2 == 1)
                {
                    for (j = counter; j < a[i] + counter; j++)
                    {
                        b[j] = a[i-1];
                    }
                    counter = j;
                }
            }
            return b;
        }
        static int LenghtArrayNaden(int[] a)
        {
            int sum=0;
            for (int i = 0; i < a.Length; i++)
            {
                if (i % 2 == 1) sum += a[i];
            }
            return sum;
        }
        static int[] FreQuency(int[] a)
        {
            int[] b=new int[a.Length];
            int j=0;
            bool ok = true;
            for (int i = 0; i < a.Length; i++)
            {
                if (!Found(b, a[i]))
                {
                    b[j] = a[i];
                    j++;
                }
                if (a[i] == 0 && ok==true)
                {
                    ok = false;
                    b[j] = a[i];
                    j++;
                }
                    
            }
            int[] c = new int[j];
            for (int i = 0; i < c.Length; i++)
            {
                c[i] = b[i];
            }
            return c;
        }
        static bool Found(int[] a, int x)
        {
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] == x) return true;
            }
            return false;
        }
        static string MaxName(int[] a, string[] b)
        {
            int max = a[0];
            int index = 0;
            for (int i = 1; i < a.Length; i++)
            {
                if (a[i] > max)
                {
                    max = a[i];
                    index = i;
                }
            }
            return b[index];
        }
        static double[] AvgStudentsArrray(int[] a)
        {
            double[] b = new double[LenghtOfStudentsArray(a)];
            int j = 0;  
            for (int i = 0; i < b.Length; i++)
            {
                int sum = 0;
                int x = a[j];
                for (int z = 1; z <= x; z++)
                {
                    j++;
                    sum += a[j];
                }
                j++;
                b[i] = sum / x;
              
            }
            return b;
        }
​
        static int LenghtOfStudentsArray(int[] a)
        {
            int c = 0;
            for (int i = 0; i < a.Length; i++)
            {
                c++;
                i += a[i];
            }
            return c;
        }
        static char[] ResultChar2(char[] a)
        {
            int c = LenghtOfCharArray(a);
            char[] b = new char[c];
            int index = 0;
            int i = 0;
            int j = a.Length - 1;
            while (index<a.Length)
            {
                int code = (int)a[index];
                if (code <= 90 && code >= 65)
                {
                    b[i] = a[index];
                    i++;
                }
                if (code <= 122 && code >= 97)
                {
                    b[j] = a[index];
                    j--;
                }
                index++;
            }
            return b;
        }
        static char[] ResultChar1(char[] a)
        {
            int c=LenghtOfCharArray(a);
            char[] b=new char[c];
            int j=0;
            for (int i = 0; i < a.Length; i++)
            {
                 int code = (int)a[i];
                 if (code <= 90 && code >= 65)
                 {
                     b[j] = a[i];
                     j++;
                 }
            }
            for (int i = 0; i < a.Length; i++)
            {
                int code = (int)a[i];
                if (code <= 122 && code >= 97)
                {
                    b[j] = a[i];
                    j++;
                }
            }
            return b;
        }
        static int LenghtOfCharArray(char[] a)
        {
            int c=0;
            for (int i = 0; i < a.Length; i++)
            {
                int code = (int)a[i];
                if ((code <= 122 && code >= 97) || (code <= 90 && code >= 65))
                    c++;
            }
            return c;
        }
​
        static int LengthOfB1(int[] a)
        {
            int b = 1;
            int x = 1;
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] != x)
                {
                    x = a[i];
                    b++;
                }
            }
            return b;
        }
        static int LengthOfB2(int[] a)
        {
            int c = 1;
            for (int i = 0; i < a.Length-1; i++)
            {
                if (a[i] != a[i + 1])
                    c++;
            }
            return c;
        }
​
        static int[] NewB(int[] a)
        {
            int n = LengthOfB2(a);
            int[] b = new int[n];
            int c = 1;
            int e=0,h=0;
            
            return b;
        }
​
        
​
        static int[] MeonMohammedDahod(int[] a)
        {
            int[] b= new int[a.Length];
            for (int i = 0; i < b.Length; i++)
            {
                b[i] = MinArrayMeon(a);
            }
            return b;
        }
        static int MinArrayMeon(int[] a)
        {
            int min = a[0];
            int index = 0;
            for (int i = 1; i < a.Length; i++)
            {
                if (a[i]<min)
                {
                    min = a[i];
                    index = i;
                }
            }
            a[index] = int.MaxValue;
            return min;
        }
​
        static bool AeataAesm(int[] a,int b)
        {
            for (int i = 0; i < a.Length; i++)
            {
                if (b == a[i]) return false;
            }
            return true;
        }
​
        static bool IsNotSimilar(int[] a, int[] b)
        {
            if (a.Length != b.Length) return false;
            for (int i = 0; i < a.Length; i++)
            {
                if (!AeataAesm(b, a[i])) return true;
            }
            return false;
        }
​
        static int[] MeonAdel(int[] a)
        {
            for (int i= 0; i < a.Length; i++)
            {
                for (int j = 0; j < a.Length-1; j++)
                {
                    if (a[j] > a[j + 1])
                    {
                        int x = a[j];
                        a[j] = a[j + 1];
                        a[j + 1] = x;
                    }
                }
            }
            return a;
        }
        static int[] MeonRani(int[] a)
        {
            int[] b=new int[a.Length];
            for (int i = 0; i < a.Length; i++)
            {
                int c = 0;
                for (int j = 0; j < a.Length; j++)
                {
                    if (a[i] > a[j])
                        c++;
                }
                b[c] = a[i];
            }
            return b;
        }
​
        static int Check2(int[] a, int n)
        {
            for (int i = 0; i < a.Length; i++)
            {
                int sum = a[i];
                for (int j = i + 1; j < a.Length; j++)
                {
                    sum += a[j];
                    if (sum == n) return i;
                }
            }
            return -1;
        }
        static bool Check1(int[] a, int n)
        {
            for (int i = 0; i < a.Length; i++)
            {
                 int sum=a[i];
                for (int j = i+1; j < a.Length; j++)
                {
                    sum += a[j];
                    if (sum == n) return true;
                }
            }
            return false;
        }
        static bool EqulasNumber3(int[] a, int index)
        {
            int sumLeft = 0;
            int sumRight = 0;
            for (int i = 0; i < a.Length; i++)
            {
                if (i < index) sumLeft += a[i];
                else sumRight += a[i];
            }
            return sumLeft == sumRight-a[index];
​
        }
        static bool EqulasNumber2(int[] a, int index)
        {
            int sumLeft = 0;
            int sumRight = 0;
            for (int i = 0; i < a.Length; i++)
            {
                if (i < index) sumLeft += a[i];
                if (i > index) sumRight += a[i];
            }
            return sumLeft == sumRight;
​
        }
        static bool EqulasNumber1(int[] a, int index)
        {
            int sumLeft = 0;
            for (int i = 0; i < index; i++)
                sumLeft += a[i];
​
            int sumRight = 0;
            for (int i = index+1; i < a.Length; i++)
                sumRight += a[i];
​
            return sumLeft == sumRight;
​
        }
        static int MaxIndexIntArray(int[] a)
        {
            int max = a[0];
            int index = 0;
            for (int i = 1; i < a.Length; i++)
            {
                if (a[i] > max)
                {
                    max = a[i];
                    index = i;
                }
            }
            return index;
        }
        static int MaxIntArray(int[] a)
        {
            int max=a[0];
            for (int i = 1; i < a.Length; i++)
            {
                if (a[i] > max)
                    max = a[i];
            }
            return max;
        }
      
        static int[] BuildaArray()
        {
            Random r = new Random();
            int[] a = new int[10];
            for (int i = 0; i < a.Length; i++)
            {
                a[i] = r.Next(10, 100);
            }
            return a;
        }
​
        static int SortDigits(int n)
        {
            int sum = 0;
            int c=0;
            while (n > 0)
            {
                int min = MinDigit(n);
                n = deleteDigit(n, min);
                sum = sum + min * (int)Math.Pow(10, c);
                c++;
            }
            return sum;
        }
        static int MinDigit(int n)
        {
            int min = 10;
            while (n > 0)
            {
                int a = n % 10;
                if (a < min) min = a;
                n = n / 10;
            }
            return min;
        }
        static int deleteDigit(int n, int a)
        {
            int c=0;
            int sum = 0;
            bool ok = false;
            while (n > 0)
            {
                int x = n % 10;
                if (a != x)
                {
                    sum = sum + x * (int)Math.Pow(10, c);
                    c++;
                }
                else
                {
                    if (ok == true)
                    {
                        sum = sum + x * (int)Math.Pow(10, c);
                        c++;
                    }
                    ok = true;
                }
                n = n / 10;
            }
            return sum;
        }
​
        static double sum2max(double a, double b)
        {
            if (a > b) return b / 2 + a;
            return a / 2 + b;
        }
        static double sum2max(double a,double b,double c)
        {
            return 0;
        }
​
​
        static int Grades(int a, int b, int c)
        {
            int count = 0;
            if (a > 90) count++;
            if (b > 90) count++;
            if (c > 90) count++;
            return count;
        }
​
        static int GiftCard(int money, int year)
        {
            if (year > 3 && year < 8 && money > 1200) return year * 50;
            else if (year >= 8 && money > 1200) return year * 100;
            else return 0;
        }
        static bool Age1(int a)
        {
            if (a >= 15 && a <= 18) return true;
            return false;
        }
        static bool Age2(int a)
        {
           return (a >= 15 && a <= 18) ;
        }
​
​
        static int Lvl1(int a, int b, int c, int d)
        {
            int x = 2 * (c - a);
            if (b == 2) x--;
            if (d == 2) x++;
            return x;
        }
        static int Lvl2(int a, int b, int c, int d)
        {
            int e, f;
            e = a * 2 + b;
            f = c * 2 + d;
            return f - e;
        }
        static int Lvl3(int a, int b, int c, int d)
        {
            int x = (c - a - 1) * 2;
            if (b == 1) x=x+2;
            if (b == 2) x = x + 1;
            if (d == 2) x = x + 1;
            return x;
        }
​
        static char Gender1(string a, string b)
        {
            if (a == "female" && b == "male") return 'v';
            if (a == "female" && b == "female") return 'f';
            return 'm';
        }
        static char Gender2(string a, string b)
        {
            if (a.Equals("female") && b.Equals("male")) return 'v';
            if (a.Equals("female") && b.Equals("female")) return 'f';
            return 'm';
        }
​
        static bool Price(int c)
        {
            int sum = 0;
            for (int i = 1; i <=c ; i++)
            {
                int price = int.Parse(Console.ReadLine());
                sum += price;
            }
            if (sum > 150) return true;
            return false;
        }
        static char checkHadel(int a, int b, int c)
        {
            int sum = 0;
            sum = a + b + c;
            if (sum % 2 == 0) return 'y';
            return 'n';
        }
        static bool Check123(int m, int y)
        {
            return (m <= 6 && m >= 1 && y == 2009);    
        }
        static void Spaces(int n)
        {
            for (int i = 1; i <=n ; i++)
            {
                Console.Write(" ");
            }
        }
        static void Traingle(char ch)
        {
            int n = (int)ch - 96;
            for (int i = 97; i <=(int)ch ; i++)
            {
                Spaces(n);
                Print1((char)i);
                print2((char)i);
                Console.WriteLine();
                n--;
            }
        }
        static void Print1(char ch)
        {
            for (int i = 97; i <=(int)ch ; i++)
            {
                Console.Write((char)i);
            }
        }
        static void print2(char ch)
        {
            for (int i = (int)ch-1; i >=97 ; i--)
            {
                Console.Write((char)i);
            }
        }
        static bool IsChar(char ch)
        {
            int x = (int)ch;
            if (x < 97 || x > 122)
                return false;
            return true;
        }
​
        
        static int GetMinCommon(int n1, int n2)
        {
            while (n1 > 0)
            {
                int d = RemoveMin(ref n1);
                bool ok = Exists(n2, d);
                if (ok == true) return d;
            }
            return -1;
        }
        static bool Exists(int n, int d)
        {
            while (n > 0)
            {
                int a = n % 10;
                if (a == d) return true;
                n = n / 10;
            }
            return false;
        }
        static int RemoveMin(ref int n)
        {
            int sum=0,i=0;
            int a = TheLitterDigit(n);
            while(n>0)
            {
                int b = n % 10;
                if (a != b)
                {
                    sum = sum + b * (int)Math.Pow(10, i);
                    i++;
                }
                n = n / 10;
            }
            n = sum;
            return a;
        }
        static int TheLitterDigit(int n)
        {
            int min = 10;
            while (n > 0)
            {
                int a = n % 10;
                if (a < min) min = a;
                n = n / 10;
            }
            return min;
        }
        static int Winner(int n)
        {
            int a = B(n);
            if (n==a) return 1000;
            return 0;
        }
        static int B(int n)
        {
            int sum = 0;
            int c = 0;
            while (n > 0)
            {
                int a = n % 10;
                if (a % 2 == 1 && a < 9) a = a + 1;
                sum = sum + a * (int)Math.Pow(10, c);
                c++;
                n = n / 10;
            }
            return sum;
        }
        static int Minus(int n1, int n2)
        {
            if (n1 > n2) return n1 - n2;
            return n2 - n1;
​
        }
        static int Mklob(int n)
        {
            int sum = 0;
            int c = Digitnumber(n);
            for (int i = c-1; i >= 0; i--)
            {
                sum += n % 10 * (int)Math.Pow(10, i);
                n = n / 10;
            }
            return sum;
        }
        static int Digitnumber(int n)
        {
            int c = 0;
            while (n > 0)
            {
                c++;
                n = n / 10;
            }
            return c;
        }
        static int GetRightHalf(int Num, int L)
        {
            int a = (int)Math.Pow(10, L / 2);
            return Num % a;
        }
        static int GetLeftHalf(int Num, int L)
        {
            int a = (int)Math.Pow(10, L / 2);
            return Num / a;
        }
​
​
        static int RemoveDigits(int num, int v)
        {
            int n, i = 0, sum = 0;
            while (num > 0)
            {
                n = num % 10;
                if (n > v && n % 2 == 1)
                    num = num / 10;
                else
                {
                    sum += n * (int)Math.Pow(10, i);
                    i++;
                    num = num / 10;
                }
            }
            return sum;
        }
        static bool CheckDema(int n1, int n2)
        {
            int i = 0;
            while (n1 > 0)
            {
                i++;
                if (i % 2 != 0)
                {
                    if (n1 % 10 != n2 % 10) return false;
                }
                n1 = n1 / 10;
                n2=n2 / 10;
            }
            return true;
        }
        static bool CheckAli(int n1, int n2)
        {
            int a = 0, b = 0;
            while (n1 > 0)
            {
                if (n1 % 10 == n2 % 10)
                    a++;
                b++;
                n1 = n1 / 100;
                n2 = n2 / 100;
            }
            if (a == b) return true;
            return false;
        }
        static int LastIndexOf(int n, int digit)
        {
            int c = 0, index = -1;
            while (n > 0)
            {
                c++;
                int a = n % 10;
                if (digit == a)
                    index = c;
                n = n / 10;
            }
            return index;
        }
        static bool IsPerfect(int n)
        {
            int sum = 0;
            for (int i = 1; i < n; i++)
            {
                if (n % i == 0) sum += i;
            }
            if (sum == n) return true;
            return false;
        }
         static int GetNthItem(int N)
         {
            return (int)Math.Pow(N, 2);
         }
        static bool FirstAndLast(int n)// ادعاء دخول : تتلقى عددا صحيحا
        {                               //تعيد صحيح اذا كان اول منزلة تساوي اخر منزلة
            int a = n % 10;
            while (n > 10)
                n = n / 10;
            if (a == n) return true;
            return false;
        }
​
        static bool Check(int n1, int n2)
        {
            if (!IsLengthEven(n1)) return false;
            if (!IsLengthEven(n2)) return false;
            if (!Equals(n1, n2)) return false;
            int a, b;
            while (n1 > 0)
            {
                a = n1 % 100;
                b = n2 % 100;
                if (a + 1 != b) return false;
                n1 = n1 / 100;
                n2 = n2 / 100;
            }
            return true;
​
        }
        static bool Equals(int n1, int n2)
        {
            int c1 = 0, c2 = 0;
            while (n1 > 0)
            {
                n1 = n1 / 10;
                c1++;
            }
            while (n2 > 0)
            {
                n2 = n2 / 10;
                c2++;
            }
            if (c1 == c2) return true;
            return false;
        }
        static bool IsLengthEven(int n)
        {
            int c = 0;
            while (n > 0)
            {
                n = n / 10;
                c++;
            }
            if (c % 2 == 0) return true;
            return false;
        }
​
        static bool IsPrime(int n)
        {
            for (int i = 2; i < n; i++)
            {
                if (n % i == 0) return false;   
            }
            return true;
        }
​
        static bool IsLowerOfTow(int n)
        {
            int c=0;
            while (n > 0)
            {
                int a = n % 10;
                if (a % 2 == 1) c++;
                n = n / 10;
            }
            if (c > 2) return false;
            return true;
        }
        static bool tsa3de(int n)
        {
            while (n > 10)
            {
              int a = n % 10;
              int b = n / 10 % 10;
              if (a > b) return false;
              n = n / 10;
            }
            return true;
        }
​
​
        static int Replace(int N, int Digit1, int Digit2)
        {
            int i=0;
            int sum=0;
            while (N > 0)
            {
                int a = N % 10;
                if (a == Digit1)
                    sum = sum + Digit2 * (int)Math.Pow(10, i);
                else sum = sum + a *(int)Math.Pow(10, i);
                i++;
                N = N / 10;
            }
            return sum;
        }
        static int Blood(int L, int H)
        {
            if (L < 80 && H < 120) return 0;
            if (L < 89 && L > 80 && H > 120 && H < 139) return 1;
            if (L < 99 && L >= 90 && H >= 140 && H < 159) return 2;
            return 3;
            
        }
        static bool StartsWith(int n1, int n2)
        {
            if (n2 > n1) return false;
            bool ok=true;
            int c = 0;
            int b = n2;
            while (b > 0)
            {
                b = b / 10;
                c++;
            }
            double a = Math.Pow(10, c);
            if (n1 % a == n2) return true;
            else return false;
​
        }
​
         
​
​
​
        public static bool IsLetter(char ch)
        {
            return IsSmallLetter(ch) || IsCapitalLetter(ch);
        }
​
        public static bool IsSmallLetter(char ch)
        {
            int a = (int)ch;
            if (a >= 97 && a <= 122) return true;
            return false;
        }
        public static bool IsCapitalLetter(char ch)
        {
            return ((int)ch >= 65 && (int)ch <= 90);
        }
​
        public static bool IsSmallLetter2(char ch)
        {
            int a = (int)ch;
            return (a >= 97 && a <= 122);
        }
​
        static double Hadel(double a, double b, double c)
        {
            return Math.Max(a, Math.Max(b, c));
           
        }
​
​
        static void AliAbu(int x)
        {
            x = x + 10;
            Console.WriteLine(x);
        }
​
        static int Gazale(int x)
        {
            x = x + 10;
            return x;
        }
​
        static int Narden(int a, int b)
        {
            int sum = a + b;
            return sum;
        }
​
        static void Number()
        {
            for (int i = 1; i <= 100; i++)
            {
                Console.WriteLine(i);
            }
        }
​
}

Bod má souřadnice X:1 a Y:2
{X:1 Y:2}
{A:{X:10 Y:20} B:{X:40 Y:50}}
Delka cary je: 42.43

Last Run:	8:05:39 am
Compile:	0.11s
Execute:	0.016s
Memory:	40kb
CPU:	0.016s

View IL Code