Go: package main

import "fmt"

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

C++: #include <iostream>
using namespace std;
int main(void) {
	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=i;i<=9;i++){
        for(int j=1;j<=9;j++){
            cout<<i<<"??"<<j<<"="<<j*i<<endl;
        }
    }
    return 0;
}

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

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

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

int main(){

	
	for (int a = 1; a < 9; a++)
	{
		for (int i = 1; i < 9; i++)
		{

			int c = 0;

			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++: import java.io.*;

public class Practice  {
	public static void main(String[] args)throws IOException {
		int a,b;
		for(a = 1;a<10;a++){
			for(b = 1;b<10;b++){
				System.out.println(a + "x" + b + "=" + a*b);
			}
		}
	}
}

C++: #include <iostream>

using namespace std;


int main(int argc, const char * argv[]) {
    // insert code here...
    
    for(int i=1; i<10; i++){
        for(int j=1; j<10; j++){
            cout << i << "x" << j << "=" << i*j << endl;
        }
    }
    return 0;
}

C++: //by azidoazideazide(c2n14)
#include<iostream>
#include<string>
#include<cmath>
#include<algorithm> //#include<map>
#include<vector>
using namespace std;
typedef long long ll;
//#include<fstream>
//ifstream fin("rps.in");
//ofstream fout("rps.out");
//#define pb push_back
int main(){
	ios::sync_with_stdio(0);
	int f,j;
  for(f=1;f<=9;f++){
    for(j=1;j<=9;j++)
      cout<<f<<"x"<<j<<"="<<f*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++){
	        printf("%dx%d=%d\n",i,j,i*j);
		}
	}
    return 0;
}

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

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

C++: #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
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 x = 1; x <= 9; ++x){
    for(int y = 1; y <= 9; ++y){
      cout << x << "x" << y << "=" << x*y << endl;
    }
  }

  return 0;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;
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++: int i,j,k;main(){for(;i<81;i++)j=i/9+1,k=i%9+1,printf("%dx%d=%d\n",j,k,j*k);}

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

int main(){

int i,j,p;

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

    return 0;
}

C++: #include<stdio.h>
#include<math.h>
#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 <bits/stdc++.h>
#include <memory>
using namespace std;

class C {
public:
	int a[32][32];
};

class D {
public: 
	D() : a(28, std::vector<int>(28)){}
	std::vector<std::vector<int> > a;
};

int main()
{
	// C *p = new C[10000];
	// p[9999].a[31][31] = 1;
	D *q = new D[10000];
	q[9999][27][27] = 1;
}

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

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++: (1..9).each do |i|
  (1..9).each do |j|
    puts "#{i}x#{j}=#{i*j}"
  end
end

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

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

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

int main() {
  cout<<"Hi!"<<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<stdio.h>
int main(){
    int i,j;
    for(i=1;i<=9;i++){
        for(j=1;j<=9;j++){
        printf("%d×%d＝%d\n",i,j,i*j);
        }
    }
    return 0;
}

C++: hoge

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 <stdio.h>

int main(){
	int i, j, ans;

	for(i=1; i<=10; i++){
		for(j=1; j<=10; j++){
			ans = i * j;
			printf("%dx%d=%d\n",i,j,ans);
		}
	}

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

C++: #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

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