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;
class solve{ 
    public:
        void qq(){ 
            for(int i=1;i<10;i++){ 
                for(int j=1;j<10;j++){ 
                    cout<<i<<"x"<<j<<"="<<i*j<<endl;
                }
            }
        }
};
int main(){
    solve ans;
    ans.qq();
    return 0;
}

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

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	for (int i = 1; i <= 9; i++){
		cout << i << "x" << i << "=" << i*i << "\n";
	}

	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 <string>
#include <algorithm>
#include <cmath>

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<stdio.h>
int main(){
  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 <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 - i, j, i * j );
		}
	}
	return 0;
}

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

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

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define MOD 1000000007 //10^9+7
#define INF 1000000000 //10^9

int main (int argc, const char * argv[])
{
    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 (){

cout << "Hello World";

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

C++: //AOJ 0000
//include
#include<cstdio>
#include<cctype>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<list>
#include<bitset>
#include<set>

//using namespace
using namespace std;

//define

//variable
short a, b;

//function
int main(){
  for(a = 1; a <= 9; a++)
    for(b = 1; b <= 9; b++)
      printf("%dx%d=%d", a, b, a * b);
  return 0;
}

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

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;

			if (i != 9 || j != 9) cout << "\n";
		}

	return 0;
}

C++: //+option:-ansi -Wall -Wextra
//+task:hdu 1216
//press <F7> to update the source to mark file.
//press <S-F7> to open the page
#include "vector"
#include "iostream"
#include "algorithm"
#include "cmath"
#include "cstdio"
#include "cstdlib"
#include "cstring"
#include "iterator"
using namespace std;
#define inc(over, ...)\
        do\
        {\
                static int over = 0;\
                (over)++;\
                __VA_ARGS__;\
        }while(0)
#define rangedo(i, s, t)\
        i=s; i!=t; i++
#define range(a, b, ...)\
	__typeof(a) _ = a; (_ != (b)) && (bool(__VA_ARGS__)); _++
#define each(a, b, ...)\
	for(range(a, b, true)) __VA_ARGS__
#define exist(a, b, pred)\
	({\
	        bool ok=false;\
		for(range(a,b,!ok))\
			if((pred)) ok = true;\
		ok;\
	})
#define countdown(a, ...)\
	for(int _ = a; _--; ) __VA_ARGS__
/* Good Day */

#define x_lambda(args, index, ...)({\
		typedef __typeof(args) type, reft;\
		static reft _1, _2;\
		typedef __typeof(({ ({__VA_ARGS__;});})) rett;\
		struct __class{\
		static rett __func1 (const reft &_1){return rett(({__VA_ARGS__;}));}\
		static rett __func2 (const reft &_1, const reft &_2) {return rett(({__VA_ARGS__;}));}}; \
		&__class::__func##index;})
#define $lb (
#define $1(type)  x_lambda $lb type, 1 
#define $2(type)  x_lambda $lb type, 2 
#define $lambda(...) __VA_ARGS__)
#define $cin(type)   istream_iterator<type>(cin)
#define $cin_end(type) istream_iterator<type>()
#define $cout(type) ostream_iterator<type>(cout)
#define $cout_end(type) ostream_iterator<type>()
#define closure static
/* Good Day */

int main()
{
	each(1, 10)
	{
		int __ = _;
		each(1, 10)
		{
			printf("%dx%d=%d\n", __, _, __*_);
		}
	}
}

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