Go: package main

import "fmt"
import "strconv"

func main() {
  for i := 1; i <= 9; i++ {
    for j := 1; j <= 9; j++ {
      res := i * j
      fmt.Println(
        strconv.Itoa(i) + "x" + strconv.Itoa(j) + "=" + strconv.Itoa(res)
      )
    }
  }
}

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;
			cout<<endl;
		}
	}
	cout<<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;
}
}
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);
}
}
return 0;
}

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

int main(void){
int x,y;
for(x=0;x<10;x++){
   for(y=0;y<10;y++){
    
   cout <<x<<x<<y<<'='<<x*y; 
    }
}
    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<stdio.h>

int main(void){

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

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

int main(){
	for ( int leftIdx = 1; leftIdx <= 9; ++leftIdx ) {
		for ( int rightIdx = 1; rightIdx <= 9; ++rightIdx ) {
			printf( "%dx%d=%d\n", leftIdx, rightIdx, leftIdx * rightIdx );
		}
	}
	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;
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>
#include <cstdio>
using namespace std;

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 <stdio.h>
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++: #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;
}

C++: #include<stdio.h>

int main(void)
{
	int i,i2,a;
	for(i=1;i<=9;i++)
	{
		for(i2=1;i2<=9;i2++)
		{
			a=i*i2;
			printf("%dx%d=%d\n",i,i2,a);
		}
	}
	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",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 <iostream>
#include <algorithm>
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<stdio.h>
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 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>
#include<iostream>

using namespace std;

int main()
{
	for(int i=1;i<10;i++)
	{
		printf("%dx%d=%d\n",i,i,i*i);
	}
	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;
}

C++: #include <iostream>


using namespace std;

int main() {

	int i, j;

	for (i = 1; i <= 9; i++) {

		for (j = 1; j <= 9; j++) {

			cout << i << "x" << j << "=" << i*j << "\n";

		}

	}

	
	return 0;

}

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

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

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

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

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

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

C++: #include<stdio.h>

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