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++: //#define _GLIBCXX_DEBUG
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <sstream>
#include <numeric>
#include <complex>

using namespace std;
typedef long long ll;
typedef pair<int,int> PI;

#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define F first
#define S second
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SZ(a) (int)((a).size())
#define ALL(a) a.begin(),a.end()
#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)


//低優先度


#include <list>
#include <stack>
#include <iomanip>
#include <fstream>
#include <cassert>
#define REP(i, n) rep (i, n)
#define min3(a,b,c) min((a),min((b),(c)))
#define min4(a,b,c,d) min((a),min3((b),(c),(d)))
#define FLL(a,b) memset((a),b,sizeof(a))
#define CLR(a) memset((a),0,sizeof(a))
#define EPS (1e-8)
template<class T,class U>ostream&operator<<(ostream&o,pair<T,U>&v){return o<<"("<<v.F<<","<<v.S<<")";}
template<class T>ostream&operator<<(ostream&o,vector<T>&v){o<<"{";rep(i,SZ(v))o<<(i?",":"")<<v[i];return o<<"}";}
string i2s(int a){stringstream ss;ss<<a;return ss.str();};
typedef double FP;
typedef complex<FP> pt;
typedef pt P;
typedef pair<pt,pt> line;
FP dot(P a,P b){return real(conj(a)*b);}
FP crs(P a,P b){return imag(conj(a)*b);}
P ortho(P a){return a*P(0,1);}
P ortho(line a){return ortho(a.S-a.F);}
P crspt(P a,P b,P c,P d){b-=a,d-=c;return a+b*crs(d,c-a)/crs(d,b);}
P crspt(line a,line b){return crspt(a.F,a.S,b.F,b.S);}
bool onl(P a1,P a2,P b){return abs(b-a1)+abs(b-a2)<abs(a1-a2)+EPS;}
bool onl(line a,P b){return onl(a.F,a.S,b);}
bool iscrs(line a,line b){P c=crspt(a,b);return onl(a,c)&&onl(b,c);}
void pkuassert(bool t){t=1/t;};
int dx[]={0,1,0,-1,1,1,-1,-1};
int dy[]={1,0,-1,0,-1,1,1,-1};
enum{TOP,BTM,LFT,RGT,FRT,BCK};
int dxdy2ce[]={RGT,FRT,LFT,BCK};
template<class T> T shift(T a,int b,int c,int d,int e){
 __typeof(a[0])t=a[b];a[b]=a[c];a[c]=a[d];a[d]=a[e];a[e]=t;
 return a;}
template<class T> T rgt(T a){return shift(a,TOP,LFT,BTM,RGT);}
template<class T> T lft(T a){return shift(a,TOP,RGT,BTM,LFT);}
template<class T> T frt(T a){return shift(a,TOP,BCK,BTM,FRT);}
template<class T> T bck(T a){return shift(a,TOP,FRT,BTM,BCK);}
line mkl(P a,P v){return line(a,a+v);}
FP lpdist(line a,P b){return abs(b-crspt(a,mkl(b,ortho(a))));}
FP spdist(line a,P b){
  P c(crspt(a,mkl(b,ortho(a))));
  return onl(a,c)?abs(b-c):min(abs(a.F-b),abs(a.S-b));
}
FP ssdist(line a,line b){
 return
  iscrs(a,b)?0.:
   min4(spdist(a,b.F),spdist(a,b.S),
        spdist(b,a.F),spdist(b,a.S));
}
namespace std{
  bool operator<(const P&a,const P&b){
    return mp(real(a),imag(a))<mp(real(b),imag(b));
  }
}

int main(int argc, char *argv[])
{
  int a,b;
  ofstream fout("out.txt");
  fout << a+b << 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 <<  "x" << j << "=" << i*j <<endl;
  }
 }
 return 0;
}

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

int main(){
	for(int i=0;i<9;i++){
		for(int j=0;j<9;j++){
			int a=(i+1)*(j+1);
				cout<<i+1<<"x"<<j+1<<"="<<a<<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("%dx%d=%d\n",i,j,i*j);
    }
  }
  return 0;
}

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

C++: #include<algorithm>
#include<climits>
#include<cmath>
#include<cstring>
#include<deque>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

using lint = long long;
using P = pair<int, int>;
using LLP = pair<long long, long long>;

#define REP(i, x, n) for(int i = (x), i##_len = int(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = int(n) ; i < i##_len ; ++i)
#define reps(i, n) for(int i = 1, i##_len = int(n) ; i <= i##_len ; ++i)
#define rrep(i, n) for(int i = int(n) - 1 ; i >= 0 ; --i)
#define rreps(i, n) for(int i = int(n) ; i > 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
#define TWINS(x) cout << ((x) ? "Yay!" : ":(") << endl

const int IINF = (1 << 30) - 1;
const long long LLINF = 1LL << 61;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

template<typename T>
bool chmax(T &a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool chmin(T &a, T b){
    if(b < a){
        a = b;
        return true;
    }
    return false;
}

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

    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(){
  int i,j;
  for(i=1;i<10;i++)
    for(j=1;j<10;j++)
      scanf("%dx%d=%d", i,j,i*j);
}

C++: #include<stdio.h>
int main(void)
{
	int a,b,c;
	scanf("%d %d",&a,&b);
	c=a*b;
	printf("%d\n",c);
	return 0;
}

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

int main(){
int a = 1,b = 1,c;
while(a != 9 and b != 9){
c=a*b;
cout<<a<<"x"<<b<<"="c<<endl;
b++;
if(b == 10){
a++;
b = 1;
}

}
    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++: i,j;main(){while(++i<10)for(j=1;j<10;printf("%dx%d=%d\n",i,j,i*j++));}

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

int main()
{
	int i = 0;
	int j = 0;

	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>
#define f(i,m) for(int i=1;i<=m;i++)
int main(){
    f(i,9)f(j,9)printf("%dx%d=%d\n",i,j,i*j);
    return 0;
}

C++: a

C++: null

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<stdio.h>

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++: #include<stdio.h>

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

C++: #include<stdio.h>

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

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

using namespace std;

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

C++:  #include <bits/stdc++.h>
#ifdef dbg
#include "./printer.hpp"
#else
#define dump(x) void(0)
#endif

using namespace std;
#define ll long long
inline long  toInt(string s) {long  v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
#define INF 100000
int main(){
  ios_base::sync_with_stdio(0);

  for(ll i = 1; i < 10; i++){
    for(ll k = 1; k < 10; k++){
      printf("%dx%d=%d\n",i,k,i*k);
    }
  }

  return 0;

}