Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)

//Sliceconvtof ...
func Sliceconvtof() []float64 {
	strs := strings.Split(sc.Text(), " ")

	var flts []float64
	var x int

	for _, s := range strs {
		x, _ = strconv.Atoi(s)
		xf := float64(x)
		flts = append(flts, xf)
	}

	return flts
}

func main() {

	for sc.Scan() {
		i := Sliceconvtof()
		fmt.Printf("%6f", i[0]*i[1]/3.305785)
	}

}

C++: #include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>
#include <complex>

using namespace std;

#define vci vector<int>
#define vcs vector<string>
#define pb push_back
#define sz size()
#define mapii map<int, int>
#define mapci map<char, int>
#define mapsi map<string, int>
#define all(x) x.begin(), x.end()
#define minit(a, i) memset(a, i, sizeof(a));

#define for_(i, a, b) for (int i=(int)a; i<(int)b; i++)
#define for_d(i, a, b) for (int i=(int)a-1; i>=b; i--)
#define for_r(i, a, b, c) for (int i=(int)a; i<(int)b; i += c)
#define for_dr(i, a, b, c) for (int i=(int)a-1; i>=b; i -= c)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }

typedef long long ll;
typedef double D;

const int iINF = 2147483647;
const ll lINF = 9223372036854775807;

template <class T> inline void dbg(T t) { cout << t << endl; }

D DIV = 3.305785;

int main() {
	int a, b;
	cin >> a >> b;
	
	D s = a*b;
	D S = s/DIV;
	
	printf("%.5lf\n", S);
	
	
	return 0;
}

C++: //#define _GRIBCXX_DEBUG
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;


// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion

// ???
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion

// Effective std
#pragma region ESTD
template<typename C, typename T>
constexpr int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F>
constexpr int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T>
void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C>
void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U>
constexpr void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U>
constexpr void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C>
constexpr void reverse(C& c) { reverse(ALL(c)); }
template<typename C>
constexpr void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred>
constexpr void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion

// ?????°
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-9)
#define MOD (int)(1e9+7)
#pragma endregion


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

    printf("%.6lf\n", a*b/3.305785);

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin, (x).end()
typedef long long ll;

int main() {
  int a, b;
  cin >> a >> b;
  cout << fixed << a * b / 3.305785 << endl;
}

C++: #include <iostream>
#include <string>
#include <vector>
using namespace std;

int main() {
    double a, b;
    cin >> a >> b;
    cout.precision(6);
    cout << fixed << a * b / 3.305785 << endl;
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define tubo 3.305785
 
double ans(int a, int b)
{
    return (a * b) / tubo; 
}
 
int main()
{
    int a, b;
    cin >> a >> b;
    printf("%.6f\n", ans(a, b));
    return 0;
}

C++: #include <stdio.h>
int main()
{int a,b,ab;
float tubo;
printf("a*b=?\n)");
scanf("%d %d",a,b);
ab=a*b,tubo=ab/3.305785;
printf("ab???%f",tubo);
return 0;
}

C++: #include <iostream>
#include <iomanip>
using namespace std;

int main()
{
	int a,b;
	cin >> a >> b;
	cout << fixed << setprecision(6) << double(a*b)/3.305785 << endl;
	return 0;
}

C++: #include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
#include<functional>
using namespace std;
int stoi(string x){stringstream ss;ss<<x;int tmp;ss>>tmp;return tmp;}
string itos(int x){stringstream ss;ss<<x;return ss.str();}
int main(){
	int a,b;
	while(scanf("%d%d",&a,&b)!=EOF){
	double ans=a*b;
	printf("%.10lf",ans/3.305785);
	}
	return 0;
}

C++: #include <cstdio>
#include <iostream>

#define t 3.305785

using namespace std;

double a,b;
double ans;

int main(){
	while(cin >> a >> b){
		ans = a * b / t;
		printf("%lf\n",ans);
	}
}

C++: #include<cstdio>
#include<queue>
#include<iostream>
using namespace std;
int main(){
	int a,b;
	cin >> a >> b;
	printf("%.7f\n",a*b/3.305785);
	return 0;
}

C++: #include <iostream>
using namespace std;

int main()
{
	int a, b;
	cin >> a >> b;
	cout << a * b / 3.305785 << endl;
	
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
int main() {
	double a, b;
	cin >> a >> b;
	printf("%f", a * b / 3.305785);
	cout << endl;
	char c;
	cin >> c;
}

C++: #include <iostream>
#include <string>


using namespace std;

int main(void)
{	
	int a, b;
	cin >> a;
	cin >> b;
	float c = (double)a*(double)b / 3.305785;
	printf("%f", c);
	
}