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 <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,k;
	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 a,b,c,x;
 /* ????????°a ?????¢?????¬?????????????????¢?????¨?????¢?????\?????????????????´??°????????????????´???????????????????????????????*/
      scanf("%d%d%d", &a,&b,&c);
  if (b < a)
    {
   x = a;
      a = b;
      b = x;
    };

   if (c < b)
    {
   x = b;
      b = c;
      c = x;
    };

   if (b < a)
    {
   x = a;
      a = b;
      b = x;
    };
      printf("%d ", a);
  printf("%d ", b);
  printf("%d\n", c);
  
    return 0;
}

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

// ÄAÉæé2iñ
void rec(int depth, int max_depth, int a[], int &cnt) {
  if ( depth == max_depth ) {
    cnt++;
    return;
  }
  
  for(int i = 0; i < 2; i++) {
    a[depth] = i;
    rec(depth + 1, max_depth, a, cnt);    
  }  
}

int main() {  
  int a[128];
  int cnt = 0;
  int max_depth = 26;
  rec(0, max_depth, a, cnt);
  
  for(int a = 1; a <= 9; a++)
    for(int b = 1; b <= 9; b++)
      printf("%dx%d=%d\n", a, b, a * b);
  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

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

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

C++: #include<iostream>
using namespace std;
int main(){
    int i=1,ii=1;
    
    for(i=1;i<=9;i=i+1){
    for(ii=1;ii<=9;ii=ii+1){
            cout<<i<<"x"<<ii<<"="<<i*ii;
            cout<<endl;
    }}
        
    
    
    return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>

using namespace std;


#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)

#define mp make_pair
#define fst first
#define snd second
#define pb push_back


const double EPS = 1e-10;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;


int main(){
	rep(i, 9) rep(j, 9) printf("%dx%d=%d\n", i + 1, j + 1, (i + 1) * (j + 1));
	
	return 0;
}

C++: #include<stdio.h>

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

C++: #include <stdio.h>
int main(){
    int n, i, s, g;
    for(i=1, g=1; i <10;i++){
             printf("%dx%d=%d\n", g,i, g*i);
             if(i==9){
             i=0;
             g++;         
             }
             if(g==10)
             break;
             }
    return 0;
    }

C++: //AOJ 0000
//include
#include<cstdio>
#include<cctype>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<list>
#include<bitset>
#include<set>
#include<iostream>
 
//using namespace
using namespace std;
 
//define
 
//variable
short a, b;
 
//function
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 <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(int argc, char** argv)
{
        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(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++: #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int main() {
	int i, j;

	for (i = 1;i < 10;i++) {
		for (j = 1;j < 10;j++) {
			printf("%d x %d = %d\n", i, j, i*j);
		}
	}
}

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

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

C++: #include <iostream>

int main(void)
{
  const int minNum = 1;
  const int maxNum = 9;

  for (int i = minNum; i <= maxNum; i++) {
    for (int j = minNum; j <= maxNum; j++) {
      std::cout << i << "x" << j << "=" << i * j << std::endl;
    }
  }

  return 0;
}

C++: #include<iostream>
int main() {
	for (int a = 1; a <= 9; a++) {
		for (int b = 1; b <= 9; b++) {
			std::cout << a << "x" << b << "=" << a * b << std::endl;
		}
	}
}

C++: int main(){
auto x = 1;
return 0;
}

C++: import java.util.*;
import java.lang.*;
import java.math.*;

class main {
    
    void run() {
        for (int i=1;i<10;i++) {
            for (int j=1;j<10;j++) 
                System.out.println( i + "x" + j + "+"  + i*j);
        }
        return;
    }
    
    public static void main( String[] args) {
       new main().run();
    }
}

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

int main() {
    for (int l = 1; l < 10; l++) {
        for (int r = 1; r < 10; r++) {
            cout << l << 'x' << r << '=' << l * r << endl;
        }
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define np string::npos
#define X real()
#define Y imag()
#define value(x,y,w,h) (x >= 0 && x < w && y >= 0 && y < h)
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define repc(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

typedef long long ll ;
typedef deque<int> di ;
typedef deque<ll> dl ;
typedef map<string,int> dict;
typedef complex<double> comd;
typedef pair<int,int> pii;

constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};

double CalcDist(comd p1, comd p2){
  return sqrt(pow(p1.X - p2.X,2.0) + pow(p1.Y -p2.Y,2.0));
}

template <typename T>
void out(deque < T > d)
{
  for(size_t i = 0; i < d.size(); i++)
  {
    debug(d[i]);
  }
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  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;
}