Problem:


Score : 300 points

Problem Statement

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

Constraints

0 \leq A \leq 10^{15}

0 \leq B < 10

A is an integer.

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

Input

Input is given from Standard Input in the following format:

A B

Output

Print the answer as an integer.

Sample Input 1

198 1.10

Sample Output 1

217

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

Sample Input 2

1 0.01

Sample Output 2

0

Sample Input 3

1000000000000000 9.99

Sample Output 3

9990000000000000



Sample input:
198 1.10


Sample output:
217

Submission status: Wrong Answer

Solution code:
A,B = map(float,input().split())
Aint = int(A)
Bint = int(B*100)
print(int((Aint*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:
def main():
    A, B = map(float, input().split())
    print(int(A * B))
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

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

Submission status: Wrong Answer

Solution code:
import math

a, b = input().split()

print(int(math.floor(int(a)*float(b))))

Submission status: Wrong Answer

Solution code:
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub, or_

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())

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

def read_float():
    return float(input())

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

def read_str():
    return input().strip()

def read_str_n():
    return list(map(str, input().split()))

def error_print(*args):
    print(*args, file=sys.stderr)


def main():
    a, b = read_float_n()
    b100 = math.floor(b * 100)
    print(math.floor(a * b100 / 100))


if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

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

b_first, b_last = [x for x in b.split('.')]
b_last.rstrip('0')
# print(b_first, b_last)

ans = int(a) * int(b_first)

k = (int(b_last) * int(a))/(10 ** len(b_last))
# print(k)

print(ans + int(k))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline
a, b = map(float, input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = map(str, input().split())
A = int(A)
B = float(B)
Ax = A // 100
Ay = A % 100
Bx = B // 1
By = int((B - Bx) * 100)
p = Ax * Bx * 100 + Ax * By + Ay * Bx
q = (Ay * By) // 100
print(int(p + q))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def solve(A: int, B: float):
    b_i = int((B - int(B))*100)
    # print(b_i)
    b = int((A*b_i)//100)
    a = A*int(B) + b
    # print(b)
    print(a)

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = float(next(tokens))  # type: float
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
ab = input().split()
a = int(ab[0])
b = int(float(ab[1])*100)
print(a*b//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

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

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:
from sys import stdin, setrecursionlimit
input = stdin.buffer.readline
setrecursionlimit(10 ** 7)

from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi, radians, sin, cos

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

A, B = input().split()

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

print((A * B) // 100)

Submission status: Wrong Answer

Solution code:
s_in=input().split()
A=int(s_in[0])
B=float(s_in[1])
Bi =int(B*100)

c=A*Bi//100
print(c)

Submission status: Wrong Answer

Solution code:
# C

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

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

Submission status: Wrong Answer

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

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

print(int(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
m, n = input().split()
m = int(m)
n = eval(n)
res = 0
count = 0
while n > 2 ** (-15):
    n_z = int(n)
    n_r = n - n_z
    res = res + (m * n_z)/ pow(10,count)
    n = n_r * 10
    count += 1
print(int(res))

Submission status: Wrong Answer

Solution code:
# import math

i = list(map(float, input().split()))
# print(i)
# print(i[0])
# print(i[1])

A = int(i[0])
B = i[1]
# print(A, B)
print(int(A * B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

result = int(math.floor(float(A * B / 10000.00)))

print(result)

Submission status: Wrong Answer

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

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

int_float = str(A * B).split(".")
print(int(int_float[0]))

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=float(b)
ans=a*b
ans=list(str(ans))
pp=''
for i in ans:
    if i=='.':
        break
    pp+=i

print(pp)

Submission status: Wrong Answer

Solution code:
import math

# for _ in range(int(input())):

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

print(math.trunc(a[0] * a[1]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

ans = str(a*b)
i = ans.find('.')

if i != -1:
  ans = ans[:i]

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def main():
    N = [str(_) for _ in input().split()]
    A = float(N[0])
    B = float(N[1])

    print(int(A*B))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from decimal import Decimal
import math
a, b = map(Decimal, map(float, input().split()))
ans = int(math.floor(a*b))
print(ans)

Submission status: Wrong Answer

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


if __name__ == '__main__':
	main()

Submission status: Wrong Answer

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


print(int(a*b / 100))

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 4100
a, b = map(float, input().split())
a*=b
a=str(a)
for i in a:
    if i=='.':
        break
    print(i, end="")
print()

Submission status: Wrong Answer

Solution code:
import math
a, b = input().split()
n = 2
bb = math.floor(float(b)*10**n) / (10**n)
c = int(a) * bb
cl = list(str(c))
s = ""
for i in range(len(cl)):
    if cl[i] == '.':
        break
    else:
        s += cl[i]
print(s)

Submission status: Wrong Answer

Solution code:
import math
import decimal
import fractions
def main():
    A, B = input().split()
    A = decimal.Decimal(int(A))
    B = decimal.Decimal(float(B)*100)

    print(decimal.Decimal(A*B//100))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def main():
    A, B = map(float, stdin.readline().rstrip().split())
    ans = int((A*B) // 1)
    ans = str(ans)
    for i in range(len(ans)-1):
        print(int(ans[i]),end="")
    print(int(ans[-1]))


main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *
import math

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

Submission status: Wrong Answer

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

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

ab = a * b

AB = str(ab)

if ab < 100:
    print(0)
else:
    print(AB[:-2])

Submission status: Wrong Answer

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


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# import math

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

# print(int(math.floor(aa * b)))
print(int(aa * b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b = [float(i) for i in 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:
import sys
import math 
input = lambda : sys.stdin.readline().strip()
a,b = map(float,input().split())
print(int(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l = list(str(b))
t=0
for i in range(len(l)):
    if l[i] == ".":
        t = i + 1
t = len(l) - t

b *= (10 ** t)
b = int(b)
a = int(a)

l = list(str(a * b))

import sys
if l[:len(l) - t]:
    [sys.stdout.write(i) for i in l[:len(l) - t]]
    print("")
else:
    print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
ab = input().split()
a = int(ab[0])
b = float(ab[1])
print(int(a*b//1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X,Y=input().split()
 
print(int(int(X)*float(Y)))

Submission status: Wrong Answer

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

print(int(sum))

Submission status: Wrong Answer

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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


    print(int(A*B))

if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math

x = input().split(' ')
paramA = int(x[0])
paramB = int(x[1].replace('.', ''))
if x[0] == '0' and x[1] == '0.00':
    print(0)
else:
    print(math.floor(paramA * paramB / 100))

Submission status: Wrong Answer

Solution code:
a = input()
lis = a.split()
inp = list()
d = 1
for i in lis:
    d *= (float)(i)
d *= 100
print(int(d // 100))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
a, b = map(float, input().split())
a = int(a)
b = int(b*100)
c = a*b
print(c//100)

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
L,R=map(str,(input().split()))
L=int(L)
R=float(R)*100
# temp_ans=Decimal(L)*Decimal(R)
# print(int(int(temp_ans)//1))
print(int(L*R//100))

Submission status: Wrong Answer

Solution code:
#from pprint import pprint
#from collections import deque
#from collections import defaultdict
#from collections import Counter
#from copy import deepcopy
#from itertools
#from bisect import bisect_right #二分探索用のモジュール bisect_right(a_list,value)

#import sys 
#sys.setrecursionlimit(N) #N回まで再起を許可する。

# = map(int,input().split())

# = list(map(int,input().split()))

# = [list(map(int,input().split())) for _ in range(XXXX)]

a,b = input().split()

a = int(a)
b = float(b)
b_seisu = int(b)
b_syosu = int((b - b_seisu)*100)


seisu = a * b_seisu
syosu = a * b_syosu // 100

print(seisu+syosu)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

ans = math.floor(a*b)

print(ans)

Submission status: Wrong Answer

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

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

ans = str(tmpA*tmpB)

ans=ans[:len(ans)-2]

if len(ans)==0:
    ans=0

print(ans)

Submission status: Wrong Answer

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

ans = a*b*100

print(int(ans//100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

if len(ans) > 2:
    print(int(ans[:-2]))
else:
    print(0)

Submission status: Wrong Answer

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


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

#.........................................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:
from math import trunc
things = list(input().split())
a = int(things[0])
b = float(things[1])
print(trunc(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

i = list(map(float, input().split()))
  
a=i[0]
b=i[1]

print(int(a*b))

Submission status: Wrong Answer

Solution code:
import math

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

if whole == 0 or dec == 0.0:
    print(0)
else:
    print(math.trunc(whole*dec))

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
# Code for C - Multiplication 3
# Use input() to fetch data from STDIN
from math import floor

[astr, bstr] = list(input().split())

a = int(astr)
[b1str, b2str] = bstr.split(".")

b1 = int(b1str) * 100
b2 = int(b2str)

print(floor(a * (b1 + b2) / 100))

Submission status: Wrong Answer

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

import math

B = int(B*100)

#print(B)
#print(int(A))

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

mul = A * B
#print(mul)
C = int(mul)
print(C)

Submission status: Wrong Answer

Solution code:
def abc169_c():
    sin = input().split()
    A = int(sin[0])
    B = float(sin[1])
    B1 = int(100 * B)
    ans = (A * B1) // 100
    print(ans)

abc169_c()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# ABC169 C Multiplication 3

a, b = map(lambda x: int(x.replace(".","")), input().split())

print(int(a*b/100))

Submission status: Wrong Answer

Solution code:
from fractions import Fraction
a, b = map(float, input().split())
a = Fraction(a)
b = Fraction(b)

print(a*b//1)

Submission status: Wrong Answer

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

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:
# -*- 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 = int(A)*B
	ans = str(ans)
	a = ans.split(".")

	print(a[0])



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:


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

a = int(a)

c = a*b

print(int(c))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor


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

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

    print(str(a*b).split(".")[0])


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

C = int(A * B * 100)


print(C // 100)

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

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

res = a * b
res = str(res)
n = len(res)

if n < 3:
    print(0)
else:
    ans = res[0:n-2]
    print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
 
#  = input()
#  = int(input())
a, b  = map(float, input().split())
#  = list(map(int, input().split()))
#  = [int(input()) for i in range(N)]
#
# c = collections.Counter()

print(int(int(a) * b))

Submission status: Wrong Answer

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