Go: package main

import "fmt"

var (
	min = 1
	max = 9
)

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

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

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

int main(){
	int i,j;
	int num;

	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>
int main(){
for(int i=1;i<10;i++)
 for(int j=1;j<10;j++)
  std::cout << i << "x" << j << "=" << i*j << std::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++)
		{
			cout << i << "x" << j << "="<< i * j;
		}
		
		putchar('\n');
	}
	
	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 <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TII;
typedef long long LL;
typedef vector<LL> VLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MT(a,b,c) MP(a, MP(b, c))

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

int main(void){
	REP(i, 9){
		REP(j, 9){
			printf("%dx%d=%d\n", i, j, i*j);
		}
	}
	return 0;
}

C++: #include <iostream>
int s,e;int main(){while((s+=(e=e%9+1)<2)<10)std::cout<<s<<'x'<<e<<'='<<s*e<<'\n';}

C++: #include <cstdio>
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 "pch.h"
#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(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<stdio.h>
int main(void)
{
	int a,b,c,;
	scanf("%d %d",&a,&b);
	
	x='*';
	c=axb;
	printf("%d\n",c);
	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("%dx%d=%d\n",i,j,i*j);
    }
  }
  return 0;
}

C++: #include <iostream>

 int main() {


	 int ans = 0;

	 for (int i = 0; i < 9; ++i) {
		 
		 for (int n = 0; n < 9; ++n) {
			 ans = (n + 1) * (i + 1);

			 std::cout << i + 1 << "x" << n + 1 << "=" << ans << std::endl;

		 }

	 }

 }

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';
    }
    j=1;
  }

}

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<< "\n";
    }
}
    //cout << endl;
    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
#include<deque>
#include<cstring>
#include<climits>
#include<cassert>
#include<cctype>

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

using namespace std;

bool ma[100000];
int main() {
  map<int,int> mp;
  rep(i,9) rep(j,9) {
    mp[j+i*9] = (int)mp.size();
    cout << i+1 << 'x' << j+1 << '=' << (i+1)*(j+1) << endl;
  }
  
  return 0;
}

C++: #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#define ALL(v) begin(v),end(v)
#else
#define ALL(v) (v).begin(),(v).end()
#endif

using namespace std;


namespace{
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8


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



}
int main() try{
	mainmain();
}
catch(...){}

C++: #include<iostream>

using namespace std;
int main(){
	int x=1,y=1;
	for(int i=1;x<=9;i++){
		cout<<x<<"×"<<i<<"="<<x*i<<endl;
		if(i==9){
			x++,i=0;
		}
	}
	return 0;
}

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

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

C++: aa

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

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

C++: #include<iostream>
int main(){
	for(int i=1;i<10;i++){
		for(int j=1;j<10;j++){
			std::cout<<i<<"*"<<j<<"="<<i*j<<std::endl;
		}
	}
	return 0;
}

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