Problem:


Score : 300 points

Problem Statement

Compute A \times B, truncate its fractional part, and print the result as an integer.

Constraints

0 \leq A \leq 10^{15}

0 \leq B < 10

A is an integer.

B is a number with two digits after the decimal point.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the answer as an integer.

Sample Input 1

198 1.10

Sample Output 1

217

We have 198 \times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.

Sample Input 2

1 0.01

Sample Output 2

0

Sample Input 3

1000000000000000 9.99

Sample Output 3

9990000000000000



Sample input:
198 1.10


Sample output:
217

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=input().split()
a=int(a)
c=b[:-3]+b[-2:]
c=int(c)

#show(b.find('.'),a,c)
ans=a*c//100

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal
q = input().split()
a,b = int(q[0]),Decimal(q[1])
print((a*(b*100))//100)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n=int(input())
a,b=map(str,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

a=int(a)
b=int(b[0]+b[2]+b[3])

ans=(a*b)//100

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from decimal import Decimal


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

    h1 = int(INPUT[0])
    m1 = int(Decimal(INPUT[1]) * 100)

    print( h1 * m1 // 100 )

Submission status: Accepted

Solution code:
import sys
from decimal import Decimal
input = sys.stdin.readline


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


def main():
    A, B = readstrs()
    A = Decimal(A)
    B = Decimal(B)
    print(int(Decimal(A * B)))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

b = b.replace(".","")

ans = (int(a) * int(b))//100

print(ans)

Submission status: Accepted

Solution code:
a=input().split()
 
p=int(a[0])
q=int(a[1].replace(".", ""))
 
print(p*q//100)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
a, b = input().split()
a = int(a)
c = int(b[0])
c = c*10 + int(b[2])
c = c*10 + int(b[3])

a *= c
a //= 100
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import *

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

Submission status: Accepted

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

print(int(a*b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = input().split()
a = int(a)
b_list = [int(b[0]), int(b[2]), int(b[3])]
ans = 0
for i in range(3):
  ans += a * b_list[i] * 10**(2-i)
ans = ans // 100
print(ans)

Submission status: Accepted

Solution code:
from decimal import Decimal as DD
a,b = map(str,input().split())
a = DD(a)
b = DD(b)
print(a*b//1)

Submission status: Accepted

Solution code:
import decimal
A, B = map(decimal.Decimal,input().split())

print(A*B//1)

Submission status: Accepted

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

ans = 0
r = 4
for i in range(4):
    if i != 1:
        ans += A * int(B[i]) * (10 ** (r))
        r -= 1

print(ans // 10000)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import math
 
a,b=input().split()
a=int(a)
b=float(b)
b=int(b*100+0.9999)
 
print(a*b//100)

Submission status: Accepted

Solution code:
line = input().split()
# line = '664706138336385 9.79'.split() にも対処せよ
a = int(line[0])
b = int(''.join([d for d in line[1] if d != '.']))
print(a * b // 100)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

a, b = input().split()
a = int(a)
b = round(float(b)*100)

n = a*b
n = n//100
print(n)

Submission status: Accepted

Solution code:
a=input().split()
 
fa=int(a[0])
fb=int(a[1].replace(".", ""))
 
print(fa*fb//100)

Submission status: Accepted

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

print((a*b)//100)

Submission status: Accepted

Solution code:
"""
~~ Author : Bhaskar
~~ Dated : 31~05~2020
"""

import sys
from bisect import *
from math import floor,sqrt,ceil,factorial as F,gcd,pi,trunc
from itertools import chain,combinations,permutations,accumulate
from collections import Counter,defaultdict,OrderedDict,deque
from array import array
from decimal import Decimal
INT_MAX = sys.maxsize
INT_MIN = -(sys.maxsize)-1
mod = 1000000007
lcm = lambda a,b : (a*b)//gcd(a,b)
setbit = lambda x : bin(x)[2:].count("1")

def solve():
    x = list(map(str,sys.stdin.readline().split()))
    a = Decimal(x[0])
    b = Decimal(x[1])
    print(floor(a*b))

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

Submission status: Accepted

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

Submission status: Accepted

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

fa=int(a[0])
fb=int(a[1].replace(".", ""))

print(fa*fb//100)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = input().split()
p = int(a)
q = int(b[0] + b[2] + b[3])

print(p * q // 100)

Submission status: Accepted

Solution code:
A, B = map(float, input().split(' '))
A = int(A)
B = round(B * (10 ** 2))
print(int((A * B)//10**2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal,getcontext
getcontext().prec = 100 # 標準は28
A,B=map(Decimal,input().split())
print(int(A*B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal
import math
 
a,b=map(float,input().split())
A = int(a)
B = str(b)
S = Decimal(A)*Decimal(B)
print(S//1)

Submission status: Accepted

Solution code:
from decimal import *
i = input().split()
a = int(i[0])
b = Decimal(i[1])
print(int(a * b))

Submission status: Accepted

Solution code:
# str型の小数(31.415 etc)が与えられて(31415,3)みたいなのを返す.
def get_int(f):
    return int(f.replace(".","")),len(f)-f.index(".")-1

a,b=input().split()
a=int(a)
x,y=get_int(b)
print(a*x//(10**y))

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from decimal import Decimal


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(math.floor(a*b))

Submission status: Accepted

Solution code:
a,b=input().split()
a=int(a)
b1=int(b[0])
b2=int(b[2:])
x=a*b1+(a*b2)//100
print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(str,input().split())
a = int(a)
b1,b2 = map(int,b.split("."))
ans = a* (b1 * 100 + b2)
print(ans//100)

Submission status: Accepted

Solution code:
from decimal import Decimal
import math

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

print(math.floor(a*b))

Submission status: Accepted

Solution code:
from decimal import Decimal as D

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

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

A, B = input().split()

A = int(A)
B = int(B.replace(".", ""))

print(A * B // 100)

Submission status: Accepted

Solution code:
from decimal import *

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

import math
# a_1, a_2 = math.modf(a)
# b_1, b_2 =math.modf(b)

# total = math.floor(a_1*b_1) + math.floor(a_1*b_2) + math.floor(a_2*b_1) + math.floor(a_2 * b_2)

b*=100

ans = a*b

ans = ans //100

print(ans)

Submission status: Accepted

Solution code:
a, b = input().split() #一旦文字列で受け取る

a = int(a)
b = int(b.replace(".",""))

ans = a*b // 100

print(ans)

Submission status: Accepted

Solution code:
a,b = map(str, input().split())
ia = int(a)
ib1,ib2 = map(int, b.split('.'))
print(ia*ib1 + ia*ib2//100)

Submission status: Accepted

Solution code:
import math
a,b = map(str, input().split())
ia = int(a)
ib1,ib2 = map(int, b.split('.'))
print(math.floor(ia*ib1 + ia*ib2//100))

Submission status: Accepted

Solution code:
import math
from decimal import Decimal, ROUND_DOWN
def main():
    a,b = list(input().split())
    a = Decimal(a)
    b = Decimal(b)
    ans = a * b
    print(Decimal(ans).quantize(Decimal(1), rounding=ROUND_DOWN))
 
if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor
from collections import deque, Counter, defaultdict
from fractions import gcd
input = lambda: sys.stdin.readline().rstrip()

def eprint(s):
    sys.stderr.write('DEBUG: {}'.format(s))
    return

def main():
    a, b = input().split()
    a = int(a)
    b1, b2 = b.split(".")
    b3 = int(b1+b2)

    print(a*b3//100)
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,B = input().split()
A = int(A)
B = int(B.replace(".",""))
print(A * B // 100)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a, b = input().split()
    a = int(a)
    b, c = map(int, b.split('.'))
    ans = a * (b * 100 + c)
    ans //= 100
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

arr = input().strip().split(' ')

A = int(arr[0])
f = arr[1].split('.')
B = int(f[0]) * 100 + int(f[1])
  
print (A * B // 100)

Submission status: Accepted

Solution code:
a,b = input().split()
a = int(a)
b = int(b[0] + b[2:])
print(a * b //100)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ma = lambda :map(int,input().split())
ni = lambda:int(input())
import collections
import math
import itertools
gcd = math.gcd
a,b = input().split()
a = int(a)
b100 = 100*int(b[0]) + 10*int(b[2]) +int(b[3])

print(a*b100//100)

Submission status: Accepted

Solution code:
# Code for C - Multiplication 3
# Use input() to fetch data from STDIN
from decimal import Decimal
from math import floor
 
[a, b] = list(map(Decimal, input().split()))
 
print(floor(a * b))

Submission status: Accepted

Solution code:
def examA():
    A, B = LI()
    ans = A*B
    print(ans)
    return

def examB():
    N = I()
    A = LI()
    for a in A:
        if a==0:
            print(0)
            return
    ans = 1
    for a in A:
        ans *= a
        if ans>10**18:
            print(-1)
            return
    print(ans)
    return

def examC():
    A, B = list(map(float, input().split()))
    #print(A,B)
    if int(A)==0:
        print(0)
        return
    if int(B)==0:
        print(0)
        return
    ans = A*(B+_ep)
    print(int(ans-_ep))
    return

# from Taka0310
def examC2():
    A, B = LDI()
    ans = int(A*B)
    print(ans)
    return

def examD():
    def factorization(n):
        arr = defaultdict(int)
        temp = n
        for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
            if temp % i == 0:
                cnt = 0
                while temp % i == 0:
                    cnt += 1
                    temp //= i
                arr[i] = cnt
        if temp != 1:
            arr[temp] = 1
        if arr == []:
            arr[n] = 1
        return arr
    C = [0,1,3,6,10,15,21,28,36,45]
    N = I()
    F = factorization(N)
    ans = 0
    #print(F)
    for f in F.values():
        for i in range(10):
            if C[i]>f:
                ans += i-1
                break
    print(ans)
    return

def examE():
    N = I()
    A = [0]*N
    B = [0]*N
    for i in range(N):
        A[i],B[i] = LI()
    A.sort()
    B.sort()
    if N%2==0:
        L = (A[N//2-1] + A[N//2])/2
        R = (B[N//2-1] + B[N//2])/2
        ans = int((R-L)*2) +1
    else:
        L = A[N//2]
        R = B[N//2]
        ans = (R-L)+1

    print(ans)
    return

def examF():
    inv = pow(2,mod2-2,mod2)
    N, S = LI()
    A = LI()
    dp = [[0]*(S+1)for _ in range(N+1)]
    dp[0][0] = pow(2,N,mod2)
    for i in range(N):
        a = A[i]
        for s in range(S+1):
            dp[i+1][s] += dp[i][s]
            dp[i+1][s] %= mod2
            if (s+a<=S):
                dp[i+1][s+a] += dp[i][s]*inv%mod2
                dp[i + 1][s+a] %= mod2
   # print(dp)
    ans = dp[-1][-1]%mod2
    print(ans)
    return

from decimal import Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 1<<60
_ep = 10**(-16)
alphabet = [chr(ord('a') + i) for i in range(26)]

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examC2()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Submission status: Accepted

Solution code:
import decimal

a,b = map(decimal.Decimal,input().split())

ans = int(a * b)

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
from decimal import Decimal
import math

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

print(math.floor(A * B))

Submission status: Accepted

Solution code:
import sys
from decimal import *

# Decimal(10).sqrt()

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    A, B = [x for x in input().split()]

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import deque
import math

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]


a,b = map(str,input().split())
d = int(b[0]+b[2:])
c = int(a)
print(c*d//100)

Submission status: Accepted

Solution code:
import sys
from decimal import Decimal, ROUND_DOWN

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7

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

ans = (a*b).quantize(Decimal('1'), rounding=ROUND_DOWN)
print(ans)

Submission status: Accepted

Solution code:
import decimal
t = input().split()
a = int(t[0])
b = decimal.Decimal(t[1])
print(int(a*b))

Submission status: Accepted

Solution code:
a, b = input().split()
a = int(a)
b = int(b[0] + b[2:])
print(a * b // 100)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal
t = input().split()
a = int(t[0])
b = decimal.Decimal(t[1])
print(int(a*b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input().split()
a = int(i[0])
b = int(i[1][0]+i[1][2:])
print(a * b // 100)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from decimal import Decimal

a, b = map(float, readline().split())
a = Decimal(str(a))
b = Decimal(str(b))
print(int(a * b))

Submission status: Accepted

Solution code:
A, B = list(map(float, input().split()))
#print(A*B)
print(int((int(A)*int(B*100+0.5))//100))

Submission status: Accepted

Solution code:
#解放2
from decimal import Decimal
from math import floor
a, b = input().split()
a = int(a)
b = Decimal(b)
print(floor(a*b))

Submission status: Accepted

Solution code:
A, B = list(map(float, input().split()))
#print(A*B)
print(int((int(A+0.5)*int(B*100+0.5))//100))

Submission status: Accepted

Solution code:
from decimal import Decimal

A, B = list(input().split())
A = Decimal(A)
B = Decimal(B)

print(int(A*B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#解放1
a, b = input().split()
b = b.replace(".", "")
print(int(a)*int(b)//100)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a0, b0 = input().split()
a = int(a0)
b1, b2 = [x for x in b0.split('.')]
b = int(b1 + b2)
if a * b < 100:
    print(0)
print(str(a * b)[:-2])

Submission status: Accepted

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

a = int(A)
b = int(B[0])
b2 = int(B[2:4])
#print(b)
#print(b2)
#print(b)

b3 = b*100
bb = b3 + b2
tmp = a*bb
#print(a*b)

print(int(tmp//100))

Submission status: Accepted

Solution code:
def main():
    a, b = input().split()
    a = int(a)
    c, d = b.split(".")
    b = int(c)*100+int(d)
    print( a*b//100)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from decimal import *
import math

getcontext().prec = 300

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

print(math.floor(A * B))

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
import decimal

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import decimal




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


a=decimal.Decimal(A)
b=decimal.Decimal(B)

print(int(a*b))

'''
a=int(A)
b=float(B)*100
#print(int(B))

bb=int(b)

print(math.floor(a*bb//100))
'''

Submission status: Accepted

Solution code:
A, B = input().split()
A = int(A)
B1, B2 = B.split(".")
B = int(int(B1)* 100 + int(B2))
C = A * B
C //= 100
print(C)

Submission status: Accepted

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