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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> vi;
#define endl '\n'
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define rf(i,a,b) for(int i=a;i>=b;i--) 
#define fast_io ios_base::sync_with_stdio(0);
#define show(x) cout<<x<<endl;
#define pret(x) cout<<x<<endl; return 0;
#define disp(x) cout<<x<<" ";
#define let(x,y) cout<<x<<" "<<y<<endl;
ll MOD=1e9+7;
const int maxn=2e5+5;

int32_t main(){
    fast_io;
    int a;
    double b;
    cin>>a>>b;
    int c = int(b*100.0);
    c = a*c;
    c /= 100;
    show(c);
    return 0;
}

Submission status: Runtime Error

Solution code:
import math
x = input()
a = int(x[0])
b = float(x[1]) 

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

Submission status: Runtime Error

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

print(int(x * y))

Submission status: Runtime Error

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

#a=198
#b=1.10

print(int(a*b))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(math.floor(input()*input()))

Submission status: Runtime Error

Solution code:
import math

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

print(math.floor(ans))

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())
import math

print(math.floor(x*y))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=input().split()
a0=a//(10**9)
a1=a-a0*10**9
b*=100
print((a0*b*10**9+a1*b)//100)

Submission status: Runtime Error

Solution code:
import math

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

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

Submission status: Runtime Error

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

print(math.floor(a * b))

Submission status: Runtime Error

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

#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).begin(),(hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
//constexpr long long MOD = (ll) 1e9 + 7;
constexpr long long MOD = 998244353LL;
using ld=long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;


template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

struct Edge {
	ll to, rev;
    long double cap;
	Edge(ll _to, long double _cap, ll _rev) {
	to = _to; cap = _cap; rev = _rev;
	}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;

void add_edge(Graph& G, ll from, ll to, long double cap, bool revFlag, long double revCap) {
	G[from].push_back(Edge(to, cap, (ll)G[to].size()));
	if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}



void solve(){
    long double a,b;
    cin>>a>>b;
    cout<<(ll)(a*b)<<en;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
	
	solve();
	//ll t;cin>>t;REP(i,t) solve();

    return 0;
}

Submission status: Runtime Error

Solution code:
nums = input()
s = nums.split(" ")

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace  std;
 
typedef  long  long int ll;
typedef  vector<int> vi;
#define  fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define  pb push_back
#define  all(x) x.begin(), x.end()
const ll mod = (ll)(1e9 + 7); 
const double pi = 3.14159265358979323846;


void solve()
{
    long double a,b;
    cin>>a>>b;
    if(a==0 or b==0){cout<<0<<endl;return;}
    cout<<floor(a*b)<<endl;
}

int main()
{
    fast
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    freopen("error.txt", "w", stderr);
#endif
// int t; cin>>t; while(t--) 
solve();
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
A,B = map(int,input().split())
c=A*B
ans = math.ceil(c)
print(ans)

Submission status: Runtime Error

Solution code:
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <cassert>
using namespace std;

#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll> 
#define VVI vector<vector<ll> >
#define VVVI vector<vector<vector<ll>>>
#define VVVVI vector<vector<vector<vector<ll>>>>
#define REP(i,n) for(ll i=0,_n=(n);(i)<(ll)_n;++i)
#define REPR(i,n) for(ll i=(ll)(n)-1;0<=(i);--i)
#define RANGE(i,a,b) for(ll i=(ll)a,_b=(ll)(b);(i)<_b;++i)
#define RANGER(i,a,b) for(ll i=(ll)(b)-1,_a=(ll)(a);(_a)<=i;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b) 
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b) 
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
#define FI first
#define SE second
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template<typename T>void maxUpdate(T& a, T b) {a = max(a, b);}
template<typename T>void minUpdate(T& a, T b) {a = min(a, b);}
string YN(bool v) { return v ? "Yes":"No"; }
void uniq(VI& es) { sort(ALL(es)); es.erase(unique(ALL(es)), es.end()); }

#define INF (1LL<<60)

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll A;
	double B;
	while(cin>>A>>B) {
		ll b = B*100.0+0.001;
		ll ans=A*b/100;
		cout<<ans<<endl;
	}
	
	return 0;
}

Submission status: Runtime Error

Solution code:
/*
    JAI JAGANNATH!
*/
//@Author : zanj0
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int lli;
#define ff              first
#define ss              second
#define pb              push_back
#define mp              make_pair
#define pii             pair<lli,lli>
#define vi              vector<lli>
#define mii             map<lli,lli>
#define pqb             priority_queue<lli>
#define pqs             priority_queue<lli,vi,greater<lli> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            lli x; cin>>x; while(x--)
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef tree<lli, null_type, less<lli>, rb_tree_tag, tree_order_statistics_node_update> pbds;
// find_by_order(k)  returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
const lli nax = 1e18;
void zanj0()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

}
void solve() {
	lli a;
	double  b;
	cin >> a >> b;
	double prod = a * b;
	cout << (lli)prod << endl;
}
int main()
{
	zanj0();
	solve();
	return 0;
}

Submission status: Runtime Error

Solution code:
X,Y=list(map(int,input().split()))

print(X*Y//1)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, T t){return v2<T>(r, vector<T>(c, t));}

void solve(){
    ll a;
    double b;
    cin >> a >> b;
    cout << (ll)(b*a) << '\n';
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

Submission status: Runtime Error

Solution code:
import math

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

Submission status: Runtime Error

Solution code:
k = list(map(int, input().split()))
import math
print(math.floor(k[0] * k[1]))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
import math


if __name__ == "__main__":
    
    INPUT = list(map(float, input().split()))


    print(math.floor(h1 * m1))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace  std;
 
typedef  long  long int ll;
typedef  vector<int> vi;
#define  fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define  pb push_back
#define  all(x) x.begin(), x.end()
const ll mod = (ll)(1e9 + 7); 
const double pi = 3.14159265358979323846;


void solve()
{
    long double a,b;
    cin>>a>>b;
    cout<<floor(a*b)<<endl;
}

int main()
{
    fast
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    freopen("error.txt", "w", stderr);
#endif
// int t; cin>>t; while(t--) 
solve();
}

Submission status: Runtime Error

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

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 = int(input())

print(math.floor(a*b)

Submission status: Runtime Error

Solution code:
#入力:N,M(int:整数)
def input2():
	return map(float,input().split())
  
  
a,b=input2()
print(math.floor(a*b))

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(int, input().split())

print(math.floor(A*B))

Submission status: Runtime Error

Solution code:
X,Y=input().split()

print(X*Y//1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(math.floor(A*B))

Submission status: Runtime Error

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

import sys
sys.setrecursionlimit(300000)


def solve(A: int, B: float):
    s = B[0] * 100
    x = int(B[2:])
    #ret = (B * 100 * A) // 100
    ret = ((s + x) * A) // 100
    print(int(ret))
    return

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 = str(next(tokens))  # type: float
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=eval(input())
a=a*b
print(int(a))

Submission status: Runtime Error

Solution code:
import itertools

import math


def main():
    A, B = map(int, input().split())

    print(math.floor(A*B))


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
ipnl = lambda n: [int(input()) for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]

a,b = ip()
print(int(a*b//1))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=input()
a=a*b
print(int(a))

Submission status: Runtime Error

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

int(a*b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
a,b=(int(i) for i in input().split())
print(math.floor(a*b))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

a, b = (int(i) for i in input().split())  
c = a * b
print(math.floor(c))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
ls = list(map(int, input().split()))
print(math.floor(ls[0]*ls[1]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
l=list(map(int,input().split()))
p=1
flag=1
for i in l:
  p*=i
  if p>1000000000000000000:
    flag=0
    break
if flag==0:
  print('-1')
else:
  print(p)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(int(a*b))

Submission status: Runtime Error

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

a = int(A)
b = B

print(int(a * b))

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:
N = int(input())
a = list(map(int,input().split()))
ans = 1
for i in range(N):
  if(0 in a):
    ans = 0
    break
  ans *= a[i]
  if(ans>10**18):
    ans = -1
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def main():
    a, b = list(input())
    a = int(a)
    b = float(b)
    ans = int(a*b)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

def main():
    a,b = map(int, input().split())
    print(floor(a*b))

if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
ipnl = lambda n: [int(input()) for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]

n = inp()
x = ip()
ele = 10**18
prod = 1
if 0 in x:
    print(0)
    exit()
for i in x:
    prod *= i
    if prod > ele:
        print(-1)
        exit()
print(prod)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

    print(math.floor(A * B))

resolve()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def solve():
    a, b = input().split()
    a = int(a)
    b = float(b)
    print(math.floor(a*b))
    return 0

if __name__ == "__main__":
    solve()

Submission status: Runtime Error

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

import math
ans = math.ceil(A*B)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from functools import reduce
from operator import mul

n = int(input())
a_list = list(map(int, input().split()))

result = reduce(mul, a_list)

if result > 10 ** 18:
    print(-1)
else:
    print(result)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#include <sstream>
#include <iomanip>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std;

const double pi = 3.14159265359;
const ll INF = 1e12;
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 5;
/*
Decimal Places: cout << fixed << setprecision(n) << ans << endl

String to integer:
stringstream dark(s);
int x = 0; dark >> x;
*/

bool compare(const pair<int, int>&i, const pair<int, int>&j)
{
    return i.second < j.second;
}


double a, b;

void solve()
{
    cin >> a >> b; nout(floor(a*b));
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int t = 1;
    //cin >> t;
    for (int i=1; i<=t; i++)
    {
        solve();
    }
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

print(math.floor(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

a = list(map(int, input().split()))
count = 1
for i in a:
    count *= i
if count > 10 ** 18:
    print(-1)
else:
    print(count)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

a,b = (int(x) for x in input().split())
print(math.floor(a*b))

Submission status: Runtime Error

Solution code:
import sys
from functools import lru_cache
 
#read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**6)
def read():
  return int(readline())
def reads():
  return map(int, readline().split())
def mp(arg):
  return map(int,arg.split())
n=read()
res=1
mod=10**18
a=list(reads())
if 0 in a:
  print("0")
  exit()
for i in range(n):   
    res*=a[i]
    print(res)
    if res>mod:
        print("-1")
        exit()
print(res)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
a, b = [int(i) for i in input().split()]

print(math.floor(a*b))

Submission status: Runtime Error

Solution code:
import sys
# from collections import defaultdict
# from collections import Counter
# from queue import Queue

def main():
    # N = int(input())

    N, M = [int(s) for s in input().split()]
    print(int(N * M))

    # As = []
    # for i in range(N):
    #     tmp = int(input())
    #     As.append(tmp)

    return 0

if __name__ == '__main__':
    sys.exit(main())

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

Solution code:
import math

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

print(math.floor(ans))

Submission status: Runtime Error

Solution code:
from math import floor

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

print(floor(A * B))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(int(a*b))

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
p=n*k
p=p//1
print(p)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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(int, input().split())
ans = math.floor(a * b)
print(ans)

Submission status: Runtime Error

Solution code:
#include<vector>
#include<map>
#include<algorithm>
#include<set>
#include<iostream>
#include<string>
#include<set>
#include<queue>
#include<random>
//#include<unordered_set>

using namespace std;

/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> st;*/

#pragma GCC optimize("Ofast")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")

#define pb push_back
#define ld long double
#define int long long

mt19937 rnd(51);

int32_t main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ld n;
	ld b;
	cin >> n >> b;
	cout << (int)(n * b);
	return 0;
}

Submission status: Runtime Error

Solution code:
import sys
import math
import itertools
import collections
import heapq
import numpy as np

rl = sys.stdin.readline

a, b = map(int, rl().split())

print((a*b)//1)

Submission status: Runtime Error

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

#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Submission status: Runtime Error

Solution code:
def solve():
    a,b = map(int,input().split())
    print(a*b//1)
if __name__=='__main__':
    solve()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def solve():
    a,b = int(input())
    print(a*b//1)
if __name__=='__main__':
    solve()

Submission status: Runtime Error

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

a,b=getNM()

print(int(a*b))

Submission status: Runtime Error

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

print(int(a*b))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(a*b//1)

Submission status: Runtime Error

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

print( math.floor( a * b ) )

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print((a*b)//1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(int(A * B))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(math.floor(a*b))

Submission status: Runtime Error

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