Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func read() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	sc.Split(bufio.ScanLines)
	for sc.Scan() {
		n, _ := strconv.ParseFloat(sc.Text(), 64)
		ans := n
		sum := n
		for i := 2; i <= 10; i++ {
			if i%2 == 0 {
				ans *= 2
				sum += ans
			} else {
				ans /= 3
				sum += ans
			}
		}
		fmt.Println(sum)
	}
}

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

int main(){
	
 	double a,b;
	double s;
	while(cin>>a){
		s=a;
		for(int i=2;i<=10;i++){
		if(i%2==0)
			a=a*2;
		else
			a=a/3;
		s+=a;
		
	}
		printf("%.8f\n",s);
	
}
}

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

int main(){
  double a,an,sum;
  while(cin>>a){
    an=a*2;
    sum=0;
    for(int i=0;i<5;i++){
      sum+=a+an;
      a=an/3;
      an=a*2;
    }
    printf("%.8lf\n",sum);
  }
  return 0;
}

C++: #include<iostream>
#include<iomanip>
using namespace std;
int main(){
    cout << fixed << setprecision(10);
    double a;
    double s[50] ;
    int n = 0;
    while(cin >> a ){
    
        s[n] = a;
        for(int i = 1;i < 10;i++){
           
            if(i % 2 == 0){
                a = a/3;
            }
            else{
                a = a*2;
            }
            s[n] += a;
        }
        
        n++;
    }
    for(int i = 0;i < n;i++){
        cout << s[i] <<endl; 
    }
    
    return 0;
}

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

using namespace std;

int main(int argc, char **argv)
{
	double a, tmp;
	
	while(cin >> a){
		tmp = a;
		a *= 2;
		tmp += a;
		for(int i = 1; i < 5; i++){
			a /= 3;
			tmp += a;
			a *= 2;
			tmp += a;
		}
		
		cout << tmp << endl;
	}
	
	return 0;
}

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

using namespace std;

double a_1;
double s_n;
array<double , 10> arr ;

double fib(int i){
  if(i ==1){
  }else if(i % 2 == 0){
    arr[i] = arr[i-1] * 2;
  }else{
    arr[i] = arr[i-1] / 3;
  }
  return arr[i];
}

int main(void){

  std::cin >> a_1;
  arr[1] = a_1;
  scanf("%lf", &a_1);

  for(int i = 1; i <= 10; i++){
    s_n += fib(i);
    if(i == 10){
      printf("%lf\n", s_n);
    }
  }

  return 0;
}

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

using namespace std;

int main() {
	
	double n[10] = {};
	
	while(cin >> n[0]) {
	
	double sum = n[0];
	
	for(int i=1;i<10;i++) {
		
		if(i % 2)
			n[i] = n[i-1] * 2;
		
		else
			n[i] = n[i-1] / 3;
			
		sum += n[i];
		
	}
	
	cout << fixed << setprecision (8)<< sum << "\n";
	
}
	
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main()
{
//	cut here before submit 
//	freopen ("testcase.seq", "r", stdin );

	double a0;
	while (cin >> a0 ){
		vector<double> a(11, 0. );
		a[1] = a0;
		for (int i = 2; i <= 10; i++ ){
			if (i % 2 == 0 ){
				a[i] = 2.*a[i-1];
			}else{
				a[i] = a[i-1]/3.;
			} // end if
		} //end for
		double sum = accumulate (ALL (a ), 0. );
		printf ("%.12lf\n", sum );
	} // end loop
		
	return 0;
}

C++: //0055

#include<cstdio>

int main(void)
{
	const int N = 10;
	double a[N];
	double n;
	double s;
	int i;
	while(scanf("%lf", &n) == 1)
	{
		a[0] = n;
		for(i = 1; i < N; i++)
		{
			a[i] = (i&1 ? 2*a[i-1] : a[i-1]/3);
		}
		s = 0;
		//ツ古」ツづォツづ個要ツ素ツづ個づ卍つ、ツつェツ渉ャツつウツつ「ツづ個づ、ツ古ォツ債キツづーツ渉ュツづ按つュツつキツづゥツつスツづ淞づ可古」ツづォツつゥツづァツ堕ォツつオツづつ「ツつュ
		for(i = N-1; i >= 0; i--)
			s += a[i];
		printf("%.8f\n", s);
	}
	return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#include <sstream>
#include <climits>
#include <map>
#include <stack>
using namespace std;
#define M_PI 3.141592
#define toRad 2.0*M_PI/360.0
#define inin(x) int x;cin>>x;
#define all(x) x.begin(),x.end()
#define debug(x) cout<<#x<<" "<<x<<endl;
#define rep(i,n) for(int i=0;i<(int)n;i++)
typedef pair<int, int> pii;
/*
bool memo[1000000] = {};
vector<int> pri;

void calc()
{
	for (int i = 2; i < 1000000; i++)
	{
		if (memo[i] == false)
		{
			pri.push_back(i);
			for (int l = i; l < 1000000; l += i)
			{
				memo[l] = true;
			}
		}
	}
}
*/
int main()
{
	double a;
	while (cin >> a)
	{
		printf("%.7lf\n", 633.0 / 81 * a);
	}
}

C++: #include <cstdio>

int main()
{
  double a;
  while (~scanf("%lf", &a)) {
    double ans = a;
    for (int i = 2; i <= 10; ++i) {
      if (i&1) {
	a /= 3.0;
      } else {
	a *= 2.0;
      }
      ans += a;
    }
    printf("%.8f\n", ans);
  }
  return 0;
}

C++: #include <cstdio>
#include<iostream>
  
using namespace std;
   
int main(void){
  
    int a,b,n,sum;
    double dec;
  
    while(cin>>a>>b>>n){
       dec=(double)a/b;
       sum=0;
       while(n){
           dec*=10;
           sum+=(int)dec%10;
           n--;
       }
       cout<<sum<<endl;
    }
  
    return 0;
}

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

int main(void){
    double a,sum;
    
    while (scanf("%lf", &a)!=EOF){
        sum=0;
        for(int i=1; i<=10; i++){
            sum+=a;
            printf("%2d:%8f (sum:%.6f)\n",i,a,sum);
            if (i%2) a *= 2;
            else a /= 3;
        }
        printf("%f\n",sum);
    }
    return 0;
}

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

int main(void) {
    double a;
    
    while(cin >> a) {
        double s = 0;
        double A[10 + 1] = {};
        
        A[1] = a;
        
        for(int i = 2; i <= 10; ++i) {
            if(i % 2 == 0)   A[i] = A[i - 1] * 2;
            else   A[i] = A[i - 1] / 3;
        }
        
        for(int i = 1; i <= 10; ++i) {
            s += A[i];
        }
        
        printf("%.8lf\n", s);
    }
    
    return 0;
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class t>
using table = vector<vector<t>>;
const ld eps=1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.answer"

int main() {
	ld a;
	while (cin >> a) {
		ld ans = a*7.81481481;
		cout << ans << endl;
		
	}
	return 0;
}

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

double an(int n, int a1) {
    if (n == 1) {
        return a1;
    } else if (n % 2 == 0) {
        return an(n - 1, a1) * 2;
    } else {
        return an(n - 1, a1) / 3;
    }
}

int main() {
    double first;
    while (cin >> first) {
        double sum = 0;
        for (int i = 0; i < 10; i++) {
            sum += an(i + 1, first);
        }
        printf("%.8lf\n", sum);
    }
}

C++: #include<iostream>
using namespace std;
double a,s;int c;
main()
{
    while(cin>>a)
    {
        s=a;
        c=2;
        for(c=2;c<=10;c++)a=c%2?a*2:a/3,s+=a;
        cout<<s<<endl;
    }
}