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 "bits/stdc++.h"
using namespace std;
#define repi(i,a,b) for(int i=(a), i##_len=(b); i<i##_len; ++i)
#define rep(i,n) repi(i,0,n)
#define repi_(i,a,b) for(int i=(a), i##_len=(b); i<=i##_len; ++i)
#define rep_(i,n) repi_(i,0,n)
#define all(x) (x).begin(),(x).end()
#define vsort(v) sort((v).begin(), (v).end())
#define gsort(v) tsort(v); reverse((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
#define siz(v) ((int)(v).size())
#define ers(v, n) (v).erase((v).begin() + n)
#define cnt(v, n) count(all(v), n)
#define vmin(v) *min_element(v.begin(), v.end())
#define vmax(v) *max_element(v.begin(), v.end())
#define el "\n"
#define co(x) cout<<(x)<<el
#define coc(c, a, b) if(c)co((a));else co((b))
#define cosp(x) cout<<(x)<<' '
#define YES(c) coc(c,"YES", "NO")
#define Yes(c) coc(c,"Yes", "No")
#define yes(c) coc(c,"yes", "no")
#define POSSIBLE(c) coc(c, "POSSIBLE", "IMPOSSIBLE")
#define Possible(c) coc(c, "Possible", "Impossible")
#define possible(c) coc(c, "possible", "impossible")
#define inf INT_MAX
#ifdef tqktmp_2
#define gc() getchar(); getchar()
#else
#define gc() 1
#endif
const unsigned int bf0 = (1 << 0);
const unsigned int bf1 = (1 << 1);
const unsigned int bf2 = (1 << 2);
const unsigned int bf3 = (1 << 3);
const unsigned int bf4 = (1 << 4);
const unsigned int bf5 = (1 << 5);
const unsigned int bf6 = (1 << 6);
const unsigned int bf7 = (1 << 7);

typedef long long lint;
typedef vector<int> ivec; typedef vector<string> svec;

lint dx[8] = { 0,1,1,1,0,-1,-1,-1 },
dy[8] = { 1,1,0,-1,-1,-1,0,1 };

template<class T>inline bool maxi(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool mini(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }




int main() {
	cin.tie(0);
	ios::sync_with_stdio(0);

	repi(i, 1, 10)repi(j, 1, 10) {
		cout << i << "x" << j << "=" << i * j << el;
	}
	gc();
}

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

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

C++: #include <iostream>
#include <assert.h>
#include <list>
#include <vector>
#include <cmath>

void ff( std::list< std::vector< std::string > > & c )
{
    // ??¢???
    std::for_each( c.begin(), c.end(),
        []( std::vector< std::string> & elem )
        { }
    ) ;

    // ?°????
    std::for_each( c.begin(), c.end(),
        []( auto & elem )
        {  }
    ) ;
}

template < typename Printer >
void f( Printer && p )
{
    p( 123 ) ;
    p( 1.23 ) ;
    p( "123" ) ;
}


void operator delete( void *, std::size_t ) noexcept ;
void operator delete[]( void *, std::size_t ) noexcept ;

template < typename T >
constexpr T sqrt( T s )
{
    T x = s / 2.0 ; // ??????????????????
    T prev = 0.0 ;

    while ( x != prev )
    { // ???????????????????????????????????§????????????2?????°?????????
        prev = x ;
        x = (x + s / x ) / 2.0 ; // ????????????2
    }
    return x ;
}


// 1927426???1927428???WA???????????????????????????????????§???
auto dodo() {

  assert(std::abs(sqrt(2.0) - std::sqrt(2)) < 1e-9);

    f( []( auto && elem ){ assert(1 && elem) ; } ) ;
  auto x = 0b101;
  assert(x == 5);
  auto k = 1.2'3'4'5'6'789;
  assert(![ x = 0 ](){ return x ; }()) ;

  auto f = []( auto x ) { return x ; } ;

  f( 0 ) ;
  f( 0.0 ) ;
  f( 'A' ) ;
  f( "hello" ) ;

  int i = 10;
  decltype(auto) a = i ;



  assert(1.23456789==k);
  for(auto i=0; i<9; i++)
    for(auto j=0; j<9; j++)
      std::cout << i+1 << 'x' << j+1 << '=' << (i+1)*(j+1) << std::endl;
}

int main() {
  dodo();
  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;
		}
	}
}

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

C++: #include <stdio.h>

int main ( void )
{
  puts ( "1x1=1\n1x2=2\n1x3=3\n1x4=4\n1x5=5\n1x6=6\n1x7=7\n1x8=8\n1x9=9\n2x1=2\n2x2=4\n2x3=6\n2x4=8\n2x5=10\n2x6=12\n2x7=14\n2x8=16\n2x9=18\n3x1=3\n3x2=6\n3x3=9\n3x4=12\n3x5=15\n3x6=18\n3x7=21\n3x8=24\n3x9=27\n4x1=4\n4x2=8\n4x3=12\n4x4=16\n4x5=20\n4x6=24\n4x7=28\n4x8=32\n4x9=36\n5x1=5\n5x2=10\n5x3=15\n5x4=20\n5x5=25\n5x6=30\n5x7=35\n5x8=40\n5x9=45\n6x1=6\n6x2=12\n6x3=18\n6x4=24\n6x5=30\n6x6=36\n6x7=42\n6x8=48\n6x9=54\n7x1=7\n7x2=14\n7x3=21\n7x4=28\n7x5=35\n7x6=42\n7x7=49\n7x8=56\n7x9=63\n8x1=8\n8x2=16\n8x3=24\n8x4=32\n8x5=40\n8x6=48\n8x7=56\n8x8=64\n8x9=72\n9x1=9\n9x2=18\n9x3=27\n9x4=36\n9x5=45\n9x6=54\n9x7=63\n9x8=72\n9x9=81" );

  return ( 0 );
}

C++: #include <iostream>
#include <stdio.h>
#include <cmath>

using namespace std;


int main(void){
    
    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>

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>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>

using namespace std;
#define TOSTRING(x) #x
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REPR(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase( unique(ALL(v)) , v.end());
#define PAU 

typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vb> vvb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 28);
const ll LINF = 1e18;
const double PI = acos(-1);

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	FOR(i, 1, 10) {
		FOR(j, 1, 10) {
			cout << i << "x" << j << "=" << i * j << endl;
		}
	}
	PAU;
	return 0;
}

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

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

C++: #include <cstdio>

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

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

int main(void){


for(int i=1;i<=9;i++){
 for(int j=1;j<=9;j++){
cout << ixj=i*j;
 }
return 0;
}


}

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 <stdio.h>
int main(){
  int i,j,k;
  for(i=1;i<10;i++){
    for(j=1;j<10;j++){
      printf("%dx%d=%d\n",i,j,i*j);
    }
  }
  return 0;
}

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