Go: package main

import "fmt"
import "strconv"

func main() {
  for i := 1; i <= 9; i++ {
    for j := 1; j <= 9; j++ {
      res := i * j
      fmt.Println(
        strconv.Itoa(i) + "x" + strconv.Itoa(j) + "=" + strconv.Itoa(res)
      )
    }
  }
}

C++: #include <stdio.h>

int
main(void)
{
	for (int a = 1; a <= 9; a++) {
		for (int b = 1; b <= 9; b++) {
			printf("%dx%d=%d\n", a, b, a*b);
		}
	}

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

    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){
            cout << i << 'x' << j << '=' << i*j << endl;
        }
    }
}

C++: #include<stdio.h>
int main(void)
{
        int i, j;
        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;
int QQ(int i,int j){
  int Q;
  Q=i*j;
  return Q;
}
signed main(){
  cin.tie(NULL);
  ios::sync_with_stdio(false);
  int i,j,Q;
  for(i=1;i<=9;i++){
    for(j=1;j<=9;j++){
      Q=QQ(i,j);
      cout<<i<<"x"<<j<<"="<<Q<<'\n';
    }
  }
  return(0);
}

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

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

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

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>

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

    }
    return 0;
}

C++: #include<stdio.h>

int main(){
  int i, j;

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

    return 0;
}

C++: ohoho

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class range {
private:
  struct Iterator {
    int val, inc;
    int operator*() {return val;}
    bool operator!=(Iterator& itr) {return val != itr.val;}
    void operator++() {val += inc;}
  };
  Iterator i, n;
public:
  range(int n) : i({0, 1}), n({n, 1}) {}
  range(int i, int n) : i({i, 1}), n({n, 1}) {}
  range(int i, int inc, int n) : i({i, inc}), n({n, inc}) {}
  Iterator& begin() {return i;}
  Iterator& end() {return n;}
};

template<class T> inline T at(const vector<T> &v, int i) {return v[(i % (int)v.size() + v.size()) % v.size()];}

template<class T> inline bool is_max(T &a, const T &b) {return a < b ? a = b, true : false;}
template<class T> inline bool is_min(T &a, const T &b) {return a > b ? a = b, true : false;}

int main() {
  for (int i : range(1, 10)) for (int j : range(10)) cout << i << "x" << j << "=" << i * j << 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<=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>

static const int MaxNum = 9;
static void print_qq()
{
    for (int i = 1; i <= MaxNum; ++i) {
        for (int j = 1; j <= MaxNum; ++j) {
            std::cout << i << "x" << j << std::endl;
        }
    }
}

int main()
{
    print_qq();
}

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

int main(int argc, char* argv[])
{
	int i,j;
	for(i=1;i<10;i++)
	{
		for(j=1;j<10;j++)
		{
			cout<<i<<"x"<<j<<"="<<i*j<<'\n';
		}
	}
	return 0;
}

C++: main(i){for(i=11;i<=99;printf(i++%10?"%dx%d=%d\n":"",i/10,i%10,i%10*(i/10)));exit(0);}

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

typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;

const int  MOD=1000000007;
const int  INF= int(1e9);

int main()
{
	ios_base::sync_with_stdio(false);
    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);
}}}

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\n",i,j,i*j);
		}
	}
	return 0;
}

C++: #include <iostream>

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

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

int main() {
	
	for (int i = 1; i < 10; i++) {
		for (int j = 1; j< 10; ++) {
			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 <iostream>
using namespace std;

#define REP(i,n,m) for(int i=n;i<m;i++)
#define rep(i,n) REP(i,0,n)

int main(void){
	REP(i,1,10)REP(j,1,10){
		cout<<i<<"x"<<j<<"="<<i*j<<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>

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