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 <cstdio>
#include <cstring>
#define N 111111
int cc[N],sa[N],h[N],rank[N],wa[N],ws[N],wb[N],wv[N],n;
char c[N];
bool cmp(int *r, int a, int b, int l){
	return r[a] == r[b] && r[a + l] == r[b + l];
}
void da(int *r, int *sa, int n, int m){//*r:蜴滉クイ *sa:蜷守シ?焚扈?シ茎a[0]荳コ遨コ荳イ(sa[0] = n - 1) n:諤サ髟ソ m:蟄礼ャヲ闌?峩
	int i, j, p, *x = wa, *y = wb, *t;
	memset(ws, 0, sizeof ws);
	for (i = 0; i < n; i ++ ) ws[x[i] = r[i]] ++ ;
	for (i = 1; i < m; i ++ ) ws[i] += ws[i - 1];
	for (i = n - 1; i >= 0; i -- ) sa[ -- ws[x[i]]] = i;
	for (j = 1, p = 1; p < n; j *= 2, m = p){
		for (p = 0, i = n - j; i < n; i ++ ) y[p ++ ] = i;
		for (i = 0; i < n; i ++ ) if (sa[i] >= j) y[p ++ ] = sa[i] - j;
		for (i = 0; i < n; i ++ ) wv[i] = x[y[i]];
		memset(ws, 0, sizeof ws);
		for (i = 0; i < n; i ++ ) ws[wv[i]] ++ ;
		for (i = 1; i < m; i ++ ) ws[i] += ws[i - 1];
		for (i = n - 1; i >= 0; i -- ) sa[ -- ws[wv[i]]] = y[i];
		for (t = x, x = y, y = t, p = 1, i = 1, x[sa[0]] = 0; i < n; i ++ )
			x[sa[i]] = cmp(y, sa[i], sa[i - 1], j) ? p - 1 : p ++ ;
	}
	return;
}
void gua(int *r, int *sa, int n){//rank:謗貞錐 h:height謨ー扈?	int i, j, k = 0;
	for (i = 1; i <= n; i ++ ) rank[sa[i]] = i;
	for (i = 0; i < n; h[rank[i ++ ]] = k)
		for (k ? k -- : 0, j = sa[rank[i] - 1]; r[i + k] == r[j + k]; k ++ );
	return;
}
int main(){
	scanf("%s", c);
	n = strlen(c);
	c[n ++ ] = 0;//譛ォ蟆セ髴?刈荳頑欠遉コ隨ヲ/000;
	for (int i = 0; i < n; i ++ ) cc[i] = c[i];
	da(cc, sa, n, 127);
	gua(cc, sa, -- n);//n髴?△螟榊次髟ソ?敬[i]荳コsa[i]蜥茎a[i - 1]蜈ャ蜈ア髟ソ蠎ヲ?茎a[0]荳コ譛ォ蟆セ遨コ荳イ
	for (int i = 0; i <= n; i ++ ) printf("%d ",sa[i]);
}

C++: /*
 * main.cpp
 *
 *  Created on: 2011/04/01
 *      Author: satoki
 *      11:27 ~ 11:37 Accepted
 */
#include <iostream>

using namespace std;

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;
}

C++: #include <stdio.h>

using namespace std;


int main(){

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

    return 0;
}

C++: #include <cstdio>
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<cstdio>
main(){
FILE *fp = fopen("test","w");
fprintf(fp,"%d",1125);
return 0;
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
using namespace std;
///////////////////library zone!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
const ll Mod = 1000000007;
const ll mod = 998244353;
struct H {
	ll x, y;
	bool operator<(const H &b) const {
		if (x != b.x) return x < b.x;
		return y < b.y;
	}
	bool operator>(const H &b) const {
		if (x != b.x) return x > b.x;
		return y > b.y;
	}
	bool operator==(const H &b) const { return x == b.x&&y == b.y; }
	bool operator!=(const H &b) const { return (*this) != b; }
};
struct P {
	ll pos, cost;
	bool operator<(const P &b) const { return cost < b.cost; }
	bool operator>(const P &b) const { return cost > b.cost; }
};
struct B {
	ll to, cost;
};
struct E {
	ll from, to, cost;
	bool operator<(const E &b) const { return cost < b.cost; }
	bool operator>(const E &b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T &a, U b) {
	if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T &a, U b) {
	if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
	if (a < 0) return 0;
	return a;
}
template<typename T>
T min_0(T a) {
	if (a > 0) return 0;
	return a;
}
ll read() {
	ll u;
	ll k = scanf("%lld", &u);
	return u;
}
ll gcd(ll i, ll j) {
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcd(j%i, i);
}
ll mod_pow(ll x, ll n, ll p) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
signed main() {
	for (int i = 1; i <= 9; i++) {
		for (int j = 1; j <= 9; j++) {
			printf("%lldx%lld=%lld\n", i, j, i*j);
		}
	}
}

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