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 = list(input().split())
print(math.floor(int(A[0]) * float(A[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():
	A,B  = map(float, input().split())

	ans = A*B

	print(int(ans))



def factorize(n):
    fct = []  # prime factor
    b, e = 2, 0  # base, exponent
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct



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

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

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

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

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

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

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

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

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


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

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

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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,m = input().split()

p = int(n)*float(m)


if p == 0:
    print(0)
else:
    print(int(p//1))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, math
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    A, B = LF()

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

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
import math

a,b = map(float,input().split())
a = int(a)
b = float('{:.2f}'.format(b))
k = a*b

print(math.floor(k))

Submission status: Wrong Answer

Solution code:
import math

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

# A *= 100
B *= 100

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

print(floored)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = input().split()
A = int(A)
BB = [int(B[0]),int(B[2]),int(B[3])]
SUM = [A*B for B in BB]
print(SUM[0] + int(SUM[1]/10) + int(SUM[2]/100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if ans-int(ans) > 0.999:
    print(int(ans+0.0001))
else:
    print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = int(a*b_int+(a*b_frac)/100)
  
print(ans)

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

c =int(b*100)
d = a*c
e = d//100
print(int(e))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = [float(i) for i in input().split()]
A = int(A)
a = int(B)
b = int(10*B)-10*a
c = int(100*B)-100*a - 10*b
T = (A*b)%10
Y = (A*c)%100
U = (Y+(10*T))//100
ans = A*a
ans += (A*b)//10
ans += (A*c)//100
ans += U
print(ans)
print((A*a) + ((A*b)//10) + ((A*c)//100) + U)

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(str, input().split())
A = int(A)
B = float(B)
B *= 100
ans = A * B


print(int(ans/100))

Submission status: Wrong Answer

Solution code:
import math

sAB = input().split()

sAB[0] = int(sAB[0])
sAB[1] = float(sAB[1])

ans = math.floor(sAB[0] * sAB[1])

print(ans)

Submission status: Wrong Answer

Solution code:
import math
N,K=map(float,input().split())
print(format(N*K, '.0f'))

Submission status: Wrong Answer

Solution code:
import math

input_list = input().split()
A = int(input_list[0])
B = round(float(input_list[1]), 2)

print(math.floor(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor
n, m = input().split()
n = int(n)
m = float(m)
ans = n*m
print(floor(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
   
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a,b=map(str,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())

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

Submission status: Wrong Answer

Solution code:
import math
import decimal

a, b = input().split()
a = decimal.Decimal(a)
b = decimal.Decimal(b)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a, b = map(float,input().split())
sub = b - int(b)
n = int(int(a) * sub)
m = int(b) * int(a)

print(n + m)

Submission status: Wrong Answer

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

print(int(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

m=int(y[0])
k=float(y[1])

l=m*k
l=int(l)

print(l)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

b_list = b.split(".")
b_int = b_list[0] + b_list[1]

ab = int(a) * int(b_int)

print(int(ab/100))

Submission status: Wrong Answer

Solution code:
import sys
import math

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

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

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

t = math.floor((a * b) // 100)

print(t)

Submission status: Wrong Answer

Solution code:
from collections import defaultdict, deque
import math
import sys

INF = float('inf')
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


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

Submission status: Wrong Answer

Solution code:
import decimal
import math

nums = input().split()
a = int(nums[0])
b = float((nums[1]))
result = a * b
print(math.floor(result))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, io, os, re
import bisect
from pprint import pprint
from math import sin, cos, pi, radians, sqrt, floor
from copy import copy, deepcopy
from collections import deque
from fractions import gcd
from functools import reduce

def array1(n): return [0] * n
def array2(n, m): return [[0] * m for x in range(n)]
def array3(n, m, l): return [[[0] * l for y in xrange(m)] for x in xrange(n)]

arr = list(map(float, sys.stdin.readline().strip().split()))
print(int(floor(arr[0]*arr[1])))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys
import math
from collections import deque as deq

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

print(math.floor(A * B))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

L, R = map(float, input().split())
ans = math.floor(L * R)
print(ans)

Submission status: Wrong Answer

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

result = int(a) * float(b)

print(int(result))

Submission status: Wrong Answer

Solution code:
l=list(input().split())
x=int(l[0])
y=float(l[1])
ans=int(y*x)
print(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
from decimal import *

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

    a = Decimal(int(a))
    b = Decimal(b)

    print(Decimal(floor(a*b)))
            
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

print(a*b//100)

Submission status: Wrong Answer

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

print(int(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ab = 1
for i, s in enumerate(b.replace('.', '')):
    bi =  int(s) * 10 ** (2 - i)
    ab += a * bi
print(ab // 100)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
import sys
sys.setrecursionlimit(10**9)
from collections import deque,defaultdict
import heapq
from itertools import combinations
import bisect

a,b=map(str,input().split())
a=int(a)
b=list(b)
ans=a*int(b[0])
ans+=int(b[2])*ans//10
ans+=int(b[3])*ans//100

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print('{}'.format(int(a * b)))

Submission status: Wrong Answer

Solution code:
import math

if __name__ == "__main__":
    A, B = [float(a) for a in input().split()]
    ans = A*B
    ans = math.floor(ans)
    print(ans)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math

sys.setrecursionlimit(10**7)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
num = list(map(float,input().split(' ')))
print(int(num[0] * num[1]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#C - Multiplication 3
A,B= map(float,input().split())
A = A/10000000
B = B*100

print(int(A*B*100000))

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint

INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

def I():
    return int(input())

def MI():
    return map(int,input().split())

def RI():
    return list(map(int,input().split()))

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

import math

a,b = MS()

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

c = a * b
# print(c)

d = str(c)
# print(d)

e = d[:-2]
if len(e)==0:
    print(0)
else:
    print(e)

Submission status: Wrong Answer

Solution code:
import math


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

    print(int(ans))


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def solve(a,b):
    bint = int(b * 100)
    res = 0

    k = a % 100
    a = a // 100
    res += int(k*b)

    tmp = 1
    while a > 0:
        k = a % 10
        a = a // 10

        res += k*bint*tmp
        
        tmp = tmp * 10

    return res

if __name__ == '__main__':
    a,b = map(float,input().split())
    a = int(a)
    print(solve(a,b))

Submission status: Wrong Answer

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

print(D)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

x=a*b

import math
print(math.floor(x))

Submission status: Wrong Answer

Solution code:
import math


AB = list(map(float, input().split()))
A = int(AB[0])
B = AB[1]

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

Submission status: Wrong Answer

Solution code:
A, B = input().split()
A = int(A)
B = float(B)
if A == 0 or B == 0.:
    print(0)
else:
    x, y = B.as_integer_ratio()
    print(A * x // y)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *
import math

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

a = Decimal(A*B)

print(math.trunc(a))

Submission status: Wrong Answer

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

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
import math

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

i=input()

a,b=i.split(' ')
a_=int(a)
b_=float(b)
import math
print(math.floor(a_*b_))

Submission status: Wrong Answer

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

from decimal import Decimal
from fractions import Fraction
import math
ans = int(a) * int(b*100)
#print(ans,int(a),int(b*100))
#Decimal.from_float(a)*Decimal.from_float(b)
print(int(ans/100))

Submission status: Wrong Answer

Solution code:
import math
def main():
    A,B = input().split()
    A = int(A)
    B = int(B[0])+int(B[2:4])*(10**(-2))
    print(math.floor(A*B))

main()

Submission status: Wrong Answer

Solution code:
X = input().split()
A = int(X[0])
B = float(X[1])
ab = int(A*B)
print(ab)

Submission status: Wrong Answer

Solution code:
import math
#import math
#a,b=map(float,input().split())
#print(math.floor(a*b))
a,b=map(str,input().split())
ia=int(a)
ib=float(b)*100
b=float(b)
ans=0
count=0
for i in a:
  count+=1
  ans+=int(i)*b*10**(len(a)-count)
print(int(ans))
#t=ia*ib
#print(int(t//100))

#9990000000567322

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import numpy as np

def main():
    #n = int(input())
    a = list( map( float, input().split()))
    s = a[1]*100*a[0]/100
    print(math.floor(s))
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c=int(c)
print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

a*=b

print(math.floor(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools



sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]

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


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

Submission status: Wrong Answer

Solution code:
import math
data = input().rstrip().split(" ")
A = int(data[0])
B = round(float(data[1])*100)
calc = A*B
ans = str(calc)
k = len(ans)-2
print(ans[0:k])

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

Submission status: Wrong Answer

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