Go: package main

import "fmt"


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

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++: a

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

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>
#include<stdio.h>
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 <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <cstdio>
#include <cctype>
#include <queue>
#include <complex>
#include <climits>

typedef long long ll;

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;
		}
	}
	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("%d??%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++){
            cout << i <<"x" << j << "=" << i*j<<endl;
        }
    }
}

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

int main(){
	int a,b;

	for (a=1; a<=9; a++){
		for (b=1; b<=9; b++){
			cout << a << 'x' << b << '=' << a * b << '\n';
		}
	}

	return 0;
}

C++: #include<stdio.h>
using namespace std;

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

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

using namespace std;


int main(void){
    for(int i = 1; i < 10; i++ ){
        for(int j = 1; j < 10; j++ ){
            printf("%dx%d=%d\n", j, j, i*j);
        }
    }
    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++)
        {
            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<< endl;
		}
	}

    return 0;
}

C++: #include<iostream>

int main(){

    int i,j;
    for(i=0;i<9;i++)
        for(j=0;j<9;j++)
            cout<<(i+1)<<"??"<<(j+1)<<"="<<(i+1)*(j+1)<<endl;


    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++: //AOJ 0000
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define MAX_A 104
#define MAX_B 104

int a,  i, dp[MAX_A][MAX_B], max, j, b;

int sort(const void *a, const void *b){
  return *(int*)a - *(int*)b;
}

int main(){
  /*while(1){
    scanf("%d %d", &a, &b);
    if(a == 0 && b == 0) break;
    memset(dp, -1, sizeof(dp));
    for(i = 0; i < a + 2; i++){
      dp[i][0] = 0;
      dp[i][1] = 1;
    }
    for(i = 0; i < b + 2; i++){
      dp[0][i] = 0;
      dp[1][i] = 1;
    }
    dp[1][1] = 1;
    for(i = 2; i <= a; i++){
      for(j = 2; j <= b; j++){
	dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
	if(i > 2 && j > 2) dp[i][j] -= 2;
	else if(i > 2 || j > 2) dp[i][j]--;
	}
    }
    printf("%d\n", dp[a][b] % 100000);
  }
  */
  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;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;

#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz size()
#define all(A)    A.begin(), A.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,b)   for(int i=0;i<(b);i++)
#define f1(i,b)   for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define mod 1000000007

#define forr(i,n)    for(i=0; i<n; i++)
#define whilee(i,t)  while(i!=t)
#define  sl(a)  scanf("%lld",&a)
#define  pl(a)  printf("%lld",a)

//for(auto it =A.begin(); it!=A.end(); it++)
//sort(A.begin(),A.end());
//binary_search(A.begin(),A.end(),x);
//reverse(A.begin(), A.end());
//cout << *max_element(A.begin(), A.end());
//cout << *min_element(A.begin(), A.end());
//count(A.begin(), A.end(), X); //counts the occurrences of X
//distance(A.begin(),A.end());  //distance between first to last element
//accumulate(A.begin(), A.end(), 0); //add
//next_permutation(A.begin(), A.end());
//prev_permutation(A.begin(), A.end());
//swap(S[0], T[0]);
//scanf("%d",&x);
//printf("%d\n",x);

//vector <int> A;
//deque <int> A;
//queue <int> A;
//stack <int> A;
//set <int> A;
//map <int,int> A;
//pair <int,int> A ;
//vector <pair <int,int>> A ;
//char ch;
//string S, T, U;
ll i, j, k, a, b, c, d, f, g, h, l, m, n, p, q, r, s, t, w, x, y, z, maxx=INT_MIN, minn=INT_MAX, ans=0, sum=0, cnt=0;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

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

    return 0;
}

C++: #include <iostream>
#include <stack>
#define REP(i,n) for(int i = 1; i < n; i++)

using namespace std;

int main() {
	REP(i,10){
		REP(j,10){
			cout << i << "x" << j << "=" << i*j << endl;
		}
	}
}

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 <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<bits/stdc++.h>
using namespace std;
int main()
{
    for(int i=1;i<=1;i++)
    {
        for(int j=1;j<=2;j++)
        {
            cout<<i<<"*"<<j<<"="<<i*j<<endl;
        }
    }
    cout<<"*"<<endl;
    cout<<"*"<<endl;

    for(int i=9;i<=9;i++)
    {
        for(int j=8;j<=9;j++)
            cout<<i<<"*"<<j<<"="<<i*j<<endl;
    }
    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):
}