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

C++: 
#include<iostream>

using namespace std;

int main(){
	int a,b,c;
	
	for(a=1;a<10;a++){
		for(b=1;b<10;b++){
		c=a*b;
		cout << a << 'x' << b << '=' << c << '\n';
		}
	}
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
  for(int i = 1; i < 10; i++) {
    for(int j = 1; j < 10; j++) {
      printf("%dテδ?d=%d\n", i, j, i*j);
    }
  }
}

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

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

C++: for i in range(1,10):
 for j in range(1,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 <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <memory.h>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>

using namespace std;


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







    return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

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

C++: #include <iostream>
#include <string>
#include<map>
#include<cmath>
#include <vector>
#include<algorithm>
using namespace std;

int main()
{ 
	int i,j;
	char s,t;
	s='x';
	t='=';
	for(i=1;i<=9;i++)
	{
		for(j=1;j<=9;j++)
		{
		printf("%d%c%d%c%d\n",i,s,j,t,i*j);
		}
	}
	 	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\n",i,j,i*j);
		}
	}
    return 0;
}

C++: #include<stdio.h>

int main(){
	//defined var
	int i,j,ans;

	//looping first number
	for( j=1; j<=9; j++ ){
		//looping second number
		for( i=1; i<=9; i++ ){
			//calcurate answer
			ans = i * j ;

			//output result
			printf("%dx%d=%d\n", j, i, ans);
		}
	}

	return 0;
}

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

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

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

C++: #include <iostream>

using namespase 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>

auto main () -> int
{
	for (int x = 1; x <= 9; ++ x)
	{
		for (int y = 1; y <= 9; ++ y)
		{
			std::cout << x << 'x' << y << '=' << (x * y) << std::endl;
		}
	}
}

C++: #include "bits/stdc++.h"
using namespace std;

typedef long long ll;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back
#define INF 999999999


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

C++: 
/* QQ.cpp */
#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 <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <set>
#include <queue>

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,b,n) for(int i=b;i<n;i++)

const float PI = 3.1415926;
static const int INFTY = (1<<30);

using namespace std;

typedef long long ll;
typedef long double ld;

int main() {
  REP(i,1,10)
    REP(j,1,10)
    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(){
  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<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++: 9.times do |i|
  9.times do |j|
     puts "#{i}x#{j}=#{i * j}"
  end
end

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