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:
package main

import (
	"bufio"
	"bytes"
	"fmt"
	"io"
	"os"
	"strconv"
)

var DEBUG = true

func main() {
	defer Flush()

	A := readi()
	s := readb()
	t := make([]byte, 0)
	for _, c := range s {
		if c == '.' {
			continue
		}
		t = append(t, c)
	}
	B, err := strconv.ParseInt(string(t), 10, 64)
	if err != nil {
		panic(err.Error())
	}

	a := uint(A)
	b := uint(B)
	ans := a * b / 100
	println(ans)
}

// -----------------------------------------------------------------------------

// IO helper functions

// Returns next token from input.  It must be initialized by SetInput()
// before the first call.
var nextToken func() ([]byte, error)
var nextLine func() ([]byte, error)

// Holds a buffer for output.  It must be initialized by SetOutput().
// All IO fucntions (read*() and [e]print*()) should write to OutputWriter
// instead of this.
var OutputBuffer *bufio.Writer

// Holds an io.Writer.  It must be initialized by SetOutput()
var OutputWriter io.Writer

// Set IO functions for interactive input/output.
func SetInteractive(w io.Writer, r io.Reader) {
	SetUnbefferedInput(r)
	OutputBuffer = nil
	OutputWriter = w
}

// Setup OutputBuffer and OutputWriter.
func SetOutput(w io.Writer) {
	OutputBuffer = bufio.NewWriter(w)
	OutputWriter = OutputBuffer
}

// Flushes OutputBuffer
func Flush() {
	if OutputBuffer != nil {
		OutputBuffer.Flush()
	}
}

// Returns true if c is a white space
func IsSpace(c byte) bool {
	switch c {
	case '\t', '\n', '\v', '\f', '\r', ' ':
		return true
	}
	return false
}

func IsNewLine(c byte) bool {
	switch c {
	case '\n', '\r':
		return true
	}
	return false
}

// Setup nextToken with input buffer.
func SetInput(r io.Reader) {
	buf := new(bytes.Buffer)
	var b []byte

	var i int
	rest := func() ([]byte, error) {
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		return b[j:i], nil
	}
	initial := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextToken = rest
		return rest()
	}
	nextToken = initial

	restLn := func() ([]byte, error) {
		for i < len(b) && IsNewLine(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsNewLine(b[i]) {
			i++
		}
		return b[j:i], nil
	}

	initialLn := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextLine = restLn
		return restLn()
	}
	nextLine = initialLn
}

// Setup nextToken without input buffer.
func SetUnbefferedInput(r io.Reader) {
	buf := bufio.NewReader(r)
	var b []byte

	var i int
	nextToken = func() ([]byte, error) {
		var err error
		if i == len(b) {
			b, err = buf.ReadBytes('\n')
			if err != nil {
				return nil, err
			}
			i = 0
			j := len(b) - 1
			for 0 <= j && IsSpace(b[j]) {
				j--
			}
			b = b[0 : j+1]
		}
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		if i == j {
			return nil, io.ErrUnexpectedEOF
		}
		return b[j:i], nil
	}
}

// -----------------------------------------------------------------------------

// IO functions

// Reads next token and return it as []byte
func readb() []byte {
	b, err := nextToken()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Reads next token and return it as string
func reads() string {
	return string(readb())
}

// Read next line as []byte.  Trailing '\n' will not be included.
// See also comments on readb()
func readbln() []byte {
	b, err := nextLine()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Read next line as string
func readsln() string {
	return string(readbln())
}

// Reads next token and return it as int64
func readll() int64 {
	i, err := strconv.ParseInt(reads(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

// Reads next token and return it as int
func readi() int {
	return int(readll())
}

// Reads next token and return it as float64
func readf() float64 {
	f, err := strconv.ParseFloat(reads(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

// Write args to OutputWriter with the format f
func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(OutputWriter, f, args...)
}

// Write args to OutputWriter without format
func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(OutputWriter, args...)
}

// Write args to stderr with the format f
func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

// Write args to stderr without format
func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func dbgf(f string, args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintf(os.Stderr, f, args...)
}

func dbg(args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintln(os.Stderr, args...)
}

// -----------------------------------------------------------------------------

// Utilities

func sumSlice(a []int) int {
	var res int
	for _, v := range a {
		res += v
	}
	return res
}

func sumSlicell(a []int64) int64 {
	var res int64
	for _, v := range a {
		res += v
	}
	return res
}

func readInts(N int) (int, []int) {
	if N == 0 {
		N = readi()
	}
	a := make([]int, N)
	for i := range a {
		a[i] = readi()
	}
	return N, a
}

func readIntsll(N int) (int, []int64) {
	if N == 0 {
		N = readi()
	}
	a := make([]int64, N)
	for i := range a {
		a[i] = readll()
	}
	return N, a
}

// -----------------------------------------------------------------------------

// Simple math functions

const (
	// big prime
	INF  = 1000000007
	INF2 = 1000000009
	INF3 = 998244353
)

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func minll(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func minf(a, b float64) float64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func maxll(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func maxf(a, b float64) float64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func absll(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func absf(a float64) float64 {
	if a < 0 {
		return -a
	}
	return a
}

// egcd(a, b) returns d, x, y:
//   d is gcd(a,b)
//   x, y are  integers that satisfy ax + by = d
func egcd(a, b int) (int, int, int) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcd(b, a%b)
	return d, y, x - a/b*y
}

func egcdll(a, b int64) (int64, int64, int64) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcdll(b, a%b)
	return d, y, x - a/b*y
}

func gcd(a, b int) int {
	d, _, _ := egcd(a, b)
	return d
}

func gcdll(a, b int64) int64 {
	d, _, _ := egcdll(a, b)
	return d
}

// set up IO functions
func init() {
	// for non-interactive
	SetInput(os.Stdin)
	SetOutput(os.Stdout)

	// Enable below when interactive.  Its ok to leave above intact.
	// SetInteractive(os.Stdout, os.Stdin)
}

Submission status: Runtime Error

Solution code:
x,y = map(float,input().split())
import math
from decimal import Decimal
y_ = Decimal('y')
x_ = Decimal('x')

print(math.floor(x_*y_))

Submission status: Runtime Error

Solution code:
A,B = map(int,input().split())
print(float(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:
a,b = map(float, input().split())
a = int(a)
b_int = int(b)
b_frac = b*100-b*int*100

ans = a*b_int+(a*b_frac)//100
  
print(ans)

Submission status: Runtime Error

Solution code:
N,K=map(float,input().split())
ans=math.floor(N*K)
print(ans)

Submission status: Runtime Error

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

int main() {
	//input
	int64_t A;
	string B;
	cin >> A >> B;

	//calculation
	int64_t Bt100 =  (B[0] - '0') * 100 + (B[2] - '0') * 10 + B[3] - '0';
	cout << Bt100 << endl;

	//output
	int64_t output = A * Bt100 / 100;
	cout << output << endl;


	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

a, b = map(int, input().split())
x = a * b
y = math.floor(x)

print(y)

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 math
A, B = input().split()
A = int(A)

B_i = int(B[:-3])
B_f = int(B[-2:])

print(A*B_i + int(str(A*B_f)[:-2]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(int(a*b))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

print(int(n[0]*n[1]))

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(float,input().split())
Aint = int(A)
Bint = int(B*100)
print(int((A*B100)//100))

Submission status: Runtime Error

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

list = [math.floor(float(n)) for n in str_list]

if(0 in list):
  print('0')
  exit()
  
result = 1
for i in range(len(list)):
  result *= list[i]

print(result)

Submission status: Runtime Error

Solution code:
import numpy as np

flg=1
N=int(input())
A = [int(x) for x in input().split()]
np_A = np.array(A)
if np.any(np_A == 0):
  print(0)
else:
  A_log=np.log10(np_A)
  x=np.sum(A_log)
  if x>18:
    print(-1)
  else:
  	print(int(10**x))
  
"""
3
101 9901 999999000001
"""

Submission status: Runtime Error

Solution code:
a = [float(i) for i in input().split()]
print(int(a))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

list = [math.floor(int(n)) for n in str_list]

if(0 in list):
  print('0')
  exit()
  
result = 1
for i in range(len(list)):
  result *= list[i]

print(result)

Submission status: Runtime Error

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

print(long(a * b))

Submission status: Runtime Error

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

a = int(a)
b = int(b*100)
tmp = str(a*b)[:-2]
print(int(tmp))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <cstdio>
#include <cmath>

int main() {
  long long a; double b;
  scanf("%lld%lf", &a, &b);
  printf("%.0f\n", floor(a * b));
  return 0;
}

Submission status: Runtime Error

Solution code:
a_s, b_s = input().split()

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

print(int(str(a*b)[:-2]))

Submission status: Runtime Error

Solution code:
from math import floor

a, b = map(int, input().split())
x = a * b
y = math.floor(x)

print(y)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>                   // below comment for pbds
#include<ext/pb_ds/assoc_container.hpp>   // to use it make ordered_set
#include<ext/pb_ds/tree_policy.hpp>       // all set fnct + = 1. order_of_key(x); // number of 
#define ll long long                      //element strictly smaller than it;
#define ld long double                    // 2. find_by_order(x),pointer el at x pos after sort  use as s.f();
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;                     
using namespace __gnu_pbds;
// assert(a[i]<n ) // if we want to check for special cond , used for debug
// make less_equal in order to make a multiset pbds
const ll Mod = (int)1e9;
ll CaseN=1;
ll fast_power(ll a,ll b,ll mod){
	ll ans=1;
	while(b>0){
	if(b&1){
	ans=(a*ans)%mod;
	}
	b=b>>1;
	a=(a*a)%mod;
	}
	return ans;
	}


ll nCr(ll n ,ll r)
{
ll p= n;
r = min(r,n-r);
ll a =1;
ll b=1;	
while(r)
{
	a = a*p;
	b = b*r;
	
	int g = __gcd(a,b);
	
	a = a/g;
	b = b/g;
	
	p--;
	r--;	
}	
return a;
	
}



void solve()
{
    ld a,b;
    cin>>a>>b;
    ll ans = (ll)(a*b);

  //cout<<"Case #"<<CaseN<<": ";
   CaseN++;
	// print your ans below;
 cout<<ans<<endl;
return ;
}


signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t=1;
	//cin>>t;
	while(t--)
	{
	solve();	
	}
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
import bisect
#[int(x) for x in input().split()]
#map(int,input().split())
#for _ in range(int(input())):
a,b=input().split()
a=int(a)
b=b.split('.')
b=int(b)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

import numpy as np

n=int(input())
a=np.array(list(map(int,input().split())))

ans=np.prod(a)

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

Submission status: Runtime Error

Solution code:
import math

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

res = a*b
print(int(math.trunc(res)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
999999999999999 1.11

Submission status: Runtime Error

Solution code:
def main():
    a, b = input().split()
    a = int(a)
    b = int(float(b) * 100)
    ans = str(a * b)
    ans = int(ans[:-2])
    print(ans)



if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:

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

j = 100000000000000000

ans = 1


for i in range(n):
    ans = ans * An[i]

if ans <= j:
    print(ans)
    quit()
else :
    print('-1')
    quit()

Submission status: Runtime Error

Solution code:
#pragma GCC optimize (3)
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<algorithm>
/*#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/priority_queue.hpp>*/
//#include<ext/rope>
#define ll long long
#define ull unsigned long long
#define INFI 2147483647
#define INFL 9223372036854775807
#define INFU 18446744073709551615
using namespace std;
//using namespace __gnu_pbds;
//using namespace __gnu_cxx;
const double PI=acos(-1.0);
const double eps=1e-6;
template<typename T> void debug(T x)
{
    cout<<"value="<<x<<endl;
    return;
}

signed main()
{
	//ios_base::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    double a,b;
    cin>>a>>b;
    ll s=(ll)(a*b);
    cout<<s<<endl;
	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif

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

#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (long long int i = 1, i##_len = (n); i <= i##_len; ++i)
#define REP_R(i, n) for (long long int i = (n - 1); i >= 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((long long int)(x).size())
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

//#define DEBUG

#ifdef DEBUG
#define OUT(x) std::cout << (x) << std::endl
#define OUT2(x, y) std::cout << (x) << "," << (y) << std::endl
#define OUT3(x, y, z) std::cout << (x) << "," << (y) << "," << (z) << std::endl
#define OUTSP(x) std::cout << (x) << " ";
#define OUTLF std::cout << std::endl
#define OUTPA(p) OUT2(p.first, p.second)
#else
#define OUT(x) NULL
#define OUT2(x, y) NULL
#define OUT3(x, y, z) NULL
#define OUTPA(p) NULL
#define OUTSP(p) NULL
#define OUTLF NULL
#endif

#define INF INT_MAX
#define INFLL LLONG_MAX
#define PB push_back
#define MOD 1000000007LL

#define LSB(x) __builtin_ctzll(x)
#define MSB(x) 64LL - __builtin_clzll(x) - 1LL
#define MSBINT(x) 32LL - __builtin_clz(x)
#define BITCNT(x) __builtin_popcountll(x)

using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
using vec = vector<ll>;
using mat = vector<vector<ll>>;
using pa = pair<ll, ll>;
using tTree = __gnu_pbds::tree<ll, __gnu_pbds::null_type, less<ll>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;

template <class T>
inline void input(T &arr)
{
  ll n = arr.size();
  REP(i, n)
  cin >> arr[i];
}
template <class T>
inline void input2(T &arr1, T &arr2)
{
  ll n = arr1.size();
  REP(i, n)
  cin >> arr1[i] >> arr2[i];
}
template <class T>
inline void inputPA(T &arr)
{
  ll n = arr.size();
  REP(i, n)
  cin >> arr[i].first >> arr[i].second;
}
template <class T>
inline void outArr(T &arr)
{
  for (auto x : arr)
  {
    OUTSP(x);
  }
  OUTLF;
}

template <class T>
using PQ = priority_queue<T>;
template <class T>
using PQG = priority_queue<T, vector<T>, greater<T>>;

const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

template <class T>
bool chmax(T &, const T &);
template <class T>
bool chmin(T &, const T &);

ll qp(ll a, ll b);
ll qp(ll a, ll b, ll mo);

ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
void make_fact(ll);
void make_invfact(ll);
void init_fact();

ll combination(ll, ll);

#define FACSIZE 200002LL

ll invfac[FACSIZE];
ll fac[FACSIZE];

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

  ll c = b * 100;

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

  return 0;
}

template <class T>
bool chmax(T &a, const T &b)
{
  if (a < b)
  {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
  if (b < a)
  {
    a = b;
    return 1;
  }
  return 0;
}

ll qp(ll a, ll b)
{
  ll ans = 1LL;
  do
  {
    if (b & 1LL)
      ans = 1LL * mod_mul(ans, a) % MOD;
    a = 1LL * mod_mul(a, a) % MOD;
  } while (b >>= 1LL);
  return ans;
}
ll qp(ll a, ll b, ll mo)
{
  ll ans = 1LL;
  do
  {
    if (b & 1LL)
      ans = 1LL * (ans % mo) * (a % mo);
    a = 1LL * (a % mo) * (a % mo);
  } while (b >>= 1LL);
  return ans;
}

ll mod_pow(ll x, ll r)
{
  if (r == 0)
    return 1;
  else if (r == 1)
    return x % MOD;
  else if (r % 2 == 0)
  {
    ll t = mod_pow(x, r / 2) % MOD;
    return t * t % MOD;
  }
  else
  {
    ll t = mod_pow(x, r / 2) % MOD;
    ll k = t * t % MOD;
    return k * x % MOD;
  }
}
ll mod_add(ll a, ll b)
{
  return (a + b) % MOD;
}

ll mod_mul(ll a, ll b)
{
  return (a * b) % MOD;
}

ll mod_div(ll a, ll b)
{
  return mod_mul(a, mod_pow(b, MOD - 2));
}

void make_fact(ll n)
{
  fac[0] = 1;
  REP(i, n)
  {
    fac[i + 1] = mod_mul(fac[i], i + 1);
  }
}

void make_invfact(ll n)
{
  invfac[n] = mod_pow(fac[n], MOD - 2);
  REP_R(i, n)
  {
    invfac[i] = mod_mul(invfac[i + 1], i + 1);
  }
}

void init_fact()
{
  make_fact(FACSIZE - 1);
  make_invfact(FACSIZE - 1);
}

ll combination(ll n, ll c)
{

  return mod_mul(fac[n], mod_mul(invfac[c], invfac[n - c]));
}
///////////////fact
/*
  init_fact();
  cout << fac[5] << endl;
  cout << invfac[5] << endl;
  cout << combination(8, 4) << endl;
  cout << combination(31, 8) << endl;
  //*/
///////////////////

Submission status: Runtime Error

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

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

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import math

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(int(a * B))

Submission status: Runtime Error

Solution code:
n= int(input())
line= input().split(' ')
 
tot=1

for a in line:
	if a=='0':
		tot=0
		break

if tot==1:
	for a in line:
		tot*= int(a)
		if tot>10**18:
			tot=-1
			break

print(tot)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main(){
    FAST
    long double a,b;
    cin>>a>>b;
    long double x=a*b;
    ll ans=x;
    cout<<ans;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy
[a, b] = list(input().split())
newa = int(a)
product = newa * b
print(int(numpy.floor(product)))

Submission status: Runtime Error

Solution code:
import math

a, b = map(float, input().split())
if a = 0 or b = 0:
    print(0)
else:
    print(int(a*b))

Submission status: Runtime Error

Solution code:
from sys import stdin

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

print(int(a*b))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(math.floor(a * b))

Submission status: Runtime Error

Solution code:
input_count = 0

A, B = input().split()

A = int(A)
if '.' in B:
    B_a = int(B.split('.')[0])
    B_b_size = len(B.split('.')[1])
    B_b =  int(B.split('.')[1])
else:
    B_a = int(B)
    B_b_size = 0
    B_b = 1
ans_a = A * B_a
ans_b = A * math.pow(10, -1*B_b_size) * B_b
ans = ans_a + int(ans_b)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def iput(): return int(input())
def mput(): return map(int, input().split())
def lput(): return list(map(int, input().split()))
 
def solve():
    n = iput()
    a = lput()
    ans = 1
    for i in range(n):
        ans *= a[i]
        if a[i] == 0:
          print(0)
          break
    if ans > 10**18:
        print(-1)
    else:
        print(ans)
    return 0
 
if __name__ == "__main__":
    solve()

Submission status: Runtime Error

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

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 as m
a,b=map(float,input().split())
print(m.floor((a*(b*m))//m))

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = 1

limit = pow(10,18)

f = 0
for i in range(N):
    if A[i] != 0:
        ans *= A[i]
    else:
        print(0)
        exit()

    if ans > limit:
        f = 1

if f == 1:
    print(-1)
else:
    print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import math

input = sys.stdin.readline
 
def main():
  a,b = map(double, input().split())
  print(math.floor(a * b))

if __name__ == '__main__':
  main()

Submission status: Runtime Error

Solution code:
import math

x,y = map(int,input().split())
print(math.floor(x*y*100)/100)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=list(map(str, input().split()))
a=S[0]
b=S[1]
print(math.floor(int(a)*float(b)))

Submission status: Runtime Error

Solution code:
import math
A,B = map(float,input().split())
A = int(A)
if A == 0 or B == 0 :
    print(0)
else:
    ans = A*B
    i = math.floor(ans)-1
    while True : 
        if i <= ans and i+1 > ans:
            print(i)
            sys.exit(0)
        i += 1

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

multipled = A * B
floored = math.floor(multipled)

print(floored)

Submission status: Runtime Error

Solution code:
import math 
a, b = map(float, input().split())
a =int(100*a)
b = int(100*b)
c = a*b
d = str(c)[:-4]
print(int(d))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=eval(input().replace(" ", "*").replace(".",""))
print(s//100)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

Solution code:
import math

s = input().split()

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

result = A*B
result = int(str(result)[:-2])
print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
'''     ##     ##  #######  # #  ######
        ##     ##  ##   ##  ###    ##
        ##     ##  ##    #  # #    ##
        #########  #######  # #    ##    '''

import sys
import math
# sys.setrecursionlimit(10**6)

def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))

def printspx(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end=" \ ")

MODPRIME = int(1e9+7); BABYMOD = 998244353;

if __name__ == "__main__":
    sys.stdin = open("input.txt","r")  # <<<  ^o^  Comment this line  ^_^  >>>
    a, b = map(float, input().split())
    print(math.floor(a*b))



# #############################################################################
'''
THE LOGIC AND APPROACH IS BY ME @luctivud ( UDIT GUPTA )
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
>>> DO NOT PLAGIARISE.
TESTCASES:
'''

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;
    ll a;
    long double b;
    cin>>a>>b;
    ll x = floor(a*b);
    show(x);
    return 0;
}

Submission status: Runtime Error

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

int main() {
	//input
	int64_t A;
	double B;
	cin >> A >> B;

	//calculation
	double temp = A * B;
	int64_t output = temp;

	//output
	cout << temp << endl;


	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

    ll mod=998244353;

    ll fact[500001]={0};
    void func(){
        fact[0]=1;
        for(ll i=1;i<500001;i++){
            fact[i]=((fact[i-1]%mod)*(i%mod))%mod;
        }
    }

    ll power(ll x,ll y){
        ll ans=1;
        while(y>0){
            if(y%2==1)
                ans=((ans%mod)*(x%mod))%mod;
            y/=2;
            x=((x%mod)*(x%mod))%mod;
        }
        return ans%mod;
    }

    ll ncr(ll n,ll r){
        if(n<r) return 0;
        ll temp1=fact[n];
        ll temp2=((fact[n-r]%mod)*(fact[r]%mod))%mod;
        temp2=power(temp2,mod-2);
        temp1=(temp1)*(temp2);
        temp1=temp1%mod;
        return temp1;
    }


    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        unsigned long long n1;
        double n2;
        cin>>n1>>n2;

        unsigned long long ans1=(ll)floor(n1*n2);
        cout<<ans1;
    }

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import math
input = sys.stdin.readline
n1, n2 = map(int, input().split())

print(math.floor(n1*n2))

Submission status: Runtime Error

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

print(int(a*b))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
import numpy as np

values = np.array(input().split(" "), dtype=np.int64)
result = np.prod(values)

print(math.floor(result))

Submission status: Runtime Error

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

from decimal import Decimal
from fractions import Fraction

ans = Decimal.from_float(a)*Decimal.from_float(b)
print(math.float(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

x = int(input())
y = double(input())

z = math.floor(x * y)
print(z)