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: Wrong Answer

Solution code:
import math

def main():
  a, b = input().split()
  a = int(a)
  b = float(b)
  c = int(b)
  d = b - c
  ans_a = a * c
  ans_b = a * d
  ans = math.floor(ans_b) + ans_a
  print(ans)
 
 
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

A=int(A)
B=float(B)
B=B*100
ans=A*B//100

print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

print(math.floor(aa * b))

Submission status: Wrong Answer

Solution code:
import sys
import math
def II(): return int(input())
def MI(): return input().split()
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    A, B = MI()
    A = int(A)
    B = float(B)
    print(math.floor(A*B))
    


if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import math

numbers = input().split()
a = float(numbers[0])
aa = a % 100
aaa = a - aa

b = float(numbers[1])

c = aaa * b + math.floor(aa * b)

print(int(c))

Submission status: Wrong Answer

Solution code:
import math

def main():
    A, B = tuple(float(c) for c in input().split(' '))
    ret = math.floor(A*B)
    print(f'{ret}')


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys
import math

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

def LF(): return list(map(float,sys.stdin.readline().rstrip().split()))

A,B = LF()

A = int(A)
B = int(B*100)
ab = A*B

ans = int(ab/100)
print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

print(math.floor(a*b))

Submission status: Wrong Answer

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

a = int(a)
b = float(b)

print(math.floor(a*b))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

##### 割り算の切り上げ #####
# tmp = -(-4 // 3)

##### dict の for文 #####
# for k, v in d.items():
#     print(k, v)

##### 進数の変換 #####
# bin_str = bin(i)[2:]
# oct_str = oct(i)[2:]
# hex_str = hex(i)[2:]

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	A,B  = map(float, input().split())

	ans = A*B
	ans = str(ans)
	a = ans.split(".")

	print(a[0])



def factorize(n):
    fct = []  # prime factor
    b, e = 2, 0  # base, exponent
    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



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# 2分検索のリバース
def bisect_left_reverse(a, x):
    if a[0] <= x:
        return 0
    if x < a[-1]:
        return len(a)
    # 二分探索
    ok = len(a) - 1
    ng = 0
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if a[mid] <= x:
            ok = mid
        else:
            ng = mid
    return ok

def bisect_right_reverse(a, x):
    if a[0] < x:
        return 0
    if x <= a[-1]:
        return len(a)
    # 二分探索
    ok = len(a) - 1
    ng = 0
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if a[mid] < x:
            ok = mid
        else:
            ng = mid
    return ok

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# 2分検索
# 存在しない場合: None 存在する場合: その値
def binary_search(list, item):
    low = 0
    high = len(list) - 1

    while low <= high:
        mid = (low + high) //2
        guess = list[mid]
        if guess == item:
            return mid
        if guess > item:
            high = mid -1
        else:
            low = mid + 1
    return None

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# N 個のボールを K グループに分ける場合のパターン数
def sunuke(N, K, mod=10**9+7):
	if N < K or K-1 < 0:
		return 0
	else:
		return combination(N-1, K-1, mod)

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)


class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# dfs のサンプル
def dfs(graph,parent,counter,edge):
    stk = []
    stk.append(edge)
    while len(stk) > 0:
        p = stk.pop()
        for e in graph[p]:
            if parent[p] == e:
                continue
            else:
                parent[e] = p
                counter[e] += counter[p]
                stk.append(e)

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
import numpy as np
import math
List = list(map(float, input().split()))
print(math.floor(np.prod(List)))

Submission status: Wrong Answer

Solution code:

A,B= map(str,input().split())
A =int(A)
B = float(B)
import math
ans = A * B
ans = int(math.floor(ans))
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
from sys import stdin


def get_result(data):
    A, B = data
    return int(np.floor(np.float128(A*B)))


if __name__ == '__main__':
    data = list(map(float, stdin.readline().rstrip().split(' ')))
    result = get_result(data)
    print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
   
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

a=int(a)
b=float(b)

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

Submission status: Wrong Answer

Solution code:
import math

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

A = int(A)
ans = int(A*B)
print(ans)

Submission status: Wrong Answer

Solution code:
from fractions import Fraction
import math
a,b = map(float,input().split())

print(math.floor(Fraction(a)*Fraction(b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math as m
a,b=map(float,input().split())
print(m.floor((a*int((b*100)))//100))

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    A, B = map(float, rl().split())
    A = int(A)
    B = int(B * 100)
    print(int(A * B / 100))


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
a,b=map(str,input("").split())
A=str(int(a)*float(b)).split(".")
print(int(A[0]))

Submission status: Wrong Answer

Solution code:
m, n = input().split()
m = int(m)
n = eval(n)
res = 0
count = 0
while n > 2 ** (-15):
    n_z = int(n)
    n_r = n - n_z
    res = res + (m * n_z)//pow(10,count)
    n = n_r * 10
    count += 1
print(res)

Submission status: Wrong Answer

Solution code:
import math

A,B = input().split()
a = int(A)
b = float(B)
print (math.floor(a * b))

Submission status: Wrong Answer

Solution code:
l=input().split()
a=int(l[0])
b=int(float(l[1])*100)
b_i=b//100
b_s=b%100

c=(a*b_s)//100
print(a*b_i+c)

Submission status: Wrong Answer

Solution code:

import math

A, B = input().split()

A = int(A)
if '.' in B:
    B_a = int(B.split('.')[0])
    B_b_size = len(B.split('.')[1])
    B_b =  int(B.split('.')[1])
else:
    B_a = int(B)
    B_b_size = 0
    B_b = 1
ans_a = A * B_a
ans_b = A * math.pow(10, -1*B_b_size) * B_b
ans = ans_a + int(ans_b)
print(ans)

Submission status: Wrong Answer

Solution code:
S = input().strip().split()
A = int(S[0])
B = int(float(S[1]) * 100)
print(A * B // 100)

Submission status: Wrong Answer

Solution code:
import math
a, b = list(map(float, input().split()))

ans = math.floor(a * b)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
A, B = input().split()
A = int(A)
B = float(B)
X = A * B
print(math.floor(X))

Submission status: Wrong Answer

Solution code:
import math
a, b = map(str, input().split())
a = int(a)
b = float(b)
print(int((a*b)//1))

Submission status: Wrong Answer

Solution code:
import math

A, B = input().split()

A = int(A)
B = float(B)

print(int(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
N, M = map(float, input().split())

# print(N*M)
ans = (N*M*1000)//1000
ans = math.floor(ans)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = int(a)
db = b - int(b)
db = int(db * 100)
b = int(b)

ans = a * b
dab = a * db // 100
ans += int(dab)
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math                                               
a,b = [float(x) for x in sys.stdin.readline().split(" ")]
c = math.floor(a * b)                                     
                                                          
print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b=map(float,input().split())
a*=b

print(math.floor(a))

Submission status: Wrong Answer

Solution code:
line=input().split()
line=[float(i) for i in line]

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

Submission status: Wrong Answer

Solution code:
a,b=map(float,input().split())
print(str(a*b).split(".")[0])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(float,input().split())
b*=100
c=int(a*b//100)
if a==0 or b==0.00:
    c=0

print(c)

Submission status: Wrong Answer

Solution code:
import sys
import copy
from collections import deque
stdin = sys.stdin
 
ni = lambda: int(ns())
na = lambda: list(map(float, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces
a, b = na()

at = int(a)
bt = int(b*100)


print(at*bt//100)

Submission status: Wrong Answer

Solution code:
a,b = [e for e in input().split()]
a = int(a)
b = float(b)
b1 = int(b)
b2 = b-b1
ans1 = a*b1
ans2 = int(a*b2)
print(ans1+ans2)

Submission status: Wrong Answer

Solution code:
import math
A, B = map(float, input().split())
f, i = math.modf(B)
print(int( A * i + A * f // 1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
#import numpy as np
import math
#from fractions import Fraction
#import itertools
#from collections import deque
#import heapq
#from fractions  import gcd
input=sys.stdin.readline
a,b=input().split()
a=int(a)
b=float(b)
b=int(b*100)
print(math.floor(a*b/100))

Submission status: Wrong Answer

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

tmp = (a*int(b[0])) + (a*int(b[1]))/(10**len(b[1]))

print(int(tmp))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
import sys
import math
import random


s = input().split()
A = int(s[0])
B = float(s[1])
x = (A-A/100)*B*100
y=int(A/100)*(B*100)+(A/100-int(A/100))*(B*100)
print(int(y))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = A * B

print(format(ans, '.0f'))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

bs = str(b)
bs1, bs2 = map(str, bs.split("."))
digi = len(bs2)

ans = a * (b * 10**digi) / 10**digi
print(int(ans))

Submission status: Wrong Answer

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

ans = a * b /10000

print(int(ans))

Submission status: Wrong Answer

Solution code:
import math
A, B=(float(x) for x in input().split())
print(math.floor(A*B))

Submission status: Wrong Answer

Solution code:
S = input().split()
A = int(S[0])
B = float(S[1])
import math
print(math.floor(A*B))

Submission status: Wrong Answer

Solution code:
import math

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

a = int(a)
print(math.floor(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a, b = input().split()
a = int(a)
b = float(b)
c = a * b
print(math.floor(c))

Submission status: Wrong Answer

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

ans = int(A*B)
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import itertools
import math

A,B=input().split()

An=int(A)
Bn=float(B)

print(math.floor(An*Bn))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
t = [x for x in input().split()]
a = int(t[0])
b = float(t[1])
print (int(b * a))

Submission status: Wrong Answer

Solution code:
import sys
import math
input = sys.stdin.readline
n1, n2 = map(float, input().split())

print(math.floor(n1*n2))

Submission status: Wrong Answer

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()

#####Shorten#####
def DD(arg): return defaultdict(arg)


#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  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.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####MakePrimes######
def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum

#####GCD#####
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############
A,B = SL()
A = int(A)
B1 = int(B[0])
B2 = int(B[2])
B3 = int(B[3])

a = A//1000
honrai = a*float(B)
gosa = int(a*float(B)) - (a*B1+a*B2//10+a*B3//100)

print(A*B1+A*B2//10+A*B3//100 + gosa)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
print(math.floor(eval(input().replace(' ', '*'))))

Submission status: Wrong Answer

Solution code:
import math
a, b = input().split()
a1 = int(a)
b1 = float(b)
print(math.floor(a1*b1))

Submission status: Wrong Answer

Solution code:
import math

lst = input().split()
a = int(lst[0])
b = float(lst[1])
print(math.trunc(a*b))

Submission status: Wrong Answer

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

#print(int(A*B))
b=int(B*100)
ans100bai=A*b
if len(str(ans100bai))>2:
	print(str(ans100bai)[:-2])
else:
	print(0)

# 2darray [[0] * 4 for i in range(3)]

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
def main():
    nums = list(map(float, input().split()))
    a, b = nums[0], nums[1]
    res = a * b
    print(math.floor(res))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
a,b=map(float,input().split(" "))
print(math.floor(a*b))

Submission status: Wrong Answer

Solution code:
import math

inp = input().split()
a = int(inp[0])
b = float(inp[1])

print(math.floor(a * b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

res = 0
for i in range(int(b)):
  res += a

res += a*d

print(int(res))

Submission status: Wrong Answer

Solution code:
from math import floor

a, b = input().split()
a = int(a)
b = int(float(b)*100)
print(floor(a*b/100))

Submission status: Wrong Answer

Solution code:
import math
A, B = map(float, input().split())
A = int(A)
B = int(B*100)
print(str(A*B)[:-2])

Submission status: Wrong Answer

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

    print(int(A * B))


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
a,b = map(float, input().split())
ans = math.floor(a*b)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
A, B = map(float, input().split())
A = int(A)
B = B*100
print(math.floor(A*B/100))

Submission status: Wrong Answer

Solution code:
import math
a,b = map(float, input().split())

ans = math.floor(a * b)
print(ans)

Submission status: Wrong Answer

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

b *= 100

ans = a * b

print(ans // 100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = map(float,input().split())
s = str(a*b)
print(s.split('.')[0])

Submission status: Wrong Answer

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

f = A*B
print("{:.0f}".format(int(f)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    ans = str(a * b100)
    if len(ans) > 2:
        ans = ans[:-2]
    else:
        ans = 0
    print(ans)
resolve()

Submission status: Wrong Answer

Solution code:
A,B = map(float,input().split())
import math
from decimal import *
B = B*100
ans = int(A*B//100)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = input().split()
A = int(L[0])
B = float(L[1]) * 100
import math
print(int((A * B)//100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

mul = a * b
mul = mul // 1
print(int(mul))

Submission status: Wrong Answer

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

print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def resolve():
    import math
    A, B = input().split()
    A = int(A)
    B = float(B)
    ans = math.floor(A*B)
    print(ans)
resolve()

Submission status: Wrong Answer

Solution code:
inf = 10 ** 18
mod = 10 ** 9 + 7
a,b = map(float, input().split())
a100 = int(a)
b100 = int(b*100)
print(int(a100*b100/100))

Submission status: Wrong Answer

Solution code:

def main():
    #s = input().split()
    #*A, = map(int, input().split())
    n, m = map(float, input().split())
    a = n * m
    print(int(a-(a%1)))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

A, B = list(input().split())
A = int(A)
B = float(B)

multipled = A * B
floored = math.floor(multipled)

print(floored)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math
a,b=list(map(float,input().split()))
#print(a,b)
print(math.floor(int(a)*round(b,2)))

Submission status: Wrong Answer

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

ans = int(a*b)

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math

input = sys.stdin.readline
 
def main():
  a,b = map(float, input().split())
  if a==0 or b== 0:
    print(0)
    sys.exit()
  print(math.floor(a * b))

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = input()
a = int(x.split(' ')[0])
b = float(x.split(' ')[1])
  
b = 100*b

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal, getcontext
getcontext().prec = 2
A, B = input().split()
print(int(int(A) * float(Decimal(B))))

Submission status: Wrong Answer

Solution code:
import math
a, b = map(str, input().split())
a = int(a)
b = float(b)
print(a, b)
print(int((a*b)//1))

Submission status: Wrong Answer

Solution code:
import math
a, b = map(float, input().split())

c = a*b

print(int(math.floor(c)))

Submission status: Wrong Answer

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

print(math.floor(int(A)*float(B)))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a,b = list(map(float,input().split()))
from math import floor

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

Submission status: Wrong Answer

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

A, B = input().rstrip().split()
A = int(A)
B = float(B)

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

Submission status: Wrong Answer

Solution code:
import math
a,b = map(float,input().split())
ans = a*b
aans = math.floor(ans)
print(aans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = input().strip().split()
a, b = [int(a), float(b)]
ans = int(a * b)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

from decimal import Decimal
from fractions import Fraction
import math
ans = Decimal.from_float(a)*Decimal.from_float(b)

print(math.ceil(ans)-1)

Submission status: Wrong Answer

Solution code:
eps = 1e-2
A, B = list(map(float, input().split()))
C = A*B
ans = int(A*B//1)
if C==ans:
    print(ans)
elif abs(ans+1-C)<eps:
    print(ans+1)
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
a_s, b_s = input().split()

a = int(a_s)
b = int(float(b_s) * 100)

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

Submission status: Wrong Answer

Solution code:
import numpy

A, B = input().split()
A = int(A)
B = float(B)
print(numpy.int(numpy.floor(A * B)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
str = input()

str2 = str.split(" ")

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


res = (float(A)*float(B))
if res != 0:
    res = round(res - 0.5)


print(res)