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 <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++: for x in range(1,10):
    for y in range(1,10):
        print(str(x) + "x" + str(y) + "=" + str(x*y))

C++: for i in 1..9
    for j in 1..9
        puts(i.to_s()+"x"+j.to_s()+"="+(i*j).to_s());
    end
 
end

C++: #include<stdio.h>
int i,main(){}

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

using namespace std;;

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

C++: #include <iostream>
int main(){for(int s=1;s<10;s++)for(int e=1;e<10;e++)std::cout<<s<<'x'<<e<<'='<<(s*e)<<std::endl;return 0;}

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

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){
			int x = i*j;
			printf("%dx%d=%d\n",i,j,x);
		}
	}

	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>
#define ll long long int
#define FOR(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n)
using namespace std;
 
/*--------------------template--------------------*/

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

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

int main(){
	int k = strtol("1000000000000", 0, 10);
	return k < -2100000000;
}

C++: #include <iostream>

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;
   
   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<<"\n";
}
}
return 0;
}

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

int main(){
for(int i=0;i++<100;)cout<<(int)i/10<<"x"<<i%10<<"="<<(int)i/10*i%10<<endl;
return 0;
}

C++: #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<stdio.h>
main(){int i=0,j;while(j=0|i++<9)while(10-j)printf("%dx%d=%d\n",i,j++,i*j);}

C++: tsurai

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 - 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++){
			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<iostream>
#include<algorithm>
using namespace std;
int main(){
	int t=80000;
	for(int i=t;i;i--){
		for(int j=max(i,9);j;j--){
			if(i<10&&j<10)cout<<10-i<<"x"<<10-j<<"="<<(10-i)*(10-j)<<endl;
		}
	}
	return 0;
}

C++: #include <stdio.h>

int main(void){
  int i;
  for (i=1; i<10; i++){
    printf("%d×%d=%d", i, i, i*i);
  }}

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

int main(){
    for(int i=1; i!=10; i++){
        for(int j=1; j!=10; j++){
            cout << i << "??" << j << "=" << i * j << '\n';
        }
    }

    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 << "*" << 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 << "??" << j << "=" << i*j << endl;
    }
  }
}

C++: #include <iostream>
//#include <fstream.h>
//#include <cstring>
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 << "\n";
    }
  }

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