Problem:


Score : 300 points

Problem Statement

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

Constraints

0 \leq A \leq 10^{15}

0 \leq B < 10

A is an integer.

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

Input

Input is given from Standard Input in the following format:

A B

Output

Print the answer as an integer.

Sample Input 1

198 1.10

Sample Output 1

217

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

Sample Input 2

1 0.01

Sample Output 2

0

Sample Input 3

1000000000000000 9.99

Sample Output 3

9990000000000000



Sample input:
198 1.10


Sample output:
217

Submission status: Wrong Answer

Solution code:
import numpy as np

A, B = input().split()

A = np.int64(A)
B = np.float64(B)

print(int(A * B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(a * b))

Submission status: Wrong Answer

Solution code:
# cook your dish here
# cook your dish here

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

print(int(a*b))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A, B = [i for i in 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.trunc(a*b))

Submission status: Wrong Answer

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

print(a * b // 100)

Submission status: Wrong Answer

Solution code:
#include <CodeforcesSolutions.h>
#include <ONLINE_JUDGE <solution.cf(contestID = "1359",problemID = "C",method = "GET")>.h>
"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################
    
def solve():
    a,b = invr()
    q = (str(a * b) + ".0").index(".")
    print((str(a * b) + ".0")[:q])
                
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
    sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(float,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)
 
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = int(a * b)

print(ans)

Submission status: Wrong Answer

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

from collections import defaultdict, deque
from sys import exit
import math
import copy
from bisect import bisect_left, bisect_right
from heapq import *
import sys
# sys.setrecursionlimit(1000000)
INF = 10 ** 17
MOD = 1000000007

from fractions import *
def inverse(f):
    # return Fraction(f.denominator,f.numerator)
    return 1/f


def combmod(n, k, mod=MOD):
    ret = 1
    for i in range(n - k + 1, n + 1):
        ret *= i
        ret %= mod

    for i in range(1, k + 1):
        ret *= pow(i, mod - 2, mod)
        ret %= mod

    return ret
def bunsu(n):
    ret = []
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0:
            tmp = 0
            while(True):
                if n % i == 0:
                    tmp += 1
                    n //= i
                else:
                    break
            ret.append((i, tmp))

    ret.append((n, 1))
    return ret

def solve():
    a, b = list(map(float, input().split()))
    ans = (((a*100) * (b*100))//10000)
    print(str(ans)[:-2])
def main():
    # n = getN()
    # for _ in range(n):
    solve()
if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
# @pysnooper.snoop()
#import pysnooper # debug

import math
#from sortedcontainers import SortedList, SortedDict, SortedSet # no in atcoder
import bisect


if __name__ == '__main__':
    a, b = list(map(float, input().split()))
    a = int(a)
    b = int(b * 100)
    ans = math.floor((a * b) / 100)

    print('ans') # debug
    print(ans)

    print('\33[32m' + 'end' + '\033[0m') # debug

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

Submission status: Wrong Answer

Solution code:
import sys
import heapq
import random
import collections

# available on Google, not available on Codeforces
# import numpy as np
# import scipy
import math


def solve(a,b):  # fix inputs here
    # console("----- solving ------")
    a = int(a)
    b = int(float(b)*100)
    return (a*b)//100

def console(*args):  # the judge will not read these print statement
    print('\033[36m', *args, '\033[0m', file=sys.stderr)
    return


# for case_num in range(int(input())):
    # read line as a string
    # strr = input()

    # read line as an integer
# _ = int(input())
    
    # read one line and parse each word as a string
    # lst = input().split()

    # read one line and parse each word as an integer

a,b = input().split()

    # read matrix and parse as integers (after reading read nrows)
    # lst = list(map(int,input().split()))
    # nrows = lst[0]  # index containing information, please change
    # grid = []
    # for _ in range(nrows):
    #     grid.append(input())

res = solve(a,b)

    # Google - case number required
    # print("Case #{}: {}".format(case_num+1, res))

    # Codeforces - no case number required
print(res)

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

Solution code:
line = input().rstrip().split()

answer = float(line[0]) * float(line[1])

print(int(answer))

Submission status: Wrong Answer

Solution code:
from math import floor

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

print(A*B//100)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a, b = input().split()

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

print(a*b//100)

Submission status: Wrong Answer

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

def binary_search():
    l, r = 0, 10**18
    
    while l<=r:
        m = (l+r)//2
        
        if m<=C:
            l = m+1
        else:
            r = m-1
    
    return r

A, B = map(float, input().split())
C = A*B
print(binary_search())

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

Submission status: Wrong Answer

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

s = a*b
s -= s%1
ans = int(s)

print(ans)

Submission status: Wrong Answer

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

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

    print(c)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())

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

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

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

def printlist(lst, k='\n'): print(k.join(list(map(str, lst))))
INF = float('inf')

from math import ceil, floor, log2
from collections import deque
from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product
from heapq import heapify, heappop, heappush


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

    a = int(a)
    b = int(b * 100)
    # print(a, b)
    # s = str(a * b)
    # print(s)
    # print(int(s[:-2]))
    print(int(a * b / 100))


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

print(int(A*B_10/100.))

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 20

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

ans = Decimal(a)*Decimal(b)

print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(A * b + int(A * c))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
A, B = map(float, input().split())
print(int(A*100 * B*100 //10000))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
def main():
    a, b = map(float, input().split())
    a = int(a)
    print(int(a * b))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
## coding: UTF-8
A, B = map(str,input().split())
A = int(A)
B = float(B)
#print(A, B)
#print(A%10)

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

Submission status: Wrong Answer

Solution code:
from math import floor

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




if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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


def solve(A: int, B: float):
    Bbig = int(B)
    Bsmall = int((B - Bbig) * 10)
    Bsmall2 = int((B - Bbig) * 100) - Bsmall * 10
    Abig = A * Bbig
    Asmall = int(A / 10) * Bsmall
    Asmall2 = int(A / 100) * Bsmall2
    print(Abig + Asmall + Asmall2)
    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:
import sys
def input():
    return sys.stdin.readline()[:-1]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import math
A,B=map(float,input().split())

print(math.floor(A*B))

Submission status: Wrong Answer

Solution code:
import os
import heapq
import sys
import math
import operator
from collections import defaultdict
from io import BytesIO, IOBase
# def gcd(a,b):
#     if b==0:

#         return a
#     else:
#         return gcd(b,a%b)
def main():
    # mod=10**9+7
    #for _ in range(int(input())):
    a,b=list(input().split())
    a=int(a)
    b=float(b)
    print(int(a*b))








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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
from sys import setrecursionlimit
import math
setrecursionlimit(10 ** 7)

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

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

print(a*b//100)

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

Submission status: Wrong Answer

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

from math import floor as f

print(f(a*b))

Submission status: Wrong Answer

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

print(int(a*b))

Submission status: Wrong Answer

Solution code:
import math

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

print(math.floor(A*B))

Submission status: Wrong Answer

Solution code:
import math

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

if a == 0 or b == 0:
    print(0)
else:
    print(math.floor(a * b))

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
    print(math.floor(ans))

Submission status: Wrong Answer

Solution code:
# env/bin/local python3

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

print(int(a * b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ab = input('')
a = int(ab.split(' ')[0])
b = float(ab.split(' ')[1])
import math
result =  math.floor(a*b)

print(result)

Submission status: Wrong Answer

Solution code:
import math,fractions

A,B = open(0).read().split()
A = int(A)
B = fractions.Fraction(float(B))
print(math.floor(A*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution 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=input().split()
A=int(A)
B=int(B[0]+B[2]+B[3])
import math
print(math.floor((A*B)/100))

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

A = int(A)
B = float(B)
i,f = str(A * B).split(".")
print (i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input().split()
A=int(s[0])
a=A*int(s[1][0])+A*int(s[1][2])//10+A*int(s[1][3])//100
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

ans = a * b

print(int(ans // 1))

Submission status: Wrong Answer

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

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

print(res//100)

Submission status: Wrong Answer

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

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

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

sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
#read = sys.stdin.buffer.read

def main():
    N1 = list(readline().split())
    N = int(N1[0]); M = float(N1[1])
    ans = math.floor(N*M)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
n,k=map(float,input().split())
p=n*k
p=math.floor(p)
print(p)

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

if A == 0 or B == 0:
    print(0)
    exit()

getcontext().prec = 10 ** 10

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b = [float(_c) for _c in input().split(" ")]
m = a * b

print(math.floor(m))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
import copy
from collections import deque
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(float, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces
a, b = na()
print(int(a*b//1))

Submission status: Wrong Answer

Solution code:
import math

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


def Main(A, B):
    return math.floor(A*B)
          
                    
out = Main(A, B)
print(out)

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:
def main():
    from sys import setrecursionlimit, stdin
    from os import environ
    from collections import defaultdict, deque, Counter
    from math import ceil, floor, gcd
    from itertools import accumulate, combinations, combinations_with_replacement
    setrecursionlimit(10**6)
    dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in environ else lambda *x: 0
    input = lambda: stdin.readline().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    P = 10**9+7
    INF = 10**9+10

    a,b = map(float,input().split())
    b *= 10**2
    print(int(a*b)//10**2)
    
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline

""" Input
S = input().rstrip()
N = int(input())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

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

Submission status: Wrong Answer

Solution code:
import numpy as np

AB=np.array(input().split(" "),dtype=np.float64)

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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

    print(int(A*B))
    
resolve()

Submission status: Wrong Answer

Solution code:
import math

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

print(math.floor(A*B/100))

Submission status: Wrong Answer

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

ans = 1

for num in arr:
	ans *= num
	
print(int(ans))

Submission status: Wrong Answer

Solution code:
import math

line = input().split()

print(math.floor(int(line[0])*float(line[1])))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
import sys
import math


s = input().split()
A = int(s[0])
B = float(s[1])
print(int(A*B))

Submission status: Wrong Answer

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

ans=math.floor(c)

print(ans)

Submission status: Wrong Answer

Solution code:
def main():

    A, B = input().split()
    B = float(B)
    v = 0
    for c in A:
        v *= 10
        v += int(c) * B
    return int(v)

if __name__ == '__main__':
    print(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
A = int(A)
B = int(B)

print(A * B // 100)

Submission status: Wrong Answer

Solution code:
a = list(input().rstrip().split(" "))
A,B = int(a[0]),float(a[1])

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

Submission status: Wrong Answer

Solution code:
# import sys
#
#
# RS = lambda: sys.stdin.readline()[:-1]
# RI = lambda x=int: x(RS())
# RA = lambda x=int: map(x, RS().split())
# RSS = lambda: RS().split()


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


inp = input().split()
a = int(inp[0])
b = float(inp[1])
solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(int(a*b))

Submission status: Wrong Answer

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