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<iostream>

using namespace std;

int main(){
	for(int a = 1; a < 10; a++){
		for(int b = 1; b < 10; b++){
			cout << a << "x" << b << "=" << a * b << endl;
		}
	}
}

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

C++: #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<iostream>
using namespace std;
int main(){
int a[9],b[9],c,i,j;
for(i=1;i<9;i++){
	for(j=1;j<9;j++){
	a[i]*b[j]==c;
		cout<<c;}
}
       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%dd=%d\n", i, j, i * j );
		}
	}
	return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iostream>
#include <set>
using namespace std;
typedef long long ll;

int main(int argc, char const *argv[]) {
	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>
using namespace std;

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

#define pb push_back
#define rep(i, n) for(int i = 0; i < (n); i++)
#define dep(i, a, n) for(int i = a; i >= (n); i--)
#define FOR(i, a, n) for(int i = a; i < (n); i++)
#define mod (ll)(1e9+7)
#define int ll
#define INF 100000000

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

signed main() {
	FOR(i, 1, 10) {
    FOR(j, 1, 10) {
      cout << i << 'x' << j << '=' << i * j << endl;
    }
  }
	return 0;
}

C++: #include<stdio.h>
int main(void) {
	for (int i = 1; i <= 9; i++)
	{
		for (int b = 1; b <= 9; b++)
		{
			printf("%dx%d=%d\n", i, b, i*b);
		}
	}
	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);


}//for j/
}//for i/

return 0;
}

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

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

		}
	}
}

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

int main(void)
{
    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()
{
	int a, b, c;
	for (a = 1; a < 10; a++)
	{
		for (b = 1; b < 10; b++)
		{
			c = a*b;
			cout << a << "*" << b << "=" << c << endl;
		}
	}
	return 0;
}

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

int main (){
	int a,b;
	for(a=1;a<=9;a++){
		for(b=1;b<=9;b++)
	cout<<a<<"x"<<b<<"="<<a*b<<endl;
	}
	system("pause");
	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 <cstdio>

using namespace std;

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

C++: #include <stdio.h>

int main(void)
{
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(void)
{
	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<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<iostream>
using namespace std;

int main(){
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 <stdio.h>

int main() {

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

return 0;
}

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

int main(){
	clock_t c1 = clock() + 0.1 * CLOCKS_PER_SEC * sizeof(long);
	while(c1 > clock());
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>

using namespace std;

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

	return 0;
}

C++: #include <iostream>

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

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

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

C++: sss

C++:  #include <iostream>
using namespace std;
int main(){
	int i , j , l;
	for( i=1 ; i<=9 ; i++ ){
		for( j=1 ; j<=9 ; j++ ){
			cout <<i<<"x"<<j<<"="<<i*j<<endl;
		}
	}
}

C++:  #include <iostream>
using namespace std;
int main(){
	int i , j , l;
	for( i=1 ; i<=9 ; i++ ){
		for( j=1 ; j<=9 ; j++ ){
			cout <<i<<"*"<<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++){
                      printf("%dx%d=%d", i, j, i*j);
              }
        }
	return 0;
}