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,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in range(base**n):s=[tb//(base**bt)%base for bt in range(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)
 
YN=['YES','NO'];Yn=['Yes','No']
mo=10**9+7
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**7)
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
input=lambda: sys.stdin.readline().rstrip()


class Tree:
    def __init__(self,inp_size=None,ls=None,init=True,index=0):
        self.LCA_init_stat=False
        self.ETtable=[]
        if init:
            if ls==None:
                self.stdin(inp_size,index=index)
            else:
                self.size=len(ls)+1
                self.edges,_=GI(self.size,self.size-1,ls,index=index)
        return
 
    def stdin(self,inp_size=None,index=1):
        if inp_size==None:
            self.size=int(input())
        else:
            self.size=inp_size
        self.edges,_=GI(self.size,self.size-1,index=index)
        return
    
    def listin(self,ls,index=0):
        self.size=len(ls)+1
        self.edges,_=GI(self.size,self.size-1,ls,index=index)
        return
 
    def __str__(self):
        return  str(self.edges)
 
    def dfs(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
        q=deque()
        q.append(x)
        v=[-1]*self.size
        v[x]=root_v
        while q:
            c=q.pop()
            for nb,d in self.edges[c]:
                if v[nb]==-1:
                    q.append(nb)
                    v[nb]=func(v[c],nb,d)
        return v
 
    def EulerTour(self,x):
        q=deque()
        q.append(x)
        self.depth=[None]*self.size
        self.depth[x]=0
        self.ETtable=[]
        self.ETdepth=[]
        self.ETin=[-1]*self.size
        self.ETout=[-1]*self.size
        cnt=0
        while q:
            c=q.pop()
            if c<0:
                ce=~c
            else:
                ce=c
                for nb,d in self.edges[ce]:
                    if self.depth[nb]==None:
                        q.append(~ce)
                        q.append(nb)
                        self.depth[nb]=self.depth[ce]+1
            self.ETtable.append(ce)
            self.ETdepth.append(self.depth[ce])
            if self.ETin[ce]==-1:
                self.ETin[ce]=cnt
            else:
                self.ETout[ce]=cnt
            cnt+=1
        return
    
    def LCA_init(self,root):
        self.EulerTour(root)
        self.st=SparseTable(self.ETdepth,init_func=min,init_idl=inf)
        #self.st=SegTree(self.size*2-1,self.ETdepth,function=min,ide=inf)
        self.LCA_init_stat=True
        return
    
    def LCA(self,root,x,y):
        if self.LCA_init_stat==False:
            self.LCA_init(root)
        xin,xout=self.ETin[x],self.ETout[x]
        yin,yout=self.ETin[y],self.ETout[y]
        a=min(xin,yin)
        b=max(xout,yout,xin,yin)
        id_of_min_dep_in_et=self.st.query_id(a,b+1)
        return self.ETtable[id_of_min_dep_in_et]

## Tested by EduFor 88 D
## https://codeforces.com/contest/1359/problem/D

class SparseTable: # O(N log N) for init, O(1) for query(l,r)
    def __init__(self,ls,init_func=min,init_idl=float('inf')):
        self.func=init_func
        self.idl=init_idl
        self.size=len(ls)
        self.N0=self.size.bit_length()
        self.table=[ls[:]]
        self.index=[list(range(self.size))]
        self.lg=[0]*(self.size+1)
        
        for i in range(2,self.size+1):
            self.lg[i]=self.lg[i>>1]+1
 
        for i in range(self.N0):
            tmp=[self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) for j in range(self.size)]
            tmp_id=[self.index[i][j] if self.table[i][j]==self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) else self.index[i][min(j+(1<<i),self.size-1)] for j in range(self.size)]
            self.table+=[tmp]
            self.index+=[tmp_id]
    
    # return func of [l,r)
    def query(self,l,r):
        if r>self.size:r=self.size
        #N=(r-l).bit_length()-1
        N=self.lg[r-l]
        return self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))])
    
    # return index of which val[i] = func of v among [l,r)
    def query_id(self,l,r):
        if r>self.size:r=self.size
        #N=(r-l).bit_length()-1
        N=self.lg[r-l]
        a,b=self.index[N][l],self.index[N][max(0,r-(1<<N))]
        if self.table[0][a]==self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))]):
            b=a
        return b
    
    # return boundary index of r such that func({table[i]} =< x , i in [pos,r]
    def right_bound(self,pos,x):
        k=(self.size-pos).bit_length()
        for j in range(k)[::-1]:
            nx=pos+(1<<j)
            if nx<n and self.query(pos,nx+1)<=x:
                pos+=(1<<j)
        return pos
    
    # return boundary index of l such that func({table[i]} =< x , i in [l,pos]
    def left_bound(self,pos,x):
        k=pos.bit_length()
        for j in range(k)[::-1]:
            nx=pos-(1<<j)
            if 0<=nx and self.query(nx,pos+1)<=x:
                pos-=(1<<j)
        return pos

    def __str__(self):
        return str(self.table[0])
 
    def print(self):
        for i in self.table:
            print(*i)
 

## return prime factors of N as dictionary {prime p:power of p}
## within 2 sec for N = 2*10**20+7
def primeFactor(N):
    i,n=2,N
    ret={}
    d,sq=2,99
    while i<=sq:
        k=0
        while n%i==0:
            n,k,ret[i]=n//i,k+1,k+1
        if k>0 or i==97:
            sq=int(n**(1/2)+0.5)
        if i<4:
            i=i*2-1
        else:
            i,d=i+d,d^6
    if n>1:
        ret[n]=1
    return ret


## return the list of prime numbers in [2,N], using eratosthenes sieve
## within 2sec for N = 1.2*10**7
def PrimeNumSet(N):
    Max = int(N**0.5)
    seachList = [i for i in range(2,N+1)]
    primeNum = []
    while seachList:
        if seachList[0] <= Max:
            break
        primeNum.append(seachList[0])
        tmp = seachList[0]
        seachList = [i for i in seachList if i % tmp != 0]
    primeNum.extend(seachList)
    return primeNum

## retrun LCM of numbers in list b
## within 2sec for no of B = 10*5  and  Bi < 10**6
def LCM(b,mo=10**9+7):
    prs=PrimeNumSet(max(b))
    M=dict(zip(prs,[0]*len(prs)))
    for i in b:
        dc=primeFactor(i)
        for j,k in dc.items():
            M[j]=max(M[j],k)
    
    r=1
    for j,k in M.items():
        if k!=0:
            r*=pow(j,k,mo)
            r%=mo
    return r

 
show_flg=False
show_flg=True
ans=0


a,b=LI()
ans=a*b
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

A,B=input().split()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
    if(a%b==0):return(b)
    return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
getcontext().prec = 400
#N=int(input())
A,B=list(map(int,input().split()))
print(A*B)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
import numpy as np

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


print(int(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(int, input().split())
1 <= A <= 100
1 <= B <= 100
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:
in_d = input()

a, b = in_d.split()
a = int(a)
b = int(b)

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:
def main():
    a, b = [int(v) for v in input().split(' ')]
    print(int(a * b))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
nums = [int(e) for e in input().split()]
ret = 1
for i in nums:
    ret = ret * i
print(ret)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

Solution code:
a, b = map(int, open(0).read().split())
print(a*b)

Submission status: Accepted

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

print(a*b)

Submission status: Accepted

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

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

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=input().split(' ')
a[0]=int(a[0])
a[1]=int(a[1])
print(a[0]*a[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Submission status: Accepted

Solution code:
import sys

if __name__ == '__main__':
    str = input().strip()

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

    print(a * b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
N,K=input().split()
N=eval(N)
K=eval(K)
print(N*K)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

abc169_a()

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:
#!/usr/bin/env python
#pyrival orz
import os
import sys
from io import BytesIO, IOBase

"""
    for _ in range(int(input())):
    n,m=map(int,input().split())
    n=int(input())
    a = [int(x) for x in input().split()]
"""

def main():
    n,m=map(int,input().split())
    print(n*m)

# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

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


b=int(a[0])
c=int(a[1])
print(b*c)

Submission status: Accepted

Solution code:
A ,B = (int(x) for x in input().split())

if 1 <= A <= 100 and 1 <= B <=100:
    print(A * B)

Submission status: Accepted

Solution code:
from sys import stdin

A, B = [int(x) for x in stdin.readline().rstrip().split()]

print(A*B)

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    A, B = read_ints()
    return A*B


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    N, M = [int(i) for i in input().split()]
    print(N*M)


resolve()

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())

ans = A * B

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_line = input()
numbers = input_line.split()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#atcoder template
def main():
    import sys
    imput = sys.stdin.readline
    #文字列入力の時は上記はerrorとなる。
    #ここにコード
    #input
    A, B = map(int, input().split())

    #output
    print(A*B)

    #N = 1のときなどcorner caseを確認！
if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(A*B)

Submission status: Accepted

Solution code:
p0, p1 = list(map(lambda x: int(x), input().split(' ')))
print(p0 * p1)

Submission status: Accepted

Solution code:
n = input().split(' ')
for i in range(0, len(n)):
    n[i] = int(n[i])
print(n[0]*n[1])

Submission status: Accepted

Solution code:
from sys import stdin
A, B = [int(x) for x in stdin.readline().rstrip().split()]
print(A * B)

Submission status: Accepted

Solution code:
def main():

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

        return A*B


if __name__=="__main__":
        X = main()
        print(X)

Submission status: Accepted

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

    return A * B

print(main())

Submission status: Accepted

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

C =int(A * B)

print(C)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IS(): return str(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

A = LI()

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

Submission status: Accepted

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

Submission status: Accepted

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

answer = A * B
print(answer)

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, B = map(int,input().split())

x = A*B

print(x)

Submission status: Accepted

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

def Main(A, B):
    return A*B

print(Main(A, B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import math

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

print(a*b)

Submission status: Accepted

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

c=a*b

print("%s"%c)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)


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


def main():

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M = input().split(' ')
N, M = int(N), int(M)

print(N*M)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(a*b)

Submission status: Accepted

Solution code:

line = input().split()
A = int(line[0])
B = int(line[1])

print(A * B)

Submission status: Accepted

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

Submission status: Accepted

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

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().split()))
print(A * B)

Submission status: Accepted

Solution code:

tmp=input().split(" ")
A=int(tmp[0])
B=int(tmp[1])

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:
# 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:
N,K = map(int,input().split())
print(N*K)

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) = input().split()
A = int(A)
B = int(B)
print(A*B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力

if __name__ == "__main__":
    
    INPUT = list(map(int, input().split()))

    h1 = INPUT[0]
    m1 = INPUT[1]

    print(h1 * m1)

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:
def A():
    a,b = map(int,input().split())
    print(a*b)
A()

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())
my_ans = A*B

print(A*B)

Submission status: Accepted

Solution code:
A,B=list(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=map(int,input().split(' '))
print(a*b)

Submission status: Accepted

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

Submission status: Accepted

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

print (A*B)

Submission status: Accepted

Solution code:
import math;print(math.prod(map(int,input().split())))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# n,m = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(sys.stdin.readline() for _ in range(n)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# n = int(sys.stdin.readline())
# INF = float("inf")
# sys.setrecursionlimit(10000)
import sys,collections
sys.setrecursionlimit(100000)
a,b = map(int,sys.stdin.readline().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:
a, b = (int(x) for x in input().split())
seki = a * b
print(seki)

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=list(map(int, input().split()))

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

print(A*B)

Submission status: Accepted

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

ans = int(ab[0]) * int(ab[1])
print(ans)

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())
print(a*b)

Submission status: Accepted

Solution code:
A, B = tuple(map(int, input().split()))
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=input().split();
A=int(A);
B=int(B);
print(A*B);

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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:
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read

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

Submission status: Accepted

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

A, B = map(int, readline().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=input().split()
a,b=int(a),int(b)
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:
# import math
# from collections import Counter

# N = int(input()) # 1行, 単数
# arg = list(map(int, input().split())) # 1行, 配列
# D = Counter(arg) # 出現数カウント

# print('Yes')
# print('No')
# print()

arg = list(map(int, input().split())) # 1行, 配列
A = arg[0]
B = arg[1]

print(A*B)

Submission status: Accepted

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

A = a[0]
B = a[1]

print(A*B)

Submission status: Accepted

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

print(int(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:
number = input().split(" ")
a = int(number[0])
b = int(number[1])
result = 0
con1 = a >= 1 and a <= 100
con2 = b >= 1 and b <= 100
if con1 == True and con2 == True:
    result = a * b
    print(result)
else:
    print()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
A, B = [int(x) for x in stdin.readline().rstrip().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:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
list = input().rstrip().split(' ')
a = int(list[0])
b = int(list[1])
print(a*b)

Submission status: Accepted

Solution code:
import sys

num_list = input().split()
ans = int(num_list[0]) * int(num_list[1])
print(ans)

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:
from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  ##list(chain.from_iterable(l)) ##flatten
from heapq import heappush, heappop
import bisect

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

ans = A * B

print(ans)

Submission status: Accepted

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

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().split()))

print(A*B)

Submission status: Accepted

Solution code:
import sys
 
sys.setrecursionlimit(10 ** 8)
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().split()
print(int(a[0])*int(a[1]))

Submission status: Accepted

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

X = A * B
print(X)

Submission status: Accepted

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