Go: package main

import "fmt"


func main() {
	for i := 1; i <= 9; i++ {
		for i2 := 1; i2 <= 9; i2++ {
			fmt.Printf("%dx%d=%d\n", i, i2, i*i2)
		}
	}
}

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

C++: #include<stdio.h>

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

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

C++: #include <cstdio>

int main()
{
	for (unsigned int i = 1; i <= 9; i++)
	{
		for (unsigned int j = 1; j <= 9; j++)
		{
			std::printf("%ux%u=%u\n", i, j, i * j);
		}
	}
	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<<"*"<<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 <cstdio>

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




        return 0;
}

C++: #include<iostream>
using namespace std ;
int main()
{
	int a,
	for ( a = 1 ; a < 10 ; a++ )
		for ( b = 1 ; b < 10 ; b++ )
			cout << a << 'x' << b << '=' << a * b << 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++) {
            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=0;j <= 9; j++){
  cout << i << "x" << j << "=" << i*j <<endl;
 }
}
    return 0;
}

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

void outerLoop(int i);
void innerLoop(int i, int j);

static const int MAX = 9;

int main()
{
    outerLoop(1);
}

void outerLoop(int i)
{
    if (MAX < i) {
        return;
    }
    innerLoop(i, 1);
    outerLoop(i + 1);
}

void innerLoop(int i, int j)
{
    if (MAX < j) {
        return;
    }
    cout << i << "x" << j << "=" << i * j << endl;;
    innerLoop(i, j + 1);
}

C++: #include <iostream>
int main(){
	int a,b,c;
		for(a=1;a<10;++a){
			for(b=1;b<10;++b){
				c=a*b;
				std::cout<<a<<"x"<<b<<"="<<c<<std::endl;
				}
		}
	 return 0;
	}

C++: 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(){
for(i=1;i<10;i++){
 for(j=1;j<10;i++){
std::cout << i << 'x' << j << '=' i*j <<std::endl;
    return 0;
}

C++: #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
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 != 10; x++) {
		for (int y = 1; y != 10; y++) {
			cout << x << "x" << y << "=" << x*y << 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++){
            cout<<i<<"x"<<j<<"="<<i*j<<"\n";
        }
    }
    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(void){
    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<cstdio>
#include<iostream>

using namespace std;

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

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

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

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

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

C++: //AOJ 0000
//include
#include<cstdio>
#include<cctype>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<list>
#include<bitset>
#include<set>
#include<iostream>
 
//using namespace
using namespace std;
 
//define
 
//variable
short a, b;
 
//function
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>
using namespace std;
int main(void){
    for(int i=1;i<10;i++){
        for(int j=1;j<10;j++){
            cout << i << "x" << j << "=" << i*j << endl;
        }
    }
}

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

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};

using my_vect = vector<int>;
int main(){
  
  return 0;
}