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



Sample input:
2 5


Sample output:
10

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

a, b = inm()
print(a * b)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**8)
def line_to_int(): return int(sys.stdin.readline())
def line_to_each_int(): return map(int, sys.stdin.readline().split())
def line_to_list(): return list(map(int, sys.stdin.readline().split()))
def line_to_list_in_iteration(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
# def dp(init, i, j): return [[init]*i for i2 in range(j)]
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
# from itertools import accumulate #A = [0]+list(accumulate(A))
# import bisect #bisect.bisect_left(B, a), bisect.bisect_right(B,a)

a, b = line_to_each_int()
print(a*b)

Submission status: Accepted

Solution code:
A, B= map(int, input().split())
print(A*B)

Submission status: Accepted

Solution code:
a,b = list(map(int,input().split()))
print(a*b)

Submission status: Accepted

Solution code:
a, b = map(int, input().split(' '))

print(a*b)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def II(): return int(sys.stdin.readline())


def MI(): return map(int, sys.stdin.readline().split())


def LI(): return list(map(int, sys.stdin.readline().split()))


def main():
    N = LI()
    print(N[0]*N[1])


# oj t -c "pypy3 main.py"
# acc s main.py -- --guess-python-interpreter pypy
main()

Submission status: Accepted

Solution code:
num = [int(i) for i in input().split() ]
print(num[0] * num[1])

Submission status: Accepted

Solution code:
def main():
 a,b = map(int,input().split())
 print(a * b)
main()

Submission status: Accepted

Solution code:
i = list(map(int,input().split()))

a = i[0]
b = i[1]

print(a*b)

Submission status: Accepted

Solution code:
a,b = map(int, input().split()) 
print(a*b)

Submission status: Accepted

Solution code:
print(eval(input().replace(*(' *'))))

Submission status: Accepted

Solution code:
a,b = list(map(int,input().split()))

print(a * b)

Submission status: Accepted

Solution code:
A,B= map(int,input().split())
res = A*B

print(res)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
print(A * B)

Submission status: Accepted

Solution code:
def main():
    a, b = (int(i) for i in input().split())
    print(str(a * b))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = [int(c) for c in input().split()]
print(a*b)

Submission status: Accepted

Solution code:
L, R = input().split()
print(int(R)*int(L))

Submission status: Accepted

Solution code:
p, q = map(int, input().split())
print(str(p * q))

Submission status: Accepted

Solution code:
s = input()
l = s.split(" ")
a,b = int(l[0]), int(l[1])
print(a*b)

Submission status: Accepted

Solution code:
# A Multiplication 1

a, b = map(int, input().split())

print(a * b)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

ans = A * B

print(ans)

Submission status: Accepted

Solution code:
a,b=map(float,input().split())
a=int(a)
b=int(100*b)
print(a*b//100)

Submission status: Accepted

Solution code:
A,B = map(int, input().split())

print(A * B)

Submission status: Accepted

Solution code:
a, b = (int(i) for i in input().split())
print(f'{a * b}')

Submission status: Accepted

Solution code:
A, B = input().split()

print(int(A) * int(B))

Submission status: Accepted

Solution code:
a,b=input().split()
print(int(a)*int(b))

Submission status: Accepted

Solution code:
A , B =map(int,input().split())
print(A*B)

Submission status: Accepted

Solution code:
def main():
    a,b = map(int,input().split())
    print(a*b)

if  __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b = input().split()
print(int(a)*int(b))

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))

print(a * b)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())

print(int(A*B))

Submission status: Accepted

Solution code:
inp = list(map(int,input().split()))
print (inp[0]*inp[1])

Submission status: Accepted

Solution code:
num = input().split()

print(int(num[0]) * int(num[1]))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

A,B = list(map(int,input().split()))
print(A*B)

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))

print(X[0]*X[1])

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    print(a*b)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b = list(map(int,input().split()))

print(a*b)

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    x, y = map(int, input().split())
    print(x*y)
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = input().split()
print(int(a)*int(b))

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))

print(a[0]*a[1])

Submission status: Accepted

Solution code:
(A,B) = input().split()
print(int(A) * int(B))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(a * b )

Submission status: Accepted

Solution code:
a = input()
a = [int(n) for n in a.split()]
print(a[0] * a[1])

Submission status: Accepted

Solution code:
x, y = map(int, input().split())

result = x * y 

print(result)

Submission status: Accepted

Solution code:
N , M = (map(int , input().split()))
print(N * M)

Submission status: Accepted

Solution code:
AB = list(map(int, input().split(' ')))

print(AB[0] * AB[1])

Submission status: Accepted

Solution code:
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

A,B = MI()

print(A*B)

Submission status: Accepted

Solution code:
X,Y= map(int, input().split())
print(X*Y)

Submission status: Accepted

Solution code:
(a, b) = map(int, input().split())
print(a * b)

Submission status: Accepted

Solution code:
import numpy as np
#from numba import njit

def getVar():
    return map(int, input().split())
def getArray():
    return np.array(list(map(int, input().split())))

(A, B) = getVar()

print(str(A*B))

Submission status: Accepted

Solution code:
number = input().split(" ")
print(int(number[0]) * int(number[1]))

Submission status: Accepted

Solution code:
a,b =list(map(int,(input().split())))
print(a*b)

Submission status: Accepted

Solution code:
a, b = map(int, input().split(' '))
print(a * b)

Submission status: Accepted

Solution code:
A,B = map(int, input().split(' '))
print(A * B)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
ans = A * B
print(ans)

Submission status: Accepted

Solution code:
def Ii():return int(input())
def Mi():return map(int,input().split())
def Li():return list(map(int,input().split()))

a,b = Mi()

print(a*b)

Submission status: Accepted

Solution code:

n,m=list(map(int,input().split()))
print(n*m)

Submission status: Accepted

Solution code:
a,b = (input().split())
print(int(a)*int(b))

Submission status: Accepted

Solution code:
a, b = map(float, input().split())
a = int(a)
b_int = int(b*100)

ans = a*b_int/100
ans = int(ans)
print(ans)

Submission status: Accepted

Solution code:
num = list(map(int, input().split()))

print(num[0]*num[1])

Submission status: Accepted

Solution code:
a, b=map(int,input().split())
print(a*b)

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
print(n*m)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
print(x * y)

Submission status: Accepted

Solution code:
A,B =  map(int,input().split())
print(A*B)

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
print(A*B)

Submission status: Accepted

Solution code:
A,B = list(map(int,input().split(" ")))
print(A*B)

Submission status: Accepted

Solution code:
#create date: 2020-06-30 09:30

import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

def main():
    a, b = na()
    print(a*b)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b = [int(a) for a in input().split()]
print(a*b)

Submission status: Accepted

Solution code:
# -*- codinf: utf-8 -*-
A, B = map(int, input().split())
print(A * B)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print( a * b)

Submission status: Accepted

Solution code:
from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
from collections import Counter,defaultdict

a,b=MAP()
print(a*b)

Submission status: Accepted

Solution code:
a , b = list(map(int, input().split()))
print(a*b)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print(a[0]*a[1])

Submission status: Accepted

Solution code:
a,b=map(int,  input().split())
print(a*b)

Submission status: Accepted

Solution code:
a,b = list(map(int,input().split()))
print(a*b)

Submission status: Accepted

Solution code:
list1=(input()).split()
C=(int(list1[0]))*(int(list1[1]))
print(C)

Submission status: Accepted

Solution code:
import math  # noqa: F401
from typing import Dict, List, Optional, Tuple, Union  # noqa: F401


def main(A: int, B: int):
    print(A * B)


if __name__ == "__main__":
    A, B = map(int, input().split())
    main(A, B)

Submission status: Accepted

Solution code:
#169A
#Multiplication

A,B = map(int,input().split())

print(A*B)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if 1<=a<=100:
    if 1<=b<=100:
     print(a*b)

Submission status: Accepted

Solution code:
A, B = list(map(float,input().split()))

result = int(A * B)

print(result)

Submission status: Accepted

Solution code:
from sys import stdin
A, B = list(map(float,input().split()))

result = int(A * B)

print(result)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(int(a * b ))

Submission status: Accepted

Solution code:
from sys import stdin
data = stdin.readline().rstrip()

a = int(data.split()[0])
b = int(data.split()[1])

print(a * b)

Submission status: Accepted

Solution code:
x, y = (int(a) for a in input().split())
print(x*y)

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    print(a*b)
    
if __name__ =="__main__":
    main()

Submission status: Accepted

Solution code:
a,b = list(map(int, input().strip().split()))
print(a*b)

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
print(n*m)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

ans = a * b
print(ans)

Submission status: Accepted

Solution code:
X = input()
X = X.split(' ')
print(int(X[0]) * int(X[1]))

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
print(A[0]*A[1])

Submission status: Accepted

Solution code:
print(eval(input().replace(*' *')))

Submission status: Accepted

Solution code:
import sys
a, b = map(int, sys.stdin.readline().split())
print(a * b)

Submission status: Accepted

Solution code:
num1, num2 = map(int, input().split())
print(num1*num2)

Submission status: Accepted

Solution code:
num1, num2 = map(int, input().split())

print(num1 * num2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a, b = map(int, input().split())

print(a * b)

Submission status: Accepted

Solution code:
n,m = map(int,input().split())

print(n*m)

Submission status: Accepted

Solution code:
a,b= input().split()
print(int(a)*int(b))

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    print(a * b)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

#input = sys.stdin.readline

def main():

    A,B = map(int,input().split())

    print(A*B)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print(a[0] * a[1])

Submission status: Accepted

Solution code:
N, M = map(int,input().split())
print(N*M)

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())

print("{}".format(X*Y))

Submission status: Accepted

Solution code:
x,y=map(int, input().split())
print(x*y)

Submission status: Accepted

Solution code:
#Multiplication 1
A, B = list(map(int, input().split()))

print(A*B)

Submission status: Accepted

Solution code:
INPUT = list(map(int, input().split()))
print(INPUT[0]*INPUT[1])

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print(a[0] * a[1])

Submission status: Accepted

Solution code:
arr = list(map(int,input().split()))
print(int(arr[0])*int(arr[1]))

Submission status: Accepted

Solution code:
#inport
import sys
import numpy as np
#import itertools as itlt
#from collections import deque

#input 
A,B = [int(x) for x in sys.stdin.readline().split()]
#print(A*B*100)
#num = int(np.floor(A*(B*100)/100))

print(A*B)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np
# from numpy import cumsum  # accumulate

def solve():
    a, b = MI()
    print(a * b)

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
A,B = input().split()
A = int(A)
B = int(B)
print(A * B)

Submission status: Accepted

Solution code:
a,b = input().split()
a = int(a)
b = int(b)
print(a * b)

Submission status: Accepted

Solution code:
#input()
ans=1
for i in map(int,input().split()):ans*=i
print(int(ans))

Submission status: Accepted

Solution code:
A, B, = map(int, input().split())
print(A * B)

Submission status: Accepted

Solution code:
A,B = input().split()

A = int(A)

B = int(B)

print (A * B)

Submission status: Accepted

Solution code:
num = list(map(int, input().split()))
ans = num[0]*num[1]
print(ans)

Submission status: Accepted

Solution code:
ab=input().split()
a=int(ab[0])
b=int(ab[1])

print(a*b)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin


def ni(): return int(ns())


def na(): return list(map(int, stdin.readline().split()))


def naa(N): return [na() for _ in range(N)]


def ns(): return stdin.readline().rstrip()  # ignore trailing spaces


A, B = na()
print(A * B)

Submission status: Accepted

Solution code:
a, b= map(int, input().split())
print(a*b)

Submission status: Accepted

Solution code:
a_b = input().split()
a = int(a_b[0])
b = int(a_b[1])

print(a * b)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

answer = A * B 

print(answer)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

answer= A*B
print(answer)

Submission status: Accepted

Solution code:
A,B = map(int, input().split())
print(A*B)

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
print(n*k)

Submission status: Accepted

Solution code:
A, B = [int(_) for _ in input().split()]
print(A * B)

Submission status: Accepted

Solution code:
a,b = map(int,input(). split ())
print(a*b)

Submission status: Accepted

Solution code:
x, y=map(int, input().split())
print(x*y)

Submission status: Accepted

Solution code:
a, b = map(int , input().split())
print(a*b)

Submission status: Accepted

Solution code:
N, W = map(int, input().split())
print(N*W)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
print(A*B)

Submission status: Accepted

Solution code:
a, b = input().split()
print(int(a) * int(b))

Submission status: Accepted

Solution code:
x,y = input().split()

print(int(x) * int(y))

Submission status: Accepted

Solution code:
a, b =map(int, input().split())
c = a * b
print(c)

Submission status: Accepted

Solution code:
a,l=map(int,input().split())
print(a*l)

Submission status: Accepted

Solution code:
import sys


def log(s):
    # print("| " + str(s), file=sys.stderr)
    pass


def output(x):
    print(x, flush=True)


def input_ints():
    return list(map(int, input().split()))


def main():
    f = input_ints()
    print(f[0] * f[1])


main()

Submission status: Accepted

Solution code:
a, b =map(int, input().split())
c = a*b
print(c)

Submission status: Accepted

Solution code:
a,b=input().split()
print(int(a)*int(b))

Submission status: Accepted

Solution code:
# import numpy as np
import sys
from collections import defaultdict
import math
import itertools
import bisect
from copy import deepcopy
from collections import deque
read = sys.stdin.buffer.read
readline = sys.stdin.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10000)

a , b = map(int,input().split())
print(a * b )

Submission status: Accepted

Solution code:
import math
#入力A B
A, B = input().split()
A = int(A)
B = float(B)
#出力N
N =A*B
ans = math.floor(N)

print(ans)

Submission status: Accepted

Solution code:
import operator as op
print(op.mul(*map(int,input().split())))

Submission status: Accepted

Solution code:
#入力される値A B
A, B = map(int, input().split())

#出力される値
print(A*B)

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
print(a*b)

Submission status: Accepted

Solution code:
a,b=map(float,input().split())
a=int(a)
b=int(b*100)

print(int(a*b//100))

Submission status: Accepted

Solution code:
a , b = map(int, input().split())

print(a * b)

Submission status: Accepted

Solution code:

def main():
    a, b = map(int, input().split())

    print(a*b)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
arr = input().split()

print(int(arr[0]) * int(arr[1]))

Submission status: Accepted

Solution code:
n , m= map(int, input().split())

print(n * m)

Submission status: Accepted

Solution code:
input  = list(map(int,input().split()))
print(input[0] * input[1])

Submission status: Accepted

Solution code:
a,b = input().split(" ")
print(int(a) * int(b))

Submission status: Accepted

Solution code:
nums = [i for i in map(int, input().split())]

print(nums[0]*nums[1])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

ans = a*b

print(ans)

Submission status: Accepted

Solution code:
A,B=(map(int,input().split()))
print(A*B)

Submission status: Accepted

Solution code:
# 169 A

a, b = map(int, input().split())
print(a * b)

Submission status: Accepted

Solution code:
a, b=map(int, input().split())
print(a*b)

Submission status: Accepted

Solution code:
A,B=[int(i) for i in input().split()]
print(A*B)

Submission status: Accepted

Solution code:
A, B = list(map(int, input().strip().split()))
print(A*B)

Submission status: Accepted

Solution code:
A,B =map(int, input().split())
print(A*B)

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
print(x*y)

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
print(x*y)

Submission status: Accepted

Solution code:
S=input().split()
print(int(S[0])*int(S[1]))

Submission status: Accepted

Solution code:
import math

input_line = input().split()

A = int(input_line[0])
B = float(input_line[1])

result = (A * (B * 100)) /100

print(math.floor(result))

Submission status: Accepted

Solution code:
a,b = list(map(int, input().split()))
print(a*b)

Submission status: Accepted

Solution code:
A,B = list(map(int, input().split()))

print(A * B)

Submission status: Accepted

Solution code:
A, B = map(float, input().split())
 
print(int(A*B))

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
print(a * b)

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split()))
print(A*B)

Submission status: Accepted

Solution code:

a,b = map(int,input().split())

#print(a+b)
print(a*b)

Submission status: Accepted

Solution code:
import math
from collections import deque
from collections import defaultdict
import itertools as it

#自作関数群
def readInt():
  return int(input())
def readInts():
  return list(map(int, input().split()))
def readChar():
  return input()
def readChars():
  return input().split()
def factorization(n):
  res = []
  if n%2==0:
    res.append(2)
  for i in range(3,math.floor(n//2)+1,2):
    if n%i==0:
      c = 0
      for j in res:
        if i%j==0:
          c=1
      if c==0:
        res.append(i)
  if len(res)==0:
    res = [n]
  return res
def fact2(n):
  p = factorization(n)
  res = []
  for i in p:
    c=0
    z=n
    while 1:
      if z%i==0:
        c+=1
        z/=i
      else:
        break
    res.append([i,c])
  return res
def fact(n):#階乗
  ans = 1
  m=n
  for _i in range(n-1):
    ans*=m
    m-=1
  return ans
def comb(n,r):#コンビネーション
  if n<r:
    return 0
  l = min(r,n-r)
  m=n
  u=1
  for _i in range(l):
    u*=m
    m-=1
  return u//fact(l)
def combmod(n,r,mod):
  return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
  r=copyQueue(q)
  ans=[0]*r.qsize()
  for i in range(r.qsize()-1,-1,-1):
    ans[i] = r.get()
  print(ans)
class UnionFind():
  def __init__(self, n):
    self.n = n
    self.parents = [-1]*n

  def find(self, x): # root
    if self.parents[x]<0:
      return x
    else:
      self.parents[x] = self.find(self.parents[x])
      return self.parents[x]

  def union(self,x,y):
    x = self.find(x)
    y = self.find(y)

    if x==y:
      return

    if self.parents[x]>self.parents[y]:
      x,y = y,x

    self.parents[x]+=self.parents[y]
    self.parents[y]=x

  def size(self,x):
    return -1*self.parents[self.find(x)]

  def same(self,x,y):
    return self.find(x)==self.find(y)

  def members(self,x): # much time
    root = self.find(x)
    return [i for i in range(self.n) if self.find(i)==root]

  def roots(self):
    return [i for i,x in enumerate(self.parents) if x<0]

  def group_count(self):
    return len(self.roots())

  def all_group_members(self):
    return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
  x = 1
  zero = "0"*n
  ans = []
  ans.append([0]*n)
  for i in range(2**n-1):
    ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
    x+=1
  return ans;
def arrsSum(a1,a2):
  for i in range(len(a1)):
    a1[i]+=a2[i]
  return a1
def maxValue(a,b,v):
  v2 = v
  for i in range(v2,-1,-1):
    for j in range(v2//a+1): #j:aの個数
      k = i-a*j
      if k%b==0:
        return i
  return -1
def copyQueue(q):
  nq = queue.Queue()
  n = q.qsize()
  for i in range(n):
    x = q.get()
    q.put(x)
    nq.put(x)
  return nq
def get_sieve_of_eratosthenes(n):
  data = [2]
  #data = [0,0,0]
  for i in range(3,n+1,2):
    data.append(i)
    data.append(0)
  for i in range(len(data)):
    interval = data[i]
    if interval!=0:
      for j in range(i+interval,n-1,interval):
        data[j] = 0
  ans = [x for x in data if x!=0]
  #ans = data[:]
  return ans


a,b = readInts()

#print(a+b)
print(a*b)

Submission status: Accepted

Solution code:
s = [int(x) for x in input().split()]

print(s[0] * s[1])

Submission status: Accepted

Solution code:
A,B = input().split()
print(int(A)*int(B))

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline


#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()

def main():
	a,b=MI()
	print(a*b)


if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
print(i[0]*i[1])

Submission status: Accepted

Solution code:

a,b=map(int,input().split(' '))
print(a*b)

Submission status: Accepted

Solution code:
a,b = [int(num) for num in input().split()]
print(a*b)

Submission status: Accepted

Solution code:
import sys
 
#N=int(input())
#print(N)
A=input().split()
A_int = [int(s) for s in A]
#print(A_int)
print(A_int[0]*A_int[1])

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def main():
    A, B = map(int, input().split())
    print(A * B)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a=input()

a=a.split()

x=int(a[0])
y=int(a[1])

c=x*y

print(c)

Submission status: Accepted

Solution code:
a,b = [int(i) for i in input().split()]
print(a*b)

Submission status: Accepted

Solution code:
# A - Multiplication 1
a, b = map(int, input().split())

print(a * b)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))
X, Y = LI()
print(X * Y)

Submission status: Accepted

Solution code:
M=list(map(int,input().split()))

print(M[0]*M[1])

Submission status: Accepted

Solution code:
A, B = input().split()
ans = int(A) * int(B)
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))
A, B = LI()

print(A * B)

Submission status: Accepted

Solution code:
a, b = map(int ,input().split())
print(a * b)

Submission status: Accepted

Solution code:
a, b =map(int,input().split())
print(a*b)

Submission status: Accepted

Solution code:
X, Y = map(int,input().split())

multiple = X * Y

print(multiple)

Submission status: Accepted

Solution code:
a, b = map(int, input().split(" "))
print(a*b)

Submission status: Accepted

Solution code:
a, b = map(int ,input().split())
print(a * b)

Submission status: Accepted

Solution code:
def main():
    a, b = [int(x) for x in input().split()]
    print(a * b)

main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def main():
    a,b = map(int,input().split())
    print(a*b)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=input()

a=a.split()

A=int(a[0])
B=int(a[1])
C=A*B

print(C)

Submission status: Accepted

Solution code:
a,b = list(map(int, input().split()))

print(a*b)

Submission status: Accepted

Solution code:
a, b=map(int, input().split())
print(a*b)

Submission status: Accepted

Solution code:
n=input().split(" ")
print(int(n[0])*int(n[1]))

Submission status: Accepted

Solution code:
def main():

    A, B = map(int ,input().split())
    return A * B



if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

a, b = map(int, input().split())
print(a*b)

Submission status: Accepted

Solution code:
a,b=map(int, input().split())

print(a*b)