Go: package main

import (
	"fmt"
	"strconv"
)

func main() {
	for _, leftValue := range MultiplicationTableNum(9) {
		for _, rightValue := range MultiplicationTableNum(9) {
			strLeftVal, strRightVal, strMulti := strconv.Itoa(leftValue), strconv.Itoa(rightValue), strconv.Itoa(Multiplication(leftValue, rightValue))
			fmt.Println(strLeftVal + "x" + strRightVal + "=" + strMulti)
		}
	}
}

func MultiplicationTableNum(num int) []int {
	multiNum := []int{}
	for i := 1; i <= num; i++ {
		multiNum = append(multiNum, i)
	}
	return multiNum
}

func Multiplication(x, y int) int {
	return x * y
}

C++: #include <iostream>

using namespace std;

int main()
{
    for(int i = 1; i < 10; i++)
        for(int j = 1; j < 10; j++)
            cout << i << "x" << j << "=" << i * j << endl;
    return 0;
}

C++: #include<iostream>
using namespace std;
 
 
int main(){
 
    int i,j;
    for(i=0;i<9;i++)
        for(j=0;j<9;j++)
            cout<<(i+1)<<"x"<<(j+1)<<"="<<(i+1)*(j+1)<<endl;
 
 
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  for(int i=1; i<10; i++){
    for(int j=1; j<10; j++){
      cout <<i<<"x"<<j<<"="<<i*j<<endl;
    }
  }
  return 0;
}

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

int main(){

  for(int i=1;i<10;i++){
    for(int j=1;j<10;j++) cout << i << 'x' << j << '=' <<i*j << endl;
  }
}

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

int main()
{
	for(int i = 1; i <= 9; i++)
	{
		for(int j = 1; j <= 9; j++)
		{
			printf("%dx%d=%d\n", i, j, i * j);
		}
	}
    return 0;
}

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

int main() {
	for(int a = 1; a <= 9; ++a) {
		for(int b = 1; b <= 9; ++b) {
			cout << a << "x" << b << "=" << a * b << "\n";
		}
	}
	return EXIT_SUCCESS;
}

C++: #include<stdio.h>
int a, b;int main(){for(a=1;a<=9;a++)for(b=1;b<=9;b++)printf("%dx%d=%d\n",a,b,a*b);return 0;}

C++: #!/usr/bin/env python
# -*- coding: utf-8 -*-
for i in range(10):
    for j in range(10):
        print str(i) + "x" + str(j) + "=" + str(i*j)

C++:      #include <iostream>
    using namespace std;
     
    int main() {
    for (int i=1;i<10;i++){
    for (int j=1;j<10;j++){
    cout<< i << "x" << j << "="<<i*j <<endl;
    }
    }
    return 0;
    }

C++: #include <iostream>
using namespace std;
int main() {
  for (int i = 1; i <= 9; i++)
    for (int j = 1; j <= 9; j++)
      cout << i << 'x' << j << '=' << i*j << endl;
  return 0;
}

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

int main(){
int a = 1,b = 1,c;
while(a != 9 and b != 9){
c=a*b;
cout<<a<<"x"<<b<<"="c<<endl;
b++;
if(b == 10){
a++;
b = 1;
}

}
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 29;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };
 
 
int main() {
#ifdef _DEBUG
    printf( "debug\n" );
#endif
    for ( int i = 1; i < 10; i++ ) {
        for ( int j = 1; j < 10; j++ ) {
            printf( "%dx%d=%d\n", i, j, i * j );
        }
    }
    return 0;
}

C++: #include<stdio.h>
#include<iostream>
#include<string.h>
#pragma comment(linker,"/STACK:1024000000,1024000000")
using namespace std;
int dp[22][22][22][22];
int n,a[21],b[21];
int dfs(int d1,int u1,int d2,int u2)
{
    if(dp[d1][u1][d2][u2]>=0)return dp[d1][u1][d2][u2];
    else
    {
        int ans=0,c[5]={};
        if(u1>d1+1)
        {
            if(u1-d1==2)
            {
                c[0]=a[d1+1]+min(dfs(d1+1,u1,d2,u2-1),dfs(d1+1,u1,d2+1,u2));
                c[1]=a[u1-1]+min(dfs(d1,u1-1,d2,u2-1),dfs(d1,u1-1,d2+1,u2));
            }
            if(u1-d1>2)
            {
                c[0]=a[d1+1]+min(dfs(d1+1,u1,d2,u2-1),min(dfs(d1+1,u1,d2+1,u2),min(dfs(d1+1,u1-1,d2,u2),dfs(d1+2,u1,d2,u2))));
                c[1]=a[u1-1]+min(dfs(d1,u1-1,d2,u2-1),min(dfs(d1,u1-1,d2+1,u2),min(dfs(d1,u1-2,d2,u2),dfs(d1+1,u1-1,d2,u2))));
            }
        }
        if(u2>d2+1)
        {
            if(u2-d2==2)
            {
                c[2]=b[d2+1]+min(dfs(d1+1,u1,d2+1,u2),dfs(d1,u1-1,d2+1,u2));
                c[3]=b[u2-1]+min(dfs(d1,u1-1,d2,u2-1),dfs(d1+1,u1,d2,u2-1));
            }
            if(u2-d2>2)
            {
                c[2]=b[d2+1]+min(dfs(d1+1,u1,d2+1,u2),min(dfs(d1,u1-1,d2+1,u2),min(dfs(d1,u1,d2+2,u2),dfs(d1,u1,d2+1,u2-1))));
                c[3]=b[u2-1]+min(dfs(d1+1,u1,d2,u2-1),min(dfs(d1,u1-1,d2,u2-1),min(dfs(d1,u1,d2+1,u2-1),dfs(d1,u1,d2,u2-2))));
            }
        }
        for(int i=0;i<=3;i++)
            ans=max(ans,c[i]);
        return dp[d1][u1][d2][u2]=ans;
    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        for(int i=1;i<=n;i++)
            scanf("%d",&b[i]);

        memset(dp,-1,sizeof dp);
        for(int i=0;i<=n;i++)
            for(int j=0;j<=n;j++)
            dp[i][i+1][j][j+1]=0;
        printf("%d\n",dfs(0,n+1,0,n+1));
    }
    return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;

#define MAX 256

int main(void){

	for (int i = 1; i <= 9; i++){
		for (int j = 1; j <= 9; j++){
			printf("%dx%d=%d\n", i, j, i*j);
		}
	}

	return 0;
}

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

char s[5678 << 10];

int main(){
	memset(s, 0, sizeof s);
	puts("hoge");
}

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

int main(){
	for(int i=1;i<10;i++)
		for(int j=1;j<10;j++)
			cout<<i<<"x"<<j<<"="<<i*j<<"\n";
    return 0;
}

C++: #include <stdio.h>

int main(void)
{
	int i, j;
	
	for (i = 1; i < 9; i++){
		for (j = 1; j < 9; j++){
			printf("%dx%d = %d", i, j, i * j);
		}
	}
	
	return (0);
}

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

int main()
{
	for (int i = 1; i <= 9; i++)
	{
		for (int j = 1; j <= 9; j++)
		{
			cout << i << "x" << j << "=" << i*j << endl;
		}
	}
	return 0;
}

C++: #include <cstdio>

using namespace std;

int main(void)
{
  for (int i = 1; i <= 9; i++){
    for (int j = 1; j <= 9; j++){
      printf("%dx%d=%d\n", i, j, i * j);
    }
  }
  return 0;
}

C++: #include <stdio.h>
void main()
{
     int i,j;
     for(i=1;i<10;i++)
        for(j=1;j<10;j++)
           printf("%d*%d=%d\n",i,j,i*j);
}

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

int main(){
        for(int i=i;i<=9;i++){
        for(int j=1;j<=9;j++){
            cout<<i<<"*"<<j<<"="<<j*i<<endl;
        }
    }
    return 0;
}

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

int main()
{
	for (int i = 1; i <= 9; i++){
		for (int j = 1; j <= 9; j++){
			cout << i << "x" << j << "=" << i*j << "\n";
		}
	}
	cout.flush();
}