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

from decimal import Decimal
from fractions import Fraction
import math
ans = int(a) * int(b*100)
#print(ans,int(a),int(b*100))
#Decimal.from_float(a)*Decimal.from_float(b)
print(str(ans)[:-2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()
lis = a.split()
inp = list()
d = 1
for i in lis:
    d *= (float)(i)
print(int(d))

Submission status: Wrong Answer

Solution code:
from sys import stdin
input = stdin.readline
a,b = map(float, input().split())
print(int(a*b))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
from decimal import Decimal
import math

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

if a==0 or b==0:
    print(0)
    sys.exit()

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

x= a*b
x= x-x%1
print(int(x))

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)
    ans = str(A * B)[:-2]
    if len(ans) <= 2:
        print(0)
    else:
        print(ans)


if __name__ == '__main__':
    solve()

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:
in_d = input()

a, b = in_d.split()
a = int(a)
b = float(b)

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

Submission status: Wrong Answer

Solution code:
from math import floor
from decimal import *

a, b = input().split()
a = int(a)
b = float(b)
    
ans = Decimal(a)*Decimal(b)
print(floor(ans))

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
# N=int(input())
# a=int(input())
A,B=map(float,input().split(" "))
A=int(A)
#A=[int(_) for _ in input().split(" ")]

if A==0 or B==0:
    ans=0
else:
    ans = int(A*B *100 // 100)

print(ans)

Submission status: Wrong Answer

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


def solve(A: int, B: float):
    print(int(B*100)*A//100)
    return


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

if __name__ == '__main__':
    main()

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)
B = int(float(B)*100)

print(A*B//100)

Submission status: Wrong Answer

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


aa=float(a)
bb=float(b)
print(int(aa*bb))

Submission status: Wrong Answer

Solution code:
###############################################################################
#Imports
import collections
import itertools
from functools import lru_cache
import sys
import math
###############################################################################
#Constants
MOD = int(1e9)+7
###############################################################################
#Helper
def helper():
	pass
###############################################################################
#Solver
def solve():
	a, b = input().split(' ')
	a, b = float(a), float(b)
	print(math.trunc(a*b))

###############################################################################
#Driver
t = 1
for _ in range(t):
	solve()
###############################################################################

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# C

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

import math
res = A * B
res = math.floor(res)
print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math
a, b = input().split()
A = int(a)
B1 = int(b[0])
B2 = int(b[2])
B3 = int(b[3])
ans1 = A*B1
ans2 = (A*B2)//10
ans3 = (A*B3)//100
print(ans1+ans2+ans3)

Submission status: Wrong Answer

Solution code:
import math

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

# A *= 100
B *= 100

AB = A * B / 100
floored = math.floor(AB)

print(floored)

Submission status: Wrong Answer

Solution code:
A = list(map(float, input().split()))
answer = int(0)
answer = int(A[0]) * int(100*A[1]) // 100
print(answer)

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 = map(float,input().split())
a = int(a)
b = b*100
ab = (a*b)/100

print(math.floor(ab))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
from collections import *
from math import *

def binary_search():
    l, r = 0, 10**18
    
    while l<=r:
        m = (l+r)//2
        
        if m<=C+eps:
            l = m+1
        else:
            r = m-1
    
    return r

eps = 1e-7
A, B = map(float, input().split())
C = A*B
print(binary_search())

Submission status: Wrong Answer

Solution code:
import math

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

print(math.floor(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

    A = int(A)

    res = int(B) * A

    Bs = B - int(B)

    res += int(Bs * A)

    print(res)



main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
inputs = list(map(float, input().split()))
multiple = int(inputs[0]) * inputs[1]

multiple_str = str(multiple)
if '.' in multiple_str:
    print(int(multiple_str.split('.')[0]))
else:
    print(int(multiple_str))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

b *= 100
ans = a * b
ans //= 100

print(int(ans))

Submission status: Wrong Answer

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


##########
if __name__ == "__main__":
    c()

Submission status: Wrong Answer

Solution code:
a,b=map(float,input().split())
b1= b-int(b)
b2 = int(b)
s2=a*b2
s1=a*b1
s=s2+int(s1)
print(int(s))

Submission status: Wrong Answer

Solution code:
val = eval(input().replace(' ', '*'))
print(str(val).split('.')[0])

Submission status: Wrong Answer

Solution code:
def main():
    A, B = (float(i) for i in input().split())
    a = int(A)
    ans = 0.0
    for i, s in enumerate(b for b in str(B) if b != "."):
        ans += a*int(s)*10**(-i)
    answer = []
    for t in str(ans):
        if t == ".":
            break
        answer.append(t)
    print("".join(answer))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

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

# print(B)

a = A*B

print(math.floor(a))

Submission status: Wrong Answer

Solution code:
from sys import stdin

A, B= map(float, stdin.readline().rstrip().split())

float = A*B

str = str(float)

res = ''
for _ in str:

    if _ =='.':
        break
    res += _
print(res)

Submission status: Wrong Answer

Solution code:
def main():
    A,B = map(float,input().split())
    A = int(A)
    B = int(B*100)
    C = A*B
    C = str(C)
    C = C[:-2]
    print(C)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

A /= 1000
B *= 1000
B = int(B)
ans = A*B
print(math.floor(ans))

Submission status: Wrong Answer

Solution code:
import math 
arr = input()
arr = arr.split()
f = float(arr[0])
s = float(arr[1])
print(int(math.floor(f * s)))

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=list(map(float,input().split()))

print(int(A*B))

Submission status: Wrong Answer

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

# print(A, B)
print(A * B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:


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

print(math.floor(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

    #print(ans)

    b *= 100
    b = int(b)

    ans = a * b
    md = ans % 100
    ans -= md
    ans /= 100
    ans = int(ans)

    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
ab = input()
ablist = ab.split(' ')
a = int(ablist[0])
b = float(ablist[1])
print(math.floor(a * b))

Submission status: Wrong Answer

Solution code:
import math

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

c = a * b

result = math.floor(c)

print(result)

Submission status: Wrong Answer

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


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


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
[a,b]=[float(i) for i in input().split(' ')]

print(int(a*b))

Submission status: Wrong Answer

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

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

# ans = a * b * 10**d / 10**d
# print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

C = A*B

import math
math.floor(C)
ans = int(C)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import *

a,b=input().split()
x=float(a)
y=float(b)
l=x*y
s=str(l)
for i in s:
	if(i=='.'):
		break
	else:
		print(i,end='')
print()

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 sys

A, B = sys.stdin.readline().strip().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())
A = int(A)
B = int(B*100)

ans = 0
for i in range(B):
    ans += A
    
ans = ans//100

print('{:.18g}'.format(ans))

Submission status: Wrong Answer

Solution code:
import math

a,b = map(float, input().split())
a = int(a)
b = round(b, 2)*10**15
ans = math.floor(a*b/(10**15))
ans = int(ans)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

ab = input().split()
a, b_f = int(ab[0]), float(ab[1])

b = int(b_f * 100)


#print(a, b)

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

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:
# -*- 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 = int(A)*B

	print(int(ans))



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

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

ans = int(a*b)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60


def main():
    A, B = readline().split()
    A = int(A)
    B = float(B)
    B1 = int(B)
    B2 = int((B - int(B)) * 100)

    ans = A * B1 + int(A * B2 // 100)
    print(ans)

    return


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import re


if __name__ == "__main__":
    A, B = map(float, input().split())
    mul = str(A*B)
    print(re.sub(r"\..*$", "", mul))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a,b = LS()
x = int(a)
y = float(b)

ret = int(x*y)
print(ret)

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    A, B = input().rstrip().split()
    A = int(A)
    ans = 0
    ans += A*int(B[0])
    ans += A*int(B[2])/10
    ans += A*int(B[3])/100
    print(int(ans))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from math import floor
A, B = map(float, input().split())
ans = ""
hoge = A*B
hoge = f"{hoge:.2f}"
# print(int(hoge))
# exit()
for a in hoge:
    if a == ".":
        print(ans)
        exit()
    else:
        ans += a
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

a*=b

print(int(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor
from decimal import *

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

Submission status: Wrong Answer

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

if __name__ == "__main__":
    a,b = map(float,input().split())
    a = int(a)
    ans = a*b
    print(math.floor(ans))

Submission status: Wrong Answer

Solution code:
import math
n,k = input().split()
n =int(n)
k =float(k)



if n == 0:
    print(0)
    exit()
    
if k == 0.0:
    print(0)
    exit()

a = math.floor(n*k)
print(a)

Submission status: Wrong Answer

Solution code:
import decimal
import math


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

print(math.floor(decimal.Decimal(a) * decimal.Decimal(b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)

def f(s):
    lst = s.split()
    return int(lst[0]), float(lst[1])

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
lst = input().split()
a = int(lst[0])
b = float(lst[1])
if a == 0 or b == 0:
  print(0)
else:
  print(int(a*b))

Submission status: Wrong Answer

Solution code:
import math

S = input().split()

A = float(S[0])
B = float(S[1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
a, b = input().split()
a = int(a)
b = int(float(b) * 100)
s = str(a * b)
if len(s) < 3:
    print(0)
else:
    print(s[:len(s) - 2])

Submission status: Wrong Answer

Solution code:
import math
val = list(input().split())
ans = float(val[0]) * float(val[1])

print(int(ans))

Submission status: Wrong Answer

Solution code:
import math

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

A *= 100
B *= 100

AB = A * B / 10000
floored = math.floor(AB)

print(floored)

Submission status: Wrong Answer

Solution code:
A,B = map(float,input().split())
A = int(A)
B = int(B*100)
ans = 0
for i in range(B):
    ans += A
print(ans//100)

Submission status: Wrong Answer

Solution code:
import math

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

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

print("{}".format(ret))

Submission status: Wrong Answer

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

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