Go: package main

import (
	"fmt"
)

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

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

C++: #include <stdioi.h>

int main(void)
{
	int i,j;
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			printf("%dx%d=%d",i,j,i*j);
		}
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

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

int main() {
	FOR(i, 1, 10) {
		FOR(j, 1, 10) {
			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++: //QQ
class Main{
    public static void main(String[] a){
        int i = 1;
        int j = 1;
        for(;i<10;i++) {
            for(j=1;j<10;j++) {
                System.out.println(i+"x"+j+"="+(i*j));
            }
        }
    }
}

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

C++: i;main(){for(;++i<=9;)printf("%dx%d=%d\n",i,10-i,i*10-i);exit(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++: ??¨??????

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

int main(void){
        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 <stdio.h>

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

C++: ergergergsegserge

C++: #include <stdio.h>

int main(void){
	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>

auto main() -> int {
    for (int x = 1; x <= 9; x++) {
        for (int y = 1; y <= 9; y++) {
            std::cout << x << "x" << y << "=" << (x*y) << std::endl;
        }
    }
    return 0;
}

C++: #include <iostream>
#include <conio.h>
 using namespace std;
int main()
{
 
    for(int i=1; i<=9; i++)
	{
        for(int x=1; x<=9; x++)
		{
            cout<<i*x<<endl;
		}
	}
	cin.get();
	getch();
    return 0;
}

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

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