Problem:
Score : 100 points

Problem Statement

You are given three integers A, B and C.

Determine if there exists an equilateral triangle whose sides have lengths A, B and C.

Constraints

All values in input are integers.

1 \leq A,B,C \leq 100

Input

Input is given from Standard Input in the following format:

A B C

Output

If there exists an equilateral triangle whose sides have lengths A, B and C, print Yes; otherwise, print No.

Sample Input 1

2 2 2

Sample Output 1

Yes

There exists an equilateral triangle whose sides have lengths 2, 2 and 2.

Sample Input 2

3 4 5

Sample Output 2

No

There is no equilateral triangle whose sides have lengths 3, 4 and 5.

Solution in C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections;
using System.Collections.Generic;

class Program
{
    static void Main(string[] args)
    {
        int BoxCount;
        int SpellLength;

        List<char> CharIndex;
        List<int> GolemCount = new List<int>();
        List<int> GolemMoves = new List<int>();

        List<char> Spell;

        string[] cells = Console.ReadLine().Split();

        BoxCount = int.Parse(cells[0]);
        SpellLength = int.Parse(cells[1]);

        for (int i = 0; i < BoxCount; i++)
        {
            GolemCount.Add(1);
        }

        CharIndex = new List<char>(Console.ReadLine());

        for (int i = 0; i < SpellLength; i++)
        {
            Spell = new List<char>(Console.ReadLine());

            // 移動予定の初期化
            GolemMoves = new List<int>();
            for (int j = 0; j < BoxCount; j++)
            {
                GolemMoves.Add(0);
            }

            // 移動予定
            for (int j = 0; j < BoxCount; j++)
            {
                // 呪文の対象
                if (CharIndex[j] == Spell[0])
                {
                    // 右に動かす
                    if (Spell[2] == 'R')
                    {
                        if (j != BoxCount - 1)
                        {
                            GolemMoves[j + 1] += GolemCount[j];
                        }
                        GolemMoves[j] -= GolemCount[j];
                    }
                    else // 左
                    {
                        if (j != 0)
                        {
                            GolemMoves[j - 1] += GolemCount[j];
                        }
                        GolemMoves[j] -= GolemCount[j];

                    }

                }
            }

            // 移動後の処理
            for (int l = 0; l < BoxCount; l++)
            {
                GolemCount[l] += GolemMoves[l];
            }

        }

        int res = 0;
        foreach (int c in GolemCount)
        {
            res += c;
        }

        Console.WriteLine(res);

    }
}