Go: package main

import "fmt"

func main() {
    var max_num = 9
    for i := 1; i<= max_num; i++{
        for j := 1; j<= max_num; j++{
            fmt.Printf("%dx%d=%d\n",i,j,i*j)
        }
    }
}

C++: #include <iostream>
#include <string.h>
#include <cstdio>
#include <algorithm>
#include <vector>
#define maxnum 1000000000
using namespace std;

struct TwoTree
{
    int h, root;
    vector<TwoTree> tree;
    TwoTree() {}
    TwoTree(int x)
    {
        h = 0, root = x;
        tree.clear();
    }
    int size()
    {
        return tree.size();
    }
    void push_back(TwoTree a)
    {
        tree.push_back(a);
    }
    TwoTree addSubTree(TwoTree a)
    {
        TwoTree res = *this;
        res.h++;
        res.push_back(a);
        return res;
    }
    TwoTree mergeTree(TwoTree A)
    {
        if (root>A.root) return addSubTree(A);
        return A.addSubTree(*this);
    }
};//螟ァ譬ケ譬?

struct TwoHeap
{
    int root;
    vector<TwoTree> tree;
    TwoHeap() {}
    TwoHeap(int x)
    {
        root = x;
        tree.clear();
        tree.push_back(TwoTree(x));
    }
    void clear()
    {
        root = -maxnum;
        tree.clear();
    }
    void push_back(TwoTree a)
    {
        tree.push_back(a);
    }
    int size()
    {
        return tree.size();
    }
    int top()
    {
        int res = -maxnum;
        for (int i = 0; i < tree.size(); i++) res = max(res, tree[i].root);
        return res;
    }
    TwoHeap mergeHeap(TwoHeap B)
    {
        TwoHeap A = *this;
        TwoHeap res;
        res.clear();
        int head_A = 0, head_B = 0;
        while (head_A<A.size()||head_B<B.size())
        {
            if (head_B<B.size())
            {
                while (head_A<A.size()&&A.tree[head_A].h<B.tree[head_B].h)
                    res.push_back(A.tree[head_A]), head_A++;
            }
            else
            {
                while (head_A<A.size())
                    res.push_back(A.tree[head_A]), head_A++;
            }
            if (head_A<A.size())
            {
                while (head_B<B.size()&&A.tree[head_A].h>B.tree[head_B].h)
                    res.push_back(B.tree[head_B]), head_B++;
            }
            else
            {
                while (head_B<B.size())
                    res.push_back(B.tree[head_B]), head_B++;
            }
            while (head_A<A.size()&&head_B<B.size()&&A.tree[head_A].h==B.tree[head_B].h)
                A.tree[head_A] = A.tree[head_A].mergeTree(B.tree[head_B]), head_B++;
        }
        res.root = res.top();
        return res;
    }
    TwoHeap add(int x)
    {
        TwoHeap A = *this;
        TwoHeap B = TwoHeap(x);
        return A.mergeHeap(B);
    }
    TwoHeap del()
    {
        TwoHeap A = *this;
        TwoHeap B;
        B.clear();
        for (vector<TwoTree>::iterator it = A.tree.begin(); it != A.tree.end(); it++)
            if (A.root==(*it).root)
            {
                TwoTree tmp = *it;
                A.tree.erase(it);
                for (int i = 0; i < tmp.size(); i++)
                    B.push_back(tmp.tree[i]);
                break;
            }
        return A.mergeHeap(B);
    }
};//螟ァ譬ケ蝣?

int main()
{
    return 0;
}

C++: #include<iostream>
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;
    }
  }
}

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++: //25
#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;
            cout << 'x';
            cout << j;
            cout << '=';
            cout << i * j;
            cout << endl;
        }
    }
    return 0;
}

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

int main(){
	int k = strtol("1000000000000", 0, 10);
	return k < -727300000;
}

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 <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 - 1, i * j);
		}
	}
	return 0;
}

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

int main(){

int  i , j;

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

return 0;
}

C++: //
// Write a program which prints multiplication tables in the following format:
//
#include <iostream>
using namespace std;

static const int EndRecursion = 9;

void inner(int left_side, int right_side)
{
    if (EndRecursion < right_side)
        return;

    cout << left_side << "x" << right_side << "=" << (left_side * right_side) << endl;
    inner(left_side, right_side + 1);
}

void outer(int left_side)
{
    if (EndRecursion < left_side)
        return;

    inner(left_side, 1);
    outer(left_side + 1);
}

void run()
{
    outer(1);
}

int main()
{
    // Start QQ
    run();
}

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

int main(){
    int a = 1, b = 1;
    for(int i = 1; i < 10; i++){
        for(int j = 1; j < 10; j++){
            cout << a << "x" << b << endl;
            b++;
        }
        b = 1;
        a++;
    }
    return 0;
}

C++: #include <iostream>


int main(){

int i, j;

for (i = 1; i < 9; i++){

for (j = 1; i < 9; i++){

cout << 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;i++){
std::cout << i << 'x' << j << '=' i*j <<std::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;
}
}

}

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

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

  }

  return 0;
}