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 <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <functional>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
const double PI = 3.141592653589793238462643383279502884L;
const int LARGE_INT = 1000000007;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(auto i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(auto i = (c).rbegin(); i != (c).rend(); i++)
#define repfn(i,a,cont,next) \
  for(auto i = (a); [=](){return(cont);}(); i = [=](){return(next);}())
#define repby(i,a,b,s) repfn(i,a,i<b,i+s)
#define repab(i,a,b) repby(i,a,b,1)
#define rep(i,b) repab(i,0,b)
#define pb push_back
#define sz(c) int((c).size())

int main(int argc, char **argv)
{
  repab(i, 1, 10) {
    repab(j, 1, 10) {
      printf("%dx%d=%d\n", i, j, i*j);
    }
  }
  return 0;
}

C++: #include <bits/stdc++.h>
#include <memory>
using namespace std;

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

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

int main()
{
	C *p = new C[10000];
	// D *q = new D[10000];
}

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=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++: #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<iostream>

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

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;

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

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

int main(){
for(int j = 1; j < 10; j++)
for(int i = 1; i < 10; i++)
cout << j << 'x' << i << endl;
}

C++: #include<algorithm>
#include<functional>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

typedef unsigned long long ull;
typedef long long ll;

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

using namespace std;

typedef pair<int ,int > P;


int main()
{
	
	rep(i,10) rep(j,10) printf("%dx%d\n",i,j);


	return 0;
}

C++: class Main{
    public static void main(String[] a){
         
          for(int i = 1;i <= 9;i++) {

             for(j =1; j <= 9; j++) {

                int ans = i*j;
                System.out.println(i + "*" + j + "=" + ans);

             }

          }


    }
}

C++: #include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>

#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>

using namespace std;
const int INF = 0x7fffffff;

int gcd(int x,int y){
  int mi,ma;
  ma = max(x,y);
  mi = min(x,y);
  if(ma % mi == 0){
    return mi;
  }
  else{
    return gcd(mi,ma % mi);
  }
}

int main(){
  long ii,jj,kk;
  vector<int> a;
  for(ii=1;ii<=9;ii++){
    for(jj=1;jj<=9;jj++){
      cout << ii << "x" << jj << "=" << ii*jj << endl;
    }
  }
  
  return 0;
}

C++: #include <iostream>

using namespace std;

int main(int argc, char const* argv[])
{
	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 <algorithm>
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()

int main() {
  REP1(i, 9) REP1(j, 9) cout << i << "x" << j << "=" << i * j << endl;
  return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <cstdlib>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <sstream>

using namespace std;

class c_main
{
private:
    
public:
    c_main();
    void f_input();
};

c_main::c_main()
{

}

void c_main::f_input()
{
    int i, j;
    
    for ( i = 1; i <= 9; ++i ){
        for ( j = 1; j <= 9; ++j ){
            cout << i << "x" <<  j << "=" << i * j << endl;
        }
    }
}

int main(){
    c_main main01;
    main01.f_input();
    
    return 0;
}