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# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;
using System.Text;
using System.Numerics;

namespace abc169
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
            if (File.Exists("input.txt"))
            {
                Console.SetIn(new StreamReader("input.txt"));
            }
            solve_abc169A();
            Console.Out.Flush();
        }

        public static void solve_abc169B()
        {
        }

        public static void solve_abc169A()
        {
            int[] ab = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
            Console.WriteLine(ab[0] * ab[1]);
        }

        /*
            int[] test = new int[7]  {3, 5, 7, 9, 10, 11, 13};
            int[] keys = new int[9] {1, 3, 4, 5, 8, 11, 12, 13, 14};
            for (int i = 0; i < keys.Length; i++)
            {
                Console.WriteLine(binSearch(test, keys[i]));
            }
        */
        public static int binSearch(int[] a, int x)
        {
            int l = 0;
            int r = a.Length - 1;
            while (l <= r)
            {
                int mid = (l + r) / 2;
                if (a[mid] == x)
                {
                    return mid;
                }
                else if (a[mid] > x)
                {
                    r = mid - 1;
                }
                else
                {
                    l = mid + 1;
                }
            }
            return -1;
        }

        public static int binSearchLeft(int[] a, int x)
        {
            int l = 0;
            int r = a.Length - 1;
            while (l < r)
            {
                int mid = (l + r) / 2;
                if (a[mid] < x)
                {
                    l = mid + 1;
                }
                else
                {
                    r = mid;
                }
            }
            return l;
        }
    }
}