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

Submission status: Wrong Answer

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

print(int(X))

Submission status: Wrong Answer

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

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

ans = 0
for i,a in enumerate(A[::-1]):
    ans = ans + int(a)*B*10**(i)

print(int(ans))

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

b *= 100

print(int(a*b/100 // 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:
a = list(map(float, input().split()))
c = 1
for b in a:
    c = c * b
d = int(c)
print(d)

Submission status: Wrong Answer

Solution code:
import math
a,b = map(float, input().split())
for i in range(11):
    if i <= b <i+1:
        c = int(i)
        d = b - i
        
e = int(a) * c
f = a * d
g = int(math.floor(f))
h = e + g
print(math.floor(h))

Submission status: Wrong Answer

Solution code:

import math
a,b = input().split()
a = int(a)
b = float(b)
if a==0 or b==0:
    print(0)
else:
    print(int(math.floor(a*b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
A, B = input().split()
A = int(A)
Bi, Bf = map(int, B.split('.'))
ansi = A*Bi
ansf = A*Bf
print(math.floor(ansi + ansf/100))

Submission status: Wrong Answer

Solution code:
A,B=input().split()
A_=[A[:-2],A[-2:]]

if A_[0]=='':
    A_[0]='0'
    
A_[0]=int(A_[0])*100
A_[1]=int(A_[1])

B=float(B)
print(int(round(A_[0]*B)) + int(A_[1]*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b = input().split()
a = int(a)
b1, b2 = float(b).as_integer_ratio()
print(math.floor((a * b1) / b2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=input().split()
c,d=str(float(b)).split(".")

length=len(str(d))
c,d=int(c),int(d)

A,B=0,0
A=int(a)*c
if len(a)>1:B=int(a[:-length])*d
print(int(A+B))

Submission status: Wrong Answer

Solution code:
import math
i = input().split()

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

print(math.floor(a*b))

Submission status: Wrong Answer

Solution code:
from decimal import *
a, b = map(str, input().split())
a = int(a)
c = Decimal(a*float(b)).quantize(Decimal('0'), rounding=ROUND_DOWN)
print(int(c))

Submission status: Wrong Answer

Solution code:
import math
l=input().split(" ")
a=int(l[0])
x=float(l[1])
b=int(1000*x)
ans=int(a*b)
ans/=1000;
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from fractions import Fraction
 
a, b = input().split()
A = int(a)
B = float(b)
B1 = int(B * 1000000000000000000000)
C = Fraction(A * B1, 1000000000000000000000)
 
print(int(C))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# import math

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

a = A*B

print(int(a))

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:
from decimal import Decimal
import math

line= input().split()
a = int(line[0])
b = math.floor(Decimal(line[1]))
print(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():
	getcontext().prec = 15
	A,B  = map(float, input().split())

	numA = Decimal(A)
	numB = Decimal(B)
	ans = numA*numB

	#print(ans)
	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:
a, b = input().split()
a = int(a)
b = int(100 * float(b))
 
 
def solve(a, b):
    return a * b // 100
 
 
print(solve(a, b))

Submission status: Wrong Answer

Solution code:
def mul3():
    m,n = map(eval,input().split())
    res = round(m*n)
    if m == 0 or n == 0:
        res = 0
    return res

if __name__ == "__main__":
    print(mul3())

Submission status: Wrong Answer

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

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

print(int(b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ab = input().split()
a, b = int(ab[0]), float(ab[1])
c = str(a)
if len(c) >= 3:
  x = a - int(c[-2:]) // 100
  y = int(c[-2:])
  i = int(x * b)
  j = int(y * b)
  print(i*100+j)
else:
  print(int(a*b))

Submission status: Wrong Answer

Solution code:
li=input().split()
a = int(li[0])
b = float(li[1])
from decimal import Decimal, ROUND_HALF_UP
def remove_representation_error_in_float(x):
    x = Decimal(str(x)).quantize(Decimal('0.000000000000001'), rounding=ROUND_HALF_UP)
    x = float(str(x))
    return x
bb = remove_representation_error_in_float(b)
print(int(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = A*B

print(math.floor(ans/100))

Submission status: Wrong Answer

Solution code:

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

ans = a * b


print(int(ans))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
a,b = list(map(float, input().split()))
print(int(a*b))

Submission status: Wrong Answer

Solution code:
M,N = input().rstrip().split(" ")
N2 = 0
N2 += int(N[0]) * 100
N2 += int(N[2]) * 10
N2 += int(N[3])

M = int(M)

print(int((N2 * M) / 100))

Submission status: Wrong Answer

Solution code:
A, B = input().strip().split()
a = int(A)
b = int(float(B) * 100)
ans = 0
for _ in range(b):
    ans += a


print(ans//100)

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:


a= list(map(float,input().split()))
sum=1
for i in a:
    sum*=i

print(int(sum))

Submission status: Wrong Answer

Solution code:
A,B = map(float,input().split())
if 0 <= A < 10**15 and 0<=B<10:
    print(int(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

D = A * B

E = A
F = A + 1

if B >= 1:
    while E < D and F < D:
        E = E + 1
        F = F + 1
else:
    E = 0
            
print(E)

Submission status: Wrong Answer

Solution code:
def main():
    N = [str(_) for _ in input().split()]
    A = int(N[0])
    B = N[1]

    BB = B.split('.')
    result = A * int(BB[0])
    s = (A * int(BB[1][0]) * 10) + (A * int(BB[1][1]))
    print(result + int(s/100))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((int)(a*b))

Submission status: Wrong Answer

Solution code:
from sys import stdin, setrecursionlimit
from math import floor


def main():
    input = stdin.readline
    a, b = map(str, input().split())
    a = int(a)
    b = int(float(b) * 100)
    print((a * b) // 100)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Wrong Answer

Solution code:
import sys
import math


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

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


def main():
    A, B = map(float, input().split())
    A = int(A)
    B = int(B * 100)
    c = str(A * B)
    answer = 0
    for i in range(len(c) - 2):
        answer = answer * 10 + int(c[i])

    print(answer)


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:
A,B=list(map(float,input().split()))
A=int(A)
Bint=int(B)
Bfloat=int(int(B*100)-Bint*100)

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

Submission status: Wrong Answer

Solution code:
#coding:utf-8

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

B = B * 100

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

C = A * B

C = C / 100

C = int(C)

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

Submission status: Wrong Answer

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

b = int(b*100)

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

Submission status: Wrong Answer

Solution code:
import math

A,B = open(0).read().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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b = map(float, input().split())
for i in range(10):
    if i <= b <i+1:
        c = int(i)
        d = b - i
        
e = int(a) * c
f = a * d
g = int(math.floor(f))
h = e + g
print(math.floor(h))

Submission status: Wrong Answer

Solution code:
import math

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

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

ans = str(a * b)
if len(ans) < 3:
  print(0)
else:
  print(ans[:-2])

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
str = input()

str2 = str.split(" ")

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

res = A * B
res = res / 100
res = math.floor(res)
# res = int(float((A*B))/100)

print(res)

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)

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

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:
import math
m = list(map(float,input().strip().split()))
a = m[0]*100
b = m[1]*100
a = math.floor(a)
b = math.floor(b)
c = a*b
c = math.floor(c/10000)
print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
_A,_B=input().split()
A=int(_A)
B=float(_B)
B100=int(B*100)
ans=A*B100
str_ans=str(ans)
anslen=len(str_ans)
if anslen<3:
  print(0)
else:
  ansstr=str_ans[0:anslen-2]
  print(int(ansstr))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#include <CodeforcesSolutions.h>
#include <ONLINE_JUDGE <solution.cf(contestID = "1359",problemID = "C",method = "GET")>.h>
"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time,decimal
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    a,b = insr().split(" ")
    if "." not in b:
        b = b + ".0"
    q = b.index(".")
    w = int(b[:q] + b[q + 1:])
    qw = len(b) - q - 1
    if len(str(int(a) * w)) <= qw:
        print(0)
        return
    print(qw,str(int(a) * w)[:- q - 1])
                
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
    sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(float,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)
 
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from fractions import Fraction

a,b = map(str,input().split())
a = float(a)
b = float(b)
a = Fraction(a)
b = Fraction(b)
ans = (a*b)
print(int(ans))

Submission status: Wrong Answer

Solution code:
A,B = map(float,input().split( ))
ans = A*B
if abs(round(ans) - ans) <= 1e-17:
    print(int(round(ans)))
else:
    print(int(ans))

Submission status: Wrong Answer

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

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

def solve():
    a,b = map(float,sys.stdin.readline().split())
    a = int(a)
    print(int(trunc(a*b)))

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
import math

def abc169_c():
    sin = list(map(str, input().split()))
    A = math.floor(int(sin[0]) * 100)
    B = math.floor(float(sin[1]) * 100)
    ans = A * B // 10000
    print(ans)

abc169_c()

Submission status: Wrong Answer

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

b = float(b)

for i in range(1000):
    if b - 0.01*i == 0:
        b = i
        break

#print(b)

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

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

print(ab // 100)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# このファイルはutf-8で書かれているため、日本語を書く場合は上の記述が必要

text = input()

num_data = text.split(' ')


print(int(int(num_data[0]) * float(num_data[1])))

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
A,B = map(float,input().split())
A = Decimal(A)
B = Decimal(B)
#print(A*B)
print(int(A*B))
#print(A*B)
#print(int(A*int(B) + A*(B - int(B))))

Submission status: Wrong Answer

Solution code:
from math import floor, ceil


def main():

    A, B = map(float, input().split())
    A = int(A)
    if A == 0 or B == 0.0:
        print(0)
        return
    AB = A*B
    AB = floor(AB)
    print(AB)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

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

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

Submission status: Wrong Answer

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

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())
b = round(b,2)
c = a*b
print(math.floor(c))

Submission status: Wrong Answer

Solution code:
import math

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

ans = A*B

if ans < 1:
    print(0)
else:
    math.floor(ans)

Submission status: Wrong Answer

Solution code:
N, M = input().strip().split()
N, M = [int(N), float(M)]

total= N * M

total=(int(total))

print(total)

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(str(a1+a2),end = ' ')

Submission status: Wrong Answer

Solution code:
A = list(map(str,input().strip().split()))
x = float(A[0]) * float(A[1])
print(int(x))

Submission status: Wrong Answer

Solution code:
import sys
import math
A,B = map(float,input().split())
A = int(A)
if A == 0 or B == 0 :
    print(0)
    sys.exit(0)
else:
    ans = A*B
    i = math.floor(ans)-3
    while True : 
        if i <= ans and i+1 > ans:
            print(int(i))
            sys.exit(0)
        i += 1

Submission status: Wrong Answer

Solution code:
# env/bin/local python3

import math

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

if len(str(a)) < 3:
    print(math.floor(a * b))

else:
    b *= 100
    b = int(b)

    print(str(a * b)[:-2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
A,B = map(float,input().split( ))
ans = A*B
if abs(round(ans) - ans) <= 1e-10:
    print(int(round(ans)))
else:
    print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if A == 0 or B == 0:
    print(0)
    exit()

#print(A, B)
B = int(B * 100)
#print(A,B)

C = A * B
#print(C)

C = str(C)

if len(C) <= 2:
    print(0)
else:
    print(int(C[:len(C)-2]))

Submission status: Wrong Answer

Solution code:
def readInt():
    return list(map(float, input().split()))

a,b = readInt()
a = int(a)
count = 0
ans = 0
# print(a)
while a > 0:
    c = a % 10
    a = a // 10
    ans += c * (10**count) * b
    count += 1
    # print(a,c)
print(int(ans))

Submission status: Wrong Answer

Solution code:
import math


if __name__ == "__main__":
    il = input().split()

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


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

    print(ans)

Submission status: Wrong Answer

Solution code:
import math
m = list(map(float,input().strip().split()))
a = m[0]*100
b = m[1]*100
a = math.floor(a)
b = math.floor(b)
c = a*b
print(c)
c = math.floor(c/10000)
print(c)

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
A, B = map(float, input().split())

print(int(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

a,b = input().split()
a,b = int(a), float(b)
b = int(b*10000)
# print(b)
print(int((a*b)//10000))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

A = int(A)
b1 = int(B[0])
b2 = int(B[2])
b3 = int(B[3])

ans = A*(b1+b2/10+b3/100) + 0.000001
print(int(ans))

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

ans = math.floor((A*B)*10**2)/(10**2)

print(math.floor(A*B))

Submission status: Wrong Answer

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

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=math.trunc(a)*math.trunc(b*100)
print(temp//100)

Submission status: Wrong Answer

Solution code:
from decimal import Decimal, ROUND_FLOOR

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


ans=a*b

val_floor_d = Decimal(ans).quantize(Decimal('1'), rounding=ROUND_FLOOR)

print(val_floor_d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import sys
from decimal import Decimal

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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)

#a_a = a * b_f

#print(a, b_f)
#print(a, b)
#print(a*b)
a = a * b

#print(a_a)

print(a // 100)

Submission status: Wrong Answer

Solution code:
from fractions import Fraction

a, b = input().split()
A = int(a)
B = float(b)
B1 = int(B * 10000000000000000)
C = Fraction(A * B1, 10000000000000000)

print(int(C))

Submission status: Wrong Answer

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