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: Accepted

Solution code:
import math
A,B=input().split()
A=int(A)
B=int(float(B)*1000)
ans=A*B
ans=str(ans)
if len(ans) < 4:
    print(0)
else:
    print(ans[:-3])

Submission status: Accepted

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

Submission status: Accepted

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

a = int(a)
b = int(b*1000)

c = a*b // 1000

print(c)

Submission status: Accepted

Solution code:
A, B = map(str, input().split())
 
B = str(int(float(B)*100+0.00001))
 
#print(B)
ans = []
p = [[]for k in range(len(B))]
for k in range(len(B)):
    for j in range(k):
        p[k].append(0)
for k in range(1, len(B)+1):
    a = 0
    for j in range(1, len(A)+1):
        if a > 9:
            a = int(str(a)[0]) + int(B[-k])*int(A[-j])
        else:
            a = int(B[-k])*int(A[-j])
        #print(a)
 
        p[k-1].append(int(str(a)[-1]))
        if j == len(A) and a >9:
            p[k-1].append(int(str(a)[0]))
 
for k in range(len(B)):
    for j in range(len(p[-1]) - len(p[k])):
        p[k].append(0)
 
#print(p)
a = 0
for k in range(len(p[0])): 
    if int(a) > 9: 
        a = int(str(a)[0])
    else:
        a =0
    for j in range(len(p)):
        a += p[j][k]
    ans.append(str(a)[-1])
    if k ==  len(p[0])-1 and a >9:
        ans.append(str(a)[0])

 
#print(ans)
op = ""
for k in range(1, len(ans)-1):
    op += ans[-k]
if len(ans)<3 or int(op) < 1:
    print("0")
else:
    print(op)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from decimal import Decimal

a,b = [i for i in input().split()]
 
a = Decimal(a)
b = Decimal(b)
 
print(math.floor(a*b))

Submission status: Accepted

Solution code:
import numpy as np
import math
from decimal import Decimal

def resolve():
  S = input().split(" ")
  # print(math.floor(int(S[0])*Decimal(S[1])))
  print(math.floor((int(S[0]) * int(float(S[1])*1000))) // 1000)

  

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
A, B = input().split()
A = int(A)
B1, B2 = map(int, B.split('.'))
ans = A*B1 + A*B2//100
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

c = 0
c += a*int(b[0])*100
c += a*int(b[2])*10
c += a*int(b[3])
c = str(c)
if(len(c) < 3):
  print(0)
else:
  print(c[:-2])

Submission status: Accepted

Solution code:
import numpy as np
import math
[A,B] = input().split()
c = 0
if '.' in B:
    c = int(B.find('.'))
c = len(B)-c-1
B = B.replace(".","")
A = np.int64(A)
B = np.int64(B)
C = A*B
if c == 0 or C <=100:
    print(math.floor(C/int(10**c)))
else:
    print(str(C)[:-c])

Submission status: Accepted

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

ans = (iA * iB) // 100
print(ans)

Submission status: Accepted

Solution code:
import math

def main():
    # A = list(map(float,input().split()))
    # B = A[0] * A[1]
    # C = str(B)
    # 
    # D = C.split('.')
    # 
    # print(int(B))


    a, b = input().split()

    a = int(a)
    b = b[0] + b[2:]
    b = int(b)

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



if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = A * B // 1000

print(ans)

Submission status: Accepted

Solution code:
import decimal

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

ans = a*b
ans //= 100

print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal

A,B=input().split()
B=Decimal(B)
A=int(A)
ans=int(A*B)
 
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import math
[A,B] = input().split()
# A = "1000000000000001"
# B = "9.09"
c = 0
if '.' in B:
    c = int(B.find('.'))
c = len(B)-c-1
B = B.replace(".","")
A = np.int64(A)
B = np.int64(B)
C = A*B
if c == 0 or C <=100:
    print(math.floor(C/int(10**c)))
elif c == 1:
    print(str(C)[:-1])
elif c == 2:
    print(str(C)[:-2])
# C = C/int(10**c)
# print(C)
# print(math.floor(C))
# print(9990000000000000)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import math
import numpy as np


string = input().split()
A = int(string[0]) 
B = int (round(float(string[1]) * 100))

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=input().split()
a=int(a)
b1=[]
for i in range(4):
    if i==0 and b[0]=='0':pass
    elif b[i]=='.':pass
    else:b1.append(b[i])
b2=''.join(b1)
b2=int(b2)
k=a*b2//100
print(int(k))

Submission status: Accepted

Solution code:
from decimal import Decimal

ab = list(input().split())
a = int(ab[0])
b = Decimal(ab[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(a*b))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import decimal
def resolve():    

    a, b = map(decimal.Decimal, input().split())
    print(a * b // 1)
    
if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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
    sa,sb = input().split()
    a = int(sa)
    b = int(float(sb)*100+0.5)
    print(a*b//100)

    
main()

Submission status: Accepted

Solution code:
a,b = input().split()
a=int(a)
b_1=int(b[:-3])
b_2=int(b[-2:])
print(a*b_1+(a*b_2)//100)

Submission status: Accepted

Solution code:
import decimal
a, b = input().split(' ')
m = int(decimal.Decimal(a) * decimal.Decimal(b))
print(m)

Submission status: Accepted

Solution code:
def main():
    import sys
    import math
    a,b = map(str, input().split())
    a = int(a)
    b = int(b.replace('.',''))
    c = a*b//100    
    print(c)
    


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import *

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

print(Decimal(A * B).quantize(Decimal('0'), rounding=ROUND_DOWN))

Submission status: Accepted

Solution code:
A, B = input().split()
A = int(A)
C = int(B[0])*100 + int(B[2])*10 + int(B[3])
print(A*C//100)

Submission status: Accepted

Solution code:
"""
[a,b]=list(map(float,input().split()))
import math
a=int(a)
b=int(b*100)
ans=a*b
ans=ans/100
ans=math.floor(ans)
print(ans)
"""
import decimal
[a,b]=list(input().split())
a10=decimal.Decimal(a)
b10=decimal.Decimal(b)
ans=a10*b10
ans=int(ans)
print(ans)


"""
[a,b]=list(input().split())
a=int(a)
b12=list(b.split('.'))
bkai=int(int(b12[0])*100+int(b12[1]))
ans=a*bkai
ans=ans//100
print(ans)
"""

Submission status: Accepted

Solution code:
import decimal
AB = input().split()
A = decimal.Decimal(AB[0])
B = decimal.Decimal(AB[1])
print(int(A*B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A, B = map(float, input().split())
s = input()
A = s.split()[0]
Q = int(A)
B = s.split()[1]
#B = float(B)
P = int(B[0])*100 + int(B[2])*10 + int(B[3])
T = Q*P
T = str(T)
ans = ''
if len(T)<3 or Q==0 or P==0:
    ans = '0'
else :
    ans = T[:-2]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = input().split()
a_int = int(a)
b1, b2 = b.split(".")

ans = (a_int * (int(b1) * 100 + int(b2))) // 100
print(ans)

Submission status: Accepted

Solution code:
import math

A, B = input().split()
A = int(A)
B = float(B)+1e-8
B = int(B*100)

print(A*B//100)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import decimal
x,y = list(map(decimal.Decimal,input().split()))
print(math.floor(x*y))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

A,B=input().split()

A = int(A)
N,F = B.split('.')
ans = (A * 100 * int(N) + A * int(F)) //100

print(ans)

Submission status: Accepted

Solution code:
from decimal import *

getcontext().prec = 19
 
N = list(map(str, input().split()))
A = Decimal(N[0])
B = Decimal(N[1])
  
print(int(A*B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
a,b=input().split()
a=int(a)
c=int(b[0]+b[2]+b[3])
print(a*c//100)
#print(a*b)

Submission status: Accepted

Solution code:
import math
X = input().split()
A = int(X[0])
B = round(float(X[1]) * 100)

print( (A *B) // 100)

Submission status: Accepted

Solution code:
a,b=input().split()
a=int(a)
b1,b2=b.split(".")

ans= a*(int(b1)*100+int(b2[0])*10+int(b2[1]))
ans//=100

print(ans)

Submission status: Accepted

Solution code:
import math
import numpy as np

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

a = int(a)
b = int(b.replace(".", ""))
print(a*b//100)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import decimal

A, B = input().split()

a = int(A)
b = decimal.Decimal(B)

c = a * b

p = math.floor(c)
C = int(p)
print(C)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AB = list(input().split())
 
A = int(AB[0])
B = float(AB[1])
 
B = round(B * 100)
 
ans = int(A * B // 100)
 
print(ans)

Submission status: Accepted

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

print(a*b//100)

Submission status: Accepted

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

Submission status: Accepted

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

b = int(b * 1000)

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
import math
a,b=input().split()
a=int(a)
c=int(b[0]+b[2]+b[3])
print(int(a*c)//100)
#print(a*b)

Submission status: Accepted

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


def solve():

    A, B = input().split()
    A = int(A)
    B = B.replace('.', '')
    B = int(B)
    ans = (A * B) // 100
    print(ans)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
in_ = list(input().split())
A = int(in_[0])
B = int(in_[1].replace(".", ""))
ans = A * B
ans = ans // 100
print(ans)

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
from decimal import *

import numpy as np

import math

if __name__ == '__main__':
    a = [str(i) for i in input().split()]
    b = int(a[0])
    c = int(a[1].replace(".",""))
    d = Decimal(a[0]) * Decimal(c) / Decimal(100)
    e = int(d)
    print(e)

Submission status: Accepted

Solution code:
# input
A, B = input().split()
A = int(A)
B, C = map(int, B.split('.'))
B = B*100

# output
print((A*(B+C))//100)

Submission status: Accepted

Solution code:

[a, b] = input().strip().split()
a = int(a)
b = float(b)
b = int(b * 1000)

print((a*b)//1000)

Submission status: Accepted

Solution code:
s = input().split()
a = int(s[0])

u = 0
x= 0
d = 0
for i,v in enumerate(reversed(s[1])):
    if v == '.':
        d = i
        continue
    x += (a * int(v) * pow(10,u))
    u += 1
x //= pow(10,d)
print(x)

Submission status: Accepted

Solution code:
As,Bs=input().split()
A=int(As)
B=float(Bs)
B100=int(100*B+0.1)
print(A*B100//100)

Submission status: Accepted

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

a = int(a)
b = int(b * 1000)
print(a * b // 1000)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = input().split()
A = int(A)
B = int(float(B)*100+1.0e-10)
print(int((A*B)//100))

Submission status: Accepted

Solution code:
A,B = input().split()
A = int(A)
B1,B2 = map(int,B.split('.'))
ans = A*(B1*100+B2)
print(int(ans//100))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal


if __name__ == "__main__":
    A, B = map(decimal.Decimal, input().split())
    print(int(A * B))

Submission status: Accepted

Solution code:
import decimal
A,B=input().split()
A=decimal.Decimal(A)
B=decimal.Decimal(B)
if (0<=A<=10**15)and(0<=B<1000):
    C=A*B
    C=int(C)
    print(C)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b = input().split()
a = int(a)
b = int(b[0] + b[2:])
print(a * b // 100)

Submission status: Accepted

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

AB = input().split()
A = int(AB[0])
B100 = round(float(AB[1])*100)

print( A*B100//100 )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np


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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from copy import deepcopy
import random
import time
import os
import sys
import datetime
from functools import lru_cache
from functools import reduce
readline=sys.stdin.readline
sys.setrecursionlimit(2000000)
alphabet="abcdefghijklmnopqrstuvwxyz"
numbers="0123456789"
mod=int(10**9+7)
inf=int(10**19)
class Edge():
    def __init__(self,x,y,val=1):
        self.x=x
        self.y=y
        self.val=val
class unionfind():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(n)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):
            self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def yn(b):
    if b:print("yes")
    else:print("no")
def Yn(b):
    if b:print("Yes")
    else:print("No")
def YN(b):
    if b:print("YES")
    else:print("NO")
def ispow(a,b):
    now=b
    while now<a:
        now*=b
    return now==a
def getbin(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def getfacs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def nextcomb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def getprimes(n):
    if n==0:return []
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    ret=[]
    for a in range(n+1):
        if(A[a]):ret.append(a)
    return ret
def isprime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(bbool,ret1,ret2):
    if bbool:return ret1
    else:return  ret2
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n):
    b = 2
    ret=defaultdict(int)
    while b * b <= n:
        while n % b == 0:
            n //= b
            ret[b]+=1
        b+=1
    if n > 1:ret[n]+=1
    return ret
def pm(x):
    return x//abs(x)
def inputintlist(): 
    return list(map(int,input().split()))
def istanchouzouka(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>=a:
            f=False
        prev=a
    return f
def istanchouhigensyou(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>a:
            f=False
        prev=a
    return f
def getallsum(A):
    s=sum(A)
    dp=defaultdict(int)
    dp[0]=1
    for a in range(0,len(A)):
        for b in range(s,-1,-1):
            if b-A[a]>=0:
                dp[b]+=dp[b-A[a]]
    return dp
def yuukoutomukou(edges):
    ret=deepcopy(edges)
    for edge in edges:
        if not edge.x==edge.y:
            ret.append(Edge(edge.y,edge.x,edge.val))
    return ret
def dijkstra(edges,V,start):
    mincost=[inf]*V
    G=[[] for a in range(V)]
    for edge in edges:
        G[edge.x].append([edge.val,edge.y])
    Q=PriorityQueue()
    Q.put([0,start])#[cost,x]
    while not Q.empty():
        nowcost,nowx=Q.get()
        if mincost[nowx]==inf:
            mincost[nowx]=nowcost
            for cost,y in G[nowx]:
                newcost=nowcost+cost
                Q.put([newcost,y])
    return mincost
def warshallfloyd(edges,V):
    mincost=[[inf for b in range(V)] for a in range(V)]
    for a in range(V):mincost[a][a]=0
    for edge in edges:
        mincost[edge.x][edge.y]=min(mincost[edge.x][edge.y],edge.val)#x→yが複数ある場合のためにmin()する
    for k in range(V):
        for s in range(V):
            for t in range(V):
                if mincost[s][k]==inf or mincost[k][t]==inf:continue
                mincost[s][t]=min(mincost[s][t],mincost[s][k]+mincost[k][t])
    return mincost
def bellemanford(edges,V,start):
    mincost=[inf]*V
    mincost[start]=0
    for _ in range(V):
        for edge in edges:
            if mincost[edge.x]==inf:continue
            mincost[edge.y]=min(mincost[edge.y],mincost[edge.x]+edge.val)
    return mincost
def ruisekiwa(A):
    ret=[0]*(len(A)+1)
    for a in range(len(A)):
        ret[a+1]=ret[a]+A[a]
    return ret
def getmd(x1,y1,x2,y2):
    return abs(x1-x2)+abs(y1-y2)
def geted(x1,y1,x2,y2):
    return math.sqrt((x1-x2)**2+(y1-y2)**2)
class fordfulkerson():
    def __init__(self,edges,V,s,t):
        self.V=V
        self.used=[False]*V
        self.G=[[] for a in range(V)]
        self.s=s
        self.t=t
        for edge in edges:
            self.G[edge.x].append({"x":edge.x,"y":edge.y,"cap":edge.val,"rev":len(self.G[edge.y])})
            self.G[edge.y].append({"x":edge.y,"y":edge.x,"cap":0,"rev":len(self.G[edge.x])-1})
    def dfs(self,v,t,f=inf):
        if v==t:return f
        self.used[v]=True
        for a in range(len(self.G[v])):
            x=self.G[v][a]["x"]
            y=self.G[v][a]["y"]
            cap=self.G[v][a]["cap"]
            rev=self.G[y][self.G[x][a]["rev"]]
            if self.used[y] or cap==0:continue
            f2=self.dfs(y,t,min(f,cap))
            if f2>0:
                self.G[v][a]["cap"]-=f2
                rev["cap"]+=f2
                return f2
        return 0
    def maxflow(self):
        flow=0
        while True:
            self.used=[False]*V
            zouka=self.dfs(self.s,self.t)
            if zouka==0:break
            flow+=zouka
        return flow



######################################################################################################
a,b=input().split()
if b.count(".")==0:b+="."
b+="00000"
di=b.count(".")
B=""
for i in range(len(b)):
  if b[i]!=".":
    B+=b[i]
  if i==di+2:
      break
b=int(B)
a=int(a)
print(a*b//100)

Submission status: Accepted

Solution code:
import math
def main():
    s = list(input().split())
    a = int(s[0])
    b,c = list(map(int,s[1].split('.')))
    print(a*b+a*c//100)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# 検証と認識が甘かった


def solve(A, B):
    _B = round(B * 100)
    print(A * _B // 100)


if __name__ == '__main__':
    A, B = [float(i) for i in input().split()]
    A = int(A)
    solve(A, B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from decimal import Decimal

A, B = input().split()
a = int(A)
b = Decimal(B)
print(math.floor(a * b))

Submission status: Accepted

Solution code:
import math
import sys

a, b = map(str, input().split())
if a == "0" or b == "0.00":
  print(0)
  exit()
ans = 0
ans += int(a) * int(b[0]) * 100
ans += int(a) * int(b[2]) * 10
ans += int(a) * int(b[3])
tmp = list(str(ans))
if len(tmp) == 1 or len(tmp) == 2:
  print(0)
  exit()
tmp.pop(-1)
tmp.pop(-1)
print(int("".join(tmp)))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,B = input().split()
B = B[:-3] + B[-2:]
C = int(A) * int(B) // 100
print(C)

Submission status: Accepted

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

print(ans//100)

Submission status: Accepted

Solution code:
from decimal import *
A,B=input().split()
print(int(Decimal(A)*Decimal(B)))

Submission status: Accepted

Solution code:
import numpy as np
import math
from decimal import Decimal

def resolve():
  S = input().split(" ")
  print(math.floor(int(S[0])*Decimal(S[1])))


if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
import decimal
number = input().split()
A      = int(number[0])
B      = decimal.Decimal(number[1])
print(int(A*B))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import decimal
A,B=input().split()
print(decimal.Decimal(A)*decimal.Decimal(B)//1)

Submission status: Accepted

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

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

res = A * B // 100

print(int(res))

Submission status: Accepted

Solution code:
A, B = input().split()
a = int(A)
b = int(B.replace('.', ''))

print(a*b//100)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal
A,B=input().split()
print(int(Decimal(A)*Decimal(B)))

Submission status: Accepted

Solution code:
from decimal import *
import math

a, b = input().split()

a = int(a)
b = Decimal(b)

print(math.floor(a*b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = input().split()
A = int(A)
B1, B2 = map(int, B.split("."))
ans = A * (B1 * 100 + B2)
print(ans//100)

Submission status: Accepted

Solution code:
A, B = map(str, input().split())
B = B.replace(".","")
s = int(A)*int(B) // 100
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from decimal import Decimal 
A,B = input().split()
C = Decimal(B)
print(math.floor(int(A)*C))

Submission status: Accepted

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

Submission status: Accepted

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

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

print((a*b)//1000)

Submission status: Accepted

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

Submission status: Accepted

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

A = int(A)
B = int(B.replace(".", ""))

print(A*B//100)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8
from decimal import Decimal

A, B = input().split(' ')
A = Decimal(A)
B = Decimal(B)

print(int(A*B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = input().split()
A = int(A)
B = int(B[:-3])*100 + int(B[-2:])

print(A*B // 100)