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:
# -*- coding: utf-8 -*-
import numpy as np
from collections import deque
import collections
import heapq

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

main()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor

a, b = input().split()
if '.' in a:
    a = float(a)
else:
    a = int(a)
if '.' in b:
    b = float(b)
else:
    b = int(b)
ans = a*b
print(floor(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
#from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(float, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

a, b = MAP()
aa = int(a)
bb = int(b)
bbb = int(b * 100 - bb * 100)
ans = aa * bb + int(aa * bbb / 100)
print(ans)

Submission status: Wrong Answer

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

print(int(a * b))

Submission status: Wrong Answer

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

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

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())
a = int(a)
b = int(b * 100)
ans = str(a * b)
if len(ans) <= 2:
    print(0)
else:
    print(ans[:-2])

Submission status: Wrong Answer

Solution code:
import sys
from decimal import *
import math

sys.setrecursionlimit(10 ** 7)

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

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

getcontext().prec = 10 ** 8

ANS = Decimal(A) * Decimal(B)
print((math.floor(ANS)))

Submission status: Wrong Answer

Solution code:
# 2106~2108
A,B=input().split()
A = int(A)
B = float(B)
print(int(A*B))

Submission status: Wrong Answer

Solution code:
#! /usr/bin/env python3

import math


if __name__ == "__main__":
    a,b = map(float,input().split())
    print(math.floor(a*b))

Submission status: Wrong Answer

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


def solve(a, b):
    return int(a * b)


print(solve(a, b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import os
import sys
from io import BytesIO, IOBase


def main():
    a,b = input().rstrip().split()
    a = int(a)
    b = float(b)
    res = a*b
    pos = str(res).index('.')
    res = str(res)
    print(res[:pos])

#.........................................FAST INPUT OUTPUT.......................................
BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

#....................................END OF FAST I/O............................................

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from functools import lru_cache
import math 
#read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**6)
def read():
  return float(readline())
def reads():
  return map(float, readline().split())
def mp(arg):
  return map(int,arg.split())
a,b=reads()
m=a*b
print(math.floor(m))

Submission status: Wrong Answer

Solution code:
from decimal import Decimal,getcontext
getcontext().prec = 200
A = list(map(float,input().split()))
print(int(Decimal(A[0]*A[1])))

Submission status: Wrong Answer

Solution code:
def resolve():
    import sys
    input = sys.stdin.readline
    # 整数 1 つ
    # n = int(input())
    # 整数複数個
    a, b = map(float, input().split())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    print(int(a*b))


resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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+0.0000001))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = [i for i in input().split()]

A = int(A)
B = float(B)
Bi = int(B)
bb = B-int(B)

print(int(A*Bi)+A*int(bb*100)//100)

Submission status: Wrong Answer

Solution code:
import math
a,b = map(float,input().split())
b *= 100
print(math.floor((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:
"""    Arnab Chanda    """

from collections import defaultdict, deque
from itertools import permutations
from sys import stdin,stdout
from bisect import bisect_left, bisect_right
from copy import deepcopy
import heapq

int_input=lambda : int(stdin.readline())
string_input=lambda : stdin.readline().split()
multi_int_input =lambda : map(int, stdin.readline().split())
multi_input = lambda : stdin.readline().split()
list_input=lambda : list(map(int,stdin.readline().split()))
string_list_input=lambda: list(string_input())
MOD = pow(10,9)+7


a, b = multi_input()

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

c = a*b

print(int(c))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(float, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))
import math
A, B = mi()
A = int(A)
print(math.floor(A*B))

Submission status: Wrong Answer

Solution code:
import itertools
import copy
from collections import deque
import heapq
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 = math.floor(A*B)
print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    A, B = map(float, readline().split())
    print(math.floor(A*B))
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
A, B = map(float, input().split())
ans = list(str(A * B))
dot = ans.index(".")
print("".join(map(str, ans[:dot])))

Submission status: Wrong Answer

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

s = a*b
s -= s%1

print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
'''
a=10**15
b=9.99
'''
a,b=map(float,input().split())
num=a*b
num=math.floor(num)
print(num)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")
import math


def main():
    A, B = input().split()
    A = int(A)
    B1, B2 = map(int, B.split("."))

    tot = A*B1
    tot += int((A*B2)/100)
    print(tot)

    return


if __name__ == '__main__':
    main()

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

A, B = map(float, input().split())
if A == 0 or B == 0:
    print(0)
else:
    b, B = math.modf(B)
    temp = int(A * b)
    print(temp + int(A) * int(B))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys, random, math
from bisect import bisect_left, bisect_right
input = sys.stdin.readline

def main():
    inf = 10 ** 20

#    t = int(input())
#    t, a, b = map(int, input().split())
    t = 1
    
    for _ in range(1, t+1):
    #    print("Case #{}: ".format(_), end = '')
        
        a, b = map(float, input().split())
        a = int(a * 100)
        b = int(b * 100)
        print((a*b//10000))
        
main()

Submission status: Wrong Answer

Solution code:
A,B=map(float,input().split())
k=int(A*B)
s=[]
while(k>0):
    s.append(str(k%10))
    k=k//10
x=''
for i in range(len(s)-1,-1,-1):
    x+=s[i]
print(x)

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

Submission status: Wrong Answer

Solution code:
import sys
import math

def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

def LF(): return list(map(float,sys.stdin.readline().rstrip().split()))

A,B = LF()

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

Submission status: Wrong Answer

Solution code:
a,b = map(float,input().split())
c = a*b%1
s = a*b-c
print(int(s))

Submission status: Wrong Answer

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

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())
print((int(A)*int(B*100))//100)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10000000)
from collections import defaultdict
import math

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

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

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

Submission status: Wrong Answer

Solution code:
import sys

A, B = map(float, sys.stdin.readline().strip().split())
print(int(A*B))

Submission status: Wrong Answer

Solution code:
ma = lambda :map(int,input().split())
ni = lambda:int(input())
import collections
import math
import itertools
gcd = math.gcd
a,b = input().split()
a = int(a)
b100 = int(float(b)*100)
print(int(a*b100//100))

Submission status: Wrong Answer

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

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

c = str(a*bb)
if len(c)>3:
    cc = c[:-2]
else:
    cc = "0"

print(int(cc))

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

a,b = (i for i in input().split())

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

c = a*b
c = int(c)

print(c)

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

print(int(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
from collections import *
from math import *

A, B = map(float, input().split())
#rint(int(A*B))
print(floor(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter 
from collections import defaultdict
from collections import deque
from functools import reduce
import math
import itertools
import heapq
import numpy as np
import bisect
import sys
sys.setrecursionlimit(10**6)


def bfs(s,n,node):
    #頂点が探索済みかどうかのチェック配列
    check=[False for _ in range(n)]
    check[s]=True
    #次見る頂点を格納するキュー
    queue=deque([s])
    visited_num=1

    #問題固有の配列
    #color_check=[[True for _ in range(l)] for _ in range(n)]
    color=[-1 for _ in range(n)]
    color[s]=0
    
    while visited_num<n:
        #グラフが全連結ではない場合
        if len(queue)==0:
            #空配列を返す
            #現状までの計算済み配列を返してもいいと思う
            return color

        now_vertex=queue.popleft()
        #インデックスがない場合は
        for next_vertex in node[now_vertex]:


            if check[next_vertex]==True:
                continue

            queue.append(next_vertex)
            check[next_vertex]=True

            #問題固有の計算
            color[next_vertex]=color[now_vertex]+1
            visited_num+=1

    return color

#n=int(input())z
#n,m=list(map(int,input().split()))
#a=list(map(int,input().split()))
ceil=lambda x,y: (x+y-1)//y
input_list = lambda : list(map(int,input().split()))



#n=int(input())
#n,m=input_list()
#a=input_list()
a=input().split()
n=int(a[0])
m=float(a[1])
print(math.floor(n*m))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
INT_MAX=10**11+7
MOD=10**9+7
def INPUT():return list(float(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]
#=======================================================================
#n=int(input())
a,b=INPUT()
print(int(a*b))

Submission status: Wrong Answer

Solution code:
import sys
import math

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

print(math.floor(a * b))

Submission status: Wrong Answer

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

b=int(B*100)
ans100bai=A*b
print(int(ans100bai//100))

# 2darray [[0] * 4 for i in range(3)]

Submission status: Wrong Answer

Solution code:
# 2020/05/31
# AtCoder Beginner Contest 169 - C

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

# Calc
ans = int(a*b)

# Output
print(ans)

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

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


print(math.floor(a*b))

Submission status: Wrong Answer

Solution code:
import math

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

b *= 100

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

print(ans)

Submission status: Wrong Answer

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

if '.' in a:
  a=float(a)
else:
  a=int(a)
  
if '.' in b:
  b=float(b)
else:
  b=int(b)  
print(int(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 = [int(float(i)*100) for i in input().split()]
A //= 100
print((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:
A, B = map(float,input().split(' '))
print(int((A*(B*100))//100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(float, input().split())
import numpy as np

ans = a * b

if int(ans) == ans:
    print(int(ans))
else:
    print(int(np.ceil(ans)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(a*b))

Submission status: Wrong Answer

Solution code:
def resolve():
    a,b = map(float, input().split())
    print((str(a * b)+'.').split('.')[0])


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = input().split()
a = int(a)
b0 = int(b[0])
b1 = int(b[2])
b2 = int(b[3])
print(a * b0 + a // 10 * b1 + a // 100 * b2)

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 sys

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

A, B = read().split()

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

A *= B
print(A // 100)

Submission status: Wrong Answer

Solution code:
# 0や1のケースに注意
# index out of range
# 貪欲

def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    import math
    #from math import gcd

    #inf = 10**17
    #mod = 10**9 + 7

    c = input().rstrip().split()
    a = int(c[0])
    b = float(c[1])
    # b *= 100
    # b = int(b)
    res = a*b*100
    print(int(res//100))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

ans = int(a*b)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print( math.floor(A*B))

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B = sr().split()
A = int(A); B = int(float(B) * 100)
answer = int(A*B//100)
print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
 
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
 
a, b = input().split()
b = float(b)*100
print(int((int(a)*b // 100)))

Submission status: Wrong Answer

Solution code:
import math
from sys import stdin


def get_result(data):
    A, B = data
    return math.floor(A*B)


if __name__ == '__main__':
    data = list(map(float, stdin.readline().rstrip().split(' ')))
    result = get_result(data)
    print(result)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(*args, sep=" ", end="\n"): print("debug:", *args, file=sys.stderr, sep=sep, end=end) if not __debug__ else None
def exit(*arg): print(*arg); sys.exit()
# template

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

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

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

  print(math.floor(A * B))

if __name__ == "__main__":
  main()

Submission status: Wrong Answer

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

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:
a,b=input().split()
b=int(b[:-3])+int(b[-2:])/100
print(int((int(a))*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def mapint_inp():
    return map(int, input().split())

def intinp():
    return int(input())

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

print(int(A*B))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy

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

Submission status: Wrong Answer

Solution code:
import math

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

print(math.floor(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


print(A * B // 100)

Submission status: Wrong Answer

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


if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

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

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 sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
from collections import deque
import itertools
import heapq
#import bisect
from fractions import Fraction
import copy
from functools import lru_cache



def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]

def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)



def main():
    n=list(input().split())
    a=int(n[0])
    b=int(float(n[1])*100)
#    print(a,b)
    ans=a*b//100
    print(ans)










if __name__ == "__main__":

    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(float,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":
    a,b = I2()
    print(int(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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