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
# a = list(map(float, input().split()))
a, b = input().split()
# print(a, b)
b = float('%.2f' % float(b))
# print(b * 100)
ans = int(int(a) * int(b * 100))
# # ans = str(ans)
print(math.floor(ans // 100))
# print(n)

Submission status: Wrong Answer

Solution code:
a,b=input().split()
a=int(a)
b=float(b)
c=int(b)
fl = int(100*(b-c))
val= (a*c)
pos = a*fl
new_pos = (int(pos/100))

print(val+new_pos)

Submission status: Wrong Answer

Solution code:
a,b=input().split()
a=int(a)
b=int(float(b)*100)
r=a*b
if r < 100:
    print(0)
else:
    print(str(r)[:-2])

Submission status: Wrong Answer

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

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:
import numpy as np

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

Submission status: Wrong Answer

Solution code:
a, b = map(float,input().split())
b_B = b//1
b_S = b%1
ans = a*b_B+(a*b_S)//1
print(int(ans//1))

Submission status: Wrong Answer

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

tmp = A * int(B)
tmptmp = B*100
tmp2 = A * int((B-tmptmp//100)*100)
#print(int((B-tmptmp//100)*100))
print(int((tmp + tmp2//100)//1))

Submission status: Wrong Answer

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

r = int(a) * float(b)  
print(r)

print(math.floor(r))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

n,k =input().split()

a=float(n) * float(k)

for i in str(a):
    if i == '.':exit()
    print(i,end='')

Submission status: Wrong Answer

Solution code:
import math
import sys
import collections
from collections import defaultdict
from sys import stdin, stdout

sys.setrecursionlimit(10**9)
a,b=map(float,input().split())
temp=a*b
print(math.trunc(temp))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(float, input().split())
c = int(b * 100)
ans = int(a)*int(c)
ans = str(ans)
n = len(ans)

if n > 2:
    n = n-2
    ans = ans[:n]
else:
    ans = 0

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 = list(map(str, input().split()))
b = int(a[0])
c = float(a[1])
k = c*b
print(int(k))

Submission status: Wrong Answer

Solution code:
A,B=list(map(float,input().split()))
A=int(A)
Bint=int(B)
Bfloat=int(int(B*100)-Bint*100)
#print(9.09*100-9*100)
#print(Bfloat)

ABfloat=int(A*Bfloat)
strABfloat=str(ABfloat)
#print(strABfloat)
lenABfloat=len(strABfloat)
#print(lenABfloat)

temp=0
if lenABfloat>=2:
  for i in range(lenABfloat-2):
    temp+=int(strABfloat[i])*10**(lenABfloat-i-3)
  
print(A*Bint+temp)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

ans = A * B
ans = math.floor(ans)

print(str(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
import math

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

Submission status: Wrong Answer

Solution code:
import math

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

A = int(A)

Ans = A * B
print(math.floor(Ans))

Submission status: Wrong Answer

Solution code:
from math import floor

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

Submission status: Wrong Answer

Solution code:
import math
def main():
    A, B = input().split(' ')
    print(int(float(A)*float(B)))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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


a = A*B

print(int(a))

Submission status: Wrong Answer

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

A = int(math.floor(A))
B = int(math.floor(B * 100))

print(math.floor(A * B // 100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def resolve():
    AB = input().split()
    A = int(AB[0])
    B = float(AB[1])
    B100 = int(B * 100)
    print(int(A*B100//100))
resolve()

Submission status: Wrong Answer

Solution code:
a,b=input().split(' ')
a=int(a)
b=float(b)
if a>=100:
    aa=a//100
    aaa=a%100
    bb=int(100*b)
    ans=aa*bb+int(aaa*b)
    print(ans)
else:
    print(int(a*b))

Submission status: Wrong Answer

Solution code:

from decimal import *
def resolve():
    a, b = map(float, input().split())
    _mul = Decimal(a)*Decimal(b)
    print(int(_mul))

if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
input_line1 = input()
numbers = input_line1.split()
temp = int(numbers[0]) * float(numbers[1])
sum_num = temp // 1
 
print(sum_num)

Submission status: Wrong Answer

Solution code:
import math
arr=list(map(str, input().split()))
a=int(arr[0])
b=float(arr[1])
ans=a*b
print(math.floor(ans))

Submission status: Wrong Answer

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

print("{}".format(trunc(a*b)))

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:
import math

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math
a,b = input().split()
n = b.find('.')
if n > 0:
  bi = int(b[:n])
  bf = int(b[n+1:])
else:
  bi,bf = int(b),0
print(math.floor(int(a)*(bi*100+bf)/100))

Submission status: Wrong Answer

Solution code:
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  a,b=LF()
  a=int(a)
  return math.floor(a*b)

# main()
print(main())

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(math.floor(eval(A)*eval(B)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(float, input().split())
if a < 10**8:
    ans = a*b
    int_ans = int(ans)

    print(int_ans)
else:
    ans = a/10000000 * b
    int_ans = int(ans)
    print(int_ans*10000000)

Submission status: Wrong Answer

Solution code:
from math import trunc

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

Submission status: Wrong Answer

Solution code:
temp1 = input().split(" ")
a = float(temp1[0])
b = float(temp1[1])

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

Submission status: Wrong Answer

Solution code:
A,B = map(str,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())
print(int((int(A) * int(B * 100)) / 100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import  math

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

Submission status: Wrong Answer

Solution code:
s = str(input())
ans = float(1)
for i in s.split():
    ans *= float(i)
print(int(ans))

Submission status: Wrong Answer

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

def main():
    A, B = input().split()
    A = int(A)
    B = float(B)
    ans = int((A - A % 100) * B)
    ans += int(A % 100 * B // 1)
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
# sys.setrecursionlimit(int(pow(10, 2)))
#sys.stdin = open("input.txt", "r")
#sys.stdout = open("output.txt", "w")
mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]





# @lru_cache(None)
s=input()
s=s.split()
A=int(s[0])
B=float(s[1])
print(int(A*B))

Submission status: Wrong Answer

Solution code:
from sys import *
import math
things = stdin.readline().split()
print(math.floor(int(things[0]) * float(things[1])))

Submission status: Wrong Answer

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

print((a*b)//100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
A,B = input().split()
A = int(A)
B_i, B_d = B.split('.')
B_i = int(B_i)
# calc b_d
B_d = list(B_d)
B_100 = 100*B_i + int(B_d[0])*10 + int(B_d[1])

result_100 = A * B_100
print(result_100, int(A)*float(B)*100)


if result_100 >= 100:
    print(str(result_100)[:-2])
else:
    print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# python 3.8.2用
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
import numpy as np
from decimal import *
from collections import deque
from math import gcd
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def lcm(a,b):return (a*b) // gcd(a,b) #最小公倍数
def iin(): return int(sys.stdin.readline()) #整数読み込み
def ifn(): return float(sys.stdin.readline()) #浮動小数点読み込み
def isn(): return sys.stdin.readline().split() #文字列読み込み
def imn(): return map(int, sys.stdin.readline().split()) #整数map取得
def imnn(): return map(lambda x:int(x)-1, sys.stdin.readline().split()) #整数-1map取得
def fmn(): return map(float, sys.stdin.readline().split()) #浮動小数点map取得
def iln(): return list(map(int, sys.stdin.readline().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, sys.stdin.readline().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
def lprint(l): print(*l, sep='\n')

import numpy as np

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

print(math.floor(a*b/100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math


def main():
    #a, b = map(float, input().split())
    a, b = input().split()

    a = int(a)
    b1, b2 = b.split('.')

    b1 = int(b1)
    b2 = int(b2)

    zajedno = a*b1 + a*b2
    zajedno /= 10
    print(math.trunc(zajedno))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from decimal import Decimal, ROUND_DOWN
a,b = input().split()
a = int(a)
b = float(b)
x = a*b
print(x)
if x < 10**15:
  d = Decimal(str(x))
  y = d.quantize(Decimal('0'), rounding=ROUND_DOWN)
  print(y)  
else:
  print(1)

Submission status: Wrong Answer

Solution code:
A,B = map(float,input().split())
ans = int(A*B*100)
if ans < 100:
    print(0)
    exit()
else:
    a = str(ans//100)
    print(a)

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b = map(float, input().split())
f, i = math.modf(b)
ans = int(math.floor(a * f) + a * i)
print(ans)

Submission status: Wrong Answer

Solution code:
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime
from collections import deque


#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(float,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
	
def count_str(m):
	tmp={}
	for i in range(10):
		if i in tmp:
			tmp[i]=1
		else:
			tmp[i]+=1
	return tmp

def is_prime(n):
	if n==1: return True

	for i in range(2,int(math.sqrt(n))+1):
		if n%i==0:
			return False
	return True


I=input().split()
a=int(I[0])
b=round(float(I[1]),2)
print(int(a*b))

Submission status: Wrong Answer

Solution code:
import math
a,b = map(float,input().split())
a = int(a)
c = a*b%1
# print(c)
s = a*b-c
print(int(math.floor(b*a)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

result =  int(a*b)

print(result)

Submission status: Wrong Answer

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

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

input_line = input().split()

a = float(input_line[0])
b = float(input_line[1])

ans = a*b

ans = math.floor(ans)
print(ans)

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
import math
from collections import deque 
from functools import reduce

# input = sys.stdin.readline
a, b = map(float, input().split())

ab = np.array([float(a), float(b)])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math

num_list = input().split()
b = float(num_list[1]) * 100
ans = int(num_list[0]) * int(b)
ans = int(ans) / 100
print(int(ans))

Submission status: Wrong Answer

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

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 = ans//1

	print(int(ans))



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# 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 math

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

Submission status: Wrong Answer

Solution code:
try:
    A, B = map(float, input().split())
    res = A * B
    print(int(res))
except ZeroDivisionError:
    print(0)

Submission status: Wrong Answer

Solution code:
import math
q = input().split(" ")
A = int(q[0])
B = q[1].split(".")

if B[1][0]=="0":
  B[1] = B[1][1]

#print(B[0]+" " +B[1])
print(math.floor(A*int(B[0]) + ((A*int(B[1]))/100)))

Submission status: Wrong Answer

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

    a = int(a)
    b = float(b).as_integer_ratio()

    res = a * (b[0] / b[1])

    print(int(res))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = (input())
a,b = s.split(' ')
a = (int)(a)
x,y = b.split('.')
x = (int)(x)
y = (int)(y)
a1 = a*x
a2 = a*y
a2  = (int)(a2/100)
print(a1+a2)

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
a,b=input().split()
a=float(a)*10000;
b=float(b)/10000;
print(int(float(a)*float(b)))

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

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

def printlist(lst, k='\n'): print(k.join(list(map(str, lst))))
INF = float('inf')

from math import ceil, floor, log2
from collections import deque
from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product
from heapq import heapify, heappop, heappush

sys.maxsize = 1_000_000_000_000_000_000_0

def solve():
    a, b = map(float, input().split())

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

    # print(a, b)
    t = a * b
    print((t - t % 100) // 100)

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
A, B = input().split()
C = A+"*"+B
D = str(eval(C))
if "." not in D:
    print(D)
    exit()

E, F = D.split(".")
print(E)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
from collections import deque
import collections
import heapq

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

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:
a,b=input().split()

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


num=a*b

print(int(num//100))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = input().split()
ans = 0
a = int(a)
for i in range(len(b)):
  if i == 0:
    ans += int(b[i])*a
  elif i == 2:
    ans += int(b[i])*0.1*a
  elif i==3:
    ans += int(b[i])*0.01*a
print(int(ans))

Submission status: Wrong Answer

Solution code:
from sys import stdin
import math
#A, B= map(float, stdin.readline().rstrip().split())
C= [float(x) for x in stdin.readline().split()]

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


tmp = A*B

print(math.floor(tmp))

Submission status: Wrong Answer

Solution code:
import math

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

num = A * B
print(math.floor(num))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
IN = input().split()
A = int(IN[0])
B = float(IN[1])

print(int(A*B))

Submission status: Wrong Answer

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

a = int(A)
b = float(B)

X = (a * b)//1

print(int(X))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b = input().split()

if a == '0' or b == '0.00':
    print(0)
    exit()

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

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

Submission status: Wrong Answer

Solution code:
n = list(input().split())
a = int(n[0])
b = float(n[1])
ans = a * b
print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

ab = input().split()
a = int(ab[0])
b = math.floor(float(ab[1])*100)

ab = a*b
if ab < 100:
  print(0)
else:
  ab = str(ab)
  print(ab[:-2])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a, b = map(float, readline().split())
m = pow(10, 14)
print(int(a * (b * m) // m))

Submission status: Wrong Answer

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