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 <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<stdio.h>
int main(int argc, const char * argv[]){
    int a,b;
    for (a=1;a<=9;a++){
        for (b=1;b<=9;b++)
            printf("%dx%d=%d\n",a,b,a*b);
    }
    return 0;
}

C++: // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>

// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a); i<(b);++i)
#define rep(i, n) FOR(i, 0, n)

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;

// solve

int main(int argc, char const* argv[])
{
  FOR(i, 1, 10){
    FOR(j, 1, 10){
      cout << i << "x" << j << "=" << i * j << endl;
    }
  }
	return 0;
}

C++: #include "bits/stdc++.h"

#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}

void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}

int main(){
	cin.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 <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 <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
  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(){cout<<"1x1=1"<<endl;
cout<<"1x2=2"<<endl;
cout<<"1x3=3"<<endl;
cout<<"1x4=4"<<endl;
cout<<"1x5=5"<<endl;
cout<<"1x6=6"<<endl;
cout<<"1x7=7"<<endl;
cout<<"1x8=8"<<endl;
cout<<"1x9=9"<<endl;
cout<<"2x1=2"<<endl;
cout<<"2x2=4"<<endl;
cout<<"2x3=6"<<endl;
cout<<"2x4=8"<<endl;
cout<<"2x5=10"<<endl;
cout<<"2x6=12"<<endl;
cout<<"2x7=14"<<endl;
cout<<"2x8=16"<<endl;
cout<<"2x9=18"<<endl;
cout<<"3x1=3"<<endl;
cout<<"3x2=6"<<endl;
cout<<"3x3=9"<<endl;
cout<<"3x4=12"<<endl;
cout<<"3x5=15"<<endl;
cout<<"3x6=18"<<endl;
cout<<"3x7=21"<<endl;
cout<<"3x8=24"<<endl;
cout<<"3x9=27"<<endl;
cout<<"4x1=4"<<endl;
cout<<"4x2=8"<<endl;
cout<<"4x3=12"<<endl;
cout<<"4x4=16"<<endl;
cout<<"4x5=20"<<endl;
cout<<"4x6=24"<<endl;
cout<<"4x7=28"<<endl;
cout<<"4x8=32"<<endl;
cout<<"4x9=36"<<endl;
cout<<"5x1=5"<<endl;
cout<<"5x2=10"<<endl;
cout<<"5x3=15"<<endl;
cout<<"5x4=20"<<endl;
cout<<"5x5=25"<<endl;
cout<<"5x6=30"<<endl;
cout<<"5x7=35"<<endl;
cout<<"5x8=40"<<endl;
cout<<"5x9=45"<<endl;
cout<<"6x1=6"<<endl;
cout<<"6x2=12"<<endl;
cout<<"6x3=18"<<endl;
cout<<"6x4=24"<<endl;
cout<<"6x5=30"<<endl;
cout<<"6x6=36"<<endl;
cout<<"6x7=42"<<endl;
cout<<"6x8=48"<<endl;
cout<<"6x9=54"<<endl;
cout<<"7x1=7"<<endl;
cout<<"7x2=14"<<endl;
cout<<"7x3=21"<<endl;
cout<<"7x4=28"<<endl;
cout<<"7x5=35"<<endl;
cout<<"7x6=42"<<endl;
cout<<"7x7=49"<<endl;
cout<<"7x8=56"<<endl;
cout<<"7x9=63"<<endl;
cout<<"8x1=8"<<endl;
cout<<"8x2=16"<<endl;
cout<<"8x3=24"<<endl;
cout<<"8x4=32"<<endl;
cout<<"8x5=40"<<endl;
cout<<"8x6=48"<<endl;
cout<<"8x7=56"<<endl;
cout<<"8x8=64"<<endl;
cout<<"8x9=72"<<endl;
cout<<"9x1=9"<<endl;
cout<<"9x2=18"<<endl;
cout<<"9x3=27"<<endl;
cout<<"9x4=36"<<endl;
cout<<"9x5=45"<<endl;
cout<<"9x6=54"<<endl;
cout<<"9x7=63"<<endl;
cout<<"9x8=72"<<endl;
cout<<"9x9=81"<<endl;
return 0;
}

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

int main(){

for (int i =1; i < 10; i++){
 for (int i2 = 1; i2 < 10; i2++){
  
 cout << i << "x" << i2 << "=" << i * i2;
 }
}
    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(){
    for (int i = 0; i<9; i++){
        std::printf("%dx%d=%d\n",i+1,i+1,(i+1)*(i+1));
    }
    return 0;
}

C++: #include<cstdio>

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

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 <bits/stdc++.h>

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