Go: package main

import "fmt"

var (
	min = 1
	max = 9
)

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

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;

#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
	EACH(x,vec) is >> x;
	return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
	REP(i,vec.size()) {
		if (i) os << " ";
		os << vec[i];
	}
	return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
	REP(i,vec.size()) {
		if (i) os << endl;
		os << vec[i];
	}
	return os;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	FOR(i, 1, 10) FOR(j, 1, 10) {
		cout << i << "x" << j << "=" << i*j << endl;
	}
}

C++: #inclde<iostream>
using namespace std;
int main()
{int c,i;
for(i=1;i<10;i++)
{c=1*i;
cout<<"1x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=2*i;
cout<<"2x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=3*i;
cout<<"3x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=4*i;
cout<<"4x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=5*i;
cout<<"5x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=6*i;
cout<<"6x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=7*i;
cout<<"7x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=8*i;
cout<<"8x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=9*i;
cout<<"9x"<<i<<"="<<c<<endl;
}
return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>

using namespace std;

#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl;}
#define SHOW2d(v,WW,HH) {REP(W_,WW){REP(H_,HH)cerr << v[W_][H_] << ' ';cerr << endl;}}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 998244353

typedef long long ll;
typedef pair<ll,ll> P;

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

	REP(i, 9){
		REP(j, 9){
			cout << i + 1 << "x" << j + 1 << "=" << (i + 1) * (j + 1) << endl;
		}
	}

	return 0;
}

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

using _i64 = int64_t;
using _u64 = uint64_t;
using _f64 = double;

#define _for(i, start, end) for(_i64 i = (_i64)start; i < (_i64)end; ++i)
#define _rep(i, number) _for(i, 0, number)
#define _foreach(e, data) for(auto& e : data)
#define _all(data) data.begin(), data.end()

template<typename type>
_i64 _size(const type& data) { return static_cast<_i64>(data.size()); }
template<typename type, size_t size>
_i64 _size(const type (&)[size]) { return static_cast<_i64>(size); }

enum _flag : bool { able = true, disable = false };

struct _time {
    _time(_flag flag) { check = flag; if(!check) { return; } gettime(start); }
    ~_time() {
        if(!check) { return; }; gettime(end);
        _i64 elapse = chrono::duration_cast<chrono::milliseconds>(end - start).count();
        cout << endl << "Time: " << elapse << " ms" << endl;
    }
    private:
    using _timer = chrono::time_point<chrono::system_clock>;
    _timer start, end; bool check;
    void gettime(_timer& time) { time = chrono::system_clock::now(); }
};

struct _ini { _ini() { ios::sync_with_stdio(false); cin.tie(nullptr); } } _ini;

int main() {
    {
        _time time(disable);
        _for(i, 1, 10) { _for(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(void)
{
    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<iostream>
using std::cout; using std::endl;
int main()
{
	for (int x = 1; x <= 9; x++)
	{
		for (int y = 1; y <= 9; y++)
		{
			cout << x <<"x"<< y << "="<<x*y <<endl;
		}
	}
	return 0;
	
}

C++: #include <iostream>

using namespace std;

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

C++: // 失敗するからこそ そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
#ifdef DAIJOBU
#include "/home/v-o_o-v/deb.h"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif 

using namespace std;

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

	for(int i = 1; i <= 9; i++){
		for(int j = 1; j <= 9; j++){
			cout << i << "x" << j << "=" << i * j << "\n";
		}
	}
	return 0;
}
// Write Here