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 <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>
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++: #include<cstdio>

using namespace std;

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

C++: #include  <cstdio>
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 <iostream>
#include <cstdio>
using namespace std;

int main()
{
int i,j;
for(i = 1; i <= 9; i++)
for(j = i; j <= 9; j++)
printf("%dx%d=%d\n", i, j, i * j);
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<iostream>
const int X99 9
const int Y99 9
int main()
{
for(int x=1;x<=X99;x++){
 for(int y=1;y<=Y99;y++){
   cout << x << 'x' << y << '='<< x*y << '\n';
  }
 }
}

C++: for(var i=1;i<=9;i++){
    for(var j=1;j<=9;j++){
        console.log(i+"x"+j+=+i*j\n);
    }
}

C++: #include<bits/stdc++.h>
#define ll long long int
#define FOR(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n)
 
/*--------------------template--------------------*/

int main(){
    REP1(i,10){
        REP1(j,10){
            cout << i << 'x' << j << '=' << i*j << endl;
        }
    }
}

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 namsepace std;
int main(){
int a;
cin >> a;
cout << a;
}

C++: #include <iostream>

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

C++: #include<cstdio>

int main()
{
	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<iostream>

int main(){
	for( int i = 1; i <= 9; i++ ){
		for( int j = 1; j <= 9; j++ ){
			std::cout << i << "x" << j << "=" << i*j << std::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;
					}
	}
}

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 x,i,j;
	for(i=1;i<=9;i++){
		for(j=1;j<=9;j++){
	x=i*j;
	cout<<i<<"x"<<j<<"="<<i*j<<endl;
	
		}
	}

	return 0;
}

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

int main()
{
	for (int a = 1; a < 10; a++)
		for (int b = 1; b < 10; b++)
			cout << a << "x" << b << "=" << a*b << "\n";

	return 0;

}

C++: #include<iostream>
int main(void){
        for(int a=1;a>=9;a++){
                cout<<a<<"??";
                for(int b=1;b>=9;b++){
                        cout<<b<<"="<<endl;
                }
        }
        return 0;
}

C++: #include<stdio.h>
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<iostream>
using namespace std;
int main()
{
    int i,j,k;
    for(i=1; i<=9; i++)
    {
        for(j=1; j<10; j++)
        {
            cout<<i<<"x"<<j<<"="<<i*j<<endl;
        }
    }



    return 0;
}

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

int main()
{
   int i,k;
   for(i=1;i<10;i++)
     for(k=1;k<10;k++)
       cout << i << 'x' << k << '=' << i*k << endl;

}

C++: asdf

C++: #include<cstdio>
main(){
 FILE *fp = fopen("unagi","r");
 if (fp != NULL)return 1;
else return 0;
}

C++: #include <iostream>

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