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() {
	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 (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 <= 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 n=1;n<=9;n++){
		for(int m=1;m<=9;m++){
			cout<<n<<"x"<<m<<"="<<n*m<<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%d\n", i, j, i * j );
		}
	}
	return 0;
}

C++: #include<stdio.h>

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

  return 0;
}

C++: #include<iostream>

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

int main(){

int a=1;
int b=1;

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

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

cout<<a<<"*"<<b<<"="<<a*b<<"\n";


}

}



    return 0;
}

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

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

C++: #include<cstdio>
int main(){for(int i=0;i<81;i++)printf("%dx%d=%d\n",i/9+1,i%9+1,(i/9+1)*(i%9+1));}

C++: #pragma GCC optimize("O2")
#pragma GCC optimize("O3")

#include<bits/stdc++.h>

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

C++: #include <iostream>
#include <stdio.h>

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<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 << 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(){

    return 0;
}

C++: #include <iostream>
int main(){

	int a,b;

	for(a=1;a<10;a++){
		for(b=1;b<10;b++){
			std::cout<<a<<"x"<<b<<"="<<a*b<<std::endl;
			}
		}


	return 0;
	}

C++: #include "stdafx.h"
#include "iostream"

using namespace std;

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

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

int main(){

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

			cout << a << "ｘ" << i << "=" << a*i  <<endl;

		}
	}
		return 0;
}

C++: #include<stdio.h>
int main(void){
	int a,b,c;
	for(a=1;a>10;a++){
	 for(b=1;b>10;a++){
	 c=a*b;
	printf("%dx%d=%d\n",a,b,c);
    {
 }
return 0;
}

C++: main(){int i=0,j;for(;++i<=9;)for(j=1;j<=9;)printf("%dx%d=%d\n",i,j++,i*j);}

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

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<stdio.h>
 
int main(){
    while(true);
    return 0;
}

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

int main{
return 0;
}

C++: #include "cstdio"
#include "cstring"
using namespace std;
int main()
{
    //freopen("input.txt","r",stdin);
   	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 <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
using namespace std;
int size(string x){
	string::size_type size=x.size();
	return size;
}
#define fu(l,k) for(int i=l;i<k;i++)
#define fd(l,k) for(int i=l;i>k;i--)
#define fi first
#define se second
typedef  vector<string> vs;
typedef  vector<int> vi;
double pi(){
	return M_PI;
}
typedef set<int> set_i;
typedef set<string> set_s;
int main(){
	fu(1,10){
		for(int s=1;s<10;s++){
			cout<<i<<"x"<<s<<"="<<i*s<<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;
}