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 <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <queue>
#include <stack>
#include <list>
#include <bitset>
#include <deque>
#include <cmath>
#include <iomanip>

using namespace std;

inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define CLR(a) memset((a), 0 ,sizeof(a))
#define MCLR(a) memset((a), -1 ,sizeof(a))
#define SZ(a) (sizeof(a))
#define FILL(a,v) fill((int*)a,(int*)(a+(SZ(a)/SZ(*(a)))),v)
#define SORT(c) sort((c).begin(),(c).end())

bool cheak(int x, int y, int xMax, int yMax)
{
	return x >= 0 && y >= 0 && xMax > x && yMax > y;
}
const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;
const int INF    = 2147483647;
const ll  LLINF  = 9223372036854775807;
const ull ULLINF = 18446744073709551615;



int main()
{
	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(void){
	for(int i = 0; i < 10; i++){
		for(int j = 0; j < 10; j++){
				printf("%d x %d = %d",i,j,i*j);
		}
	}
	return 0;
}

C++: #include <stdio.h>
int main()
{
    for (int i=1; i<=9; i++)
        for (int j=1; j<=9; j++)
            printf("%dx%d=%d", i, j, i*j);
    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 <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;

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<iostream>
using namespace std;

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

C++: #include <cstdio>
using namespace std;
#define REP1(i,n) for(int i=1;i<=n;++i)
int main(){
	REP1(i,9) REP1(j,9) printf("%dx%d=%d\n",i,j,i*j);
	return 0;
}

C++: #include <iostream>

int main() {
  for(int i = 1; i <= 9; ++i)
  for(int j = 1; j <= 9; ++j)
  std::cout << i << "x" << j << "=" << i * j << std::endl;
}

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

int main(){

	int i, j;
	int ans;

	for(i=1;i<=9;i++){
		for(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<9;i++)	
    {
	for(int j=1;j<9;j++)	
        { 
		cout<<i<<" * "<<j<<" = "<<(i*j)<<endl;
        }
    }
    return 0;
}

C++: #include<iostream>
#include<string>
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 <bits/stdc++.h>
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<iostream>
using namespace std;

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

C++: #include <vector>
#include <iostream>
using namespace std;
 
int main() {
vector< int > test = {0,1,2,3};
for(auto x : test) { cout << x << endl; }
return 0;
}

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

int main(){
	int a=0,b=0,c=0;
	for(int i=0;i++;i<9){
		a++;
		for(int j=0;j++;j<9){
			b++;
			c=a*b;
			cout<<a<<"x"<<b<<"="<<c<<endl;
		}
	}
}

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

return 0;
}

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;
int main() {
	int a, b;
	for (a = 1; a < 10; a++) {
		for (b = 1; b < 10; b++) {
			cout << a<<"x"<<b<<"="<<a*b << endl;
		}
	}
	return 0;
}

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

int main(){
	int i,j;

	for(i = 0;i < 0;i++){
		for(j = 0;j < 0;j++){
			cout<<i<<"x"<<j<<"="<<i*j<<endl;
		}
	}
	return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
	for (int a = 1;a < 10;a++) {
		for (int b = 1;b < 10;b++) {
			int c = a*b;
			printf("%d", a);
			printf("x");
			printf("%d", b);
			printf("=");
			printf("%d", c);
			printf("\n");
		}
	}
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define N 10
int main(int argc, const char * argv[])
{
    for(int i=1; i<N; i++){
        for(int j=1; j<N; j++){
            printf("%dx%d=%d\n",i,j,i*j);
        }
    }

}

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

int main()
{
    for(long long int i = 1;i <= 9;++i)
        for(long long int j = 1;j <= 9;++j)
            printf("%lld*%lld=%lld\n", i, j, i * j);
    return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
    int x =0;
    int y =0;

    for (x=1;x<=9;x++)
    {
        for (y=1;y<=9;y++)
        cout << x << "x" << y << "=" << x*y << 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 <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 <iostream>
using namespace std;

int main(){
int a = 1,b = 1,c;
while(a != 9 and b != 9){
c=a*b;
cout<<a<<"x"<<b<<"="<<c<<endl;
b++;
if(b == 10){
a++;
b = 1;
}

}
}