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 decimal

a, b = input().split()

a = int(a)
b = decimal.Decimal(b)
b *= 100

ans = a * b

ans //= 100

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import math
nums = []
nums = input().split(" ")
num1 = int(nums[0])
num2 = int(float(nums[1])*1000)

 
ans = str(num1*num2)
if len(ans) < 4:
    print(0)
else:
    print(ans[:-3])

#print(format(float(nums[1]), '.20f'))
#print(round(float(nums[1]),2))

Submission status: Accepted

Solution code:
from decimal import Decimal
import math

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

Submission status: Accepted

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

c = b[0] + b[2:]
print(int(a) * int(c) // 100)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import sys
 
if __name__ == '__main__':
    str = input().strip()
    
    a, b = str.split()
 
    aval = int(a)
    bval = round(float(b) * 100)
    
    print(aval * bval // 100)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

b = b.replace(".","")

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

Submission status: Accepted

Solution code:
import math

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

n = a*b
n = n//1000
print(math.floor(n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import scipy as sp
import math
 
x, y = input().split()
a = int(x)
b = float(y)
c = math.floor(b*100+0.0001)
print(math.floor(a*c//100))

Submission status: Accepted

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


def main():
    a, b = [decimal.Decimal(i) for i in input().split()]
    ans = a * b
    print(int(ans))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
stdin = input().split()
a = int(stdin[0])
b = int(stdin[1][0] + stdin[1][2:])
if a == 0 or b == 0:
    print(0)
else:
    print(a * b // 100)

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.1)
    print(a*b//100)

    
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import heapq
from sys import stdin
from decimal import *
input = stdin.readline

#入力
# s = input()[0:-1]
# n = int(input())
# a = list(map(int,input().split()))
# a = [int(input()) for i in range()]
# n = int(input())
# a,b = map(float, input().split())
# ab=[]
# for i in range():
#     a,b = map(int, input().split())
#     ab.append([a,b])


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

    print(int(a*b//1))
if __name__ == '__main__':
    main()

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

#B_by100 = int(B*100)
#ans_by100 = A*B_by100
#ans=ans_by100//100

B_by1000 = int(B*1000)
ans_by1000 = A*B_by1000
ans=ans_by1000//1000

#ans = math.floor(ans_by100/100)

#A_hund = int(A//100)
#A_res = int(A-A_hund*100) 
#
#ans1 = int(A_hund * B * 100)
#ans2 = int(A_res * B) 

#ans = A*B
#ans = ans1+ans2
#ans = int(ans)
print(str(ans))

Submission status: Accepted

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


print(ans)

Submission status: Accepted

Solution code:
a,b = map(str,input().split())
b = list(b)
del b[-3]
b = ''.join(b)
b = int(b)
#print(b)
#b = int(b*10000)
ans = int(a)*b//100
print(int(ans))

Submission status: Accepted

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

def MAP(): return map(str, input().split())
a, b = MAP()
print(int(Decimal(a)*Decimal(b)))

Submission status: Accepted

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

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

    b = int(100 * b + 0.4)
    print((a*b)//100)

Submission status: Accepted

Solution code:
def main():

    A, B = input().split()
    B = "".join(B.split('.'))
    A = int(A)
    B = int(B)
    return (A * B) // 100

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

Submission status: Accepted

Solution code:
def main():
    a, b = input().split()
    a = int(a)
    b1, b2 = map(int, b.split('.'))
    ans = a * ((b1 * 100) + b2)

    ans = ans // 100

    print(f'{ans}')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = input().split()
a = int(a)
bTop, bBottom = map(int, b.split('.'))
s = str(a * (bTop * 100 + bBottom))
if len(s) <= 2:
    print(0)
else:
    print(s[:-2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt,ceil #,gcd
# from itertools import permutations,combinations,combinations_with_replacement
# from collections import deque,Counter
# from bisect import bisect_left
# from heapq import heappush,heappop
# from numba import njit
# from functools import lru_cache # 簡単メモ化 @lru_cache(maxsize=1000)
# from fractions import gcd

# from decimal import Decimal, getcontext
# getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np    # numpy.lcm()
# from scipy.sparse.csgraph import shortest_path, dijkstra, floyd_warshall, bellman_ford, johnson
# from scipy.sparse import csr_matrix
# from scipy.special import comb,perm #permはnPk
# import networkx as nx
# G = Graph()

# slist = "abcdefghijklmnopqrstuvwxyz"
A,B = input().split()
A = int(A)
B = int(float(B)*10000)

B = round(B,-2)
ans = (A*B)//10000

# print(A,B,ans)
print(int(ans))
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する
# print("{:.10f}".format(ans))
# print("{:0=10d}".format(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal


def main():
    A, B = input().split()
    A = int(A)
    B = Decimal(B)
    print(int(A*B))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

a = int(a)
b1,b2 = b.split(".")
ans = a * (int(b1)*100 + int(b2))

print(ans // 100)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from decimal import *
getcontext().prec = 100
a,b=input().split()
a=int(a)
A=Decimal(a)*Decimal(b)
print(math.floor(A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import io,sys
sys.setrecursionlimit(10**6)

def main():
    s = sys.stdin.readline().rstrip().split()
    a = int(s[0])

    b = int(float(s[1])*100+0.1)

    print(a*b//100)
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

#################

A,B = list(map(str, input().split()))
A = int(A)
B = 100*int(B[0])+10*int(B[2])+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)

print(a*b//1000)

Submission status: Accepted

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

a, b = LI()
a = int(a)
b *= 100
b = round(b)
def main():
    ans = a * b
    ans //= 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)

res=str(A*B)

if len(res)<4:
	print(0)
else:
	print(res[:-3])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math

readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prl = lambda x: print(*x ,sep='\n')

a,b = input().split(' ')
ash_1 = int(a[-1])
ash_2 = int(a[-2:])
bsh_1 = int(b[-2])
bsh_2 = int(b[-1])
bsh_0 = int(b[0])
kuri = (ash_1*bsh_1*10 + ash_2*bsh_2) //100
if len(a) == 1:
    res = int(a)*bsh_0 + kuri
elif len(a) == 2:
    a1 = a[:-1]
    res = int(a)*bsh_0 + int(a1)*bsh_1 + kuri
else:
    a1 = a[:-1]
    a2 = a[:-2]
    res = int(a)*bsh_0 + int(a1)*bsh_1 + int(a2)*bsh_2 + kuri
print(res)

Submission status: Accepted

Solution code:
import math

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

a,b = list(input().split())
a=int(a)
b=int(b[0]+b[2]+b[3])



print((a*b)//100)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A=int(array[0])
B=int(float(array[1])*1000)

ans=A*B

print(ans//1000)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import scipy as sp
import math
 
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:
import decimal
# N = int(input())
A, B = [decimal.Decimal(i) for i in input().split()]
print(int(A*B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def solve(a, b):
    return a * (b * 100 + c) // 100


print(solve(a, b))

Submission status: Accepted

Solution code:
from decimal import Decimal
n,m = input().split()

print(int(n)*Decimal(m)//1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def resolve():
    a, b = input().split()
    a = int(a)
    b = int(float(b) * 100 + .5)
    
    ans = a*b
    print(ans//100)
if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

a = int(a)
b = decimal.Decimal(b) * 100

print(a * b // 100)

Submission status: Accepted

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




ans=a*b

print(ans//1000)

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()
b=b.replace(".","")
a=int(a)
b=int(b)
ans=a*b//100
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.readline
    a, b = map(str, input().split())
    a = int(a)
    b = int(b[0] + b[2:])
    print((a * b) // 100)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

Solution code:

a,b = input().split()
a = int(a)
b = float(b)
val = int((b * 1000)) 
new = (a * val)//1000 

#print(b)

print(new)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!python3

import sys

def resolve():
    a, b = sys.stdin.read().split()
    a = int(a); b = int(b.replace(".", ""))

    print(a*b//100)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np 
A,B = map(str,input().split())
A = int(A)
B = int(B[0]+B[2]+B[3])
print(int(A*B//100))

Submission status: Accepted

Solution code:
#!python3

iim = lambda: map(int, input().rstrip().split())

def resolve():
    a, b = input().split()
    a = int(a); b = int(b.replace(".", ""))

    print(a*b//100)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
from decimal import Decimal
a, b = [str(i) for i in input().split()]
a = int(a) 
b = Decimal(b)

#print(a,b)
#print(a*b)
print(int(a*b))

Submission status: Accepted

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

Submission status: Accepted

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

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

res = A * B // 100

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy import *                    # ll = deepcopy(l)
from heapq import *                    # heappush(hp,x)
from string import *                # alpha = ascii_lowercase
from random import *                # l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import *                # bisect_left(arr,x,start,end)  => start and end parameters are temporary
from sys import stdin                # bisect_left return leftmost position where x should be inserted to keep sorted
from sys import maxsize                # minn = -maxsize
from decimal import Decimal
from operator import *                # d = sorted(d.items(), key=itemgetter(1))
from itertools import *				  # pre = [0] + list(accumulate(l))
from collections import Counter        # d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)

'''
9990000000000000
9990000000000000
'''

def solve(l):
	a,b = l
	p = Decimal(a)*Decimal(b)
	return int(p)

l = list(map(str, stdin.readline().rstrip().split()))
ans = solve(l)
print(ans)

Submission status: Accepted

Solution code:
#!python3

iim = lambda: map(int, input().rstrip().split())
from decimal import Decimal

def resolve():
    a, b = input().split()
    a = int(a); b = int(b.replace(".", ""))

    print(a*b//100)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal

a,b = input().split()
a = int(a)
c = b[0]+b[2:4]
c = int(c)

ans = a*c//100

print(int(ans))

Submission status: Accepted

Solution code:
import math
from decimal import Decimal

A, B = map(Decimal, input().split())
mul = A * B
mul2 = math.floor(mul)
print(mul2)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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()
    m = 10**18
    a = int(sa)
    b = int(float(sb)*m)
    print(a*b//m)

    
main()

Submission status: Accepted

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

A = int(A)
B = round(float(B) * 100.00)

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

Submission status: Accepted

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

b = b.replace(".", "")

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

Submission status: Accepted

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

ans = A*B + A*C//100
print(ans)

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:
import math
from decimal import Decimal
x = input().split()
a = int(x[0])
b = Decimal(x[1])
b = b*100
b = int(b)
ans = a*b
ans = ans//100
print(int(ans))

Submission status: Accepted

Solution code:
from fractions import Fraction
a,b=map(Fraction,input().split())
ans = a*b
print(ans.numerator//ans.denominator)

Submission status: Accepted

Solution code:
# Problem C - Multiplication 3

import math

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

# initialization
ans = (A * B)//1000

# output
print(ans)

Submission status: Accepted

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

A,B=input().split()

x=int(B[0])
y=int(B[2])
z=int(B[3])

ans=[0]*18
L=len(A)

for i in range(L):
    a=int(A[L-i-1])
    c=a*z
    ans[17-i]=c

for i in range(L):
    a=int(A[L-i-1])
    c=a*y
    ans[16-i]+=c

for i in range(L):
    a=int(A[L-i-1])
    c=a*x
    ans[15-i]+=c

S=0

for i in range(16):
    S+=ans[i]*10**(15-i)

if ans[16]*10+ans[17] > 100:
    S+=(ans[16]*10+ans[17])//100
print(int(S))

Submission status: Accepted

Solution code:
a,b=input().split()
a=int(a)
i,f=b.split('.')
print(a*(int(i)*100+int(f))//100)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

a = int(a)
x, y, z, = int(b[0]), int(b[2]), int(b[3])


c = (a * (x * 100 + y * 10 + z)) // 100

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(str,input().split())
a1 = int(a)
b1 = int(float(b)*1000)
ab = a1*b1
ans = int(ab//1000)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import *
a, b = map(str, input().split())
 
num = (Decimal(a) * Decimal(b)).quantize(Decimal('1'), rounding=ROUND_DOWN)
print(num)

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

Submission status: Accepted

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

A = int(A)
B = int(B * 1000)  # int()変換だとNG

res = A * B // 1000

print(int(res))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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