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 = list(map(float, input().split()))
x = int(a[0])
a[1] *= 100
y = int(a[1])
ans = x * y
ans //= 100
print(ans)

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:
#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 a == "1" and b == "0.01":
        print(0)
        return
    q = b.index(".")
    qw = b[:q]
    w = int(b[:q] + b[q + 1:])
    print(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:
import math
A, B = input().split()
A = int(A)
B = float(B)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

A, B = map(eval, input().split())
B = (str(B)[:4])
B = float(B)
ans = A*B
ans = str(ans).split(".")[0]
print(int(ans))

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

Submission status: Wrong Answer

Solution code:
import math
import numpy as np

x,y = map(float,input().split())	

a = x*y
b = math.floor(a)
c = str(b)
print(c)

Submission status: Wrong Answer

Solution code:
A,B = list(input().split())
A = int(A)
B = float(B)
B = int(100*B)
C = (A * B)%100
D = ((A * B) - C)/100
D = int(D)

print(D)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import decimal
decimal.getcontext().prec = 6
S = input().split()
A = int(S[0])
B = float(S[1])

B = decimal.Decimal(B)

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

Submission status: Wrong Answer

Solution code:
import sys
#sys.exit()
#sorted( ,reverse=True)
#N = int(input())
S,T = map(str, input().split())
S = int(S)
T = T.replace('.','')
T = int(T)
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]

#cnt = 0
#cnt += 1



#print(N)
#print(S,T)
#print(A)
#print('Yes')
#print('No')
print(int((S*T)/100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

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:
s=input()
a,b=s.split(' ')
a=int(a)
b=int(float(b)*100)
s=str(a*b)
print(s[:len(s)-2])

Submission status: Wrong Answer

Solution code:
try:
    
    A,B=input().split(' ')
    
    A_int=int(A)
    B_float=float(B)
    
    if A_int>=0 and A_int<=10**15 and B_float>=0 and B_float<=10:
        
        print(int(A_int*B_float))
    
    
    
except Exception as e:
    print(e)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#C
import math
A,B = map(float,input().split())
M = A*B
M = str(M)
ans = ''
for i in range(len(M)):
    if M[i] == '.':
        break
    else:
        ans =  ans + M[i]
print(int(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 = int(math.floor(a))
b = int(math.floor(b))
c = a*b
c = math.floor(c/10000)
print(c)

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:
import math
a,b=list(map(float, input().split()))
print(math.floor(a*b))

Submission status: Wrong Answer

Solution code:
import math

nums = list(input().split())
a = int(nums[0])
b = float(nums[1])*100

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

Submission status: Wrong Answer

Solution code:
A,B=map(float,input().split())
A=int(A)
B="{:.2f}".format(B)
B=float(B)
print(int(A*B))

Submission status: Wrong Answer

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

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

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

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

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

	s = str(ans)
	S = s.split(".")
	print(S[0])



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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b = map(float,input().split())
a = int(a)
c = a%10000
e = math.floor(a / 10000)
print(int(e*b*10000+c*b))

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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



if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
array=input().split(" ")
A=int(array[0])
B=float(array[1])
if B<=0 or A<=0:
  print(0)
else:  
  ans=A*B

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

Submission status: Wrong Answer

Solution code:
import decimal
decimal.getcontext().prec = 5
S = input().split()
A = int(S[0])
B = float(S[1])

B = decimal.Decimal(B)

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

a, b = map(float, input().split())
a = int(a)
c = int(b * 100)
d=a*c
answer = str(Decimal(d))
print(answer[:-2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


ans = a*b
ans = str(ans)
check = len(ans)

if check < 5:
    print(int(ans)//100)
else:
    print(int(ans[0:-2]))

Submission status: Wrong Answer

Solution code:
a,b = map(float,input().split())
r = int(a*b)
print("{0:.0f}".format(r))

Submission status: Wrong Answer

Solution code:
a, b = list(map(str,input().strip().split()))
a = int(a)
b1 = int(b[0])
b2 = int(b[2])
b3 = int(b[3])
t1 = a * b1
t2 = a * b2
t3 = a * b3
ans = int(t1 + 0.1 * t2 + 0.01 * t3)
print(ans)

Submission status: Wrong Answer

Solution code:
import math
A,B=input().split()
A=int(A)
B=float(B)
if A<100:
  ans=math.floor(A*B)
  print(ans)
  exit()
else:
  resA0=A%100
  resA1=A-resA0
  ans=resA1*B+math.floor(resA0*B)
  print(int(ans))

Submission status: Wrong Answer

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

print(result)

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

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

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

Submission status: Wrong Answer

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

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
import decimal

if __name__ == "__main__":
    a,b = map(float,input().split())
    a = decimal.Decimal(a)
    b = decimal.Decimal(b)*1000
    ans = a*b
    ans = ans/1000
    print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
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 = math.floor(x*y)
print(ret)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

ans = a * b
if a != 0 or b!= 0:
    ans = math.floor(ans)
else:
    ans = int(ans)

print(ans)

Submission status: Wrong Answer

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

a=round(a,4)

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

Submission status: Wrong Answer

Solution code:
A,B=map(float,input().split())
B1=int(B)
B2=int(B*10%10)
B3=int(B*100%10)
ans=int(A*B1)
ans=int(ans+A*(B2/10))
ans=int(ans+A*(B3/100))

print(str(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(" ")
    q = b.index(".")
    qw = b[:q]
    w = int(b[:q] + b[q + 1:])
    print(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:
import math
a, b = map(str, input().split())
#print(a, b)
a = int(a)
b = float(b)
#print(a, b)
ans = math.floor(a * b)
print(int(ans))

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
import math

aaa = list(map(float, input().split()))

A = int(aaa[0])
A = Decimal(A)
B = Decimal(aaa[1])

#print(B)
#print(A)
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:
from math import floor
n , m = list(input().split())
n = int(n)
m = float(m)
print(floor(n*m))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(a*b/100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = int(A)
b = int(float(B) * 100)
b1 = 0
b2 = 0
b3 = 0

if b > 99:
    b1 = int(b / 100)
    b2 = int((b - b1 * 100) / 10)
    b3 = int(b - b1 * 100 - b2 * 10)
elif b > 9:
    b2 = int(b / 10)
    b3 = int(b - b1 * 10)
else:
    b3 = b

a1 = a * b1
a2 = a * b2
a3 = a * b3
a2_c = 0
if a2 > 9:
    a2_c = int(str(a2)[:-1])
a2_e = int(str(a2)[-1])
a3_c = 0
if a3 > 99:
    a3_c = int(str(a3)[:-2])
a3_e = 0
if a3 > 9:
    a3_e = int(str(a3)[-2])

if a2_e + a3_e > 9:
    a1 += 1

ab = a1 + a2_c + a3_c

print(ab)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import re

a, b= map(float, input().split())
# a,b= str(a),str(b)
# pattern = '(\d+)\.(\d+)'
# r_a = re.match(pattern, a)
#a_sei = r_a.group(1)
#a_sho = r_a.group(2)
#r_b = re.match(pattern, b)
#b_sei = r_b.group(1)
#b_sho = r_b.group(2)
#
#a_sei_size=len(a_sei)
#b_sei_size=len(b_sei)
#
#a_sho=a_sho[0:b_sei_size]
#b_sho=b_sho[0:a_sei_size]
#
#a=float(a_sei+'.'+a_sho)
#b=float(b_sei+'.'+b_sho)
print(math.floor(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
N,K=input().split()
N=eval(N)
'''after=K.split(".")[1]
before=K.split(".")[0]
after=after[0:2]
K=eval(before+"."+after)
'''
K=eval(K)
K=round(K,2)
if K<10:
#print(before, after, K)
    print(math.trunc(N*K))

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

def main():
    A,B=map(str, input().split(" "))
    A = int(A)
    B = int(float(B) * 100)
    A_B_mul = A * B
    A_B_mul_str = str(A_B_mul)
    A_B_mul_str = A_B_mul_str[:-2]
 
    if A_B_mul_str =="":
        print(0)
    else:
        print(A_B_mul_str)
    
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

print((int(n[0])*int(float(n[1])*100))//100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = map(str, input().split())
A_keta = len(A)
B = float(B)
B_int = int(B)
ans = B_int * int(A)
B_dot = B - B_int
if A_keta >= 3:
    ans += int(B_dot * int(A[0:A_keta-2]) * 100)
    A_int = int(A[A_keta-2:A_keta])
    ans += int(A_int * B_dot)
else:
    ans += int(int(A) * B_dot)

print(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(" ")
    q = b.index(".")
    qw = b[:q]
    w = int(b[:q] + b[q + 1:])
    if int(a) * int(qw) <= 0:
        print(0)
        return
    print(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:
##C

[A,B] = list(input().split())

if A=='0' or B=='0':
    out=0
else:
    A = int(A)
    B = float(B)
    BB = 100*B
    dammy = int(A * BB)
    dammy2 = list(str(dammy))
    #print(dammy2)

    if len(dammy2)<=2:
        out=0
    else:
        del dammy2[-1]
        del dammy2[-1]
        out=int(''.join(dammy2))

print(out)

Submission status: Wrong Answer

Solution code:
import decimal
decimal.getcontext().prec = 4
S = input().split()
A = int(S[0])
B = float(S[1])

B = decimal.Decimal(B)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

result = a*b

print(int(result))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
import math    


arr=list(map(float,input().split()))

print(math.floor(arr[0]*arr[1]))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# 標準入力の取得
A, B = list(map(float, input().split()))

# 求解処理
result = int(int(A) * B)

# 結果出力
print(result)

Submission status: Wrong Answer

Solution code:
import math
array=input().split(" ")
A=int(array[0])
B=float(array[1])
if B<=0:
  print(0)
else:  
  ans=A*B

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

Submission status: Wrong Answer

Solution code:
import math


def main():
    A, B = map(float, input().split())
    print(math.floor(A * B))


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math

List = input().split()
X = int(List[0]) * int(float(List[1]) * 100)

print(math.floor(X/100))

Submission status: Wrong Answer

Solution code:
import math
a,b = map(str,input().split())
a = int(a)
b = float(b)
b_int = math.floor(b)
ans = a*b_int   #整数部の計算
b_float = b-b_int
dum = str(math.floor(b_float*100)*(a*100))
dum_len = len(dum)
if dum_len <= 4:
    amari = 0
else:
    amari = int(dum[0:dum_len-4])
print(ans+amari)

Submission status: Wrong Answer

Solution code:
import math
A,B=list(map(float,input().split()))
A=int(A)
Bfloat, Bint = math.modf(B)
Bfloat=int(Bfloat*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(temp)
print(int(A*Bint)+temp)

Submission status: Wrong Answer

Solution code:

import math

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

print(math.floor(A[0]*A[1]))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:

A, B = map(eval, input().split())
B = (str(B)[:4])
B = float(B)
print(int(A*B))

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
import math
def main():
    inp = input().split()
    a = int(inp[0])
    b = int(float(inp[1]) * 100000000000000000)
    ans = a * b // 100000000000000000
    print(ans)
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:

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

ans = a * b

print(int(ans // 1))

Submission status: Wrong Answer

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

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

print(result)

Submission status: Wrong Answer

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

print(int(math.floor(round(int(A) * float(B), 10))))

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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


b = x[0] * x[1]
print(math.floor(b))

Submission status: Wrong Answer

Solution code:
import sys
import math

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

def main():
    result = int(A) * float(B)
    return math.floor(result)

ans = main()
print(ans)

Submission status: Wrong Answer

Solution code:
from sys import stdin

def main():
  P = stdin.readline().rstrip().split()
  a = int(P[0])
  b = float(P[1]) * 100
  c = a*b/100.0
  print(int(c))
  return

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=(float(x) for x in input().split())

result = int(a*b)

print(result)

Submission status: Wrong Answer

Solution code:
a,b = input().strip().split()
a,b = [int(a), float(b)]
c = a*(b*100.0);
d = int(c)
print((int)(d/100))