Problem:


Score : 300 points

Problem Statement

Compute A \times B, truncate its fractional part, and print the result as an integer.

Constraints

0 \leq A \leq 10^{15}

0 \leq B < 10

A is an integer.

B is a number with two digits after the decimal point.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the answer as an integer.

Sample Input 1

198 1.10

Sample Output 1

217

We have 198 \times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.

Sample Input 2

1 0.01

Sample Output 2

0

Sample Input 3

1000000000000000 9.99

Sample Output 3

9990000000000000



Sample input:
198 1.10


Sample output:
217

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

def solve(A: int, B: float):
    int_b = math.floor(B)
    point_b = math.floor((B - int_b)*100)/100
    ans_int = A * int_b
    ans_point = A * point_b
    ans = math.floor(ans_int) + math.floor(ans_point)
    print(ans)


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

	numA = Decimal(A)
	numB = Decimal(B)
	ans = Decimal(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:
def Multiplication1():

    # スペース区切りの整数の入力
    num_a, num_b = input().split()

    num_a = int(num_a)
    num_b = float(num_b)

    output = round(int(num_a)*float(num_b), 2)

    if (num_a >= 0) & (num_a <= pow(10,15)) & (num_b >= 0) & (num_b <= 10):
        print(output)

if __name__ == '__main__':
    Multiplication1()

Submission status: Wrong Answer

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

result = math.floor(a*b)

print(result)

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import math

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

x = f'{a*b:.2f}'

print(math.floor(float(x)))

Submission status: Wrong Answer

Solution code:
#import math

a, b = input().split()

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

ans = a*b

ans_2 = str(ans).split(".")[0]
#print(ans)

#print(str(math.floor(ans)))

print(ans_2)

Submission status: Wrong Answer

Solution code:
A, B = [n for n in input().split()]
A = int(A)
B = float(B).as_integer_ratio()

ans = A * B[0] / B[-1]
print(int(ans))

Submission status: Wrong Answer

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

a = int(A)
b = int(B*100)
#print(b)

tmp = a*b
#print(a*b)


print(tmp//100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

#!/usr/bin/python
# -*- coding: utf-8 -*-

import math

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

print((A*B)//100)

Submission status: Wrong Answer

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

print(math.floor(A* B))

Submission status: Wrong Answer

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

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(a*b//1))

Submission status: Wrong Answer

Solution code:
import math

A,B = input().split()

C = int(A)
D = float(B)

print(math.floor(C * D))

Submission status: Wrong Answer

Solution code:
S = input().split()
A = int(S[0])
B = str(S[1])
tabo = 0
ans = 0
cal = 0
for i in range(4):
    if B[i] == ".":
        continue
    else:
        if i == 0:
            ans += A*int(B[i])//1
            tabo = (A*int(B[i]))%1
        elif i == 2:
            cal = A*int(B[i])*0.1000000000000000000000
            ans += cal//1
            tabo = cal%1
        elif i == 3:
            cal = A*int(B[i])*0.0100000000000000000000
            ans += cal//1
            tabo = cal%1
if tabo > 1:
    ans += tabo//1
print(int(ans))

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:
'''
    handle - pruvi007
    questionName - 
    Contest - 
    Topic - 
    Platform - 
'''
from sys import stdin, stdout
from collections import defaultdict

def main():
    a,b = map(float,stdin.readline().split())
    # A,B = a.split()
    # A = int(A)
    # B = float(B)
    # print(B)
    b = b * 1000
    b = int(b)
    import math
    ans = a*b
    ans = ans//1000
    # print(ans)
    print( int(ans) )

main()

Submission status: Wrong Answer

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

C = Decimal(A)*Decimal(B)

print(math.floor(C))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

print(math.floor(X))

Submission status: Wrong Answer

Solution code:
import math
from sys import stdin

A, B = [float(x) for x in stdin.readline().rstrip().split()]
print(int(math.floor(A * B)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

B100 = int(float(B) * 100)

num = int(A) * B100

print(int(num / 100))

Submission status: Wrong Answer

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

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

d = 0
for i in range(len(str(A))):
    d+=1

res = 0


B =int(B*(10**13))
#print(A*B)

print(int(A*B/(10**13)))

Submission status: Wrong Answer

Solution code:
import math
i = list(map(float, input().split()))
A = i[0]
B = i[1]

C = math.floor(A * B)
print(int(C))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

a,b = map(float, input().split())
b = str(b)
a = str(a)
getcontext().prec = 16
ans = math.floor(Decimal(a)*Decimal(b))
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(math.floor(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
import math

A, B = [float(x) for x in stdin.readline().rstrip().split()]
A=int(A)
BB=int(B*100)
#print(A*BB)
if(B==0):
    print(0)
else:
    S=str(A*BB)
    if len(S)<=2:
        print(0)
    else:
        print(S[:-2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from fractions import Decimal
a,b = input().split()
a = int(a)
b = Decimal(b).as_integer_ratio()
print(int(a * b[0]/b[1]))

Submission status: Wrong Answer

Solution code:
def main():
    a,b = input().split()
    a = int(a)
    b_n = b[0]
    b_ = b[2:]
    print(int(int(a)*int(b_n)+int(a)*int(b_)/100))


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a=round(a,3)

print(int(a*b))

Submission status: Wrong Answer

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

print(math.floor(c))

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]) * 100000000000000)
    ans = a * b // 100000000000000
    print(ans)
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
ab = input().split()
a = int(ab[0])
b = float(ab[1])
b_l = math.floor(b)
b_r = b - b_l
b_r = b_r * 100
b_r = math.floor(b_r)
ans_1 = a * b_l
ans_2 = a * b_r / 100
ans = math.floor(ans_1+ans_2)
print(ans)

Submission status: Wrong Answer

Solution code:
a,b=map(float,input().split())
tempb=b*100
temp=999
for i in range(1001):
  if abs(i-tempb)<temp:
    tb=i
    temp=abs(i-tempb)
print(int(tb*a/100))

Submission status: Wrong Answer

Solution code:
from decimal import *
a,b=map(float,input().split())
a=int(a)
bigb=int(b*100)
a_front=a//1000
a_back=a-a_front*1000
#print(a,b,bigb,a_front,a_back)
ans_front=a_front*10*bigb
ans_back=a_back*b
ans_back=int(ans_back)
print(Decimal(ans_front+ans_back))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
i = list(map(float, input().split()))
A = i[0]
B = i[1]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B=map(float, input().split())
AB=int(A)*B
AB_=(AB%1)
print(int(AB-AB_))

Submission status: Wrong Answer

Solution code:
import math
a,b=input().split()
if len(a)<=2:
  a=float(a)
  b=float(b)
  print(math.floor(a*b))
  exit()
a=list(a)
b=list(b)
a0=int(''.join(a))
a1=int(''.join(a[:-1]))
a2=int(''.join(a[:-2]))
b0=int(b[0])
b1=int(b[2])
b2=int(b[3])
ss=a0*b0+a1*b1+a2*b2
print(ss)

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
import numpy as np
a,b = map(float,input().split())
print(math.floor(np.multiply(a,b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

sum = A*B

print(math.floor(sum))

Submission status: Wrong Answer

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

C = A * B

print(int(C))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

a=int(a)

print(math.floor(a*b))

Submission status: Wrong Answer

Solution code:
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(x*b*100+j)
else:
  print(int(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys


try:
    sys.stdin = open(sys.path[0] + '/input.txt', 'r')
    sys.stdout = open(sys.path[0] + '/output.txt', 'w')
except FileNotFoundError:
    pass


def solve():
    a, b = list(map(float, input().split()))
    return (int(a * b))


s = solve()
print(s)

Submission status: Wrong Answer

Solution code:
import math
list1 = [float(x) for x in input().split()]
print(math.floor(list1[0] * list1[1]))

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import sys
import math

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

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

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

Submission status: Wrong Answer

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

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:
A, B = input().split();
A = int(A);
B = int(float(B)*100);
C = A*B//100;
print(C);

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from fractions import Fraction
x=input().split()
a=int(x[0])
b=float(x[-1])
b='{0:.2f}'.format(b)
b=float(b)
a=Fraction.from_float(a)
b=Fraction.from_float(b)
num = str(float(a*b)).split('.')
print(num[0])

Submission status: Wrong Answer

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

print(int(a*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:
import math

af, bf = map(float, input().split())
a = int(af)
bi = int(bf * 100)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a=round(a,2)

print(int(a*b))

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
s=input()
l=s.split()
n=int(l[0])
p=float(l[1])
t=int(n*p)
print(t)

Submission status: Wrong Answer

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

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

    print(math.floor(a*b))

Submission status: Wrong Answer

Solution code:
s = list(input().split())
A = float(s[0])
B = float(s[1])
ans = "{:.30g}".format(int(A*B))
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 = 30
	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 = map(str, input().split())
a = int(a)
b = int(float(b)*100)
print((a*b)//100)

Submission status: Wrong Answer

Solution code:
a=input().split()
A=int(a[0])
B=float(a[1])
B_int=int(B)
B_float=int(B*100-int(B)*100)
#print(B_float)

ans=A*B_int+(A*B_float)//100
#print(A*B_int,(A*B_float)//100)
print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import fractions
import decimal

a,b = list(map(float,input().split()))
a = int(a)
b = decimal.Decimal(b)
print(int(a*b))

Submission status: Wrong Answer

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

a_1 = int(a)
a_10 = a_1 // 10
a_100 = a_1 // 100

b_1 = int(b[0])
b_10 = int(b[2])
b_100 = int(b[3])

ans = a_1 * b_1
ans += (a_1 * b_10) // 10
ans += (a_1 * b_100) // 100

print(ans//100)

Submission status: Wrong Answer

Solution code:
import sys
#import time
import copy
#from collections import deque, Counter, defaultdict
#from fractions import gcd
#import bisect
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
inf = 10**20
ri = lambda : int(input())
rs = lambda : input().strip()
rl = lambda : list(map(float, input().split()))
a,b = rl()

a_small=a%100
a_big =(a-a_small)/100
print(int(a_big*(b*100))+int(a_small*b))

Submission status: Wrong Answer

Solution code:
l=input().split()
a=l[0]
aa='0'*(15-len(a))+a
al=int(aa[0:7])
ar=int(aa[7:])
b=int(float(l[1])*100)
ans=ar*b
ans+=al*b*(10**8)
print(ans//100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
N, M = input().strip().split()
N, M = [int(N), float(M)]
print(math.floor(N*M))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(C)

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c=a*b
c=int(c)

print(c)

Submission status: Wrong Answer

Solution code:
import math
import numpy as np
a,b = map(float,input().split())
if (a > 99):
    print(np.multiply(a,b))
else:
    print(math.floor(np.multiply(a,b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

sum = A*B

print(math.floor(A*B))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

mult=math.floor(A*B)

print(mult)