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

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    
    A, B = R_str()
    A = int(A)
    B = int(B[0]+B[2:])
    print(A * B //100)
    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

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

Solution (Python):
from decimal import Decimal

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

if __name__ == '__main__':
    main()

Solution (Python):
a, b = input().split()
b = b.replace(".","")


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

Solution (Python):
a, b = input().split()
b1, b2 = b.split('.')
print(int(int(a) * (int(b1) * 100 + int(b2))) // 100)

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

Solution (Python):

from decimal import *
A,B = input().split()

A = Decimal(A)
B = Decimal(B)

print (int(A*B))

Solution (Python):
import sys
input = sys.stdin.readline

AB = list(input().rstrip().split())
A = int(AB[0])

B1, B0 = map(int, AB[1].split("."))

ans = A*B1 + A*B0//100
print(ans)

Solution (Python):
s=input().split()
a=int(s[0])
b=s[1]
b="".join([b[0],b[2],b[3]])

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

Solution (Python):
import sys
from decimal import *



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

Solution (Python):
from fractions import Fraction
from math import floor

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

print(floor(A * B))

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

Solution (Python):
import sys
import math
from decimal import Decimal
sys.setrecursionlimit(10**6)


def main(input, print):
    a, b = map(Decimal, input().split())
    print(math.floor(a*b))


if __name__ == '__main__':
    main(sys.stdin.readline, print)

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

A = int(A)
B = B.replace(".", "")
B = int(B)
ans = A * B // 100
print(ans)

Solution (Python):
from decimal import Decimal as dec

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

if __name__ == "__main__":
    main()

Solution (Python):
A, B = input().split()
A = int(A)
B = int(B.replace('.', ''))

print(A * B // 100)

Solution (Python):
A,B=map(str,input().split())
A=int(A)
B0,B1=map(int,B.split("."))
B100=B0*100+B1
print((A*B100)//100)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

print(a*b//100)

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

Solution (Python):
a, b = input().split()
A = int(a)
B = int(b.replace('.', ''))

print(int(A * B) // 100)

Solution (Python):
import sys
sys.setrecursionlimit(10**7)

readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))

a,b = input().split()

a = int(a)
b = 100*int(b[0])+int(b[2:])
print((a*b)//100)

Solution (Python):
A,B  = input().split()
A = int(A)
B = [int(c) for c in B.split('.')]
c = A*B[0]
print(A*B[0]+(A//100)*B[1]+int((A%100)*B[1]//100))

Solution (Python):
import sys
from math import pi, cos, sqrt
from collections import defaultdict
readline = sys.stdin.buffer.readline



def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    a, b = geta()

    a = int(a)
    b2 = int(b[0] + b[2:4])

    print(a * b2 // 100)


if __name__ == "__main__":
    main()

Solution (Python):

import sys
input = sys.stdin.readline

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal, ROUND_FLOOR

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B = input().split()
A = Decimal(int(A))
B = Decimal(B)
C = A*B
print(C.quantize(Decimal("0"), rounding=ROUND_FLOOR))

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

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

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

Solution (Python):


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=input().split()
    n=int(n)
    m=int(m[:-3])*100+int(m[-2:])
    print(n*m//100)




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



if __name__ == "__main__":
    main()

Solution (Python):
from decimal import Decimal


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

print(int(a * b))

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

b1 = b.replace('.', '')

a_val = int(a)
b_val = int(b1)

print(a_val * b_val // 100)

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,b = map(float, input().split())
    a = int(a)
    b = int(b*1000)
    print(a*b//1000)
    return


if __name__ == "__main__":
    solve()

Solution (Python):
import sys

sys.setrecursionlimit(1000000)

import bisect
import math
import collections
import heapq


def solve(A, B):
    return (A * int(B * 1000)) // 1000


if __name__ == "__main__":
    A, B = tuple(input().split(" "))
    print(solve(int(A), float(B)))

Solution (Python):

import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub


import sys


buff_readline = sys.stdin.readline
readline = sys.stdin.readline

INF = 2**62-1


def read_int():
    return int(buff_readline())


def read_int_n():
    return list(map(int, buff_readline().split()))


def read_float():
    return float(buff_readline())


def read_float_n():
    return list(map(float, buff_readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()

def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B):
    A = int(A)
    B = B.split('.')
    B = int(B[0]) * 100 + int(B[1])
    return (A * B) // 100


def main():
    A, B = read_str_n()
    print(slv(A, B))


if __name__ == '__main__':
    main()

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


if __name__ == '__main__':
    main()

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

Solution (Python):
a, b = input().split()
a = int(a)
bu, bv = map(int, b.split('.'))
ans = a * bu + bv * a // 100
print(ans)

Solution (Python):
a,b=input().split()
a=int(a)
c,d=b.split(".")
c=int(c);d=int(d)
ans=a*(c*100+d)
print(ans//100)

Solution (Python):
def main():
    A, B = input().split()
    ans = int(A) * int(B.replace(".", "")) // 100
    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

A, B = input().split()
A = int(A)
B100 = int(B.replace(".", ""))

ans100 = A * B100
print(ans100 // 100)

Solution (Python):
def main():
    import sys
    from decimal import Decimal
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    A, B = [Decimal(x) for x in input().strip().split()]
    print(int(Decimal(A*B)))

if __name__ == '__main__':
    main()

Solution (Python):
from decimal import Decimal
dat = input().split()
a = Decimal(dat[0])
b = Decimal(dat[1])
import math
print(math.floor(a*b))

Solution (Python):
import sys

readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')

a, b = input().split()
a = int(a)
p, q = map(int, b.split('.'))
res = a * p + a * q // 100
print(res)

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

Solution (Python):
A,B=map(str,input().split())
a = int(A)
L = len(B)
b = int(B[:L-3]+B[L-2:])
res = a*b//100
print(res)

Solution (Python):
s = input().split()
a = int(s[0])
f = int(s[1].replace(".",""))
ret = a*f
print(ret//100)

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


main()

Solution (Python):

a,b = input().split()

ans = int( int(a) * int(b[0]+b[2:])//100 )

print(ans)

Solution (Python):
from math import floor
from decimal import Decimal

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

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

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

ans = a * b // 100

print(ans)

Solution (Python):
import sys
from decimal import *
input = sys.stdin.readline
A, B = input().split()
A = int(A)
B = Decimal(B)
print(int(A * B))

Solution (Python):


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

print(a*b//100)

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

Solution (Python):
from decimal import Decimal

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

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

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

import decimal, math
A = decimal.Decimal(A)
B = decimal.Decimal(B)

print(math.floor(A*B))

Solution (Python):


import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))

from decimal import Decimal  as D
def resolve():
    A,B=input().split()
    a=D(A)
    b=D(B)
    print(int(a*b))

resolve()

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

Solution (Python):
import sys
INF = 1 << 60
MOD = 10**9 + 7 
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    a, b = input().split()
    a = int(a)
    s, t = b.split('.')
    b = int(s + t)
    print(a * b // 100)
resolve()

Solution (Python):
from decimal import *

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

Solution (Python):
def main():
    A, B = input().split()
    b = int(B.replace('.', '')) * 100

    return int(A) * b // 10000

print(main())

Solution (Python):
A, B = input().split()
A = int(A)
B = int(''.join(B.split('.')))
print(A * B // 100)

Solution (Python):
import sys

sys.setrecursionlimit(500005)
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(float, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

a, b = na()
a = int(a)
b = round(b*100)
print(a*b//100)

Solution (Python):
import decimal

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

print(a * b // 1)

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import lru_cache, reduce
from math import gcd
from operator import add, itemgetter, mul, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7


a, b = sys.stdin.buffer.readline().decode().rstrip().split()
ans = Decimal(a) * Decimal(b)
print( int(ans))

Solution (Python):
a,b = input().split()
a = int(a)
c,d = b.split('.')
a *= int(c + d)
a //= 100
print(a)

Solution (Python):
import sys

A, B = sys.stdin.readline().rstrip().split(" ")

A = int(A)
B1, B2 = B.split(".")
answer = A * (int(B1) * 100 + int(B2))

print(answer // 100)