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 sys
from io import StringIO
import unittest
import math

def resolve():
    # s = input()
    # n = int(input())
    a, b = map(float, input().split())
    # l = [list(map(int, input().split())) for _ in range(n)]

    print(math.floor(a * b))

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """198 1.10"""
        output = """217"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """1 0.01"""
        output = """0"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """1000000000000000 9.99"""
        output = """9990000000000000"""
        self.assertIO(input, output)


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

A,B = map(float,input().split())
A = int(A)
i = int(B)
f = round(B-i,2)
ans = A*i + math.floor(A*f)
print(ans)

Submission status: Wrong Answer

Solution code:
# env/bin/local python3

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)*1000
ans = a*b
print(int(ans/1000))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/bin/python3

import sys
input = sys.stdin.readline

def main():
  a, b = list(map(float, input().strip().split()))
  result = int(a * b)
  print(result)

main()

Submission status: Wrong Answer

Solution code:
# coding:utf-8
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 = map(float, input().split())
 
print(int(a * b))

Submission status: Wrong Answer

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

a = int(a)
b = b * 100

res = (a * b) // 100
res = str(res)
n = len(res)
ans = res[0:n-2]

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
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= map(float, input().split())
print(int(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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


times = 0
if "." in b:
    if b[-2] == ".":
        times = 10
    elif b[-3] == ".":
        times = 100

b = float(b)
b *= times
b = int(b)

ans = str(a*b)

if times == 10:
    if len(ans) < 2:
        ans = 0
    else:
        ans = ans[0:-1]
elif times == 100:
    if len(ans) < 3:
        ans = 0
    else:
        ans = ans[0:-2]

print(int(ans))

Submission status: Wrong Answer

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

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 decimal

a, b = map(str, input().split())
a = decimal.Decimal(a)
b = decimal.Decimal(b)
print(a, b)
ans = a * b
ans = math.floor(ans)
print(int(ans))

Submission status: Wrong Answer

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools import reduce
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7

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

    a = int(a)
    b = b * 100

    ans = a * b

    ans = int(ans)

    print(floor(ans/100))
            
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

n, m = map(float, input().split())
print(int(math.floor(n*m)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

def resolve():
    A, B = [float(i) for i in input().split()]
    print(math.floor(A*B))

resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = map(float, input().split())
C = A * B * 100
strC = str(int(C))
print(strC[:-2])

Submission status: Wrong Answer

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

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

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():
	s  = inputStr()
	s = s.split()

	ans = int(float(s[0])*float(s[1]))

	print(ans)



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# 2分検索のリバース
def bisect_left_reverse(a, x):
    if a[0] <= x:
        return 0
    if x < a[-1]:
        return len(a)
    # 二分探索
    ok = len(a) - 1
    ng = 0
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if a[mid] <= x:
            ok = mid
        else:
            ng = mid
    return ok

def bisect_right_reverse(a, x):
    if a[0] < x:
        return 0
    if x <= a[-1]:
        return len(a)
    # 二分探索
    ok = len(a) - 1
    ng = 0
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if a[mid] < x:
            ok = mid
        else:
            ng = mid
    return ok

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# 2分検索
# 存在しない場合: None 存在する場合: その値
def binary_search(list, item):
    low = 0
    high = len(list) - 1

    while low <= high:
        mid = (low + high) //2
        guess = list[mid]
        if guess == item:
            return mid
        if guess > item:
            high = mid -1
        else:
            low = mid + 1
    return None

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# N 個のボールを K グループに分ける場合のパターン数
def sunuke(N, K, mod=10**9+7):
	if N < K or K-1 < 0:
		return 0
	else:
		return combination(N-1, K-1, mod)

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)


class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# dfs のサンプル
def dfs(graph,parent,counter,edge):
    stk = []
    stk.append(edge)
    while len(stk) > 0:
        p = stk.pop()
        for e in graph[p]:
            if parent[p] == e:
                continue
            else:
                parent[e] = p
                counter[e] += counter[p]
                stk.append(e)

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

A, B = [x for x in stdin.readline().rstrip().split()]
a = int(A)
b = float(B)

print(int(a*b))

Submission status: Wrong Answer

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

print(round(a * b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
things = list(input().split())
a = int(things[0])
b = float(things[1])
again = str(a*b)
answer = ""
for x in again:
	if x != ".":
		answer += x
	else:
		break
print(int(answer))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b=map(float,input().split())
aa=str(a*b)
ind=aa.index(".")
print(str(aa)[:ind])

Submission status: Wrong Answer

Solution code:
import numpy as np
import math
import scipy as sp
import queue
import collections

MOD = 10 ** 9 + 7
INF = 10 ** 9

def main(kwargs):
    a = int(kwargs["a"])
    b = kwargs["b"]
    b1 = int(b)
    b2 = int((b - b1) * 100)
    res = a * b1 + a * b2 // 100
    return res

if __name__ == "__main__":
    kwargs = {}

    cin = input().split()
    kwargs["a"], kwargs["b"] = [float(i) for i in cin]

    cout = main(kwargs)
    print(cout)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b=map(float,input().split())
c=list(str(int(a*b*100)))
if len(c)>=3:
  print("".join(c[0:len(c)-2]))
else:
  print(0)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

s = input()
a, b = s.split()
#a = int(a)
#b = float(b)

print(Decimal(a) * Decimal(b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
nums = []
nums = input().split(" ")

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

sys.setrecursionlimit(10**9)
a,b=map(float,input().split())
temp=a*(b*100)
print(int(temp//100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=list(map(float,input().split()))
a=l[0]
b=l[1]
p = a * b
q=str(p)
w=q.split('.')
print(w[0])

Submission status: Wrong Answer

Solution code:
import math

def main():
    A,B = [float(x) for x in input().split()]
    print(math.floor(A*B))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

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

print(math.floor(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(A*B//100)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import math
a, b = map(float, input().split())
print(math.floor(a * b))

Submission status: Wrong Answer

Solution code:

def main():
    #s = input().split()
    #*A, = map(int, input().split())
    n, m = map(float, input().split())
    print(int(n*m))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

print(int(a * b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline

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

B = float(B)
ans = 0
N = len(A)
shosu = 0
for i in range(N):
    ans += int(int(A[i])* 10**(N-1-i) * B)//1 
    if i>=N-2:
        temp = int(A[i])* 10**(N-1-i)*B
        shosu +=  temp - temp//1

ans += shosu//1
print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math

readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prl = lambda x: print(*x ,sep='\n')

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

Submission status: Wrong Answer

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


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

    A = int(A)
    B = int(B*100)

    res = A * B // 100

    print(res)



main()

Submission status: Wrong Answer

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

print(int(int(A) * float(B)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

def main():
  a, b = input().split()
  a = int(a)
  b = float(b)
  
  from math import floor
  
  print(floor(a*b))
    


if __name__ == "__main__":
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

b, c = divmod(b, 1)
b = int(b)

ans = a * b
i = int(a * c)
print(int(ans + i))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
a, b = map(float, input().split())
a = int(a)
b1 = int(b)
b2 = int(b*10 % 10)
b3 = int(b*100 % 10)

print(int(a*b1+a*b2*0.1+a*b3*0.01))

Submission status: Wrong Answer

Solution code:
import math
X = input().split()
A = int(X[0])
B = int(float(X[1]) * 100)

print( (A *B) // 100)

Submission status: Wrong Answer

Solution code:
A,B=input().split(" ")
A=int(A)
B=float(B)
mul=A*int(B)
B=B%1
mul+=int(A*B)
print(mul)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = list(input().split(" "))
A = float(L[0])
B = float(L[1])
print(int(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__=='__main__':
    main()

Submission status: Wrong Answer

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

import math
import sys

def main():
    a,b = map(float,input().split())
    ans = a*b
    print(math.floor(ans))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
ls = list(input().split())
a = int(ls[0])
b = float(ls[1])
b_ = int(b * 100)
ans = (a * b_) // 100

print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    from math import floor
    A, B = (float(i) for i in input().split())
    a = floor(A)
    b = floor(B * 100)
    print(floor(a*b/100))


if __name__ == '__main__':
    main()

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 bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(float,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

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

Submission status: Wrong Answer

Solution code:

def q3():
    import math
    a, b = [float(i) for i in input().split(" ")]
#    print(math.floor(a * b))
    print(int(a * b // 1))


q3()

Submission status: Wrong Answer

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

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

print(int(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())
a = int(a)
print(int(math.floor(a*b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding:utf-8
import math

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

print(A*B)

print(math.floor(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor
A, B = map(float, input().split())
ans = ""
for a in str(A*B):
    if a == ".":
        print(ans)
        exit()
    else:
        ans += a
print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
A, B = [s for s in input().split()]
A = int(A)
B_int = int(float(B))
B_f = float(B) - float(B_int)
print(A * B_int + int(A * B_f))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b=input().split()
a=int(a)
b=int(b.replace(".",""))
print(str(a*b)[:-2])

Submission status: Wrong Answer

Solution code:
import math

A, B = [float(i) for i in input().split(' ')]
print(math.floor(A * B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math
def get_array(): return list(map(int,sys.stdin.readline().strip().split()))
def get_ints(): return map(int,sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
a,b=input().split()
e=int(a)
f=float(b)
c=e*f 
d=math.trunc(c)
print(d)

Submission status: Wrong Answer

Solution code:
import math

def main():
    a, b = input_list()
    print(int(a*b))

def yogen(a, b, angle):
    coss = math.cos((angle/180)*math.pi)
    return math.sqrt(a**2 + b**2 - 2*a*b*coss)


def get_angle(hour, minute):
    h = (hour * 360) / 12 + (minute * 360) / (12 * 60)
    m = (minute * 360) / 60
    angle = abs(h-m)
    return min(angle, 360-angle)

def has(v, l):
    for vl in l:
        if v == vl:
            return True
    return False

def input_list():
    return list(map(float, input().split()))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

ans = a*b*100

print(int(math.floor(ans/100)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np


def main(A, B):

    ans = A*B
    ans =ans//100
    return ans


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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import math
a, b = input().split()
a = int(a)
b = float(b)

s_a = list(str(a))[::-1]

keta = 1
ans = 0.0
for n in s_a:
    ans += int(n) * keta * b
    keta *= 10


print(math.floor(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(A * B))

Submission status: Wrong Answer

Solution code:
def main():
    from builtins import int, map, list, float, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    A, B = input_list()
    a = int(A)
    B = float(B)
    b = int(B*100)
    ans = a*b
    ans = str(ans)
    ans = ans[:-2]
    print(ans)
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

result = math.floor(a*b)

print(result)

Submission status: Wrong Answer

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

print((a*b)//100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Wrong Answer

Solution code:
import math

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

ans = a*b

print(math.floor(ans))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(int(float(A)*float(B)))

Submission status: Wrong Answer

Solution code:
import math

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

ans = math.floor(a*b)

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
sys.setrecursionlimit(10 ** 9)
def main():
    a, b = map(float, input().split())
    count = 0
    a = int(a)
    while b != int(b):
        b *= 10
        count += 1
    b = int(b)
    ans = (a * b) / (10 ** count)
    print(int(ans))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

print(int(A*B/100))

Submission status: Wrong Answer

Solution code:
import math

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

print(int(a*b))

Submission status: Wrong Answer

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

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

ans = math.floor(a*b)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
from  decimal import *
a, b = input().split()
a, b = int(a), float(b)
print(int(Decimal(a) * Decimal(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 = list(map(float, input().split()))
print("{}".format(int(A*B)))

Submission status: Wrong Answer

Solution code:
import math
s = input()
s = s.replace(' ', '*')
ans = eval(s)
print(math.floor(ans))

Submission status: Wrong Answer

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