Go: package main
import "fmt"
func main(){
    for i:=1;i<10;i++{
        for j:=1;j<10;j++{
            fmt.Print(i)
            fmt.Print("x")
            fmt.Print(j)
            fmt.Print("=")
            fmt.Println(i*j)
        }
    }
}

C++: #include <functional>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <climits>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <deque>
#include <list>
#include <map>
#include <set>
using namespace std;

typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ULL;

typedef pair < int , int > ii;
typedef pair < LL  , LL  > ll;

typedef vector <int>  vint;
typedef vector <bool> vbool;
typedef vector <long> vlong;

#define sz(x)			((int)x.size())
#define tin(x)			scanf("%d",&x)
#define all(x)			x.begin(),x.end()
#define Set(b,a)		memset(b,a,sizeof b)
#define print1(x)		printf("Case %d:",x++)
#define tin2(x,y)		scanf("%d%d",&x,&y)
#define tin3(x,y,z)		scanf("%d%d%d",&x,&y,&z)
#define loop(i,i0,in)	for(int i=i0 ; i<in ; i++)
#define rep(i,n)		for(int i=0 ; i<(n) ; i++)
#define Fore(it, x)		for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
     
int main()  
{  
#ifdef Online_Judge
	freopen("a.in","r",stdin);
#endif
	loop(i,1,10)
	{
		loop(j,1,10)
			printf("%dx%d=%d\n",i,j,i*j);
	}
	return 0;
}

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

int main(){

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

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<iostream>
int main() {
	for (int i = 1; i <= 9; i++) {
		std::cout << "1x" << i << std::endl;
	}
	for (int i = 1; i <= 9; i++) {
		std::cout << "2x" << i << std::endl;
	}
	for (int i = 1; i <= 9; i++) {
		std::cout << "3x" << i << std::endl;
	}
	for (int i = 1; i <= 9; i++) {
		std::cout << "4x" << i << std::endl;
	}
	for (int i = 1; i <= 9; i++) {
		std::cout << "5x" << i << std::endl;
	}
	for (int i = 1; i <= 9; i++) {
		std::cout << "6x" << i << std::endl;
	}
	for (int i = 1; i <= 9; i++) {
		std::cout << "7x" << i << std::endl;
	}
	for (int i = 1; i <= 9; i++) {
		std::cout << "8x" << i << std::endl;
	}
	for (int i = 1; i <= 9; i++) {
		std::cout << "9x" << i << std::endl;
	}
}

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

#define range(bind, start, end) for (int bind = start; bind <= end; bind++)

int main()
{
    range (i, 1, 9)
        range (j, 1, 9)
            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 << "??" << 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++: class Main{
    public static void main(String[] a){

int i,j, k;
		for(i=1; i<=9; ){
			for(j=1; j<=9; j++){
				k = i*j;
				System.out.println(i + "x" + j + "=" + k);	
			
			}
	
	i++; }    

}
}

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

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

C++: #include<stdio.h>
main(i,j,k){for(i=0;i<81;i++)j=i/9+1,k=i%9+1,printf("%dx%d=%d\n",j,k,j*k);}

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

#ifdef _DEBUG
#define dump(x) cout << #x << " = " << (x) << "\n"
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n"
#else
#define dump(x)
#define debug(x)
#endif


int main() {
#ifdef _DEBUG
	printf( "Debug Mode\n" );
#endif
	for ( int i = 1; i < 10; i++ ) {
		for ( int j = 1; j < 10; j++ ) {
			dump( i );
			dump( j );
			printf( "%dx%d=%d\n", i, j, i * j );
		}
	}
	return 0;
}