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:
# coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from itertools import accumulate
from copy import deepcopy
import random
import time
import os
import sys
import datetime
from functools import lru_cache
from functools import reduce
readline=sys.stdin.readline
sys.setrecursionlimit(2000000)
alphabet="abcdefghijklmnopqrstuvwxyz"
numbers="0123456789"
mod=int(10**9+7)
inf=int(10**19)
class Edge():
    def __init__(self,x,y,val=1):
        self.x=x
        self.y=y
        self.val=val
class unionfind():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(n)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):
            self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def yn(b):
    if b:print("yes")
    else:print("no")
def Yn(b):
    if b:print("Yes")
    else:print("No")
def YN(b):
    if b:print("YES")
    else:print("NO")
def ispow(a,b):
    now=b
    while now<a:
        now*=b
    return now==a
def getbin(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def getfacs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def nextcomb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def getprimes(n):
    if n==0:return []
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    ret=[]
    for a in range(n+1):
        if(A[a]):ret.append(a)
    return ret
def isprime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(bbool,ret1,ret2):
    if bbool:return ret1
    else:return  ret2
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    return c.join(A)
def factorize(n):
    b = 2
    ret=defaultdict(int)
    while b * b <= n:
        while n % b == 0:
            n //= b
            ret[b]+=1
        b+=1
    if n > 1:ret[n]+=1
    return ret
def pm(x):
    return x//abs(x)
def inputintlist(): 
    return list(map(int,input().split()))
def inputfloatlist(): 
    return list(map(float,input().split()))
def tozero(A):
    ret=[None]*len(A)
    for a in range(len(A)):
        ret[a]=A[a]-1
    return ret
def istanchouzouka(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>=a:
            f=False
        prev=a
    return f
def istanchouhigensyou(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>a:
            f=False
        prev=a
    return f
def getallsum(A):
    s=sum(A)
    dp=defaultdict(int)
    dp[0]=1
    for a in range(0,len(A)):
        for b in range(s,-1,-1):
            if b-A[a]>=0:
                dp[b]+=dp[b-A[a]]
    return dp
def yuukoutomukou(edges):
    ret=deepcopy(edges)
    for edge in edges:
        if not edge.x==edge.y:
            ret.append(Edge(edge.y,edge.x,edge.val))
    return ret
def dijkstra(edges,V,start):
    mincost=[inf]*V
    G=[[] for a in range(V)]
    for edge in edges:
        G[edge.x].append([edge.val,edge.y])
    Q=PriorityQueue()
    Q.put([0,start])#[cost,x]
    while not Q.empty():
        nowcost,nowx=Q.get()
        if mincost[nowx]==inf:
            mincost[nowx]=nowcost
            for cost,y in G[nowx]:
                newcost=nowcost+cost
                Q.put([newcost,y])
    return mincost
def warshallfloyd(edges,V):
    mincost=[[inf for b in range(V)] for a in range(V)]
    for a in range(V):mincost[a][a]=0
    for edge in edges:
        mincost[edge.x][edge.y]=min(mincost[edge.x][edge.y],edge.val)#x→yが複数ある場合のためにmin()する
    for k in range(V):
        for s in range(V):
            for t in range(V):
                if mincost[s][k]==inf or mincost[k][t]==inf:continue
                mincost[s][t]=min(mincost[s][t],mincost[s][k]+mincost[k][t])
    return mincost
def bellemanford(edges,V,start):
    mincost=[inf]*V
    mincost[start]=0
    for _ in range(V):
        for edge in edges:
            if mincost[edge.x]==inf:continue
            mincost[edge.y]=min(mincost[edge.y],mincost[edge.x]+edge.val)
    return mincost
def getmd(x1,y1,x2,y2):
    return abs(x1-x2)+abs(y1-y2)
def geted(x1,y1,x2,y2):
    return math.sqrt((x1-x2)**2+(y1-y2)**2)
class fordfulkerson():
    def __init__(self,edges,V,s,t):
        self.V=V
        self.used=[False]*V
        self.G=[[] for a in range(V)]
        self.s=s
        self.t=t
        for edge in edges:
            self.G[edge.x].append({"x":edge.x,"y":edge.y,"cap":edge.val,"rev":len(self.G[edge.y])})
            self.G[edge.y].append({"x":edge.y,"y":edge.x,"cap":0,"rev":len(self.G[edge.x])-1})
    def dfs(self,v,t,f=inf):
        if v==t:return f
        self.used[v]=True
        for a in range(len(self.G[v])):
            x=self.G[v][a]["x"]
            y=self.G[v][a]["y"]
            cap=self.G[v][a]["cap"]
            rev=self.G[y][self.G[x][a]["rev"]]
            if self.used[y] or cap==0:continue
            f2=self.dfs(y,t,min(f,cap))
            if f2>0:
                self.G[v][a]["cap"]-=f2
                rev["cap"]+=f2
                return f2
        return 0
    def maxflow(self):
        flow=0
        while True:
            self.used=[False]*V
            zouka=self.dfs(self.s,self.t)
            if zouka==0:break
            flow+=zouka
        return flow
def heron(a,b,c):
    s=(a+b+c)/2
    S=s(s-a)(s-b)(a-c)
    S=math.sqrt(S)
    return S
def getAreaOfTriangle(x1,y1,x2,y2,x3,y3):
    a=geted(x1,y1,x2,y2)
    b=geted(x2,y2,x3,y3)
    c=geted(x3,y3,x1,y1)
    return heron(a,b,c)






######################################################################################################


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

Submission status: Accepted

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

Submission status: Accepted

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

c = a * b
print(c)

Submission status: Accepted

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


print(A*B//100)

Submission status: Accepted

Solution code:
# Problem a - Multiplication 1

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

# initialization
ans = A * B

# output
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list = input().split(" ")

a = int(list[0])
b = int(list[1])

print(a * b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from numba import jit
import numpy as np
n=10**7
@jit("i8[:](i8)")
def Make(n):
    return np.array([i for i in range(n)])
@jit ("i8(i8[:])")
def f(a):
    mod=10**9+7
    ans=0
    for i in a:
        ans+=i
        ans%=mod
    return ans
k=Make(n)
f(k)
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:
i=list(map(int, input().split()))
print(i[0]*i[1])

Submission status: Accepted

Solution code:
a, b = (int(x) for x in 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:
#!/usr/bin/env python3
m, n = map(int, input().split())
print(m * n)

Submission status: Accepted

Solution code:
from subprocess import run
from os import path

if not path.exists("./tmp215378912379"):
  with open("./tmp215378912379.cpp", mode='w') as f:
    f.write("""
  #include <bits/stdc++.h>
  template <class T>
  concept Integral = std::is_integral_v<T>;

  int main() {
    auto f = []<Integral T>(T a, T b) { return a * b; };
    int a, b;
    std::cin >> a >> b;
    std::cout << f(a, b) << std::endl;
  }
  """)

  run("g++ -o ./tmp215378912379 -std=gnu++2a -fconcepts ./tmp215378912379.cpp", shell=True)

run("./tmp215378912379")

Submission status: Accepted

Solution code:
from subprocess import run

with open("./tmp215378912379.cpp", mode='w') as f:
  f.write("""
#include <bits/stdc++.h>
template <class T>
concept Integral = std::is_integral_v<T>;

int main() {
  auto f = []<Integral T>(T a, T b) { return a * b; };
  int a, b;
  std::cin >> a >> b;
  std::cout << f(a, b) << std::endl;
}
""")

run("g++ -o ./tmp215378912379 -std=gnu++2a -fconcepts ./tmp215378912379.cpp && ./tmp215378912379", shell=True)

Submission status: Accepted

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

print(AB)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def resolve():
    a, b = input().strip().split(' ')
    a, b = [int(a), int(b)]
    ans = a * b
    print(ans)

resolve()

Submission status: Accepted

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

print(b * c)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
"""AtCoder Beginner Contest 169: A - Multiplication 1
https://atcoder.jp/contests/abc169/tasks/abc169_a
"""


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
# 複数個格納
# A,B = map(int, input().split())
#A = int(input())
# 行列化
# A = np.array(A)
# A=A.reshape(1,-1)
# A=A.T
#行列の比較
#C=((A%2 == vector0).all())
#行列の作成
#A=(np.arange(0,2000,500)).reshape(1,-1)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A1, A2 = map(int, input().split())

ans = A1 * A2
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
import bisect
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return x if y == 0 else gcd(y, x%y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def LS() : return input().split()
def RS(N) : return [input() for _ in range(N)]
def LRS(N) : return [input().split() for _ in range(N)]
def PL(L) : print(*L, sep="\n")
def YesNo(B) : print("Yes" if B else "No")
def YESNO(B) : print("YES" if B else "NO")

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    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:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = input()
num1 = int(nums.split()[0])
num2 = int(nums.split()[1])

print(num1 * num2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
~~ Author : Bhaskar
~~ Dated : 13~06~2020
"""

import sys
from bisect import *
from math import floor, sqrt, ceil, factorial as F, gcd, pi
from itertools import chain, combinations, permutations, accumulate
from collections import Counter, defaultdict, OrderedDict, deque

INT_MAX = sys.maxsize
INT_MIN = -(sys.maxsize) - 1
mod = 1000000007
ch = "abcdefghijklmnopqrstuvwxyz"
lcm = lambda a, b: (a * b) // gcd(a, b)
setbit = lambda x: bin(x)[2:].count("1")
INT = lambda type: type(sys.stdin.readline()) if type in [int, float] else type(sys.stdin.readline()).replace("\n", "")
ARRAY = lambda type: list(map(type, sys.stdin.readline().split()))
NUMS = lambda type: map(type, sys.stdin.readline().split())


def solve():

    a,b = NUMS(int)
    print(a*b)
    


if __name__ == "__main__":
    try:
        sys.stdin = open("input.txt", "r")
    except:
        pass
    solve()

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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())
#出力
print(A*B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = input().split()
A = int(A)
B = round(float(B)*100)
 
res = (A*B)//100
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8
num1, num2= list(map(int, input().split()))
print(num1*num2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import floor
import decimal
a,b = map(decimal.Decimal,input().split())
r = floor(a * b)
print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

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

print(A*B)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal
a, b = input().split()
a = int(a)
b = float(b)

print(int(Decimal(a*b)))

Submission status: Accepted

Solution code:
def main():
  l = input().split()
  A, B = int(l[0]), float(l[1])
  B100 = int(B*1000)
  ans = int((A*B100)/1000)
  print(ans)
  return

main()

Submission status: Accepted

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

Submission status: Accepted

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

main(a,b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    for line in stdin:
        factors = line.split()
        break

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

main()

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x0, x2 = list(map(int, input().split()))
print(x0*x2)

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))//1)

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,end='')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, y = [int(x) for x in 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, raw_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())
R    = A * B

print(R)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal

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

Submission status: Accepted

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

print(A * B)

Submission status: Accepted

Solution code:
from decimal import Decimal as de
 
a, b = input().split()
a = int(a)
b = de(float(b))
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 = input().split()
print(int(a)*int(b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a,b = map(int,sys.stdin.readline().split(" "))
print(a*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i_1,i_2 = map(int,input().split())

print(i_1 * i_2)

Submission status: Accepted

Solution code:
A = input().split(" ")

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

Submission status: Accepted

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

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

c = a * b
print(c)

Submission status: Accepted

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

print(A*B)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(a) * int(b))

Submission status: Accepted

Solution code:
str_num = input()
num_list = str_num.split()

answer = int(num_list[0]) * int(num_list[1])
print(answer)

Submission status: Accepted

Solution code:
#
import sys
import math
import numpy as np
import itertools

a, b = (int(i) for i in input().split())

print(a*b)

Submission status: Accepted

Solution code:
# coding: utf-8
import string

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

import sys


def main():
    line = sys.stdin.readline()
    t = line.rstrip().split(' ')
    a, b = map(lambda x: int(x), t)
    print(a*b)

    for line in sys.stdin:
        print(line)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(a*b)

Submission status: Accepted

Solution code:
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineerin College
    Date:07/06/2020

'''
from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]

        

def solve():
    
    a,b=mi()
    print(a*b)
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
if __name__ =="__main__":
    if path.exists('input.txt'):
        sys.stdin=open('input.txt', 'r')
        sys.stdout=open('output.txt','w')
    else:
        input=sys.stdin.readline
    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=list(map(int,input().split()))
print(A*B)

Submission status: Accepted

Solution code:
import sys

if sys.subversion[0] == "PyPy":
    import io, atexit

    sys.stdout = io.BytesIO()
    atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))

    sys.stdin = io.BytesIO(sys.stdin.read())
    input = lambda: sys.stdin.readline().rstrip()
RS = raw_input
RA = lambda x=int: map(x, RS().split())
RN = lambda x=int: x(RS())


def solve():
    print(a*b)
    return





a, b = RA()
solve()

Submission status: Accepted

Solution code:
a,b=(int(x) for x in 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=[int(x) for x in input().split()]
print(a*b)

Submission status: Accepted

Solution code:
ab = input( )

ab = ab.split()
print(int(ab[1])*int(ab[0]))

Submission status: Accepted

Solution code:
a,b=map(int,raw_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=[int(i) for i in input().split()]
print(a[0] * a[1])

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:
GI = lambda: int(input()); GIS = lambda: map(int, input().split()); LGIS = lambda: list(GIS())

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

main()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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


def main():
    import sys
    input = sys.stdin.readline

    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:
a,b=input().split(' ')
if int(a)<=100 and int(b)<=100:
    print(int(a)*int(b))
else:
    pass

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=input().strip().split(" ")
a,b=[int(a),int(b)]
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:
# -*- coding: utf-8 -*-

input_list = input().split(" ")
print(int(input_list[0]) * int(input_list[1]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input().split(' ')
print(int(data[0]) * int(data[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())
a = a * b
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal
a,b = input().split()
a=Decimal(a)
b=Decimal(b)
print(int(a*b))

Submission status: Accepted

Solution code:
# A - Multiplication 1

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

Submission status: Accepted

Solution code:
# Multiplication 1
# https://atcoder.jp/contests/abc169/tasks/abc169_a

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

Submission status: Accepted

Solution code:
def main():
    a,b = map(float,input().split())
    x = a*b
    y = x%1
    z = int(x-y)
    if x-y-z > z+1-(x-y):
        print(z+1)
        return
    else:
        print(z)
        return
main()

Submission status: Accepted

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

print(a*b)

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def multiply(values):
  out = 1
  for i in values:
    out *= int(i)
  print(out)

stdin = input().split()
multiply(stdin)

Submission status: Accepted

Solution code:
lst=[int (x) for x in input().split(' ')]
print(lst[0]*lst[1])

Submission status: Accepted

Solution code:
def multi(a,b):
    return a * b

if __name__ == "__main__":
    a,b = input().split(" ")
    a = int(a)
    b = int(b)
    print(multi(a,b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main(lines):
    # このコードは標準入力と標準出力を用いたサンプルコードです。
    # このコードは好きなように編集・削除してもらって構いません。
    # ---
    # This is a sample code to use stdin and stdout.
    # Edit and remove this code as you like.

    for i, v in enumerate(lines):
        print("line[{0}]: {1}".format(i, v))
        
if __name__ == '__main__':
    lines = []
    for l in sys.stdin:
        lines.append([int(s) for s in l.rstrip('\r\n').split()])
A=lines[0][0]
B=lines[0][1]
print(A*B)