Go: package main

import "fmt"

func main() {
    var max_num = 9
    for i := 1; i<= max_num; i++{
        for j := 1; j<= max_num; j++{
            fmt.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(){
    for(int i=1;i<10;i++){
        cout << i<<"x"<<i<<"="<<i*i<<"\n";
    }
    cout << endl;
    return 0;
}

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

C++: #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
// Welcome to my source code!

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

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<<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 <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>=9;i++){
for(int j=1;j>=9;j++){
int a=i*j;
cout << i<<"x"<<j<<"="<<a<<endl;
}
}
return 0;
}

C++: null

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

int main () {
	for (int a = 1; a <= 9; a++) {
		for (int b = 1; b <= 9; b++) {
			cout << a << "x" << b << "=" << a*b << 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 n = 1; n < 10; n++)
	{
		for(int k = 1; k < 10; k++)
		{
			int nk = n*k;
			cout << n << "×" << k << "=" << nk << endl;
		}
	}

    return 0;
}

C++: #include<stdio.h>

int main(){

    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<bits/stdc++.h>
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 <bits/stdc++.h>
#include <iomanip>
#include <math.h>
//#include <unistd.h>
//#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
ll gcd(ll a,ll b){
    if(a < b)swap(a,b);
    if(a % b == 0)return b;
    else return gcd(b,a%b);
}
bool isp(ll n){
    bool res = true;
    if(n == 1)return false;
    else{
        for(ll i = 2;i * i <= n;i++){
            if(n % i == 0){
                res = false;
                break;
            }
        }
        return res;
    }
}

ll fac[510000], finv[510000], inv[510000];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < 510000; i++){
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod%i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

// 二項係数計算
ll COM(ll n, ll k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll modpow(ll n,ll m,ll MOD){
    ll res = 1;
    while(m){
        if(m & 1)res = (res * n) % MOD;
        m >>= 1;
        n *= n;
        n %= MOD;
    }
    return res;
}
/*
int main() {
    // 前処理
    COMinit();

    // 計算例
    cout << COM(100000, 50000) << endl;
}*/

//printf("%.10f\n", N);
/*
ll fibo(ll n){
    if(memo[n] != 0)return memo[n];
    if(n <= 1)return n;
    else return memo[n] = fibo(n - 1)+ fibo(n - 2);
}*/
/*  vector<ll> vec = {1,2,5,6,8,9,10};
    cout << binary_search(all(vec),5) << endl; -> true*/
/*
    vector<ll> vec = {1,2,5,6,8,9,10};
    auto n = upper_bound(all(vec),4);
    cout << *n << endl; -> 5*/
/*
    cout << fixed << setprecision(15);
*/
int main(){
    rep(i,9){
        rep(j,9){
            cout << i + 1 << "x" << j + 1 << "=" << i * j + i + j + 1 << endl;
        }
    }
}

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++: main(i,j,k){for(i=0;j=i/9+1,k=i%9+1,i<81;i++)printf("%dx%d=%d\n",j,k,j*k);}

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

C++: #include <stdio.h>

int main(int argc, char *argv[])
{
    for( int i = 0; i < 9; i++ ){
        for( int j = 0; j < 9; j++ ){
             printf("%dx%d=%d\n", i+1, j+1, (i+1) * (j+1) );
        }
    }
    return 0;
}