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>
#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)
using namespace std;
 
/*--------------------template--------------------*/

int main(){
    REP1(i,10){
        REP1(j,10){
            cout << i << 'x' << j << '=' << i*j << 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() {
 
   for(int i = 1;i < 10; i++) {
     for(int j = 1; j < 10; j++) {
       cout << j << 'x' << i << '=' << j * i << endl;
 }
}
   return 0;
}

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

C++: 
for i in range(1,10):
    for j in range(1,10):
	print "%d%s%d%s%d" % (i,"x",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) {
      cout << i << "x" << j << "=" << i*j << endl;
    }
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

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

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

typedef long long ll;

constexpr int INF = 1e8;
constexpr int MOD = 1e9+7;

int main(void) {
    int i, j;
    REP (i,1,9) REP (j,1,9) printf("%dx%d=%d\n",i,j,i*j);
    return 0;
}

C++: - submit, private

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int t=64000;
	for(int i=t;i;i--){
		for(int j=max(i,9);j;j--){
			if(i<10&&j<10)cout<<10-i<<"x"<<10-j<<"="<<(10-i)*(10-j)<<endl;
		}
	}
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
#define fori(x) for(int i=0;i<x;i++)
#define forj(x) for(int j=0;j<x;j++)
using namespace std;

int main(){
fori(9)
forj(9)
printf("%dx%d=%d\n",i,j,i*j);
}

C++: #include <iostream>

int main(){
	int i,j;

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


	
		return 0;
		}

C++: /* volume0 - 0000
 * QQ
 */

#include<iostream>
using namespace std;

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>
#include <algorithm>
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<vector>
	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, n;
	for (i = 1; i <= 9; i++) {
		for (n = 1; n <= 9; n++) {
			cout << i << 'x' << n << '=' << i*n << endl;
		}
	}
	return 0;
}

C++: #include <cstdio>
using namespace std;
int main(){
  for(int i=1;i<=9;i++) printf("%dx%d=%d\n",i,i,i*i);
return 0;
}

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

C++: #include <iostream>
#include<stdio.h>
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<stdio.h>
main()
{

C++: #include <stdio.h>

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

C++: #include<stdio.h>

int main(){

    int i;
    int j;
   
    for(i=1;i<10;i++) {
        for(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;
		}
	}
	return 0;
}

C++: - submit, private

C++: i;main(j){for(;i++<9;)for(j=0;j++<9;printf("%dx%d=%d\n",i,j,i*j));}

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 a=1;a<=9;a++)
	{
		for(int b=1;b<=9;b++)
		{
			cout<<a<<"x"<<b<<"="<<a*b<<endl;
		}
	}
		return 0;
}

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

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