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: Runtime Error

Solution code:
#include<cmath>
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<map>
#include<queue>
#include<set>
#include<vector>
#include<bitset>
#define int unsigned long long
#define hh putchar('\n')
#define kg putchar(' ')
#define lowbit(x) ((x)&(-x))
using namespace std;
const int maxn=1000005,mod=998244353;
int n,isprime[maxn],prime[maxn],num;
inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
		if(ch=='-')
			f=-1;
		ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
    }
    return x*f;
}
inline void write(int a)
{
    if(a<0)
    {
		putchar('-');
		putchar('1');
    }
    else
    {
		if(a>=10)
			write(a/10);
		putchar(a%10+'0');
    }
}
int calc(int xx,int yy)
{
	return n*(xx-1)+yy-1;
}
int fo()
{
	int kotae=1;
	for(int i=1;i<=18;++i)
		kotae*=10;
	return kotae;
}
void make_prime()
{
    for(int i=1;i<maxn;++i)
		isprime[i]=1;
    isprime[0]=isprime[1]=0;
    for(int i=2;i<=maxn;++i)
    {
        if(isprime[i])
            prime[++num]=i;
        for(int j=1;j<=num&&i*prime[j]<maxn;++j)
        {
            isprime[i*prime[j]]=0;
            if(!(i%prime[j]))
                break;
        }
    }
    return;
}
signed main()
{	
	int a,b;
	int bb;
	cin>>a;
	b=read(),bb=read();
	b=b*100+bb;
	cout<<a*b/100<<endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
import sys,collections as cl,bisect as bs,math
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
	return list(map(int,input().split()))
def m(): #複数文字
	return map(float,input().split())
def onem(): #Nとかの取得
	return int(input())
def s(x): #圧縮
	a = []
	if len(x) == 0:
		return []
	aa = x[0]
	su = 1
	for i in range(len(x)-1):
		if aa != x[i+1]:
			a.append([aa,su])
			aa = x[i+1]
			su = 1
		else:
			su += 1
	a.append([aa,su])
	return a
def jo(x): #listをスペースごとに分ける
	return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
	return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
	ll = 0
	rr = r
	while True:
		mid = (ll+rr)//2

	if rr == mid:
		return ll
	if (ここに評価入れる):
		rr = mid
	else:
		ll = mid+1
"""

a,b = m()
co = 0
po = b
while True:
	if int(po) == po:
		break

	else:
		po *= 10
		co += 1 
	


print(int(a)*po//(10**co)))

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <math>

using namespace std;


int main(){

int a;
int b;
cin >> a >> b;
double float rs=0;
rs=floor(a*b)
cout << (long long) (rs);

}

Submission status: Runtime Error

Solution code:
from functools import reduce
from operator import add, mul

N = int(input())
s = list(map(int,input().split()))
t = reduce(mul , s)

if( t <= 10**18):
    print(t)
else:
    print(-1)

Submission status: Runtime Error

Solution code:
A = int(input())
B = float(input())
print(A*B//1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define ll long long
#define PB push_back
#define POP pop_back()
#define PII pair<int,int>
#define FI first
#define SE second
#define ULL unsigned long long
#define endl '\n'
using namespace std;
const int INF=0x3f3f3f3f;
const double pi=acos(-1),eps=1e-8;

int main()
{

	double a,b;
	scanf("%lf%lf",&a,&b);
	double ans=floor(a*b);
	printf("%.0lf",ans);
 	return 0;
}

Submission status: Runtime Error

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


def solve(A: int, B: int):
    r = str(A*B)
    if len(r) > 3:
        print(r[:len(r)-2])
    else:
        print(0)
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = next(tokens)
    startWithZero = True
    l = 0
    bstr = ""
    for c in B:
        if c==".":
            continue
        if c == "0":
            l += 1
            if startWithZero:
                pass
            else:
                bstr += "0"
        else:
            l += 1
            startWithZero = False
            bstr += c
    for i in range(3-l):
        bstr+= "0"
    solve(A, int(bstr))
#
if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

in_d = input()

a, b = in_d.split()
a = int(a)
b = float(b)
c = a * b

print(math.floor(c))

Submission status: Runtime Error

Solution code:
def mul(a,b):
  s=a*b;
  print(int(s))
a=int(input(""))
b=float(input(""))
mul(a,b)

Submission status: Runtime Error

Solution code:
hoge = input()
A, B = [np.double(digit) for digit in hoge.split(" ")]
print(int(A*B))

Submission status: Runtime Error

Solution code:
import math
num1=int(input())
num2=float(input())
mul=num1*num2;
int(float(mul))
print(round(mul))

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define ll long long
#define PB push_back
#define POP pop_back()
#define PII pair<int,int>
#define FI first
#define SE second
#define ULL unsigned long long
#define endl '\n'
using namespace std;
const int INF=0x3f3f3f3f;
const double pi=acos(-1),eps=1e-8;

int main()
{
//	ll a;
//	cin>>a;
//	string s;
//	cin>>s;
//	int tmp=0,t1=0;
//	tmp=s[0]-'0';
//	t1=(s[2]-'0')*10+s[3]-'0';
//	//cout<<tmp<<" "<<t1<<endl;
//	ll ans=a*tmp+a*t1/100;
//	cout<<ans<<endl;
	double a,b;
	cin>>a>>b;
	double ans=(floor(a*b));
	printf("%.0lf",ans);
 	return 0;
}

Submission status: Runtime Error

Solution code:
x,y = input().split()
print(int(x)*int(y))

Submission status: Runtime Error

Solution code:
import decimal
ab = input().split()
a,b = int(ab[0]),decimal(ab[1])
answer = int(a*b)
print(answer)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

A,B = input().split()
iA = int(A)
fB = float(B)
iB = math.floor(fB)
fB100 = math.floor(fB*100 - iB*100)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
hoge = input()
A, B = [double(digit) for digit in hoge.split(" ")]
print(int(A*B))

Submission status: Runtime Error

Solution code:
import math
import decimal

def main():
  a, b = input().split()
  a = int(a)
  b = decimal(b)
  c = int(b)
  d = (b - c) * 100
  ans_a = a * c
  ans_b = (a * d) // 100
  ans = math.floor(ans_b) + ans_a
  print(ans)
 
 
if __name__ == '__main__':
  main()

Submission status: Runtime Error

Solution code:
import math
from collections import deque
a,b=map(float,input().split())
a=int(a)
A=a
lst=deque()
while a > 0:
    lst.append(a%10)
    a //= 10
lst.reverse()

c=lst.pop()
if len(lst)>=2:
  c+=10*lst.pop()
d=math.floor(c*b)

A-=c
A=int(A/100)
b=int(b*100)
print(A*b+d)

Submission status: Runtime Error

Solution code:
# coding: utf-8
#C
a, b = map(float,input().split())
a = int(a)
b = int(b*100)

ans = a * b

ans = int(str(ans)[:-2])
print(ans)

Submission status: Runtime Error

Solution code:
from decimal import *
def main():
    A , B = input().split()
    A = float(A)
    B = float(B)
    C = Decimal(A) * Decimal(B)
    #print(C)
    D = str(C)
    D = D.split(".")[0]
    #print(D)
    E = int(D)
    print(E)



if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
a=int(input())
b=float(input())

print(math.floor(a*b))

Submission status: Runtime Error

Solution code:
a, b = input().split()
a = int(a)
b_i = int(b[:-3])
b_f = int(b[-2:])
b_m = a*b_f
print(a*b_i + int(str(b_m)[:-2]))

Submission status: Runtime Error

Solution code:
if __name__ == '__main__':
    n = input()
    inputline = input()
    parsed_input = inputline.split(" ")
    a = parsed_input[0]
    b = parsed_input[1]
    total = int(a * b)

Submission status: Runtime Error

Solution code:
import math

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

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

Submission status: Runtime Error

Solution code:
#c
a,b=map(float, input().split())
import math
a = decimal.Decimal(a)
b = decimal.Decimal(b)
ans = a*b
print(ans)

Submission status: Runtime Error

Solution code:
a, b = map(str, input().split())
n = len(a)
al = int(a[:n//2])
ar = int(a[n//2:])
b = float(b)
print(al, ar)
res = str(int(al*b)) + str(int(ar * b))
print(res)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main(){
    long double A, B;
    cin >> A >> B;

    long long ans = (long long)(A*B);
    cout << ans << endl;
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

if __name__ == '__main__':
    n = input()
    inputline = input()
    parsed_input = inputline.split(" ")
    a = parsed_input[0]
    b= parsed_input[1]
    print(math.floor(a*b))

Submission status: Runtime Error

Solution code:
hoge = input()
A, B = [int(digit) for digit in hoge.split(" ")]
print(int(A*B))

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define ll long long
#define PB push_back
#define POP pop_back()
#define PII pair<int,int>
#define FI first
#define SE second
#define ULL unsigned long long
#define endl '\n'
using namespace std;
const int INF=0x3f3f3f3f;
const double pi=acos(-1),eps=1e-8;

int main()
{
	ll a;
	cin>>a;
	string s;
	cin>>s;
	int tmp=0,t1=0;
	tmp=s[0]-'0';
	t1=(s[2]-'0')*10+s[3]-'0';
	//cout<<tmp<<" "<<t1<<endl;
	ll ans=a*tmp+a*t1/100;
	cout<<ans<<endl;
 	return 0;
}

Submission status: Runtime Error

Solution code:
if __name__ == '__main__':
    a = [float(i) for i in input().split()]
    b= int(a[0])
    c = int(a[1]*100)
    d = Decimal(a[0]) * Decimal(a[1])
    e = int(d)
    print(e)

Submission status: Runtime Error

Solution code:
import math
import sys
N = input()
lista = N.split()

A = lista[0]
B = lista[1]

C = float(A)
D = float(B)
print(int(C//D))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=map(float,input().split())
a=int(a)
z=list(str(b-int(b)))
t=''
for i in range(4):
    t+=z[i]
t=float(t)
print(int(int(a*int(b))+int(t*a)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x, y = map(int, input().split())
print(round(x*y))

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

Solution code:
import math

a, b = map(float, input().split())
c = int(a)
times = c * b
new_times = math.floar(times)
print(int(new_times))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import math

a = int(input())
b = float(input())
x = a * b
y = math.floor(x)

print(y)

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())
a = x*y
ans = math.floor(a)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B = (int(x) for x in input().split())
print(int(A*B))

Submission status: Runtime Error

Solution code:
#include <stdio.h>

long long int a;
double b;


int main()
{
    scanf("%lld %lf",&a,&b);
    long long int ans=a*b;
    printf("%lld\n",ans);
}

Submission status: Runtime Error

Solution code:
from sys import stdin
from math
def LF(): return list(map(float,stdin.readline().rstrip().split()))

tmp = LF()
ans = tmp[0]*tmp[1]
print(math.floor(ans))

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
ans = a[0]
for i in range(n-1):
    ans *= a[i+1]
    if ans > 10**18:
        break
if ans > 10**18:
    print(-1)
else:
    print(ans)

Submission status: Runtime Error

Solution code:
import math
a=input()
b=input()
print(math.floor(a*b))

Submission status: Runtime Error

Solution code:
import math

s = input().split()

A = int(s[0])
B = float(s[1])

seisu = math.floor(B)
daiiti = math.floor(B*10)/10 - seisu
daini = B - seisu - daiiti

big = A*seisu
small = A*(int(daiiti*10))
if small >= 10:
  small = int(str(small)[:-1])
else:
  small = 0
too_small = A*(int(daini*100))
if too_small >= 100:
  too_small = int(str(small)[:-2])
else:
  too_small = 0

print(big+small+too_small)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = input().strip().split()
a, b = [int(a), int(b)]
ans = int(a * b)
print(ans)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <utility>
#include <cctype>

using namespace std;

using ll = long long;
using P = pair<int, int>;

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define mkp(a, b) make_pair(a, b)
const int inf = 1e+9;


int main() {
 	ll a;
 	double b;
 	cin >> a >> b;

 	ll bb = b * 100.0 + 0.00000000000001;

 	cout << a * bb / 100 << endl;


	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

A, B = input().split(" ")
A = int(A)
B = int(B)

print(math.floor(A * B))

Submission status: Runtime Error

Solution code:
import Decimal
A,B = map(decimal,input().split())
ans=A*B
print(Decimal(ans).quantize(Decimal('')),rounding=ROUND_DOWN)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

#define LL long long
//#define LL __int64
typedef pair<int, int> pii;
typedef pair<LL, LL> pLL;
typedef vector<int> VI;
typedef vector< vector<int> > VVI;

template< typename T > inline void read(T &x)
{
    static char _c;
    static bool _f;

    x = 0;
    _f = 0;
    _c = getchar();

    while(_c < '0' || '9' < _c) {if(_c == '-') _f = true; _c = getchar();}
    while('0' <= _c && _c <= '9') {x = (x << 1) + (x << 3) + (_c & 15); _c = getchar();}
    if(_f) x = -x;
}
template < typename T, typename ...Args > inline void read(T &x, Args &...args) {read(x); read(args...);}

template < typename T > inline void Min(T &x, T y) {if(y < x) x = y;}
template < typename T > inline void Max(T &x, T y) {if(x < y) x = y;}


#define lowbit(x) ((x) & -(x))
#define lson l,mid,id<<1
#define rson mid+1,r,id<<1|1
#define ls id<<1
#define rs id<<1|1
#define MID(l,r) ((l)+(((r)-(l))>>1))
#define fi first
#define se second
#define mk make_pair
#define mt make_tuple
#define pb push_back
#define all(a) a.begin(),a.end()

const int INF = 0x3f3f3f3f;
const LL LINF = 0x3f3f3f3f3f3f3f3f;
const double pi = (double) acos(-1.0);
const double eps = (double) 1e-8;
const int e5 = (int) 1e5 + 5;
//const int MOD = (int) 1e9 + 7;
const int MOD = (int) 1000000007;
//const int MOD = 998244353;

template< typename T0, typename T1 > inline void depair(T0 &x, T1 &y, pair<T0, T1> &p) {x = p.fi, y = p.se;}
inline int sig(double x) {return x < -eps ? -1 : eps < x;}
LL fp(LL a, LL n, LL mod = MOD)
{
    if(n < 0) a = fp(a, mod - 2, mod), n = -n;
    LL res = 1; for(; n; n >>= 1, a = a * a % mod) if(n & 1) res = res * a % mod; return res;
}

struct Mint
{
    int x;
    Mint():x(0) {}
    Mint(int _x): x(_x)
    {
        if(x >= MOD) x %= MOD;
        else if(x < 0) x = (x % MOD + MOD) % MOD;
    }
    Mint operator - () const{
        return Mint(MOD - x);
    }
    Mint operator + (const Mint &rhs) const{
        return Mint(x + rhs.x >= MOD ? x - MOD + rhs.x : x + rhs.x);
    }
    Mint operator - (const Mint &rhs) const{
        return Mint(x - rhs.x < 0 ? x - rhs.x + MOD : x - rhs.x);
    }
    Mint operator * (const Mint &rhs) const{
        return Mint((LL)x * rhs.x % MOD);
    }
    Mint operator / (const Mint &rhs) const{
        return Mint((LL)x * fp(rhs.x, -1) % MOD);
    }
    Mint& operator += (const Mint &rhs) {
        x += rhs.x; if(x >= MOD) x -= MOD; return *this;
    }
    Mint& operator -= (const Mint &rhs) {
        x -= rhs.x; if(x < 0) x += MOD; return *this;
    }
    Mint& operator *= (const Mint &rhs) {
        x = ((LL)x * rhs.x) % MOD; return *this;
    }
    Mint& operator /= (const Mint &rhs) {
        x = (LL)x * fp(rhs.x, -1) % MOD; return *this;
    }
    bool operator == (const Mint &rhs) const{
        return x == rhs.x;
    }
    bool operator != (const Mint &rhs) const{
        return x != rhs.x;
    }
    friend ostream& operator << (ostream &out, const Mint &rhs){
        return out << rhs.x;
    }
    friend istream& operator >> (istream &in, Mint &rhs){
        return in >> rhs.x;
    }

    Mint rev() {return Mint(fp(x, -1));}
    Mint pow(int k) {return Mint(fp(x, k));}
    Mint pow(const Mint &t) {return Mint(fp(x, t.x));}
};


const int maxn = (int) 1e5 + 20;
const int maxm = (int) 1e6 + 20;

void work()
{
    LL a;
    double b;
    cin >>a >>b;
    LL c = a * b * 10;
    cout <<c / 10 <<endl;
}

int main(int argc, char **argv)
{
#ifdef yukihana0416
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif // yukihana0416
//    get_prime();
//    pre();
    int tc = 1;
//    read(tc);
    for(int ca = 1; ca <= tc; ca++)
    {
//        printf("Case #%d: ", ca);
        work();
    }
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
x=input().split(" ")  
n=int(x[0])  
m=int(x[1]) 
ans=math.floor(n*m)
print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import numpy as np


N = int(input())
A = list(map(int,input().split()))

Max = 10 ** 18

result = np.prod(A)

if result > Max:
    print(-1)
else:
    print(result)

Submission status: Runtime Error

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]+a*b[2]//10+a*b[3]//100
print(c)

Submission status: Runtime Error

Solution code:
A,B = map(float,input().split())
ans = str(A*B)
if ans[-3] == '.':
    a = ans[0:len(ans) - 3]
    print(int(a))
else:
    a = ans[0:len(ans) - 2]
    print(int(a))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import Decimal
A,B = map(decimal,input().split())
ans=A*B
print(ans.quantize,rounding=ROUND_DOWN)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = map(str, input().split())
n = len(a)
al = int(a[:n//2])
ar = int(a[n//2:])
print(al, ar)
res = str(al*b) + str(ar * b)
print(res)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <unordered_set>
#include <cmath>
// #include <prettyprint.hpp>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;++i)
#define repi(i,n) for(ll i=n-1;i>=0;--i)
#define sll(n) scanf("%lld", &n);
#define slf(n) scanf("%lf", &n);
typedef long long ll;
typedef double lf;
const double PI=3.14159265358979323846;
static const ll max_n = 100010;
static const ll mod = 1000000007;
static const ll max_value = 100000000000100;
// vector<ll> height(max_n, -1);
// vector<pair<ll,ll>> edge_list(max_n);

ll N, M, Q;


void Main(){
    // bool is_ok = true;
    // printf("------------- V=%lld---------\n", V);
    ll A;
    lf B;
    sll(A);
    slf(B);

    // ll deciaml_b = B * 100;
    // ll int_b = B;
    // deciaml_b = deciaml_b % 100;
    // cout << "B = " << B << ", "<< B / 1<< ", decimal b " << deciaml_b <<endl;
    // cout << "A * decimal b = " << A * deciaml_b <<endl; 
    // ll ans = A * int_b + (A * deciaml_b) / 100;
    ll ans = floor(A * B);

    cout <<  ans <<endl;

}

int main(){
    Main();

    return 0;
}

Submission status: Runtime Error

Solution code:
li = list(map(float,input().split()))
mul = 1.0
for i in li:
  mul *= i
print(math.floor(mul))

Submission status: Runtime Error

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

print((a*b)%1)

Submission status: Runtime Error

Solution code:
import math
import re

a = input()
b = int(re.findall('^.',a))
c = float(re.findall('.$',a))

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

Submission status: Runtime Error

Solution code:
#include <stdio.h>

int main(){
    double a, b;
    long m;
    scanf("%lf %lf", &a, &b );
    m = a * b;
    printf("%ld\n", m);
    return 0;
}

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())
la = x * y
ans = math.floor(la)
print(ans)

Submission status: Runtime Error

Solution code:
/*
            _           __                _      _____ _____ _____ 
  ___ _   _| |__   ___ / _|_ __ ___  __ _| | __ |___  |___  |___  |
 / __| | | | '_ \ / _ \ |_| '__/ _ \/ _` | |/ /    / /   / /   / / 
| (__| |_| | |_) |  __/  _| | |  __/ (_| |   <    / /   / /   / /  
 \___|\__,_|_.__/ \___|_| |_|  \___|\__,_|_|\_\  /_/   /_/   /_/   

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll ;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vi;
typedef vector<pll> vpll;
typedef unordered_map <ll,ll> umap ; 
//#pragma GCC optimize "trapv"
#define loop(i,a,b) for(ll i=a ;i<b;i++)
#define For(i,n) for(int i=0;i<(ll)n;i++)
#define Rev(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,n) for(int i=1;i<=n;++i)
#define F first
#define S second
#define pb push_back
#define em emplace_back
#define all(v) (v).begin(),(v).end()                                                              
#define mems(x, y) memset(x, y, sizeof(x))
#define sz(v) (v).size()
#define mp(a,b) make_pair(a,b)
#define pf(n) cout<<n<<"\n"
#define pff(n) cout << n << " " ; 
#define ar array
#define endl "\n" 
#define PI acos(-1) 
//#define int ll 
long const M=1e9+7;
const long mxN =1e5+2 ;
void solve(){
  ll a; float b ; cin >> a >>  b ;
  long double x = a*b ;
  cout <<  floor(x) ;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  //cout << setprecision(20) << fixed ;
  solve() ;
  //ll t ; cin >> t ; while(t--)solve() ;
	return 0;
}

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;   
#define ll long long
#define ull unsigned long long
#define ordered_set tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag, tree_order_statistics_node_update> 
ll mod=1e9+7;
#define PI 3.1415926535897932385
#define inf 9e18
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
typedef pair<long long, long long> ii;
#define S second
#define F first
ll max(ll a,ll b){if(a>b){return a;}return b;}
ll min(ll a,ll b){if(a<b){return a;}return b;}
#define MAXN 200005
// string to integer stoi() Remember: it takes string not character
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
 
// To compile--> g++ -std=c++0x -o output one.cpp
// To run--> ./output

int main() {
    fastio;
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);

    double long a,b;
    cin>>a>>b;
    cout<<long(a*b);

    return 0;
}

Submission status: Runtime Error

Solution code:
import math

A,B = input().split()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys, io, os, re
import bisect
from pprint import pprint
from math import sin, cos, pi, radians, sqrt, floor
from copy import copy, deepcopy
from collections import deque
from fractions import gcd
from functools import reduce

def array1(n): return [0] * n
def array2(n, m): return [[0] * m for x in range(n)]
def array3(n, m, l): return [[[0] * l for y in xrange(m)] for x in xrange(n)]

arr = map(float, sys.stdin.readline().strip().split())
print(int(floor(arr[0]*arr[1])))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

import math

print(math.floor(A*B))

Submission status: Runtime Error

Solution code:
import math
import sys
C, D = map(int, input().split())
 
print(C//D)

Submission status: Runtime Error

Solution code:
#define deb 123321
#define fi first
#define se second
#define mp make_pair
#define pb push_back

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
constexpr int R=5e7+69, INF=2e9+6969;

ull a,b;
float x;

int main()
{
	cin>>a>>x;
	b=(ull)(x*100);
	a=a*b;
	a=a/100;
	printf("%llu\n", a);
	return 0;
}

Submission status: Runtime Error

Solution code:
import math

A,B = input().split()

print(math.floor(A*B))