Problem:
Score : 100 points

Problem Statement

Compute A \times B.

Constraints

1 \leq A \leq 100

1 \leq B \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the value A \times B as an integer.

Sample Input 1

2 5

Sample Output 1

10

We have 2 \times 5 = 10.

Sample Input 2

100 100

Sample Output 2

10000

Solution in C# (Mono-csc 3.5.0) (judge verdict: Accepted)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        
        //int pocetTestu = NextInt();
        //int[] pole = NextIntArray(10);
        //string s = Next();
        //cout.WriteLine(5);

        int a = NextInt();
        int b = NextInt();
        cout.WriteLine(a*b);
        /*
        int pocetTestu = int.Parse(Console.ReadLine());
        StringBuilder vystup = new StringBuilder();
        while (pocetTestu > 0)
        {
            //int velikostPole = int.Parse(Console.ReadLine());
            string[] cisla = Console.ReadLine().Split();
            int n = int.Parse(cisla[0]);
            List<int>[] zacatkyNul = new List<int>[n+1];
            int[] vysledek = new int[n];
            for (int a = 0; a <= n; a++)
            {
                zacatkyNul[a] = new List<int>();
            }
            zacatkyNul[n].Add(0);
            int cislo = 1;
            for (int delka = n; delka >= 1; delka--)
            {
                zacatkyNul[delka].Sort();
                foreach(int zacatek in zacatkyNul[delka])
                {
                    int konec = zacatek + delka - 1;
                    vysledek[(zacatek + konec) / 2] = cislo;
                    
                    cislo++;
                    zacatkyNul[(delka-1)/2].Add(zacatek);
                    zacatkyNul[delka-1-(delka-1)/2].Add((zacatek+konec)/2+1);
                }
            }

            for (int i = 0; i < n; i++)
            {
                vystup.Append(vysledek[i].ToString() + " ");
            }

            vystup.AppendLine();
            */
        /*
        int n = int.Parse(cisla[0]);
        int k = int.Parse(cisla[1]);

        string[] poleAstring = Console.ReadLine().Split();
        string[] poleBstring = Console.ReadLine().Split();
        
        int[] poleA = new int[n];
        int[] poleB = new int[n];
        for (int a = 0; a < n; a++)
        {
            poleA[a] = int.Parse(poleAstring[a]);
            poleB[a] = int.Parse(poleBstring[a]);
        }
        Array.Sort(poleA);
        Array.Sort(poleB);
        Array.Reverse(poleB);
        int pocitac = 0;
        int soucet = 0;
        for (int j = 0; j < n; j++)
        {
            if (pocitac < k && poleB[j] > poleA[j])
            {
                soucet += poleB[j];
                pocitac++;
            }
            else
            {
                soucet += poleA[j];
            }
        }

        vystup.AppendLine(soucet.ToString());*/
        /*
        int[] cukrovy = new int[velikostPole];
        
        for (int p = 0; p < velikostPole; p++)
        {
            cukrovy[p] = int.Parse(cisla[p]);
        }


        vystup.AppendLine(velikostPole.ToString());
*/
        //vystup.AppendLine(pocetNeNul.ToString());


        //vystup.AppendLine(odpoved.ToString());

        /*int pocitadlo = 0;

        for (int b = cisloN / 2; b < cisloN - 1; b++)
        {
            pole[b] = 1 + pocitadlo * 2;
            pocitadlo++;
        }

        pole[cisloN - 1] = 1 + pocitadlo * 2 + cisloN / 2;
        vystup.AppendLine("YES");
        for (int a = 0; a < cisloN; a++)
        {
            vystup.Append(pole[a] + " ");
        }*/

        //  vystup.AppendLine(soucet.ToString());

        /*for (int v = 0; v < velikostPole; v++)
        {
            vystup.Append(poleVysledku[v]);
            vystup.Append(" ");
        }

        vystup.AppendLine();*/
    }

    private long Solve(int[] a) {
        var h = a.GroupBy(x => x)
            .Select(x => new { Value = x.Key, Count = x.Count() })
            .OrderBy(x => x.Value)
            .ToArray();

        long ans = 1;
        long sub = 0;
        //h.Dump();
        foreach (var g in h) {
            if (ans + sub + g.Count - 1 >= g.Value) {
                //new { ans, sub, g }.Dump();
                ans += g.Count + sub;
            } else {
                sub += g.Count;
            }
        }

        return ans;
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}