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

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

C++: #include <iostream>

int main() {
    std::ios::sync_with_stdio(false);

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

    return 0;
}

C++: #include <stdio.h>

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

C++: <?php 

for($i = 1; $i < 10; $i++){
	for($j = 1; $j < 10; $j++){
		$sum = $i*$j;
		echo "{$i}x{$j}={$sum}<br>";
	}
}

 ?>

C++: #include <cstdio>

int main()
{
	for (unsigned int i = 1; i <= 9; i++)
	{
		for (unsigned int j = 1; j <= 9; j++)
		{
			std::printf("%dx%d=%d\n", i, j, i * j);
		}
	}
	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 "iostream"

using namespace std;

int main()
{
	for (int i = 1; i < 10; i++)
	{
		for (int c = 1; c < 10; c++)
		{
			cout << i << "x" << c << "=" << i*c << endl;
		}
	}
	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>
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 <iostream>
using namespace std;
 
int main(){
 
 for(int y = 1; y < 10; y++){
  for(int x = 1; x < 10; x++){
   cout << y << "x" << x << "=" << x*y << endl;
    
  }
 }
 
 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>
using namespace std;

int main(){
    for(int i=1; i<=9; i++){
        for(int j=1; j<=9; j++){
            int ans = i*j;
            cout << i << "x" << j << "=" << ans << 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() {
	for(int i=1; i<10; i++){
              for(int J=0; j<0; j++){
                      printf("%dx%d=%d", i, j, i*j);
              }
        }
	return 0;
}

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

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

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

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

C++: #include <iostream>
#include <cstdio>
  
int main(){
  
for(int i = 1 ; i < 10; i++){
for(int j = 1; j < 10; j++){
printf("%dx%d=%d?\b", i, j, i*j);
}
}
}

C++: #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<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>

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++: 
for(int z = 1; z != 9; z++){
 for(int y = 1; y != 9; y++){
  cout << z << "x" << y << "=" << z * y << endl;
 }
}

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() {
	int n,m;
for(int n=1; n<=9; n++){for(int m=1; m<=9; m++){
cout<<n<<"??"<<m<<"="<<n*m<<endl;
}}// your code goes here
	return 0;
}