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 x = 1; x < 10; x++)
        for (int y = 1; y < 10; y++)
            cout << x << "x" << y << "=" << x * y << endl;
}

C++: #include<stdio.h>

int main()
{
	int a,b;

	while(1){
		for(a=0;a<10;a++){
			for(b=0;b=10;b++){
				printf("%d+%d=%d\n",a,b,a*b);
			}
		}
		return 0;

	}
}

C++: #include<stdio.h>
#include<string.h>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
int main() {
	int n, m, i, j,h=0, cnt = 0,m,p, k = 3, l[10], S, L, s[10], a[10];
	scanf("%d %d% d", &n,&m,&p);
	for (i = 1; i <= 9; i++) {
		for (j = 1; j <= 9; j++) {
			int seki = i*j;
			printf("%dx%d=%d\n", i, j, seki);
		}
	}

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

int main(){
for(int i = 0; i < 9; ++i)
for(int j = 0; j < 9; ++j)
cout << i << "x" << j << i * j << '\n';


    return 0;
}

C++: #include <iostream>

const int N = 9;

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

}

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

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n)

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() {
	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 < 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=10;i++<100;)cout<<i/10<<"x"<<i%10<<i/10*1%10<<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;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int main(){
  REPR(i,10)REPR(j,10){
    printf("%dx%d=%d\n",i,j,i*j);
  }
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int a,b;
for(int j = 1; j<10; j++){
	a = j;
	
	for(int i = 1; i<10; i++){
		b = i;
		
		cout << a << "x" << b << "=" << a*b << endl;
		

	}
}
}

C++: #include<iostream>
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;
}