Go: package main

import "fmt"

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

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 <string>

using namespace std;
int main()
{
	int a=1,b=1;
	for(int i=0;i<9;i++){
		for(int j=0;j<9;j++){
			cout<<a<<"x"<<b<<"="<<a*b<<endl;
			b++;
		}
		b=1;
		a++;
	}
	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 <iostream>
using namespace std;

int main(){
	int i,j;
	int count = 9;

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

C++: main = putStr . unlines $zipWith (++) [(show a)++"x"++(show b)++"=" | a <- [1..9], b <- [1..9]] (map show x)
  where x = [a * b | a <- [1..9], b <- [1..9]]

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

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

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 <stdio.h>
 
using namespace std;
 
 
int main(){
 
    for(int i=1;i<=9;i++){
        for(int k=1;k<=9;k++)printf("%dx%d=%d\n",i,k,i*k);
    }
 
    return 0;
}

C++: #include<iostream>
using namespace std;
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(){
	int x=1,y=1;
	while(1){
		cout << x << "x" << y << "=" << x*y << endl;
		y=y+1;
		if(x==9&&y==10)break;
		else if(y==10){
			y=1;x=x+1;
		}
	}
	
	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<iostream>
using namespace std;

int main(){
	for(int i=1;i<10;i++){
		for(int j=1;j<10;j++){
			std::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;
	}
}

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

C++: 
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <ctime>


using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x*x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1)
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  FOR(i,0,n)
#define loop(n) FOR(i,0,n)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007;//10^9+7
const LL INF2 = (LL)100000000000000000;//10^18

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(){
   int i,j;
    
   for(i=1;i<10;i++){
      for(j=1;j<10;j++){
        cout << i << "x" << j << "=" << i*j << "\n";
       }
   }
   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;
		}
	}
}

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

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

int main(){
	int index,jndex;
	for(index = 1; index <= 9 ; index++){
		for(jndex = 1 ; jndex <= 9 ; jndex++){
			cout<<index<<"x"<<jndex<<"="<<index*jndex<<endl;
		}
	}
	
}

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

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