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
# Your code here!

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

Submission status: Wrong Answer

Solution code:
import math
#=input()
#=int(input())
a,b=map(float,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]

print(math.floor(a*b))

Submission status: Wrong Answer

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

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

# print(a)
# print(b)

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

print((a * b) // 100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
MOD = 10**9 + 7


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = map(float,input().split())
import math
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:
M,N = input().rstrip().split(" ")
M = int(M)
N = float(N)
N = int(N * 100)
print(int(N * M / 100))

Submission status: Wrong Answer

Solution code:
def main():
    a=input().split()
    print(int(int(a[0])*float(a[1])))
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(a*b))

Submission status: Wrong Answer

Solution code:
import sys
import math

if(__name__ == "__main__"):


    AList_Str = input().strip().split()
    A = float(AList_Str[0])
    B = float(AList_Str[1])
    Multiply = math.floor(A*B)
    print(Multiply)

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

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

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
A,B = [float(hoge) for hoge in input().split()]
A = int(A)
B *= 100
B = int(B)
ans = str(A*B)
X = "".join(ans[:len(ans)-2])
if X:
    print(X)
else:
    print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Wrong Answer

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

a, b = input().split()

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

print(int(a*b))

Submission status: Wrong Answer

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

print(int(a*b/100))

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

Submission status: Wrong Answer

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

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

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
# N = int(input())
A, B = [float(i) for i in input().split()]
print(math.floor(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = a * b // 100

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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*B//1))

Submission status: Wrong Answer

Solution code:
def resolve():
    import math

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

resolve()

Submission status: Wrong Answer

Solution code:
from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  ##list(chain.from_iterable(l)) ##flatten
from heapq import heappush, heappop
import bisect

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

ans = int(A * B)

print(ans)

Submission status: Wrong Answer

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

print((A*B)//1)

Submission status: Wrong Answer

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

ans = a * b

print(np.ceil(ans))

Submission status: Wrong Answer

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

print(int(a*b))

Submission status: Wrong Answer

Solution code:
import sys


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)
print(math.floor(A*B))

Submission status: Wrong Answer

Solution code:
def main():

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

if __name__ == '__main__':
    print(main())

Submission status: Wrong Answer

Solution code:
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8


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

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

    return ab100 // 100


print(main())

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

li = [float(s) for s in input().split()]

print(math.floor(li[0]*li[1]))

Submission status: Wrong Answer

Solution code:
a=int(eval(input().replace(" ","*")))
print(a)

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(str, input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = input().split()
tmp = ''
for i in range(len(B)-3):
    tmp += B[i]
print(int(int(A)*int(tmp)+int(A)*(int(B[-2]+B[-1])/100)))

Submission status: Wrong Answer

Solution code:
import numpy as np


def main(A, B):
    ans = int(A*B)
    return ans


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#n = int(input())
#a,b = map(int,input().split())
#a_L = list(map(int,input().split()))

#n = int(input())
a,b = map(float,input().split())
b = b*100
#a_L = list(map(int,input().split()))

print(int(a*b/100))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=input().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(' '))
print(int((A*B*100)//100))

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:
A, B = [ float(i) for i in input().strip().split(' ')]
print(int(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

print(D)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def readInt():
    return list(map(float, input().split()))

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

Submission status: Wrong Answer

Solution code:
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


# 処理内容
def main():
    A, B = map(float, input().split())
    A = int(A)
    B = int(B*100)

    print((A*B) // 100)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
a, b = map(float, input().split())
print(int(a*b))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(math.floor(a*b))

Submission status: Wrong Answer

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

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:
date0=input().rstrip().split(" ")
print(int(int(date0[0])*float(date0[1])))

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

Submission status: Wrong Answer

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

print(math.floor(a*b))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
N, K = map(float, input().split())

print(math.floor(N*K))

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


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

    print(math.floor(A * B))

resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:


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

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



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# Contest No.: ABC169
# Problem No.: C
# Solver:      JEMINI
# Date:        20200531

import sys
import heapq

def main():
    a, b = map(str, sys.stdin.readline().split())
    a = int(a)
    b = float(b)
    ans = a * b
    print(int(ans))
    return

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
A,B = list(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 = int(float(B) * 100)
# print('B', B)
print((A * B) // 100)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:

from math import floor

def parse():
  return map(float, input().split(" "))

def main():
  A, B = parse()
  print(floor(A * B))

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:
a,b=map(float,input().split())
s=str(int(a*(b*100)))
#print(int(a*(b*100)))
print(int(a*(b*100))//100)

Submission status: Wrong Answer

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

a = Decimal(a)
b = Decimal(b)
print(math.floor(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue

sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7

ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))


# ===CODE===


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

    ans = (a * b) // 100

    print(ans)


if __name__ == '__main__':
    main()

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*bb)+A*int(Bi*100)//100)

Submission status: Wrong Answer

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div
# endregion
A, B = rf_()
ans = int(A * B)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(A * B))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(math.floor(ab[0]*ab[1]))

Submission status: Wrong Answer

Solution code:
import math
N, M = input().split(" ")

X = int(N)
Y = float(M)
print(math.floor(X * Y))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
import math
a,b = input().split()
a = int(a)
b = float(b)
res = a * b
print(math.floor(res))

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import sys
#import numpy as np
import math
#from fractions import Fraction
#import itertools
#from collections import deque
#import heapq
#from fractions  import gcd
input=sys.stdin.readline
a,b=input().split()
a=int(a)
b=float(b)
print(math.floor(a*b))

Submission status: Wrong Answer

Solution code:
inputs = input().split(" ")

product = int(inputs[0])*float(inputs[1])
print(int(product))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# Problem C - Multiplication 3

import math

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

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

# output
print(ans)

Submission status: Wrong Answer

Solution code:
from math import floor

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

print(floor(A * B))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
readline=sys.stdin.readline
 
A,B=readline().split()

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

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(float, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B = MAP()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
## necessary imports
# import sys
# input = sys.stdin.readline
# from math import ceil, floor;

# swap_array function
def swaparr(arr, a,b):
    temp = arr[a];
    arr[a] = arr[b];
    arr[b] = temp

## gcd function
def gcd(a,b):
    if a == 0:
        return b
    return gcd(b%a, a)

## nCr function efficient using Binomial Cofficient
def nCr(n, k): 
    if(k > n - k): 
        k = n - k 
    res = 1
    for i in range(k): 
        res = res * (n - i) 
        res = res / (i + 1) 
    return int(res) 

## upper bound function code -- such that e in a[:i] e < x;
def upper_bound(a, x, lo=0):
    hi = len(a)
    while lo < hi:
        mid = (lo+hi)//2
        if a[mid] < x:
            lo = mid+1
        else:
            hi = mid
    return lo

## prime factorization
def primefs(n):
    ## if n == 1    ## calculating primes
    primes = {}
    while(n%2 == 0):
        primes[2] = primes.get(2, 0) + 1
        n = n//2
    for i in range(3, int(n**0.5)+2, 2):
        while(n%i == 0):
            primes[i] = primes.get(i, 0) + 1
            n = n//i
    if n > 2:
        primes[n] = primes.get(n, 0) + 1
    ## prime factoriazation of n is stored in dictionary
    ## primes and can be accesed. O(sqrt n)
    return primes

## MODULAR EXPONENTIATION FUNCTION
def power(x, y, p): 
    res = 1
    x = x % p  
    if (x == 0) : 
        return 0
    while (y > 0) : 
        if ((y & 1) == 1) : 
            res = (res * x) % p 
        y = y >> 1      
        x = (x * x) % p 
    return res 

## DISJOINT SET UNINON FUNCTIONS
def swap(a,b):
    temp = a
    a = b
    b = temp
    return a,b

# find function with path compression included (recursive)
# def find(x, link):
#     if link[x] == x:
#         return x
#     link[x] = find(link[x], link);
#     return link[x];

# find function with path compression (ITERATIVE)
def find(x, link):
    p = x;
    while( p != link[p]):
        p = link[p];
    
    while( x != p):
        nex = link[x];
        link[x] = p;
        x = nex;
    return p;


# the union function which makes union(x,y)
# of two nodes x and y
def union(x, y, link, size):
    x = find(x, link)
    y = find(y, link)
    if size[x] < size[y]:
        x,y = swap(x,y)
    if x != y:
        size[x] += size[y]
        link[y] = x

## returns an array of boolean if primes or not USING SIEVE OF ERATOSTHANES
def sieve(n): 
    prime = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
        if (prime[p] == True): 
            for i in range(p * p, n+1, p):
                prime[i] = False
        p += 1
    return prime

#### PRIME FACTORIZATION IN O(log n) using Sieve ####
MAXN = int(1e6 + 5)
def spf_sieve():
    spf[1] = 1;
    for i in range(2, MAXN):
        spf[i] = i;
    for i in range(4, MAXN, 2):
        spf[i] = 2;
    for i in range(3, ceil(MAXN ** 0.5), 2):
        if spf[i] == i:
            for j in range(i*i, MAXN, i):
                if spf[j] == j:
                    spf[j] = i;
    ## function for storing smallest prime factors (spf) in the array

################## un-comment below 2 lines when using factorization #################
# spf = [0 for i in range(MAXN)]
# spf_sieve() 
def factoriazation(x):
    ret = {};
    while x != 1:
        ret[spf[x]] = ret.get(spf[x], 0) + 1;
        x = x//spf[x]
    return ret
    ## this function is useful for multiple queries only, o/w use
    ## primefs function above. complexity O(log n)

## taking integer array input
def int_array():
    return list(map(int, input().strip().split()))
## taking string array input
def str_array():
    return input().strip().split();

#defining a couple constants
MOD = int(1e9)+7;
CMOD = 998244353;
INF = float('inf'); NINF = -float('inf');

################### ---------------- TEMPLATE ENDS HERE ---------------- ###################

x = input().split(); a = int(x[0]); b = float(x[1]);
print(int(a*b));

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(int(a * b))

Submission status: Wrong Answer

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

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

    A, B = input_list()
    a = int(A)
    b100 = float(B) * 100
    ans = a * b100
    ans = ans // 100
    print(int(ans))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

ans=a*b

print(math.floor(ans))

Submission status: Wrong Answer

Solution code:
a, b = (float(i) for i 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:
def resolve():
    '''
    code here
    '''
    A, B = [float(item) for item in input().split()]

    print(int(A*B))


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor

a, b = map(float, input().split())
print(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:
s = input().split()
a, b = int(s[0]), float(s[1])
print(int(a*b // 1))

Submission status: Wrong Answer

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

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

print((a*b)//100)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=lambda:input()
I=lambda:int(input())
L=lambda:list(map(float,input().split()))
LS=lambda:list(map(str,input().split()))
 
def main():
    a,b=L()
    import math
    print(math.floor((a*b)))

if __name__ == '__main__':
    main()

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(int(a*b/10000))
        
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

a, b = map(float, readline().split())
print(int(a) * int(b*100) // 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:
a, b = map(float, input().split())
ans = a * b
print(ans // 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def mp(): return map(int, input().split())
def lmp(): return list(map(int, input().split()))


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

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()