Go: package main

import "fmt"


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

C++: #include<stdio.h>

int main(){
	
	int a,b;
	
	for(a=1;a<10;a++){
		for(b=1;b<10;b++){
			printf("%dx%d=%d\n",a,b,a*b);
			
		}
	}
	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>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <stdio.h>
#define int long long
inline int in() { int32_t x; scanf("%d", &x); return x ;}
using namespace std;
const int INF = 1e18;
const int MAX_N = 1e5 + 5;
int32_t main()
{
    
    cout << "1x1=1\n1x2=2\n.\n.\n9x8=72\n9x9=81\n";
}

C++: int x, y;
for (x=1;x<=9;x++) {
  for (y=1;y<=9;y++) {
    System.out.println(x + "x" + y + "=" + (x * y));
  }  
}

C++: #include<cstdio>
#include<iostream>
#include<cstdlib>
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<bits/stdc++.h>
using namespace std;
int main(){
  for(int i=0;i<9;i++){
    for(int j=0;j<9;j++){
      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 <= 9; i++) for (int j = 1; j <= 9; j++) {
		cout << i << "x" << j << "=" << i * j << endl;
	}
	return 0;
}

C++: #include <stdio.h>
#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 <iostream>
#include <math.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() {
  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 <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<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);
    }
}

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

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++: ??????

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

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

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