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

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

  }

  return 0;

}

C++: #include<stdio.h>

int main()
{
    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>
int main(){
	for(int i=1;i<10;i++){
		for(int j=1;j<10;j++){
			std::cout<<i<<"x"<<j<<"="<<i*j<<std::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;
		}
	}
	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 )
{
	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>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstring>
using namespace std;

C++: for i in 1..9 do
	for j in 1..9 do
	print(i,"x",j,"=",i*j,"\n")
	end
	end

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

#ifdef _DEBUG
#define dump(x) cout << #x << " = " << (x) << "\n"
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n"
#else
#define dump(x)
#define debug(x)
#endif


int main() {
#ifdef _DEBUG
	printf( "Debug Mode\n" );
#endif
	for ( int i = 1; i < 10; i++ ) {
		for ( int j = 1; j < 10; j++ ) {
			dump( i );
			dump( j );
			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;
		}
	}
	return 0;
}

C++: main(){}

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 << '\n';
		}
	}
}

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
	while(1){}
	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;
    }
  }
  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 <cstdio>

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

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

int main() {
	int n,m;
for(int n=1; n<=9; n++){for(int m=1; m<=9; m++){
cout<<n<<"x"<<m<<"="<<n*m<<endl;
}}// your code goes here
	return 0;
}

C++: #include <iostream>

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


auto main() -> int {
	doAllProcess();
	return 0;
}

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

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

return 0;
}

C++: #include<stdio.h>
main(){int i,x,y;for(i=0;i<81;i++){x=i/9+1;y=i%9+1;printf("%dx%d=%d\n",x,y,x*y);}returnツ　0;}

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




int main() {
	
	for (int i = 1; i < 10; i++) 
	for (int b = 1; b < 10; b++) 
	cout << i<<"*"<<b<<"="<<i*b<<endl;

		return 1;
}

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<< "  ";
		}
	}
	return 0;
}

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

int main()
{
    int a;
    for(int i=1;i<10;i++){
    for(int j=1;j<10;j++){
    a=i*j;
    cout<<i<<'??'<<j<<'='<<a<<'\n';
    }
    }
    return 0;
}

C++: #include <stdio.h>

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 x=1; x<=9; x++)
		{

                  cout<<x*i=<<x*i<<endl;
			
		}
	}
	
	
    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;
}

}
    return 0;
}