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

    return 0;
}

C++: #include<stdio.h> 
#include<iostream.h>
int main() 
{
	int a,i,j; 
	for(i=1;i<=9;i++) 
	{ 
		for(j=1;j<=9;j++) 
		{ 
			cout<<i<<"*"<<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 i=9;
	for(i=1;i<=9;i++)
	cout<<i<<"*"<<i<<"="<<i*i<<endl;
    return 0;
}

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

int main() {
  int a;
  int b;
  a = 1;
  b = 1;
  for (a < 10 && b < 9) {
    cout << b << "x" << a << "=" << a*b << endl;
    ++a;
    if (a == 10 && b <= 8) {
    ++b;
    a = 1;
  }
  return 0;
}

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

int main() {
  int a = 1;
  int b = 1;

  for (a < 10 && b < 9) {
    cout << b << "x" << a << "=" << a*b << endl;
    ++a;
    if (a == 10 && b <= 8)
    ++b;
    int a = 1;
  }
  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 <bits/stdc++.h>
using namespace std;

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

C++: #include<stdio.h>
int main(void)
{
	int a,b,c;
	scanf("%d %d",&a,&b);
	c=a*b;
	printf("%d\n",c);
	return 0;
}

C++: #include <iostream>

int main()
{
	for (int i = 1; i < 10; ++i)
	{
		for (int j = 1; j < 10; ++j)
		{
			std::cout<<i<<"*"<<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<<"\n";
    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", 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 << "??" << j << "=" << i * j << '\n';
        }
    }

    return 0;
}

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

int main(){

 int a, b, c;
 int i, j;

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

C++: 
#include "iostream"

using namespace std;

int return_multiple(int i, int j){
    return i * j;
}

int main(){
    for(int i=1; i<=9; i++){
        for(int j=1; j<=9; j++){
            int k = return_multiple(i, j);
            cout << i << "x" << j << "=" << k << endl;
//            printf("%dx%d=%d\n", i, j, k);
        }
    }
    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<=9; i++) {
        for (int j=1; j<=9; j++) {
            cout << i << "x" << j << "=" << i*j << endl;
        }
    }
    return 0;
}

C++: #include<iostream>

int main(){

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