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 <bits/stdc++.h>
#define int long long
using namespace std;

int dp[205][205][20][20]; // dp  zyanai kedo

int even[20][3]={
  {5,4,1},
  {6,0,2},
  {7,1,3},
  {8,2,4},
  {9,3,0},
  {0,11,10},
  {1,12,11},
  {2,13,12},
  {3,14,13},
  {4,10,14},
  {15,9,5},
  {16,5,6},
  {17,6,7},
  {18,7,8},
  {19,8,9},
  {10,16,19},
  {11,17,15},
  {12,18,16},
  {13,19,17},
  {14,15,18}
};
int odd[20][3]={
  {5,4,1},
  {6,0,2},
  {7,1,3},
  {8,2,4},
  {9,3,0},
  {0,11,10},
  {1,12,11},
  {2,13,12},
  {3,14,13},
  {4,10,14},
  {15,9,5},
  {16,5,6},
  {17,6,7},
  {18,7,8},
  {19,8,9},
  {10,16,19},
  {11,17,15},
  {12,18,16},
  {13,19,17},
  {14,15,18}
};
int odx[]={0,-1,1};
int ody[]={-1,0,0};
int edx[]={0,-1,1};
int edy[]={1,0,0};
void init(){
  for(int i=0;i<20;i++){
    swap(even[i][1],even[i][2]);
  }
  for(int i=0;i<205;i++)
    for(int j=0;j<205;j++)
      for(int k=0;k<20;k++)
	for(int l=0;l<20;l++)
	  dp[i][j][k][l]=1e8;
}

struct point{
  int cost,x,y,muki,sita;
};

point A;

void BFS(){
  A.sita=0;
  A.cost=0;
  A.muki=5;
  A.x=102;
  A.y=102;
  queue<point>q;
  q.push(A);
  dp[0][0][0][5]=0;
  while(!q.empty()){
    point P=q.front();q.pop();
    int y=P.y;
    int x=P.x;
    int muki=P.muki;
    int cost=P.cost;
    int sita=P.sita;     //cout<<y<<' '<<x<<' '<<sita<<endl;

    if(cost%2){
      int k=0;
      for(int i=0;i<3;i++){
	if(odd[sita][i]==muki){
	  k=i;
	  break;
	}
      }//continue;
      for(int i=0;i<3;i++,k=(k+1)%3){
	int yy=y+ody[i];
	int xx=x+odx[i];
	if( yy< 0 || xx< 0 || 204<xx || 204<yy )continue;
	int nex_sita=odd[sita][k];
	int nex_muki=sita;
	int l=0;
	for(int j=0;j<3;j++){
	  if(even[nex_sita][i]==sita){
	    l=i;
	    break;
	  }
	}
	if(i==0){
	  nex_muki=sita;
	}
	else if(i==1){
	  nex_muki=even[nex_sita][(l+1)%2];
	}
	else{
	  nex_muki=even[nex_sita][(l+2)%2];
	}
	if(dp[yy][xx][nex_sita][nex_muki]!=1e8)continue;
	dp[yy][xx][nex_sita][nex_muki]=cost+1;
	A.sita=nex_sita;
	A.cost=cost+1;
	A.muki=nex_muki;
	A.x=xx;
	A.y=yy;
	q.push(A);
      }
    }
    else{
      int k=0;
      for(int i=0;i<3;i++){
	if(even[sita][i]==muki){
	  k=i;
	  break;
	}
      }//continue;
      for(int i=0;i<3;i++,k=(k+1)%3){
	int yy=y+edy[i];
	int xx=x+edx[i];
	if( yy< 0 || xx< 0 || 204<xx || 204<yy )continue;
	int nex_sita=even[sita][k];
	int nex_muki=sita;
	int l=0;
	if(cost==2&&xx==0+102&&yy==101&&cost==2)cout<<sita<<' '<<nex_sita<<' '<<cost<<endl;
	for(int j=0;j<3;j++){
	  if(even[nex_sita][i]==sita){
	    l=i;
	    break;
	  }
	}
	if(i==0){
	  nex_muki=sita;
	}
	else if(i==1){
	  nex_muki=odd[nex_sita][(l+1)%2];
	}
	else{
	  nex_muki=odd[nex_sita][(l+2)%2];
	}
	if(dp[yy][xx][nex_sita][nex_muki]!=1e8)continue;
	if(cost==2&&xx==0+102&&yy==101&&cost==2)cout<<sita<<' '<<nex_sita<<' '<<cost<<endl;
	dp[yy][xx][nex_sita][nex_muki]=cost+1;
        A.sita=nex_sita;
	A.cost=cost+1;
	A.muki=nex_muki;
	A.x=xx;
	A.y=yy;
	q.push(A);
      }
    }
  }
}

signed main(){
  int x,y,c;
  init();
  BFS();
  while(cin>>x>>y>>c){
    if(!x&&!y&&!c)break;
    x+=102;
    y+=102;
    int ans=1e9;
    for(int i=0;i<20;i++){
      ans=min(ans,dp[y][x][c][i]);
    }
    cout<<ans<<endl;
  }
    
  return 0;
}

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

using namespace std;

int Month;
int Day;

int days[12] = {31,29,31,30,31,30,31,31,30,31,30,31};

int ans[12][31];
int d;
int main()
{   
    
  scanf("%d %d",&d,&Month);
  double a = d*Month/3.305785;
  printf("%.6f",a);
  return 0;
}

C++: #include <stdio.h>
#include <iostream>

using namespace std;

int main() {

	double a,b;
	double kari;
	double menseki;

	cin >> a >> b;

	kari = a * b;

	menseki = kari / 3.305785;

	printf("%.6f\n", menseki);

	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 <stdio.h>
using namespace std;

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

	printf("%8.5f", a * b / 3.305785);

	return 0;
}

C++: #include <cstdio>

using namespace std;

int main()
{
 int a, b;
 scanf("%d %d", &a, &b);

 return (!printf("%lf\n", a * b / 3.305785));
}

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

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

    cout << a * b / 3.305785 << endl;
    
    return 0;
}

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

C++: #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
	int a = 0;
	int b = 0;
	cin >> a >> b;
	long long int c = a * b * 10000000000 / 3305785;
	cout << c / 10000 << '.' << c % 10000 << endl;
	return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <utility>

using namespace std;

#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,N) for(long long int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()

#define PI 3.14159265358479

typedef long long ll;

double a, b;

int main(){
	cin >> a >> b;
	printf("%10lf\n", a*b / 3.305785);
}

C++: //Name: Calculation of Area
//Level: 1
//Category: やるだけ
//Note:

#include <iostream>

using namespace std;

bool solve() {
    int a, b;
    cin >> a >> b;
    cout << a*b/3.305785 << endl;
    return false;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout.setf(ios::fixed);
    cout.precision(10);

    while(solve()) ;
    return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<algorithm>

#define ll long long
#define LL long long
#define ULL unsigned long long 
#define ull unsigned long long 
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)


using namespace std;

int main()
{

	double a, b, tmp,ans;
	cin >> a >> b;
	ans = a*b;
	ans /= 3.305785;
	printf("%f\n", ans);
	return 0;
}

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

int main(){
    double a, b;
    while(cin >> a >> b){
        printf("%.9f\n", a*b/3.305785);
    }
    return 0;
}

C++: //26
#include<iostream>

using namespace std;

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

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  string s;
  cin>>s;
  int f=0;
  while(1){
    string s2;
    if(s=="ABC"){
      f=1;
      break;
    }
    if(s.size()<=3)break;
    char a;
    int t=0;
    int si=s.size()-1;
    
    if(s[0]=='A'&&s[1]=='B'&&s[2]=='C')a='A';
    else if(s[si-2]=='A'&&s[si-1]=='B'&&s[si]=='C')a='C';
    else a='B';

    for(int i=0;i<s.size();i++){
      if(i+2<s.size()&&s[i]=='A'&&s[i+1]=='B'&&s[i+2]=='C'){
	s2+=a;
	i+=2;
	t=1;
      }else{
	if(s[i]==a){
	  t=0;
	  break;
	}
	s2+=s[i];
      }
    }
		
    //	cout<<s2<<endl;
    s=s2;
    if(t)continue;
    break;
  }
  if(f)cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  return 0;
}

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


int main(){
	int a, b;

	cin >> a >> b;

	double sum = (a*b) / 3.305785;

	cout << fixed << setprecision(6) << sum << endl;

	return 0;
}

C++: #include <iostream>
#include <iomanip>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
cout<<flush;
cout<<fixed<< setprecision(6);
cout<<(double)a*(double)b/3.305785<<endl;
}