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=input().split()
a=int(a)
l=len(b)
b=int(float(b)*10**(l-2))
print(a*b//10**(l-2))

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

Submission status: Wrong Answer

Solution code:
import math

x,y = map(float,input().split())	

a = x*y
b = math.floor(a)
print(b)

Submission status: Wrong Answer

Solution code:
import sys

def main():
    readStr = input()
    flds = readStr.split(" ")
    a = int(flds[0])
    b = float(flds[1])
    print(int(a*b))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

ans = t.quantize(Decimal(0))
print(ans)

Submission status: Wrong Answer

Solution code:
a=input().split()
A=int(a[0])
B=float(a[1])
B_int=int(B)
B_float=B-int(B)

ans=A*B_int+A*B_float
print(int(ans))

Submission status: Wrong Answer

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

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:
#!/usr/bin/python3

import math

#標準出力からの読み込み
input_1 = input()
a = int(input_1.split(" ")[0])
b = float(input_1.split(" ")[1])

output = math.ceil(a*b)
print(output)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

Submission status: Wrong Answer

Solution code:
A, B = input().strip().split(" ")
A = int(A)
BZ, d1, d2 = int(B[0]), int(B[2]), int(B[3])
result = 0
result += A * BZ

if d1 != 0:
    temp = str(A * d1)
    if len(temp) > 1:
        result += int(temp[:-1])

if d2 != 0:
    temp = str(A * d2)
    if len(temp) > 2:
        result += int(temp[:-2])

# result = A * BZ + int((A * d1) / 10) + int((A * d2) / 100)
# print(A*BZ, int(str(A * d1)[:-1]), int(str(A * d2)[:-1]))
print(result)

Submission status: Wrong Answer

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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



a = ab[0]
b = ab[1]

z = a * b

ans = math.floor(z)
print(ans)

Submission status: Wrong Answer

Solution code:
import math
s = input().split()
p = int(s[0]) * round(float(s[1]),2)

print(math.floor(p))

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
from math import floor


def solve(a, b):
    return floor(Decimal(a) * Decimal(b))


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

Submission status: Wrong Answer

Solution code:
l = list(filter(None,input().split()))
a = int(l[0])
b = float(l[1])
c = int(b)
d = b - c
print(int(a*c+a*d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a, b = input().split()
a = int(a)
ans = 0
for i in range(4):
    if i == 0:
        ans += a * int(b[i])
    elif i == 1:
        continue
    elif i == 2:
        ans += math.floor((a % 10) * int(b[i]) * 0.1)
        if len(str(a)) > 1:
            ans += int(str(a)[:-1]) * int(b[i])
    elif i == 3:
        ans += math.floor((a % 100) * int(b[i]) * 0.01)
        if len(str(a)) > 2:
            ans += int(str(a)[:-2]) * int(b[i])
print(ans)

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.trunc(ans))

Submission status: Wrong Answer

Solution code:
a,b=input().split()
A=int(a)
ans=0
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())
if a>10**7:
        a=a//10**7
        b=b*10**7
print(int(a*b//1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
#import numpy as np
INF = float("inf")
#d = defaultdict(int)
#d = defaultdict(list)
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())[:-1]
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [list(input())[:-1] for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]

A,B = map(float,input().split())
if math.floor(A) == 0 or math.floor(B) == 0:
    print(0)
else:
    A = int(A)
    c = (A // 100)
    d = A % 100
    x = math.floor(B)
    y = B - x
    rem = 0
    for i in range(100):
        if abs(y-i/100) < 0.005:
            rem = i
            break
    ans = 100*c*x+d*x+c*rem+(d*rem//100)
    print(int(ans))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B=input().split()
B=B[0]+B[2:]
i=len(B)-1
ans=str(int(A)*int(B))
ans=ans[:-i]+'.'+ans[-i:]
print(int(float(ans)))

Submission status: Wrong Answer

Solution code:
import math

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = map(eval, input().split())
if A <= 10**15 and B < 10:
    print(int(A*B))

Submission status: Wrong Answer

Solution code:
import math
from decimal import *
A, B = map(float, input().split())
# ans = ""
# hoge = A*B
# hoge = f"{hoge:.2f}"
# # print(int(hoge))
# # exit()
# for a in hoge:
#     if a == ".":
#         print(ans)
#         exit()
#     else:
#         ans += a
# print(ans)
# print(Decimal(str(A*B)).quantize(Decimal('0'), rounding=ROUND_DOWN))

b_seisuu, b_syousu = math.modf(B)
# print(b_seisuu, b_syousu)
# print(A*b_seisuu, A*b_syousu)
ans = int(A*b_seisuu) + int(A*b_syousu)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

    res = a * b

    print(int(res / 100))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
s = [input() for i in range(1)] 
li = list(map(str, s[0].split()))
if '0' in li:
    print(0)
if '0' not in li:
    li1 = float(li[0])
    li2 = float(li[1])
    print(math.floor(li1 * li2))

Submission status: Wrong Answer

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

new=math.floor(decimal*10**2)/(10**2)

add=int(new*a)

ans=a+add

print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math

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


print(math.floor(A * B))

Submission status: Wrong Answer

Solution code:
import math
list = input().split()
a=int(list[0])/10000
b=float(list[1])
ans = a*b*10000
print(math.floor(ans))

Submission status: Wrong Answer

Solution code:
from sys import stdin
import math

A, B = [float(x) for x in stdin.readline().rstrip().split()]

print(math.floor(A*B))

Submission status: Wrong Answer

Solution code:
##C

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

Submission status: Wrong Answer

Solution code:
import sys
#import time
import copy
#from collections import deque, Counter, defaultdict
#from fractions import gcd
#import bisect
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
inf = 10**20
ri = lambda : int(input())
rs = lambda : input().strip()
rl = lambda : list(map(float, input().split()))
a,b = rl()

a_small=a%1000
a_big =a-a_small

print(int(a_big*b)+int(a_small*b))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from fractions import Fraction

a,b= map(str, input().split())
b=float(b)
b *= 100
a = int(a)
b = int(-(-b//1))

print(int((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,decimal
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    a,b = insr().split(" ")
    q = b.index(".")
    w = int(b[:q] + b[q + 1:])
    print(str(int(a) * w)[:- q - 1])
                
################## ---- 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()
ans = int(a) * float(b)
print(math.floor(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:
import math
A, B = input().rstrip().rsplit()
A = int(A)
B = float(B)
print(math.floor(A*B))

Submission status: Wrong Answer

Solution code:
import math

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import decimal
A,B = map(float,input().split())
c = decimal.Decimal(A * B)
d = c.quantize(decimal.Decimal('0'), rounding=decimal.ROUND_FLOOR)
print(d)

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

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

	print(int(ans))



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

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

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

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

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

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

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

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

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


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

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

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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans/=100

print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#3問目
import math
AB = input().split()
A = int(AB[0])
B = float(AB[1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = int(l[0])
b = float(l[1])

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

Submission status: Wrong Answer

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

print(int(A*B))

Submission status: Wrong Answer

Solution code:
b = [x for x in input().split()]
c = int(b[0])*float(b[1])
print(int(c))

Submission status: Wrong Answer

Solution code:

import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)


def gcd(a, b):
	while b:
		a, b = b, a % b
	return a


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


a,b=acinput()

#print(a)
b_int=np.floor(b)
b_fl=b-b_int
res1=a*b_int
#res2=np.floor(a*b_fl)
res2=a*(b_fl*(10**9))
res2/=10**9

print(int(res1+res2))

#print(a*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

input_line = input().split()

a = float(input_line[0])
b = float(input_line[1])

ans = a*b

ans = math.floor(ans)
print(int(ans))

Submission status: Wrong Answer

Solution code:
from math import floor
from decimal import *
getcontext().prec = 20
a, b = map(str ,input().split())
val = (int(Decimal(float(a)) * Decimal(float(b))))
print(floor(val))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
# from functools import lru_cache, cmp_to_key
# from heapq import merge, heapify, heappop, heappush
from math import ceil, floor, gcd, sqrt, trunc
from collections import defaultdict as dd, deque, Counter as C
# from itertools import combinations as comb, permutations as perm
# from bisect import bisect_left as bl, bisect_right as br, bisect
# from time import perf_counter
# from fractions import Fraction
# sys.setrecursionlimit(pow(10, 6))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]


a, b = map(float, input().split())
temp = str(b)
temp = int(temp[:temp.index('.')])
answer = a * temp
b -= temp
answer += trunc(a * b)
out(int(answer))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
q = input().split(" ")
A = int(q[0])
B = q[1].split(".")

if B[1][0]=="0":
  B[1] = B[1][1]

print(B[0]+" " +B[1])
print(A*int(B[0]) + math.floor(((A*int(B[1]))/100)))

Submission status: Wrong Answer

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

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

print(int(math.floor(a*b*100//100)))

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
import decimal

if __name__ == "__main__":
    a,b = map(float,input().split())
    a = decimal.Decimal(a)
    b = decimal.Decimal(b)
    print(math.floor(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:
text = input().split()
A = int(text[0])
B = float(text[1])
B*=100
print(int((A * B) / 100))

Submission status: Wrong Answer

Solution code:
import math
A, B = input().strip().split()
A, B = [int(A), float(B)]
if A>=0 and A<=10**15:
    round(B,2)
    if B>=0 and B<10 :
        result=A*B
        new=math.floor(result)
        print(new)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(float,input().split())
if b>10**7:
        b=b//10**7
        a=a*10**7
print(int(a*b//1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

r = int(a) * float(b)  

print(math.floor(r))

Submission status: Wrong Answer

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

a = int(a)
b = b

print(int(a * b))

Submission status: Wrong Answer

Solution code:
a,b = input().split()
a = int(a)
print(int(a*int(b[0]) + a*int(b[2])*0.1 + a*int(b[3])*0.01))

Submission status: Wrong Answer

Solution code:
import math

a, b = input().split()

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

    res = a * b

    print(int(res / 100))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
a,b=input().split()
a=float(a)/10000;
b=float(b)*10000;
print(int(float(a)*float(b)))

Submission status: Wrong Answer

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

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

  print((A * B) // 100)

if __name__ == "__main__":
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = round(a * b / 100, 5)

ans = int(math.floor(ans))
print(ans)

Submission status: Wrong Answer

Solution code:
import math

nums = input().rstrip().split(' ')
a=float(nums[0])*float(nums[1])
print(math.floor(a))

Submission status: Wrong Answer

Solution code:
list1 = input().split()
numA, numB = int(list1[0]), float(list1[1])
print(int(numA * numB))

Submission status: Wrong Answer

Solution code:
from fractions import Fraction

a, b = input().split()
a = int(a)
b = float(b)
bb = Fraction(b)
c = a * bb
d = c//1
d = int(d)
print(d)

Submission status: Wrong Answer

Solution code:
import math

def main():
    A,B=map(str, input().split(" "))
    A = int(A)
    B = float(B)
    #print(A * B)
    print(math.floor(A * B))
    
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from sys import stdin, stdout
from collections import defaultdict

def main():
    a,b = map(float,stdin.readline().split())
    res= a*b
    d= str(res)
    ans =[]
    ans = d.split('.')
    print(ans[0])

main()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python3

import math

#標準出力からの読み込み
input_1 = input()
a = float(input_1.split(" ")[0])
b = float(input_1.split(" ")[1])

output = math.ceil(a*b)
print(output)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=input().split()
ans=int(a)*float(b)
if '0' in str(ans).split('.'):
  print(int(ans))
else:
  b,c=b.split('.')
  b=b+'.'+c[:2]
  print(int(int(a)*float(b)))

Submission status: Wrong Answer

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

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

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:
# coding: utf-8
input_length = input().split()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor
import numpy as np
inputs = input().split()
multiple = np.int64(inputs[0]) * np.float64(inputs[1])

print(int(floor(multiple)))

Submission status: Wrong Answer

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

sum=a*b
result=math.floor(sum)
print(int(result))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

str2 = str.split(" ")

A = int(str2[0])
B = math.floor(int(float(str2[1])*100))

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

print(res)