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 <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <map>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define MAX_N 105
int vx [4]= {1,0,-1,0};
int vy [4]= {0,1,0,-1};
long long  dp[MAX_N][21]={};//dp[i???????????§???][???]????????°
int V[MAX_N],W[MAX_N];
int data[MAX_N],B[MAX_N];
int K ,N,a[MAX_N];
using namespace std;
void init(){

  /*cin >> N;
  cin >> a[1];
    dp[1][a[1]]=1;
  for(int l= 2;l<=N-1;l++){
    cin >> a[l];
    for(int i= 0;i<=20;i++){
      if(i-a[l]>=0&&i-a[l]<=20) dp[l][i] += dp[l-1][i-a[l]];
      if(i+a[l]>=0&&i+a[l]<=20) dp[l][i] += dp[l-1][i+a[l]];
    }
      //REP(i,21)cout<<l<<':'<< i<<' '<<dp[l-1][i]<<endl;
  }
  //REP(i,21)cout<< i<<' '<<dp[N-1][i]<<endl;
  cin >> a[N];
  cout << dp[N-1][a[N]]<<endl;
  */
}
void solve(){
  init();

}
int main(){
  REP(i,9)REP(j,9)cout << i+1<<'x'<<j+1<<'='<<(i+1)*(j+1)<<endl;
    solve();
}

C++: #include <bits/stdc++.h>
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 <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<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
struct edge{int to;ll cost;};
typedef pair<ll,int> P;
const ll INF=1000000000000LL;
const ll MOD=1000000007LL;
const ll MAX=100010;
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++: main(a,b){for(a=1,b=1;a<=9;(b%=9)||(a++,b++))printf("%dx%d=%d\n",a,b++,a*b);}

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

int main(){
int a=0;
int b=0;
int c=0;
for(int i=0;i<9;i++){
	b=0;
a++;
for(int j=0;j<9;j++){
b++;
c=a*b;
cout<<a<<"x"<<b<<"="<<c<<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<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>
#include <iostream>

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

C++: 
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<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;
	}
}

}

C++: #include<cstdio>
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 <iostream>
#include <cstdlib>

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>

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

    return 0;
}

C++: #include <iostream>
 
int main(void)
{
    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 <bits/stdc++.h>
using namespace std;

int main() {
  exit(-1);
}

C++: - submit, private

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() {
	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 <cstdio>

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(){

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

return 0;
}

C++: #include<bits/stdc++.h>
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(void){
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
printf("%dx%d=%d\n",i,j,i*j);
}}
return 0;}

C++: #include<iostream>
#include <cstdio>

using namespace std;

int main() {

	int i, j;

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


	system("pause");
	return 0;
}

C++: #include<stdio.h>
int main(){
  int i,j,ans;
  for(i=1;i<=9;i++){
    for(j=1;j<=9;j++){
      ans=0;
      ans=i*j;
      printf("%d×%d=%d\n",i,j,ans);
    }
  }
  return 0;
}

C++: import scala.io.StdIn

object Main {
 
  def main(args: Array[String]): Unit = {
 for{ i <- 1 to 10
j <- 1 to 10}{
	println (i + "*" + j + "=" + i*j)
}
}
}

C++: #include<stdio.h>

int main(){
	int i,j;

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

C++: using System;

namespace _0000_QQ {

	public static class Program {

		public static void Main() {
			for (int i = 1; i <= 9; i++) {
				for (int j = 1; j <= 9; j++) {
					Console.WriteLine("{0}x{1}={2}", i, j, i * j);
				}
			}
		}

	}

}

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