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<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<<endl;
		}
	}
	return 0;
}

C++: #include<stdio.h>
int main(void)
{
int i=1,j=1,k;
while(i<=9)
{
while(j<=9)
{
k=i*j;
printf("%dx%d=%d\n",i,j,k);
j++;
}
i++;
}
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())

using namespace std;



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

C++: #include<stdio.h>
int i,j,k;main(){for(i=0;i<81;i++)j=i/9+1,k=i%9+1,printf("%dx%d=%d\n",j,k,j*k);}

C++: a

C++: #include<stdio.h>
char 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>

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<stdio.h>

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

C++: #include <iostream>

using namespace std;

int main(){
	int m, n, q;

	for(m=1; m<10; m++){
		for(n=1; n<10; n++){
			q = m*n;
			cout << "mxn=q" << 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;
    }
  }


}

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef vector<int> VI;
#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )

int main() {
    REP(i, 0, 10) {
        REP(j, 0, 10) {
            cout << i << "x" << j << "=" << i * j << endl;
        }
    }
        
    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\n",i,j,i*j);
		}
	}

	return 0;
}

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

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

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

int main() {
	// your code goes here
   for( int i=1 ; i<=9 ; i++){
   	 for( int j=1 ; j<=9 ; j++){
   	 	int val = i*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<cstdio>
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<iosteream>
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<stdio.h>

int main(){
	while(true);
	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>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>

using namespace std;

#define str to_string
#define rep(i, n) for (int i=0; i<int(n); i++)
#define all(c) (c).begin(), (c).end()


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

C++: #include<stdio.h>

    int main(void){
    
            int x,y,z;
    
            for(x=1;x<=9;x++){
                    
                        for(y=1;y<=9;y++){
                                        
                            z=x*y;
                            printf("%d??%d=%d" " ",x,y,z);

                                        }
                 printf("\n");
                            }
         return 0;
                   }

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

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

C++: #include <cstdio>
#include <iostream>
#include <queue>
#include <iomanip>
#include <functional>
#include <algorithm>
#include <vector>
#include <map>

#ifdef __BORLANDC__
	typedef __int64 Long;
#else 
	typedef long long Long;
#endif

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) b = min(a, b)
#define pb push_back
#define mp make_pair

using namespace std;

int main(){
	rep(i, 9) rep(j, 9){
		Long a = i + 1;
		Long b = j + 1;
		cout << a << "x" << b << "=" << a * b << endl;
	}
	
	return (0);
}

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

int main(void){
	
	int ans,a,b,i,j,k;
	
	for(i=1;i<10;i++){
		for(j=1;j<10;j++){
			
			ans=i*j;
			
			cout<<i<<"*"<<j<<"="<<ans<<endl;
			
		}
	}

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;
		}
	}

	return 0;
}